/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/in-de52.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 10:06:27,082 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 10:06:27,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 10:06:27,105 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 10:06:27,106 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 10:06:27,107 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 10:06:27,108 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 10:06:27,109 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 10:06:27,111 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 10:06:27,111 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 10:06:27,112 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 10:06:27,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 10:06:27,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 10:06:27,114 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 10:06:27,115 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 10:06:27,116 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 10:06:27,116 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 10:06:27,117 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 10:06:27,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 10:06:27,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 10:06:27,121 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 10:06:27,122 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 10:06:27,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 10:06:27,123 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 10:06:27,124 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 10:06:27,126 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 10:06:27,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 10:06:27,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 10:06:27,128 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 10:06:27,128 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 10:06:27,128 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 10:06:27,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 10:06:27,129 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 10:06:27,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 10:06:27,130 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 10:06:27,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 10:06:27,131 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 10:06:27,132 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 10:06:27,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 10:06:27,132 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 10:06:27,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 10:06:27,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 10:06:27,134 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 10:06:27,141 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 10:06:27,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 10:06:27,142 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 10:06:27,143 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 10:06:27,143 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 10:06:27,143 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 10:06:27,143 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 10:06:27,143 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 10:06:27,144 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 10:06:27,144 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 10:06:27,144 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 10:06:27,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 10:06:27,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 10:06:27,144 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 10:06:27,145 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 10:06:27,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:06:27,145 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 10:06:27,145 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 10:06:27,145 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 10:06:27,145 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 10:06:27,146 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 10:06:27,146 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 10:06:27,146 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-08 10:06:27,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 10:06:27,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 10:06:27,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 10:06:27,396 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 10:06:27,397 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 10:06:27,399 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de52.c [2022-04-08 10:06:27,465 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d54552471/79b0a04dbaa04f28874ff08cae3d12e9/FLAG4b9101488 [2022-04-08 10:06:27,790 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 10:06:27,790 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de52.c [2022-04-08 10:06:27,794 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d54552471/79b0a04dbaa04f28874ff08cae3d12e9/FLAG4b9101488 [2022-04-08 10:06:28,219 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d54552471/79b0a04dbaa04f28874ff08cae3d12e9 [2022-04-08 10:06:28,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 10:06:28,222 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 10:06:28,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 10:06:28,228 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 10:06:28,230 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 10:06:28,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:06:28" (1/1) ... [2022-04-08 10:06:28,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f0a73a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:06:28, skipping insertion in model container [2022-04-08 10:06:28,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:06:28" (1/1) ... [2022-04-08 10:06:28,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 10:06:28,251 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 10:06:28,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de52.c[368,381] [2022-04-08 10:06:28,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:06:28,415 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 10:06:28,431 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de52.c[368,381] [2022-04-08 10:06:28,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:06:28,449 INFO L208 MainTranslator]: Completed translation [2022-04-08 10:06:28,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:06:28 WrapperNode [2022-04-08 10:06:28,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 10:06:28,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 10:06:28,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 10:06:28,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 10:06:28,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:06:28" (1/1) ... [2022-04-08 10:06:28,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:06:28" (1/1) ... [2022-04-08 10:06:28,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:06:28" (1/1) ... [2022-04-08 10:06:28,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:06:28" (1/1) ... [2022-04-08 10:06:28,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:06:28" (1/1) ... [2022-04-08 10:06:28,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:06:28" (1/1) ... [2022-04-08 10:06:28,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:06:28" (1/1) ... [2022-04-08 10:06:28,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 10:06:28,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 10:06:28,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 10:06:28,476 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 10:06:28,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:06:28" (1/1) ... [2022-04-08 10:06:28,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:06:28,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:28,506 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-08 10:06:28,515 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-08 10:06:28,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 10:06:28,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 10:06:28,541 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 10:06:28,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 10:06:28,542 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 10:06:28,542 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 10:06:28,542 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 10:06:28,542 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 10:06:28,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 10:06:28,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 10:06:28,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 10:06:28,542 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 10:06:28,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 10:06:28,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 10:06:28,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 10:06:28,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 10:06:28,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 10:06:28,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 10:06:28,589 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 10:06:28,590 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 10:06:28,809 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 10:06:28,815 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 10:06:28,815 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-08 10:06:28,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:06:28 BoogieIcfgContainer [2022-04-08 10:06:28,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 10:06:28,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 10:06:28,818 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 10:06:28,821 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 10:06:28,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 10:06:28" (1/3) ... [2022-04-08 10:06:28,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11cf33d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:06:28, skipping insertion in model container [2022-04-08 10:06:28,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:06:28" (2/3) ... [2022-04-08 10:06:28,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11cf33d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:06:28, skipping insertion in model container [2022-04-08 10:06:28,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:06:28" (3/3) ... [2022-04-08 10:06:28,824 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de52.c [2022-04-08 10:06:28,828 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 10:06:28,829 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 10:06:28,862 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 10:06:28,868 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-08 10:06:28,868 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 10:06:28,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:06:28,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 10:06:28,899 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:28,899 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:28,900 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:28,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:28,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1060076674, now seen corresponding path program 1 times [2022-04-08 10:06:28,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:28,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [411724730] [2022-04-08 10:06:28,931 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:06:28,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1060076674, now seen corresponding path program 2 times [2022-04-08 10:06:28,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:28,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869067433] [2022-04-08 10:06:28,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:28,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:29,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:29,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-08 10:06:29,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-08 10:06:29,166 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #83#return; {27#true} is VALID [2022-04-08 10:06:29,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:29,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-08 10:06:29,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-08 10:06:29,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #83#return; {27#true} is VALID [2022-04-08 10:06:29,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret15 := main(); {27#true} is VALID [2022-04-08 10:06:29,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27#true} is VALID [2022-04-08 10:06:29,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !(~x~0 % 4294967296 > 0); {27#true} is VALID [2022-04-08 10:06:29,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} ~z~0 := ~y~0; {27#true} is VALID [2022-04-08 10:06:29,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#true} assume !(~z~0 % 4294967296 > 0); {27#true} is VALID [2022-04-08 10:06:29,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#true} assume !(~y~0 % 4294967296 > 0); {27#true} is VALID [2022-04-08 10:06:29,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-08 10:06:29,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !(~z~0 % 4294967296 > 0); {28#false} is VALID [2022-04-08 10:06:29,171 INFO L272 TraceCheckUtils]: 12: Hoare triple {28#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {28#false} is VALID [2022-04-08 10:06:29,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-08 10:06:29,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-08 10:06:29,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-08 10:06:29,174 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-08 10:06:29,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:29,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869067433] [2022-04-08 10:06:29,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869067433] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:29,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:29,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:06:29,181 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:29,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [411724730] [2022-04-08 10:06:29,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [411724730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:29,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:29,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:06:29,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957852607] [2022-04-08 10:06:29,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:29,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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-08 10:06:29,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:29,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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-08 10:06:29,223 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-08 10:06:29,224 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 10:06:29,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:29,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 10:06:29,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 10:06:29,252 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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-08 10:06:29,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:29,367 INFO L93 Difference]: Finished difference Result 41 states and 60 transitions. [2022-04-08 10:06:29,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 10:06:29,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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-08 10:06:29,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:29,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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-08 10:06:29,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-08 10:06:29,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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-08 10:06:29,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-08 10:06:29,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-04-08 10:06:29,464 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-08 10:06:29,471 INFO L225 Difference]: With dead ends: 41 [2022-04-08 10:06:29,471 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 10:06:29,474 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-08 10:06:29,478 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:29,480 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:06:29,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 10:06:29,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 10:06:29,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:29,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:29,528 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:29,528 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:29,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:29,530 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-04-08 10:06:29,530 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-08 10:06:29,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:29,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:29,531 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 10:06:29,532 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 10:06:29,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:29,534 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-04-08 10:06:29,534 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-08 10:06:29,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:29,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:29,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:29,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:29,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:29,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-04-08 10:06:29,550 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 16 [2022-04-08 10:06:29,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:29,551 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-04-08 10:06:29,552 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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-08 10:06:29,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 21 transitions. [2022-04-08 10:06:29,585 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-08 10:06:29,585 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-08 10:06:29,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 10:06:29,590 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:29,590 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:29,591 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 10:06:29,591 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:29,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:29,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1174593278, now seen corresponding path program 1 times [2022-04-08 10:06:29,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:29,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1064583866] [2022-04-08 10:06:29,595 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:06:29,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1174593278, now seen corresponding path program 2 times [2022-04-08 10:06:29,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:29,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495969547] [2022-04-08 10:06:29,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:29,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:29,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:29,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {185#true} is VALID [2022-04-08 10:06:29,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {185#true} assume true; {185#true} is VALID [2022-04-08 10:06:29,757 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {185#true} {185#true} #83#return; {185#true} is VALID [2022-04-08 10:06:29,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {185#true} call ULTIMATE.init(); {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:29,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {185#true} is VALID [2022-04-08 10:06:29,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {185#true} assume true; {185#true} is VALID [2022-04-08 10:06:29,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185#true} {185#true} #83#return; {185#true} is VALID [2022-04-08 10:06:29,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {185#true} call #t~ret15 := main(); {185#true} is VALID [2022-04-08 10:06:29,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {185#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {185#true} is VALID [2022-04-08 10:06:29,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {185#true} assume !(~x~0 % 4294967296 > 0); {185#true} is VALID [2022-04-08 10:06:29,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {185#true} ~z~0 := ~y~0; {185#true} is VALID [2022-04-08 10:06:29,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {185#true} assume !(~z~0 % 4294967296 > 0); {185#true} is VALID [2022-04-08 10:06:29,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {185#true} assume !(~y~0 % 4294967296 > 0); {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} is VALID [2022-04-08 10:06:29,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} assume !(~x~0 % 4294967296 > 0); {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} is VALID [2022-04-08 10:06:29,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} assume !(~z~0 % 4294967296 > 0); {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} is VALID [2022-04-08 10:06:29,764 INFO L272 TraceCheckUtils]: 12: Hoare triple {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {191#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:06:29,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {191#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {192#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:06:29,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {192#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {186#false} is VALID [2022-04-08 10:06:29,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {186#false} assume !false; {186#false} is VALID [2022-04-08 10:06:29,767 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-08 10:06:29,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:29,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495969547] [2022-04-08 10:06:29,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495969547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:29,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:29,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:06:29,769 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:29,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1064583866] [2022-04-08 10:06:29,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1064583866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:29,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:29,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:06:29,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562681026] [2022-04-08 10:06:29,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:29,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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-08 10:06:29,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:29,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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-08 10:06:29,787 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-08 10:06:29,788 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:06:29,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:29,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:06:29,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 10:06:29,789 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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-08 10:06:29,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:29,984 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-08 10:06:29,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:06:29,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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-08 10:06:29,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:29,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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-08 10:06:29,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-08 10:06:29,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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-08 10:06:29,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-08 10:06:29,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-08 10:06:30,033 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-08 10:06:30,035 INFO L225 Difference]: With dead ends: 34 [2022-04-08 10:06:30,035 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 10:06:30,035 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-08 10:06:30,036 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:30,037 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:06:30,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 10:06:30,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-08 10:06:30,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:30,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:30,043 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:30,044 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:30,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:30,045 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2022-04-08 10:06:30,045 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-04-08 10:06:30,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:30,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:30,046 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-08 10:06:30,046 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-08 10:06:30,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:30,048 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2022-04-08 10:06:30,048 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-04-08 10:06:30,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:30,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:30,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:30,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:30,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:30,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2022-04-08 10:06:30,050 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 16 [2022-04-08 10:06:30,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:30,050 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-04-08 10:06:30,050 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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-08 10:06:30,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 30 transitions. [2022-04-08 10:06:30,081 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-08 10:06:30,081 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-04-08 10:06:30,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 10:06:30,082 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:30,082 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:30,082 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 10:06:30,083 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:30,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:30,083 INFO L85 PathProgramCache]: Analyzing trace with hash -2018158143, now seen corresponding path program 1 times [2022-04-08 10:06:30,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:30,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1900825426] [2022-04-08 10:06:30,084 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:30,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2018158143, now seen corresponding path program 2 times [2022-04-08 10:06:30,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:30,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099499120] [2022-04-08 10:06:30,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:30,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:30,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:30,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {369#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {363#true} is VALID [2022-04-08 10:06:30,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {363#true} assume true; {363#true} is VALID [2022-04-08 10:06:30,130 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {363#true} {363#true} #83#return; {363#true} is VALID [2022-04-08 10:06:30,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {363#true} call ULTIMATE.init(); {369#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:30,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {369#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {363#true} is VALID [2022-04-08 10:06:30,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {363#true} assume true; {363#true} is VALID [2022-04-08 10:06:30,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {363#true} {363#true} #83#return; {363#true} is VALID [2022-04-08 10:06:30,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {363#true} call #t~ret15 := main(); {363#true} is VALID [2022-04-08 10:06:30,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {363#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {363#true} is VALID [2022-04-08 10:06:30,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {363#true} assume !(~x~0 % 4294967296 > 0); {363#true} is VALID [2022-04-08 10:06:30,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {363#true} ~z~0 := ~y~0; {363#true} is VALID [2022-04-08 10:06:30,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {363#true} assume !(~z~0 % 4294967296 > 0); {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-08 10:06:30,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-08 10:06:30,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-08 10:06:30,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {364#false} is VALID [2022-04-08 10:06:30,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {364#false} assume !(~z~0 % 4294967296 > 0); {364#false} is VALID [2022-04-08 10:06:30,135 INFO L272 TraceCheckUtils]: 13: Hoare triple {364#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {364#false} is VALID [2022-04-08 10:06:30,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {364#false} ~cond := #in~cond; {364#false} is VALID [2022-04-08 10:06:30,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {364#false} assume 0 == ~cond; {364#false} is VALID [2022-04-08 10:06:30,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {364#false} assume !false; {364#false} is VALID [2022-04-08 10:06:30,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:30,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:30,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099499120] [2022-04-08 10:06:30,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099499120] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:30,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:30,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:06:30,137 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:30,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1900825426] [2022-04-08 10:06:30,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1900825426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:30,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:30,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:06:30,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423199082] [2022-04-08 10:06:30,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:30,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-08 10:06:30,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:30,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-08 10:06:30,152 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-08 10:06:30,153 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 10:06:30,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:30,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 10:06:30,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 10:06:30,154 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-08 10:06:30,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:30,235 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-08 10:06:30,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 10:06:30,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-08 10:06:30,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:30,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-08 10:06:30,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-08 10:06:30,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-08 10:06:30,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-08 10:06:30,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2022-04-08 10:06:30,275 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-08 10:06:30,276 INFO L225 Difference]: With dead ends: 34 [2022-04-08 10:06:30,276 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 10:06:30,276 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:06:30,278 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:30,278 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 26 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:06:30,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 10:06:30,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-08 10:06:30,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:30,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:30,293 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:30,293 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:30,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:30,295 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-04-08 10:06:30,295 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-04-08 10:06:30,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:30,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:30,296 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-08 10:06:30,296 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-08 10:06:30,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:30,298 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-04-08 10:06:30,298 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-04-08 10:06:30,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:30,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:30,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:30,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:30,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:30,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-04-08 10:06:30,300 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2022-04-08 10:06:30,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:30,300 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-04-08 10:06:30,300 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-08 10:06:30,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 36 transitions. [2022-04-08 10:06:30,342 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-08 10:06:30,343 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-04-08 10:06:30,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 10:06:30,343 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:30,343 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:30,344 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 10:06:30,344 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:30,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:30,344 INFO L85 PathProgramCache]: Analyzing trace with hash -615329744, now seen corresponding path program 1 times [2022-04-08 10:06:30,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:30,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1584649155] [2022-04-08 10:06:30,345 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:30,345 INFO L85 PathProgramCache]: Analyzing trace with hash -615329744, now seen corresponding path program 2 times [2022-04-08 10:06:30,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:30,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165588866] [2022-04-08 10:06:30,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:30,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:30,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:30,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {550#true} is VALID [2022-04-08 10:06:30,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {550#true} assume true; {550#true} is VALID [2022-04-08 10:06:30,387 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {550#true} {550#true} #83#return; {550#true} is VALID [2022-04-08 10:06:30,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {550#true} call ULTIMATE.init(); {556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:30,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {550#true} is VALID [2022-04-08 10:06:30,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {550#true} assume true; {550#true} is VALID [2022-04-08 10:06:30,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {550#true} {550#true} #83#return; {550#true} is VALID [2022-04-08 10:06:30,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {550#true} call #t~ret15 := main(); {550#true} is VALID [2022-04-08 10:06:30,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {550#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {550#true} is VALID [2022-04-08 10:06:30,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {550#true} assume !(~x~0 % 4294967296 > 0); {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:06:30,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:06:30,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:06:30,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:06:30,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {551#false} is VALID [2022-04-08 10:06:30,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {551#false} assume !(~x~0 % 4294967296 > 0); {551#false} is VALID [2022-04-08 10:06:30,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {551#false} assume !(~z~0 % 4294967296 > 0); {551#false} is VALID [2022-04-08 10:06:30,406 INFO L272 TraceCheckUtils]: 13: Hoare triple {551#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {551#false} is VALID [2022-04-08 10:06:30,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {551#false} ~cond := #in~cond; {551#false} is VALID [2022-04-08 10:06:30,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {551#false} assume 0 == ~cond; {551#false} is VALID [2022-04-08 10:06:30,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {551#false} assume !false; {551#false} is VALID [2022-04-08 10:06:30,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:30,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:30,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165588866] [2022-04-08 10:06:30,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165588866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:30,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:30,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:06:30,408 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:30,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1584649155] [2022-04-08 10:06:30,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1584649155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:30,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:30,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:06:30,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326405151] [2022-04-08 10:06:30,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:30,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-08 10:06:30,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:30,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-08 10:06:30,425 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-08 10:06:30,425 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 10:06:30,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:30,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 10:06:30,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 10:06:30,426 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-08 10:06:30,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:30,546 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2022-04-08 10:06:30,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 10:06:30,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-08 10:06:30,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:30,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-08 10:06:30,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-04-08 10:06:30,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-08 10:06:30,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-04-08 10:06:30,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 35 transitions. [2022-04-08 10:06:30,606 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-08 10:06:30,607 INFO L225 Difference]: With dead ends: 43 [2022-04-08 10:06:30,607 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 10:06:30,607 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:06:30,608 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:30,608 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 27 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:06:30,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 10:06:30,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 10:06:30,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:30,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:30,632 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:30,632 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:30,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:30,634 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-04-08 10:06:30,634 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-08 10:06:30,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:30,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:30,635 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-08 10:06:30,635 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-08 10:06:30,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:30,637 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-04-08 10:06:30,637 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-08 10:06:30,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:30,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:30,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:30,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:30,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:30,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2022-04-08 10:06:30,639 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 17 [2022-04-08 10:06:30,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:30,639 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2022-04-08 10:06:30,639 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-08 10:06:30,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 43 transitions. [2022-04-08 10:06:30,694 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-08 10:06:30,694 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-08 10:06:30,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 10:06:30,695 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:30,695 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:30,695 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 10:06:30,695 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:30,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:30,696 INFO L85 PathProgramCache]: Analyzing trace with hash 669375650, now seen corresponding path program 1 times [2022-04-08 10:06:30,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:30,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2112248958] [2022-04-08 10:06:30,710 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:30,710 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:30,710 INFO L85 PathProgramCache]: Analyzing trace with hash 669375650, now seen corresponding path program 2 times [2022-04-08 10:06:30,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:30,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828312985] [2022-04-08 10:06:30,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:30,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:30,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:30,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {775#true} is VALID [2022-04-08 10:06:30,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {775#true} assume true; {775#true} is VALID [2022-04-08 10:06:30,757 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {775#true} {775#true} #83#return; {775#true} is VALID [2022-04-08 10:06:30,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {775#true} call ULTIMATE.init(); {782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:30,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {775#true} is VALID [2022-04-08 10:06:30,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {775#true} assume true; {775#true} is VALID [2022-04-08 10:06:30,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {775#true} {775#true} #83#return; {775#true} is VALID [2022-04-08 10:06:30,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {775#true} call #t~ret15 := main(); {775#true} is VALID [2022-04-08 10:06:30,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {775#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {780#(= main_~y~0 0)} is VALID [2022-04-08 10:06:30,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {780#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {780#(= main_~y~0 0)} is VALID [2022-04-08 10:06:30,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {780#(= main_~y~0 0)} ~z~0 := ~y~0; {781#(= main_~z~0 0)} is VALID [2022-04-08 10:06:30,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {781#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {776#false} is VALID [2022-04-08 10:06:30,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {776#false} assume !(~z~0 % 4294967296 > 0); {776#false} is VALID [2022-04-08 10:06:30,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {776#false} assume !(~y~0 % 4294967296 > 0); {776#false} is VALID [2022-04-08 10:06:30,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {776#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {776#false} is VALID [2022-04-08 10:06:30,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {776#false} assume !(~x~0 % 4294967296 > 0); {776#false} is VALID [2022-04-08 10:06:30,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {776#false} assume !(~z~0 % 4294967296 > 0); {776#false} is VALID [2022-04-08 10:06:30,761 INFO L272 TraceCheckUtils]: 14: Hoare triple {776#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {776#false} is VALID [2022-04-08 10:06:30,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {776#false} ~cond := #in~cond; {776#false} is VALID [2022-04-08 10:06:30,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {776#false} assume 0 == ~cond; {776#false} is VALID [2022-04-08 10:06:30,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {776#false} assume !false; {776#false} is VALID [2022-04-08 10:06:30,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:06:30,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:30,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828312985] [2022-04-08 10:06:30,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828312985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:30,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:30,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:06:30,763 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:30,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2112248958] [2022-04-08 10:06:30,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2112248958] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:30,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:30,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:06:30,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130812132] [2022-04-08 10:06:30,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:30,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-08 10:06:30,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:30,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-08 10:06:30,777 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-08 10:06:30,778 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:06:30,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:30,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:06:30,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:06:30,778 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-08 10:06:30,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:30,900 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-04-08 10:06:30,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:06:30,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-08 10:06:30,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:30,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-08 10:06:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-08 10:06:30,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-08 10:06:30,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-08 10:06:30,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-08 10:06:30,935 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-08 10:06:30,936 INFO L225 Difference]: With dead ends: 40 [2022-04-08 10:06:30,936 INFO L226 Difference]: Without dead ends: 28 [2022-04-08 10:06:30,936 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-08 10:06:30,937 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:30,937 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 31 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:06:30,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-08 10:06:30,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-08 10:06:30,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:30,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:30,956 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:30,956 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:30,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:30,957 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-04-08 10:06:30,957 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-04-08 10:06:30,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:30,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:30,958 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-08 10:06:30,958 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-08 10:06:30,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:30,959 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-04-08 10:06:30,959 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-04-08 10:06:30,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:30,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:30,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:30,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:30,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-04-08 10:06:30,961 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 18 [2022-04-08 10:06:30,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:30,961 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-04-08 10:06:30,962 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-08 10:06:30,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 37 transitions. [2022-04-08 10:06:30,999 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-08 10:06:30,999 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-04-08 10:06:30,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 10:06:30,999 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:30,999 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:31,000 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 10:06:31,000 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:31,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:31,000 INFO L85 PathProgramCache]: Analyzing trace with hash 735022287, now seen corresponding path program 1 times [2022-04-08 10:06:31,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:31,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [543120207] [2022-04-08 10:06:31,003 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:31,004 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:31,004 INFO L85 PathProgramCache]: Analyzing trace with hash 735022287, now seen corresponding path program 2 times [2022-04-08 10:06:31,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:31,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307251707] [2022-04-08 10:06:31,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:31,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:31,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:31,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {989#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {981#true} is VALID [2022-04-08 10:06:31,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {981#true} assume true; {981#true} is VALID [2022-04-08 10:06:31,093 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {981#true} {981#true} #83#return; {981#true} is VALID [2022-04-08 10:06:31,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {981#true} call ULTIMATE.init(); {989#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:31,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {989#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {981#true} is VALID [2022-04-08 10:06:31,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {981#true} assume true; {981#true} is VALID [2022-04-08 10:06:31,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {981#true} {981#true} #83#return; {981#true} is VALID [2022-04-08 10:06:31,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {981#true} call #t~ret15 := main(); {981#true} is VALID [2022-04-08 10:06:31,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {981#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {986#(= main_~y~0 0)} is VALID [2022-04-08 10:06:31,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {986#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {987#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:31,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {987#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {987#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:31,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {987#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {988#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:06:31,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {988#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {982#false} is VALID [2022-04-08 10:06:31,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {982#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {982#false} is VALID [2022-04-08 10:06:31,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {982#false} assume !(~y~0 % 4294967296 > 0); {982#false} is VALID [2022-04-08 10:06:31,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {982#false} assume !(~x~0 % 4294967296 > 0); {982#false} is VALID [2022-04-08 10:06:31,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {982#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {982#false} is VALID [2022-04-08 10:06:31,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {982#false} assume !(~z~0 % 4294967296 > 0); {982#false} is VALID [2022-04-08 10:06:31,102 INFO L272 TraceCheckUtils]: 15: Hoare triple {982#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {982#false} is VALID [2022-04-08 10:06:31,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {982#false} ~cond := #in~cond; {982#false} is VALID [2022-04-08 10:06:31,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {982#false} assume 0 == ~cond; {982#false} is VALID [2022-04-08 10:06:31,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {982#false} assume !false; {982#false} is VALID [2022-04-08 10:06:31,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:06:31,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:31,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307251707] [2022-04-08 10:06:31,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307251707] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:31,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318233127] [2022-04-08 10:06:31,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:06:31,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:31,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:31,119 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-08 10:06:31,127 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-08 10:06:31,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:06:31,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:31,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 10:06:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:31,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:31,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {981#true} call ULTIMATE.init(); {981#true} is VALID [2022-04-08 10:06:31,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {981#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {981#true} is VALID [2022-04-08 10:06:31,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {981#true} assume true; {981#true} is VALID [2022-04-08 10:06:31,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {981#true} {981#true} #83#return; {981#true} is VALID [2022-04-08 10:06:31,622 INFO L272 TraceCheckUtils]: 4: Hoare triple {981#true} call #t~ret15 := main(); {981#true} is VALID [2022-04-08 10:06:31,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {981#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {986#(= main_~y~0 0)} is VALID [2022-04-08 10:06:31,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {986#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {987#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:31,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {987#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {987#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:31,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {987#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1017#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:31,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {1017#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~z~0 % 4294967296 > 0); {1017#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:31,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {1017#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1024#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:31,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {1024#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {1024#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:31,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {1024#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {1024#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:31,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {1024#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1034#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:06:31,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {1034#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {982#false} is VALID [2022-04-08 10:06:31,628 INFO L272 TraceCheckUtils]: 15: Hoare triple {982#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {982#false} is VALID [2022-04-08 10:06:31,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {982#false} ~cond := #in~cond; {982#false} is VALID [2022-04-08 10:06:31,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {982#false} assume 0 == ~cond; {982#false} is VALID [2022-04-08 10:06:31,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {982#false} assume !false; {982#false} is VALID [2022-04-08 10:06:31,628 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-08 10:06:31,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:31,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {982#false} assume !false; {982#false} is VALID [2022-04-08 10:06:31,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {982#false} assume 0 == ~cond; {982#false} is VALID [2022-04-08 10:06:31,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {982#false} ~cond := #in~cond; {982#false} is VALID [2022-04-08 10:06:31,759 INFO L272 TraceCheckUtils]: 15: Hoare triple {982#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {982#false} is VALID [2022-04-08 10:06:31,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {1062#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {982#false} is VALID [2022-04-08 10:06:31,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {1066#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1062#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:31,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {1066#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {1066#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:31,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {1066#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {1066#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:31,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {1076#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1066#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:31,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {1076#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1076#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:06:31,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {981#true} ~z~0 := ~y~0; {1076#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:06:31,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {981#true} assume !(~x~0 % 4294967296 > 0); {981#true} is VALID [2022-04-08 10:06:31,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {981#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {981#true} is VALID [2022-04-08 10:06:31,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {981#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {981#true} is VALID [2022-04-08 10:06:31,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {981#true} call #t~ret15 := main(); {981#true} is VALID [2022-04-08 10:06:31,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {981#true} {981#true} #83#return; {981#true} is VALID [2022-04-08 10:06:31,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {981#true} assume true; {981#true} is VALID [2022-04-08 10:06:31,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {981#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {981#true} is VALID [2022-04-08 10:06:31,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {981#true} call ULTIMATE.init(); {981#true} is VALID [2022-04-08 10:06:31,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:06:31,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318233127] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:31,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:31,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 5] total 12 [2022-04-08 10:06:31,765 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:31,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [543120207] [2022-04-08 10:06:31,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [543120207] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:31,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:31,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:06:31,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16837152] [2022-04-08 10:06:31,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:31,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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-08 10:06:31,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:31,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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-08 10:06:31,786 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-08 10:06:31,786 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:06:31,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:31,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:06:31,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-08 10:06:31,787 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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-08 10:06:32,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:32,028 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2022-04-08 10:06:32,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:06:32,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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-08 10:06:32,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:32,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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-08 10:06:32,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-08 10:06:32,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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-08 10:06:32,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-08 10:06:32,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-04-08 10:06:32,085 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-08 10:06:32,086 INFO L225 Difference]: With dead ends: 57 [2022-04-08 10:06:32,086 INFO L226 Difference]: Without dead ends: 41 [2022-04-08 10:06:32,086 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-04-08 10:06:32,088 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 29 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:32,088 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 36 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:06:32,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-08 10:06:32,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2022-04-08 10:06:32,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:32,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:32,124 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:32,124 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:32,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:32,156 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-04-08 10:06:32,156 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2022-04-08 10:06:32,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:32,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:32,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-08 10:06:32,157 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-08 10:06:32,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:32,159 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-04-08 10:06:32,159 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2022-04-08 10:06:32,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:32,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:32,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:32,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:32,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:32,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-08 10:06:32,160 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 19 [2022-04-08 10:06:32,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:32,161 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-04-08 10:06:32,161 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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-08 10:06:32,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 45 transitions. [2022-04-08 10:06:32,208 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-08 10:06:32,208 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-08 10:06:32,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 10:06:32,208 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:32,208 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:32,236 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-08 10:06:32,409 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-08 10:06:32,409 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:32,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:32,410 INFO L85 PathProgramCache]: Analyzing trace with hash 342490275, now seen corresponding path program 1 times [2022-04-08 10:06:32,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:32,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [92581641] [2022-04-08 10:06:32,414 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:32,414 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:32,414 INFO L85 PathProgramCache]: Analyzing trace with hash 342490275, now seen corresponding path program 2 times [2022-04-08 10:06:32,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:32,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772292216] [2022-04-08 10:06:32,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:32,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:32,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:32,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {1386#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1379#true} is VALID [2022-04-08 10:06:32,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-08 10:06:32,528 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1379#true} {1379#true} #83#return; {1379#true} is VALID [2022-04-08 10:06:32,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1386#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:32,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {1386#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1379#true} is VALID [2022-04-08 10:06:32,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-08 10:06:32,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #83#return; {1379#true} is VALID [2022-04-08 10:06:32,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret15 := main(); {1379#true} is VALID [2022-04-08 10:06:32,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {1379#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1379#true} is VALID [2022-04-08 10:06:32,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {1379#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:06:32,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:06:32,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:06:32,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:06:32,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:06:32,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:06:32,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:06:32,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1380#false} is VALID [2022-04-08 10:06:32,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {1380#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1380#false} is VALID [2022-04-08 10:06:32,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {1380#false} assume !(~z~0 % 4294967296 > 0); {1380#false} is VALID [2022-04-08 10:06:32,534 INFO L272 TraceCheckUtils]: 16: Hoare triple {1380#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1380#false} is VALID [2022-04-08 10:06:32,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {1380#false} ~cond := #in~cond; {1380#false} is VALID [2022-04-08 10:06:32,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {1380#false} assume 0 == ~cond; {1380#false} is VALID [2022-04-08 10:06:32,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2022-04-08 10:06:32,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:06:32,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:32,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772292216] [2022-04-08 10:06:32,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772292216] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:32,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676621761] [2022-04-08 10:06:32,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:06:32,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:32,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:32,537 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-08 10:06:32,538 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-08 10:06:32,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:06:32,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:32,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 10:06:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:32,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:32,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1379#true} is VALID [2022-04-08 10:06:32,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {1379#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1379#true} is VALID [2022-04-08 10:06:32,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-08 10:06:32,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #83#return; {1379#true} is VALID [2022-04-08 10:06:32,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret15 := main(); {1379#true} is VALID [2022-04-08 10:06:32,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {1379#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1379#true} is VALID [2022-04-08 10:06:32,853 INFO L290 TraceCheckUtils]: 6: Hoare triple {1379#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:06:32,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:06:32,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:06:32,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:06:32,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:06:32,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:06:32,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:06:32,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1380#false} is VALID [2022-04-08 10:06:32,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {1380#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1380#false} is VALID [2022-04-08 10:06:32,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {1380#false} assume !(~z~0 % 4294967296 > 0); {1380#false} is VALID [2022-04-08 10:06:32,857 INFO L272 TraceCheckUtils]: 16: Hoare triple {1380#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1380#false} is VALID [2022-04-08 10:06:32,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {1380#false} ~cond := #in~cond; {1380#false} is VALID [2022-04-08 10:06:32,858 INFO L290 TraceCheckUtils]: 18: Hoare triple {1380#false} assume 0 == ~cond; {1380#false} is VALID [2022-04-08 10:06:32,858 INFO L290 TraceCheckUtils]: 19: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2022-04-08 10:06:32,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:06:32,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:33,118 INFO L290 TraceCheckUtils]: 19: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2022-04-08 10:06:33,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {1380#false} assume 0 == ~cond; {1380#false} is VALID [2022-04-08 10:06:33,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {1380#false} ~cond := #in~cond; {1380#false} is VALID [2022-04-08 10:06:33,119 INFO L272 TraceCheckUtils]: 16: Hoare triple {1380#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1380#false} is VALID [2022-04-08 10:06:33,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {1380#false} assume !(~z~0 % 4294967296 > 0); {1380#false} is VALID [2022-04-08 10:06:33,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {1380#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1380#false} is VALID [2022-04-08 10:06:33,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1380#false} is VALID [2022-04-08 10:06:33,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:06:33,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:06:33,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:06:33,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1385#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:06:33,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:06:33,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:06:33,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {1379#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1384#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:06:33,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {1379#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1379#true} is VALID [2022-04-08 10:06:33,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret15 := main(); {1379#true} is VALID [2022-04-08 10:06:33,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #83#return; {1379#true} is VALID [2022-04-08 10:06:33,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-08 10:06:33,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {1379#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1379#true} is VALID [2022-04-08 10:06:33,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1379#true} is VALID [2022-04-08 10:06:33,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:06:33,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676621761] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:33,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:33,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-08 10:06:33,125 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:33,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [92581641] [2022-04-08 10:06:33,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [92581641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:33,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:33,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:06:33,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743448742] [2022-04-08 10:06:33,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:33,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 10:06:33,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:33,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:33,145 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-08 10:06:33,145 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:06:33,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:33,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:06:33,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:06:33,146 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:33,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:33,329 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-04-08 10:06:33,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:06:33,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 10:06:33,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:33,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:33,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 10:06:33,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:33,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 10:06:33,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-08 10:06:33,373 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-08 10:06:33,374 INFO L225 Difference]: With dead ends: 49 [2022-04-08 10:06:33,374 INFO L226 Difference]: Without dead ends: 42 [2022-04-08 10:06:33,374 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-08 10:06:33,375 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:33,375 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:06:33,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-08 10:06:33,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-04-08 10:06:33,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:33,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 41 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:33,421 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 41 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:33,421 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 41 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:33,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:33,422 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2022-04-08 10:06:33,422 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2022-04-08 10:06:33,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:33,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:33,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-08 10:06:33,423 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-08 10:06:33,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:33,424 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2022-04-08 10:06:33,424 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2022-04-08 10:06:33,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:33,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:33,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:33,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:33,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:33,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2022-04-08 10:06:33,426 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 20 [2022-04-08 10:06:33,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:33,427 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2022-04-08 10:06:33,427 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:33,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 56 transitions. [2022-04-08 10:06:33,492 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-08 10:06:33,492 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2022-04-08 10:06:33,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 10:06:33,493 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:33,493 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:33,518 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-08 10:06:33,707 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,SelfDestructingSolverStorable6 [2022-04-08 10:06:33,708 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:33,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:33,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1745318674, now seen corresponding path program 1 times [2022-04-08 10:06:33,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:33,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [805433619] [2022-04-08 10:06:33,712 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:33,712 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:33,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1745318674, now seen corresponding path program 2 times [2022-04-08 10:06:33,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:33,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750474776] [2022-04-08 10:06:33,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:33,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:33,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:33,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {1784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1774#true} is VALID [2022-04-08 10:06:33,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {1774#true} assume true; {1774#true} is VALID [2022-04-08 10:06:33,810 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1774#true} {1774#true} #83#return; {1774#true} is VALID [2022-04-08 10:06:33,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {1774#true} call ULTIMATE.init(); {1784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:33,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {1784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1774#true} is VALID [2022-04-08 10:06:33,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {1774#true} assume true; {1774#true} is VALID [2022-04-08 10:06:33,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1774#true} {1774#true} #83#return; {1774#true} is VALID [2022-04-08 10:06:33,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {1774#true} call #t~ret15 := main(); {1774#true} is VALID [2022-04-08 10:06:33,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {1774#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1779#(= main_~y~0 0)} is VALID [2022-04-08 10:06:33,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {1779#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1780#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:33,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {1780#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1780#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:33,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {1780#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1781#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:06:33,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {1781#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1782#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:06:33,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {1782#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1782#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:06:33,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {1782#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1783#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:06:33,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {1783#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {1783#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:06:33,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {1783#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1783#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:06:33,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {1783#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {1783#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:06:33,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {1783#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1775#false} is VALID [2022-04-08 10:06:33,817 INFO L272 TraceCheckUtils]: 16: Hoare triple {1775#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1775#false} is VALID [2022-04-08 10:06:33,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {1775#false} ~cond := #in~cond; {1775#false} is VALID [2022-04-08 10:06:33,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {1775#false} assume 0 == ~cond; {1775#false} is VALID [2022-04-08 10:06:33,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {1775#false} assume !false; {1775#false} is VALID [2022-04-08 10:06:33,817 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:06:33,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:33,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750474776] [2022-04-08 10:06:33,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750474776] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:33,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984207543] [2022-04-08 10:06:33,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:06:33,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:33,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:33,819 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-08 10:06:33,871 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-08 10:06:33,931 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:06:33,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:33,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 10:06:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:33,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:34,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {1774#true} call ULTIMATE.init(); {1774#true} is VALID [2022-04-08 10:06:34,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {1774#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1774#true} is VALID [2022-04-08 10:06:34,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {1774#true} assume true; {1774#true} is VALID [2022-04-08 10:06:34,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1774#true} {1774#true} #83#return; {1774#true} is VALID [2022-04-08 10:06:34,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {1774#true} call #t~ret15 := main(); {1774#true} is VALID [2022-04-08 10:06:34,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {1774#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1779#(= main_~y~0 0)} is VALID [2022-04-08 10:06:34,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {1779#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1780#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:34,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {1780#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1780#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:34,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {1780#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1812#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:34,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {1812#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1816#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:34,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {1816#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} assume !(~z~0 % 4294967296 > 0); {1816#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:34,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {1816#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1823#(and (<= 0 main_~y~0) (= main_~z~0 (+ main_~y~0 1)) (<= main_~y~0 0))} is VALID [2022-04-08 10:06:34,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {1823#(and (<= 0 main_~y~0) (= main_~z~0 (+ main_~y~0 1)) (<= main_~y~0 0))} assume !(~y~0 % 4294967296 > 0); {1823#(and (<= 0 main_~y~0) (= main_~z~0 (+ main_~y~0 1)) (<= main_~y~0 0))} is VALID [2022-04-08 10:06:34,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {1823#(and (<= 0 main_~y~0) (= main_~z~0 (+ main_~y~0 1)) (<= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1812#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:34,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {1812#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1812#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:34,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {1812#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~z~0 % 4294967296 > 0); {1775#false} is VALID [2022-04-08 10:06:34,131 INFO L272 TraceCheckUtils]: 16: Hoare triple {1775#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1775#false} is VALID [2022-04-08 10:06:34,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {1775#false} ~cond := #in~cond; {1775#false} is VALID [2022-04-08 10:06:34,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {1775#false} assume 0 == ~cond; {1775#false} is VALID [2022-04-08 10:06:34,131 INFO L290 TraceCheckUtils]: 19: Hoare triple {1775#false} assume !false; {1775#false} is VALID [2022-04-08 10:06:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:34,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:34,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {1775#false} assume !false; {1775#false} is VALID [2022-04-08 10:06:34,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {1851#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1775#false} is VALID [2022-04-08 10:06:34,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {1855#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1851#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:06:34,396 INFO L272 TraceCheckUtils]: 16: Hoare triple {1859#(= (mod main_~y~0 4294967296) 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1855#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:06:34,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {1863#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1859#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-08 10:06:34,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {1863#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {1863#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:06:34,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {1870#(or (< 0 (mod main_~z~0 4294967296)) (= (mod (+ main_~y~0 1) 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1863#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:06:34,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {1870#(or (< 0 (mod main_~z~0 4294967296)) (= (mod (+ main_~y~0 1) 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {1870#(or (< 0 (mod main_~z~0 4294967296)) (= (mod (+ main_~y~0 1) 4294967296) 0))} is VALID [2022-04-08 10:06:34,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {1877#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (mod main_~y~0 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1870#(or (< 0 (mod main_~z~0 4294967296)) (= (mod (+ main_~y~0 1) 4294967296) 0))} is VALID [2022-04-08 10:06:34,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {1877#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (mod main_~y~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {1877#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-08 10:06:34,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {1863#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1877#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-08 10:06:34,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {1774#true} ~z~0 := ~y~0; {1863#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:06:34,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {1774#true} assume !(~x~0 % 4294967296 > 0); {1774#true} is VALID [2022-04-08 10:06:34,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {1774#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1774#true} is VALID [2022-04-08 10:06:34,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {1774#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1774#true} is VALID [2022-04-08 10:06:34,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {1774#true} call #t~ret15 := main(); {1774#true} is VALID [2022-04-08 10:06:34,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1774#true} {1774#true} #83#return; {1774#true} is VALID [2022-04-08 10:06:34,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {1774#true} assume true; {1774#true} is VALID [2022-04-08 10:06:34,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {1774#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1774#true} is VALID [2022-04-08 10:06:34,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {1774#true} call ULTIMATE.init(); {1774#true} is VALID [2022-04-08 10:06:34,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:06:34,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984207543] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:34,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:34,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 17 [2022-04-08 10:06:34,403 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:34,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [805433619] [2022-04-08 10:06:34,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [805433619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:34,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:34,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:06:34,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309161189] [2022-04-08 10:06:34,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:34,404 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 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-08 10:06:34,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:34,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:34,420 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-08 10:06:34,420 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:06:34,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:34,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:06:34,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-04-08 10:06:34,421 INFO L87 Difference]: Start difference. First operand 41 states and 56 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:34,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:34,823 INFO L93 Difference]: Finished difference Result 59 states and 82 transitions. [2022-04-08 10:06:34,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:06:34,824 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 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-08 10:06:34,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:34,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:34,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 57 transitions. [2022-04-08 10:06:34,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:34,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 57 transitions. [2022-04-08 10:06:34,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 57 transitions. [2022-04-08 10:06:34,881 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-08 10:06:34,882 INFO L225 Difference]: With dead ends: 59 [2022-04-08 10:06:34,882 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 10:06:34,882 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2022-04-08 10:06:34,883 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 30 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:34,883 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 38 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:06:34,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 10:06:34,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2022-04-08 10:06:34,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:34,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 41 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:34,940 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 41 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:34,940 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 41 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:34,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:34,941 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-08 10:06:34,942 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2022-04-08 10:06:34,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:34,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:34,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-08 10:06:34,942 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-08 10:06:34,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:34,943 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-08 10:06:34,943 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2022-04-08 10:06:34,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:34,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:34,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:34,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:34,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:34,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2022-04-08 10:06:34,945 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 20 [2022-04-08 10:06:34,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:34,945 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2022-04-08 10:06:34,945 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:34,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 55 transitions. [2022-04-08 10:06:35,023 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-08 10:06:35,023 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2022-04-08 10:06:35,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 10:06:35,023 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:35,023 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:35,055 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-08 10:06:35,224 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:35,224 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:35,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:35,225 INFO L85 PathProgramCache]: Analyzing trace with hash -2026119006, now seen corresponding path program 3 times [2022-04-08 10:06:35,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:35,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [216793388] [2022-04-08 10:06:35,228 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:35,228 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:35,228 INFO L85 PathProgramCache]: Analyzing trace with hash -2026119006, now seen corresponding path program 4 times [2022-04-08 10:06:35,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:35,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688732491] [2022-04-08 10:06:35,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:35,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:35,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:35,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {2232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2223#true} is VALID [2022-04-08 10:06:35,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {2223#true} assume true; {2223#true} is VALID [2022-04-08 10:06:35,335 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2223#true} {2223#true} #83#return; {2223#true} is VALID [2022-04-08 10:06:35,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {2223#true} call ULTIMATE.init(); {2232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:35,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {2232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2223#true} is VALID [2022-04-08 10:06:35,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {2223#true} assume true; {2223#true} is VALID [2022-04-08 10:06:35,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2223#true} {2223#true} #83#return; {2223#true} is VALID [2022-04-08 10:06:35,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {2223#true} call #t~ret15 := main(); {2223#true} is VALID [2022-04-08 10:06:35,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {2223#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2228#(= main_~y~0 0)} is VALID [2022-04-08 10:06:35,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {2228#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2229#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:35,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {2229#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2230#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:35,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {2230#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {2230#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:35,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {2230#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2231#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:35,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {2231#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {2224#false} is VALID [2022-04-08 10:06:35,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {2224#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2224#false} is VALID [2022-04-08 10:06:35,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {2224#false} assume !(~y~0 % 4294967296 > 0); {2224#false} is VALID [2022-04-08 10:06:35,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {2224#false} assume !(~x~0 % 4294967296 > 0); {2224#false} is VALID [2022-04-08 10:06:35,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {2224#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2224#false} is VALID [2022-04-08 10:06:35,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {2224#false} assume !(~z~0 % 4294967296 > 0); {2224#false} is VALID [2022-04-08 10:06:35,340 INFO L272 TraceCheckUtils]: 16: Hoare triple {2224#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2224#false} is VALID [2022-04-08 10:06:35,340 INFO L290 TraceCheckUtils]: 17: Hoare triple {2224#false} ~cond := #in~cond; {2224#false} is VALID [2022-04-08 10:06:35,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {2224#false} assume 0 == ~cond; {2224#false} is VALID [2022-04-08 10:06:35,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {2224#false} assume !false; {2224#false} is VALID [2022-04-08 10:06:35,340 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:06:35,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:35,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688732491] [2022-04-08 10:06:35,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688732491] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:35,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93353433] [2022-04-08 10:06:35,341 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:06:35,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:35,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:35,342 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-08 10:06:35,343 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-08 10:06:35,393 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:06:35,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:35,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 10:06:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:35,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:35,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {2223#true} call ULTIMATE.init(); {2223#true} is VALID [2022-04-08 10:06:35,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {2223#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2223#true} is VALID [2022-04-08 10:06:35,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {2223#true} assume true; {2223#true} is VALID [2022-04-08 10:06:35,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2223#true} {2223#true} #83#return; {2223#true} is VALID [2022-04-08 10:06:35,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {2223#true} call #t~ret15 := main(); {2223#true} is VALID [2022-04-08 10:06:35,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {2223#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2228#(= main_~y~0 0)} is VALID [2022-04-08 10:06:35,500 INFO L290 TraceCheckUtils]: 6: Hoare triple {2228#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2229#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:35,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {2229#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2230#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:35,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {2230#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {2230#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:35,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {2230#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2263#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:35,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {2263#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~z~0 % 4294967296 > 0); {2224#false} is VALID [2022-04-08 10:06:35,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {2224#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2224#false} is VALID [2022-04-08 10:06:35,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {2224#false} assume !(~y~0 % 4294967296 > 0); {2224#false} is VALID [2022-04-08 10:06:35,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {2224#false} assume !(~x~0 % 4294967296 > 0); {2224#false} is VALID [2022-04-08 10:06:35,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {2224#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2224#false} is VALID [2022-04-08 10:06:35,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {2224#false} assume !(~z~0 % 4294967296 > 0); {2224#false} is VALID [2022-04-08 10:06:35,505 INFO L272 TraceCheckUtils]: 16: Hoare triple {2224#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2224#false} is VALID [2022-04-08 10:06:35,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {2224#false} ~cond := #in~cond; {2224#false} is VALID [2022-04-08 10:06:35,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {2224#false} assume 0 == ~cond; {2224#false} is VALID [2022-04-08 10:06:35,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {2224#false} assume !false; {2224#false} is VALID [2022-04-08 10:06:35,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:06:35,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:35,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {2224#false} assume !false; {2224#false} is VALID [2022-04-08 10:06:35,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {2224#false} assume 0 == ~cond; {2224#false} is VALID [2022-04-08 10:06:35,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {2224#false} ~cond := #in~cond; {2224#false} is VALID [2022-04-08 10:06:35,584 INFO L272 TraceCheckUtils]: 16: Hoare triple {2224#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2224#false} is VALID [2022-04-08 10:06:35,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {2224#false} assume !(~z~0 % 4294967296 > 0); {2224#false} is VALID [2022-04-08 10:06:35,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {2224#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2224#false} is VALID [2022-04-08 10:06:35,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {2224#false} assume !(~x~0 % 4294967296 > 0); {2224#false} is VALID [2022-04-08 10:06:35,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {2224#false} assume !(~y~0 % 4294967296 > 0); {2224#false} is VALID [2022-04-08 10:06:35,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {2318#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2224#false} is VALID [2022-04-08 10:06:35,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {2322#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2318#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:06:35,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {2223#true} ~z~0 := ~y~0; {2322#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:06:35,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {2223#true} assume !(~x~0 % 4294967296 > 0); {2223#true} is VALID [2022-04-08 10:06:35,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {2223#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2223#true} is VALID [2022-04-08 10:06:35,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {2223#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2223#true} is VALID [2022-04-08 10:06:35,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {2223#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2223#true} is VALID [2022-04-08 10:06:35,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {2223#true} call #t~ret15 := main(); {2223#true} is VALID [2022-04-08 10:06:35,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2223#true} {2223#true} #83#return; {2223#true} is VALID [2022-04-08 10:06:35,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {2223#true} assume true; {2223#true} is VALID [2022-04-08 10:06:35,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {2223#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2223#true} is VALID [2022-04-08 10:06:35,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {2223#true} call ULTIMATE.init(); {2223#true} is VALID [2022-04-08 10:06:35,592 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 10:06:35,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93353433] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:35,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:06:35,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 6] total 10 [2022-04-08 10:06:35,592 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:35,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [216793388] [2022-04-08 10:06:35,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [216793388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:35,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:35,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:06:35,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260470061] [2022-04-08 10:06:35,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:35,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 10:06:35,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:35,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:35,607 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-08 10:06:35,607 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 10:06:35,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:35,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 10:06:35,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:06:35,608 INFO L87 Difference]: Start difference. First operand 41 states and 55 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:35,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:35,719 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2022-04-08 10:06:35,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 10:06:35,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 10:06:35,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:35,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:35,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-08 10:06:35,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:35,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-08 10:06:35,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-04-08 10:06:35,748 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-08 10:06:35,749 INFO L225 Difference]: With dead ends: 48 [2022-04-08 10:06:35,749 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 10:06:35,749 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:06:35,750 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:35,750 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 41 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:06:35,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 10:06:35,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-08 10:06:35,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:35,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:35,809 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:35,810 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:35,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:35,811 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2022-04-08 10:06:35,811 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2022-04-08 10:06:35,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:35,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:35,811 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-08 10:06:35,812 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-08 10:06:35,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:35,813 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2022-04-08 10:06:35,813 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2022-04-08 10:06:35,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:35,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:35,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:35,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:35,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:35,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2022-04-08 10:06:35,814 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 20 [2022-04-08 10:06:35,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:35,815 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2022-04-08 10:06:35,815 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:35,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 50 transitions. [2022-04-08 10:06:35,879 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-08 10:06:35,880 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2022-04-08 10:06:35,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 10:06:35,880 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:35,880 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:35,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 10:06:36,080 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:36,081 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:36,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:36,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1005753922, now seen corresponding path program 1 times [2022-04-08 10:06:36,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:36,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1398710502] [2022-04-08 10:06:36,084 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:36,084 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:36,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1005753922, now seen corresponding path program 2 times [2022-04-08 10:06:36,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:36,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327326667] [2022-04-08 10:06:36,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:36,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:36,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:36,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {2613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2603#true} is VALID [2022-04-08 10:06:36,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {2603#true} assume true; {2603#true} is VALID [2022-04-08 10:06:36,212 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2603#true} {2603#true} #83#return; {2603#true} is VALID [2022-04-08 10:06:36,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {2603#true} call ULTIMATE.init(); {2613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:36,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {2613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2603#true} is VALID [2022-04-08 10:06:36,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {2603#true} assume true; {2603#true} is VALID [2022-04-08 10:06:36,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2603#true} {2603#true} #83#return; {2603#true} is VALID [2022-04-08 10:06:36,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {2603#true} call #t~ret15 := main(); {2603#true} is VALID [2022-04-08 10:06:36,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {2603#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2608#(= main_~y~0 0)} is VALID [2022-04-08 10:06:36,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {2608#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2609#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:36,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {2609#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:36,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {2610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {2610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:36,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {2610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2611#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:36,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {2611#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2612#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:06:36,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {2612#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {2604#false} is VALID [2022-04-08 10:06:36,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {2604#false} assume !(~y~0 % 4294967296 > 0); {2604#false} is VALID [2022-04-08 10:06:36,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {2604#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2604#false} is VALID [2022-04-08 10:06:36,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {2604#false} assume !(~x~0 % 4294967296 > 0); {2604#false} is VALID [2022-04-08 10:06:36,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {2604#false} assume !(~z~0 % 4294967296 > 0); {2604#false} is VALID [2022-04-08 10:06:36,217 INFO L272 TraceCheckUtils]: 16: Hoare triple {2604#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2604#false} is VALID [2022-04-08 10:06:36,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {2604#false} ~cond := #in~cond; {2604#false} is VALID [2022-04-08 10:06:36,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {2604#false} assume 0 == ~cond; {2604#false} is VALID [2022-04-08 10:06:36,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {2604#false} assume !false; {2604#false} is VALID [2022-04-08 10:06:36,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:06:36,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:36,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327326667] [2022-04-08 10:06:36,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327326667] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:36,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390729165] [2022-04-08 10:06:36,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:06:36,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:36,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:36,224 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-08 10:06:36,225 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-08 10:06:36,260 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:06:36,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:36,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 10:06:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:36,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:36,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {2603#true} call ULTIMATE.init(); {2603#true} is VALID [2022-04-08 10:06:36,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {2603#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2603#true} is VALID [2022-04-08 10:06:36,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {2603#true} assume true; {2603#true} is VALID [2022-04-08 10:06:36,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2603#true} {2603#true} #83#return; {2603#true} is VALID [2022-04-08 10:06:36,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {2603#true} call #t~ret15 := main(); {2603#true} is VALID [2022-04-08 10:06:36,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {2603#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2608#(= main_~y~0 0)} is VALID [2022-04-08 10:06:36,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {2608#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2609#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:36,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {2609#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:36,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {2610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {2610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:36,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {2610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2644#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:36,503 INFO L290 TraceCheckUtils]: 10: Hoare triple {2644#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:36,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {2610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~z~0 % 4294967296 > 0); {2610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:36,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {2610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~y~0 % 4294967296 > 0); {2604#false} is VALID [2022-04-08 10:06:36,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {2604#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2604#false} is VALID [2022-04-08 10:06:36,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {2604#false} assume !(~x~0 % 4294967296 > 0); {2604#false} is VALID [2022-04-08 10:06:36,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {2604#false} assume !(~z~0 % 4294967296 > 0); {2604#false} is VALID [2022-04-08 10:06:36,505 INFO L272 TraceCheckUtils]: 16: Hoare triple {2604#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2604#false} is VALID [2022-04-08 10:06:36,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {2604#false} ~cond := #in~cond; {2604#false} is VALID [2022-04-08 10:06:36,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {2604#false} assume 0 == ~cond; {2604#false} is VALID [2022-04-08 10:06:36,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {2604#false} assume !false; {2604#false} is VALID [2022-04-08 10:06:36,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:06:36,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:36,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {2604#false} assume !false; {2604#false} is VALID [2022-04-08 10:06:36,601 INFO L290 TraceCheckUtils]: 18: Hoare triple {2604#false} assume 0 == ~cond; {2604#false} is VALID [2022-04-08 10:06:36,601 INFO L290 TraceCheckUtils]: 17: Hoare triple {2604#false} ~cond := #in~cond; {2604#false} is VALID [2022-04-08 10:06:36,601 INFO L272 TraceCheckUtils]: 16: Hoare triple {2604#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2604#false} is VALID [2022-04-08 10:06:36,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {2604#false} assume !(~z~0 % 4294967296 > 0); {2604#false} is VALID [2022-04-08 10:06:36,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {2604#false} assume !(~x~0 % 4294967296 > 0); {2604#false} is VALID [2022-04-08 10:06:36,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {2604#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2604#false} is VALID [2022-04-08 10:06:36,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {2696#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {2604#false} is VALID [2022-04-08 10:06:36,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {2696#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2696#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:36,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {2703#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2696#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:36,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {2603#true} ~z~0 := ~y~0; {2703#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:06:36,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {2603#true} assume !(~x~0 % 4294967296 > 0); {2603#true} is VALID [2022-04-08 10:06:36,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {2603#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2603#true} is VALID [2022-04-08 10:06:36,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {2603#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2603#true} is VALID [2022-04-08 10:06:36,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {2603#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2603#true} is VALID [2022-04-08 10:06:36,607 INFO L272 TraceCheckUtils]: 4: Hoare triple {2603#true} call #t~ret15 := main(); {2603#true} is VALID [2022-04-08 10:06:36,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2603#true} {2603#true} #83#return; {2603#true} is VALID [2022-04-08 10:06:36,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {2603#true} assume true; {2603#true} is VALID [2022-04-08 10:06:36,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {2603#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2603#true} is VALID [2022-04-08 10:06:36,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {2603#true} call ULTIMATE.init(); {2603#true} is VALID [2022-04-08 10:06:36,608 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 10:06:36,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390729165] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:36,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:06:36,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8, 6] total 11 [2022-04-08 10:06:36,609 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:36,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1398710502] [2022-04-08 10:06:36,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1398710502] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:36,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:36,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:06:36,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334276341] [2022-04-08 10:06:36,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:36,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 10:06:36,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:36,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:36,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:36,633 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 10:06:36,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:36,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 10:06:36,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-04-08 10:06:36,634 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:36,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:36,746 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2022-04-08 10:06:36,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 10:06:36,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 10:06:36,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:36,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:36,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-08 10:06:36,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:36,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-08 10:06:36,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2022-04-08 10:06:36,774 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-08 10:06:36,775 INFO L225 Difference]: With dead ends: 44 [2022-04-08 10:06:36,775 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 10:06:36,776 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-04-08 10:06:36,776 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:36,776 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 31 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:06:36,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 10:06:36,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 10:06:36,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:36,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:36,839 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:36,839 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:36,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:36,840 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-04-08 10:06:36,840 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-08 10:06:36,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:36,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:36,840 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-08 10:06:36,840 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-08 10:06:36,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:36,841 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-04-08 10:06:36,841 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-08 10:06:36,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:36,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:36,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:36,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:36,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:36,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-08 10:06:36,842 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 20 [2022-04-08 10:06:36,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:36,843 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-08 10:06:36,843 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:36,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 45 transitions. [2022-04-08 10:06:36,901 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-08 10:06:36,901 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-08 10:06:36,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 10:06:36,902 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:36,902 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:36,918 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-08 10:06:37,102 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,SelfDestructingSolverStorable9 [2022-04-08 10:06:37,103 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:37,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:37,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1695200847, now seen corresponding path program 1 times [2022-04-08 10:06:37,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:37,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [587529336] [2022-04-08 10:06:37,108 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:37,108 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:37,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1695200847, now seen corresponding path program 2 times [2022-04-08 10:06:37,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:37,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957374162] [2022-04-08 10:06:37,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:37,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:37,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:37,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {2978#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2968#true} is VALID [2022-04-08 10:06:37,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {2968#true} assume true; {2968#true} is VALID [2022-04-08 10:06:37,217 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2968#true} {2968#true} #83#return; {2968#true} is VALID [2022-04-08 10:06:37,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {2968#true} call ULTIMATE.init(); {2978#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:37,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {2978#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2968#true} is VALID [2022-04-08 10:06:37,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {2968#true} assume true; {2968#true} is VALID [2022-04-08 10:06:37,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2968#true} {2968#true} #83#return; {2968#true} is VALID [2022-04-08 10:06:37,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {2968#true} call #t~ret15 := main(); {2968#true} is VALID [2022-04-08 10:06:37,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {2968#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2973#(= main_~y~0 0)} is VALID [2022-04-08 10:06:37,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {2973#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:37,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:37,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:37,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:37,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~z~0 % 4294967296 > 0); {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:37,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2973#(= main_~y~0 0)} is VALID [2022-04-08 10:06:37,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {2973#(= main_~y~0 0)} assume !(~y~0 % 4294967296 > 0); {2973#(= main_~y~0 0)} is VALID [2022-04-08 10:06:37,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {2973#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:37,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:37,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2975#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:06:37,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {2975#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 > 0); {2975#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:06:37,225 INFO L272 TraceCheckUtils]: 17: Hoare triple {2975#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2976#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:06:37,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {2976#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2977#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:06:37,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {2977#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2969#false} is VALID [2022-04-08 10:06:37,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {2969#false} assume !false; {2969#false} is VALID [2022-04-08 10:06:37,226 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:06:37,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:37,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957374162] [2022-04-08 10:06:37,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957374162] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:37,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890064440] [2022-04-08 10:06:37,226 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:06:37,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:37,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:37,227 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-08 10:06:37,232 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-08 10:06:37,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:06:37,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:37,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 10:06:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:37,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:37,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {2968#true} call ULTIMATE.init(); {2968#true} is VALID [2022-04-08 10:06:37,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {2968#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2968#true} is VALID [2022-04-08 10:06:37,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {2968#true} assume true; {2968#true} is VALID [2022-04-08 10:06:37,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2968#true} {2968#true} #83#return; {2968#true} is VALID [2022-04-08 10:06:37,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {2968#true} call #t~ret15 := main(); {2968#true} is VALID [2022-04-08 10:06:37,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {2968#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2973#(= main_~y~0 0)} is VALID [2022-04-08 10:06:37,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {2973#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:37,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:37,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {3006#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:37,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {3006#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3010#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:37,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {3010#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} assume !(~z~0 % 4294967296 > 0); {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:37,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2973#(= main_~y~0 0)} is VALID [2022-04-08 10:06:37,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {2973#(= main_~y~0 0)} assume !(~y~0 % 4294967296 > 0); {2973#(= main_~y~0 0)} is VALID [2022-04-08 10:06:37,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {2973#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:37,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:37,453 INFO L290 TraceCheckUtils]: 15: Hoare triple {2974#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2973#(= main_~y~0 0)} is VALID [2022-04-08 10:06:37,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {2973#(= main_~y~0 0)} assume !(~z~0 % 4294967296 > 0); {2973#(= main_~y~0 0)} is VALID [2022-04-08 10:06:37,454 INFO L272 TraceCheckUtils]: 17: Hoare triple {2973#(= main_~y~0 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3035#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:06:37,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {3035#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3039#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:06:37,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {3039#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2969#false} is VALID [2022-04-08 10:06:37,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {2969#false} assume !false; {2969#false} is VALID [2022-04-08 10:06:37,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:37,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:37,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {2969#false} assume !false; {2969#false} is VALID [2022-04-08 10:06:37,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {3039#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2969#false} is VALID [2022-04-08 10:06:37,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {3035#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3039#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:06:37,631 INFO L272 TraceCheckUtils]: 17: Hoare triple {3055#(= (mod main_~y~0 4294967296) 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3035#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:06:37,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {3055#(= (mod main_~y~0 4294967296) 0)} assume !(~z~0 % 4294967296 > 0); {3055#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-08 10:06:37,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {3062#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3055#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-08 10:06:37,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {3062#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !(~x~0 % 4294967296 > 0); {3062#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-08 10:06:37,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {3055#(= (mod main_~y~0 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3062#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-08 10:06:37,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {3055#(= (mod main_~y~0 4294967296) 0)} assume !(~y~0 % 4294967296 > 0); {3055#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-08 10:06:37,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {3062#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3055#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-08 10:06:37,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {3078#(or (= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3062#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-08 10:06:37,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {3082#(or (= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3078#(or (= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:06:37,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {2968#true} ~z~0 := ~y~0; {3082#(or (= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:06:37,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {2968#true} assume !(~x~0 % 4294967296 > 0); {2968#true} is VALID [2022-04-08 10:06:37,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {2968#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2968#true} is VALID [2022-04-08 10:06:37,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {2968#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2968#true} is VALID [2022-04-08 10:06:37,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {2968#true} call #t~ret15 := main(); {2968#true} is VALID [2022-04-08 10:06:37,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2968#true} {2968#true} #83#return; {2968#true} is VALID [2022-04-08 10:06:37,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {2968#true} assume true; {2968#true} is VALID [2022-04-08 10:06:37,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {2968#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2968#true} is VALID [2022-04-08 10:06:37,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {2968#true} call ULTIMATE.init(); {2968#true} is VALID [2022-04-08 10:06:37,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:06:37,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890064440] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:37,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:37,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-04-08 10:06:37,640 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:37,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [587529336] [2022-04-08 10:06:37,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [587529336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:37,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:37,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:06:37,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859937913] [2022-04-08 10:06:37,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:37,641 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 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-08 10:06:37,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:37,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 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-08 10:06:37,662 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-08 10:06:37,662 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:06:37,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:37,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:06:37,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:06:37,663 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 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-08 10:06:37,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:37,942 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-08 10:06:37,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:06:37,942 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 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-08 10:06:37,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:37,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 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-08 10:06:37,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-08 10:06:37,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 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-08 10:06:37,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-08 10:06:37,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 38 transitions. [2022-04-08 10:06:37,980 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-08 10:06:37,981 INFO L225 Difference]: With dead ends: 44 [2022-04-08 10:06:37,981 INFO L226 Difference]: Without dead ends: 37 [2022-04-08 10:06:37,981 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-04-08 10:06:37,982 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:37,982 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 41 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:06:37,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-08 10:06:38,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-08 10:06:38,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:38,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:38,048 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:38,049 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:38,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:38,050 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-08 10:06:38,050 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-04-08 10:06:38,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:38,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:38,050 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-08 10:06:38,050 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-08 10:06:38,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:38,051 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-08 10:06:38,051 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-04-08 10:06:38,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:38,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:38,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:38,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:38,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:38,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2022-04-08 10:06:38,052 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 21 [2022-04-08 10:06:38,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:38,053 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-04-08 10:06:38,053 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 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-08 10:06:38,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 46 transitions. [2022-04-08 10:06:38,103 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-08 10:06:38,103 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-04-08 10:06:38,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 10:06:38,104 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:38,104 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:38,120 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-08 10:06:38,307 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:38,307 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:38,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:38,308 INFO L85 PathProgramCache]: Analyzing trace with hash 2049284511, now seen corresponding path program 3 times [2022-04-08 10:06:38,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:38,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1498338457] [2022-04-08 10:06:38,313 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:38,313 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:38,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2049284511, now seen corresponding path program 4 times [2022-04-08 10:06:38,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:38,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586640783] [2022-04-08 10:06:38,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:38,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:38,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:38,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {3366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3356#true} is VALID [2022-04-08 10:06:38,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {3356#true} assume true; {3356#true} is VALID [2022-04-08 10:06:38,430 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3356#true} {3356#true} #83#return; {3356#true} is VALID [2022-04-08 10:06:38,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {3356#true} call ULTIMATE.init(); {3366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:38,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {3366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3356#true} is VALID [2022-04-08 10:06:38,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {3356#true} assume true; {3356#true} is VALID [2022-04-08 10:06:38,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3356#true} {3356#true} #83#return; {3356#true} is VALID [2022-04-08 10:06:38,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {3356#true} call #t~ret15 := main(); {3356#true} is VALID [2022-04-08 10:06:38,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {3356#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3361#(= main_~y~0 0)} is VALID [2022-04-08 10:06:38,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {3361#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3362#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:38,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {3362#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3363#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:38,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {3363#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {3363#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:38,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {3363#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {3364#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:38,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {3364#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3365#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:06:38,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {3365#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3357#false} is VALID [2022-04-08 10:06:38,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {3357#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3357#false} is VALID [2022-04-08 10:06:38,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {3357#false} assume !(~y~0 % 4294967296 > 0); {3357#false} is VALID [2022-04-08 10:06:38,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {3357#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3357#false} is VALID [2022-04-08 10:06:38,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {3357#false} assume !(~x~0 % 4294967296 > 0); {3357#false} is VALID [2022-04-08 10:06:38,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {3357#false} assume !(~z~0 % 4294967296 > 0); {3357#false} is VALID [2022-04-08 10:06:38,436 INFO L272 TraceCheckUtils]: 17: Hoare triple {3357#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3357#false} is VALID [2022-04-08 10:06:38,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {3357#false} ~cond := #in~cond; {3357#false} is VALID [2022-04-08 10:06:38,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {3357#false} assume 0 == ~cond; {3357#false} is VALID [2022-04-08 10:06:38,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {3357#false} assume !false; {3357#false} is VALID [2022-04-08 10:06:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:06:38,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:38,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586640783] [2022-04-08 10:06:38,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586640783] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:38,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165332139] [2022-04-08 10:06:38,437 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:06:38,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:38,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:38,438 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-08 10:06:38,464 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-08 10:06:38,482 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:06:38,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:38,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 10:06:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:38,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:38,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {3356#true} call ULTIMATE.init(); {3356#true} is VALID [2022-04-08 10:06:38,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {3356#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3356#true} is VALID [2022-04-08 10:06:38,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {3356#true} assume true; {3356#true} is VALID [2022-04-08 10:06:38,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3356#true} {3356#true} #83#return; {3356#true} is VALID [2022-04-08 10:06:38,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {3356#true} call #t~ret15 := main(); {3356#true} is VALID [2022-04-08 10:06:38,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {3356#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3361#(= main_~y~0 0)} is VALID [2022-04-08 10:06:38,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {3361#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3362#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:38,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {3362#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3363#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:38,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {3363#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {3363#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:38,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {3363#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {3397#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:38,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {3397#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3401#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:06:38,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {3401#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {3401#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:06:38,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {3401#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3364#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:38,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {3364#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {3364#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:38,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {3364#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3364#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:38,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {3364#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {3364#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:38,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {3364#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3357#false} is VALID [2022-04-08 10:06:38,747 INFO L272 TraceCheckUtils]: 17: Hoare triple {3357#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3357#false} is VALID [2022-04-08 10:06:38,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {3357#false} ~cond := #in~cond; {3357#false} is VALID [2022-04-08 10:06:38,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {3357#false} assume 0 == ~cond; {3357#false} is VALID [2022-04-08 10:06:38,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {3357#false} assume !false; {3357#false} is VALID [2022-04-08 10:06:38,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:06:38,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:38,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {3357#false} assume !false; {3357#false} is VALID [2022-04-08 10:06:38,879 INFO L290 TraceCheckUtils]: 19: Hoare triple {3357#false} assume 0 == ~cond; {3357#false} is VALID [2022-04-08 10:06:38,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {3357#false} ~cond := #in~cond; {3357#false} is VALID [2022-04-08 10:06:38,879 INFO L272 TraceCheckUtils]: 17: Hoare triple {3357#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3357#false} is VALID [2022-04-08 10:06:38,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {3444#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3357#false} is VALID [2022-04-08 10:06:38,879 INFO L290 TraceCheckUtils]: 15: Hoare triple {3444#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {3444#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:38,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {3444#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3444#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:38,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {3444#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {3444#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:38,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {3457#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3444#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:38,881 INFO L290 TraceCheckUtils]: 11: Hoare triple {3457#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3457#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-08 10:06:38,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {3464#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3457#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-08 10:06:38,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {3356#true} ~z~0 := ~y~0; {3464#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:06:38,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {3356#true} assume !(~x~0 % 4294967296 > 0); {3356#true} is VALID [2022-04-08 10:06:38,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {3356#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3356#true} is VALID [2022-04-08 10:06:38,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {3356#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3356#true} is VALID [2022-04-08 10:06:38,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {3356#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3356#true} is VALID [2022-04-08 10:06:38,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {3356#true} call #t~ret15 := main(); {3356#true} is VALID [2022-04-08 10:06:38,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3356#true} {3356#true} #83#return; {3356#true} is VALID [2022-04-08 10:06:38,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {3356#true} assume true; {3356#true} is VALID [2022-04-08 10:06:38,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {3356#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3356#true} is VALID [2022-04-08 10:06:38,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {3356#true} call ULTIMATE.init(); {3356#true} is VALID [2022-04-08 10:06:38,883 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 10:06:38,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165332139] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:38,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:38,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 13 [2022-04-08 10:06:38,883 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:38,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1498338457] [2022-04-08 10:06:38,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1498338457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:38,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:38,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:06:38,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059031669] [2022-04-08 10:06:38,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:38,884 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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-08 10:06:38,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:38,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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-08 10:06:38,897 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-08 10:06:38,898 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:06:38,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:38,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:06:38,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-04-08 10:06:38,898 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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-08 10:06:39,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:39,405 INFO L93 Difference]: Finished difference Result 71 states and 96 transitions. [2022-04-08 10:06:39,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:06:39,405 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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-08 10:06:39,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:39,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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-08 10:06:39,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2022-04-08 10:06:39,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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-08 10:06:39,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2022-04-08 10:06:39,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 65 transitions. [2022-04-08 10:06:39,470 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-08 10:06:39,472 INFO L225 Difference]: With dead ends: 71 [2022-04-08 10:06:39,472 INFO L226 Difference]: Without dead ends: 58 [2022-04-08 10:06:39,472 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:06:39,472 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 37 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:39,473 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 49 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:06:39,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-08 10:06:39,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2022-04-08 10:06:39,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:39,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 45 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:39,563 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 45 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:39,563 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 45 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:39,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:39,565 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-04-08 10:06:39,565 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2022-04-08 10:06:39,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:39,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:39,565 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-08 10:06:39,565 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-08 10:06:39,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:39,566 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-04-08 10:06:39,566 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2022-04-08 10:06:39,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:39,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:39,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:39,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:39,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2022-04-08 10:06:39,568 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 21 [2022-04-08 10:06:39,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:39,568 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-04-08 10:06:39,568 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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-08 10:06:39,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 56 transitions. [2022-04-08 10:06:39,639 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-08 10:06:39,639 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-08 10:06:39,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 10:06:39,639 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:39,639 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:39,656 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-08 10:06:39,843 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:39,843 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:39,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:39,844 INFO L85 PathProgramCache]: Analyzing trace with hash -439116189, now seen corresponding path program 3 times [2022-04-08 10:06:39,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:39,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1885388337] [2022-04-08 10:06:39,847 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:39,847 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:39,847 INFO L85 PathProgramCache]: Analyzing trace with hash -439116189, now seen corresponding path program 4 times [2022-04-08 10:06:39,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:39,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661948624] [2022-04-08 10:06:39,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:39,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:39,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:39,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {3864#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3857#true} is VALID [2022-04-08 10:06:39,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {3857#true} assume true; {3857#true} is VALID [2022-04-08 10:06:39,919 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3857#true} {3857#true} #83#return; {3857#true} is VALID [2022-04-08 10:06:39,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {3857#true} call ULTIMATE.init(); {3864#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:39,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {3864#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3857#true} is VALID [2022-04-08 10:06:39,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {3857#true} assume true; {3857#true} is VALID [2022-04-08 10:06:39,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3857#true} {3857#true} #83#return; {3857#true} is VALID [2022-04-08 10:06:39,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {3857#true} call #t~ret15 := main(); {3857#true} is VALID [2022-04-08 10:06:39,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {3857#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3857#true} is VALID [2022-04-08 10:06:39,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {3857#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3857#true} is VALID [2022-04-08 10:06:39,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {3857#true} assume !(~x~0 % 4294967296 > 0); {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:06:39,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:06:39,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:06:39,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:06:39,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:06:39,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:06:39,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:06:39,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3858#false} is VALID [2022-04-08 10:06:39,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {3858#false} assume !(~x~0 % 4294967296 > 0); {3858#false} is VALID [2022-04-08 10:06:39,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {3858#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3858#false} is VALID [2022-04-08 10:06:39,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {3858#false} assume !(~z~0 % 4294967296 > 0); {3858#false} is VALID [2022-04-08 10:06:39,925 INFO L272 TraceCheckUtils]: 18: Hoare triple {3858#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3858#false} is VALID [2022-04-08 10:06:39,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {3858#false} ~cond := #in~cond; {3858#false} is VALID [2022-04-08 10:06:39,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {3858#false} assume 0 == ~cond; {3858#false} is VALID [2022-04-08 10:06:39,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {3858#false} assume !false; {3858#false} is VALID [2022-04-08 10:06:39,926 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:06:39,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:39,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661948624] [2022-04-08 10:06:39,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661948624] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:39,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916781651] [2022-04-08 10:06:39,926 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:06:39,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:39,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:39,928 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-08 10:06:39,929 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-08 10:06:39,973 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:06:39,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:39,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 10:06:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:39,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:40,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {3857#true} call ULTIMATE.init(); {3857#true} is VALID [2022-04-08 10:06:40,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {3857#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3857#true} is VALID [2022-04-08 10:06:40,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {3857#true} assume true; {3857#true} is VALID [2022-04-08 10:06:40,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3857#true} {3857#true} #83#return; {3857#true} is VALID [2022-04-08 10:06:40,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {3857#true} call #t~ret15 := main(); {3857#true} is VALID [2022-04-08 10:06:40,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {3857#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3857#true} is VALID [2022-04-08 10:06:40,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {3857#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3857#true} is VALID [2022-04-08 10:06:40,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {3857#true} assume !(~x~0 % 4294967296 > 0); {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:06:40,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:06:40,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:06:40,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:06:40,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:06:40,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:06:40,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:06:40,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3858#false} is VALID [2022-04-08 10:06:40,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {3858#false} assume !(~x~0 % 4294967296 > 0); {3858#false} is VALID [2022-04-08 10:06:40,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {3858#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3858#false} is VALID [2022-04-08 10:06:40,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {3858#false} assume !(~z~0 % 4294967296 > 0); {3858#false} is VALID [2022-04-08 10:06:40,249 INFO L272 TraceCheckUtils]: 18: Hoare triple {3858#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3858#false} is VALID [2022-04-08 10:06:40,249 INFO L290 TraceCheckUtils]: 19: Hoare triple {3858#false} ~cond := #in~cond; {3858#false} is VALID [2022-04-08 10:06:40,249 INFO L290 TraceCheckUtils]: 20: Hoare triple {3858#false} assume 0 == ~cond; {3858#false} is VALID [2022-04-08 10:06:40,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {3858#false} assume !false; {3858#false} is VALID [2022-04-08 10:06:40,249 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:06:40,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:40,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {3858#false} assume !false; {3858#false} is VALID [2022-04-08 10:06:40,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {3858#false} assume 0 == ~cond; {3858#false} is VALID [2022-04-08 10:06:40,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {3858#false} ~cond := #in~cond; {3858#false} is VALID [2022-04-08 10:06:40,335 INFO L272 TraceCheckUtils]: 18: Hoare triple {3858#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3858#false} is VALID [2022-04-08 10:06:40,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {3858#false} assume !(~z~0 % 4294967296 > 0); {3858#false} is VALID [2022-04-08 10:06:40,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {3858#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3858#false} is VALID [2022-04-08 10:06:40,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {3858#false} assume !(~x~0 % 4294967296 > 0); {3858#false} is VALID [2022-04-08 10:06:40,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3858#false} is VALID [2022-04-08 10:06:40,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:06:40,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:06:40,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:06:40,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:06:40,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:06:40,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:06:40,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {3857#true} assume !(~x~0 % 4294967296 > 0); {3862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:06:40,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {3857#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3857#true} is VALID [2022-04-08 10:06:40,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {3857#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3857#true} is VALID [2022-04-08 10:06:40,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {3857#true} call #t~ret15 := main(); {3857#true} is VALID [2022-04-08 10:06:40,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3857#true} {3857#true} #83#return; {3857#true} is VALID [2022-04-08 10:06:40,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {3857#true} assume true; {3857#true} is VALID [2022-04-08 10:06:40,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {3857#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3857#true} is VALID [2022-04-08 10:06:40,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {3857#true} call ULTIMATE.init(); {3857#true} is VALID [2022-04-08 10:06:40,341 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:06:40,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916781651] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:40,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:40,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-08 10:06:40,341 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:40,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1885388337] [2022-04-08 10:06:40,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1885388337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:40,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:40,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:06:40,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354524671] [2022-04-08 10:06:40,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:40,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 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-08 10:06:40,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:40,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:40,384 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-08 10:06:40,384 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:06:40,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:40,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:06:40,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:06:40,385 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:40,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:40,566 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2022-04-08 10:06:40,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:06:40,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 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-08 10:06:40,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:40,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:40,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-08 10:06:40,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:40,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-08 10:06:40,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2022-04-08 10:06:40,594 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-08 10:06:40,595 INFO L225 Difference]: With dead ends: 53 [2022-04-08 10:06:40,595 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 10:06:40,595 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-08 10:06:40,596 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:40,596 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 31 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:06:40,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 10:06:40,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 10:06:40,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:40,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:40,655 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:40,655 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:40,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:40,656 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-04-08 10:06:40,656 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-08 10:06:40,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:40,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:40,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-08 10:06:40,656 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-08 10:06:40,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:40,657 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-04-08 10:06:40,657 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-08 10:06:40,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:40,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:40,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:40,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:40,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:40,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-08 10:06:40,658 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 22 [2022-04-08 10:06:40,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:40,658 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-08 10:06:40,659 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:40,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 45 transitions. [2022-04-08 10:06:40,720 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-08 10:06:40,720 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-08 10:06:40,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 10:06:40,720 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:40,720 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:40,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-08 10:06:40,923 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 10:06:40,924 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:40,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:40,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1412676430, now seen corresponding path program 5 times [2022-04-08 10:06:40,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:40,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1853447667] [2022-04-08 10:06:40,926 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:40,926 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:40,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1412676430, now seen corresponding path program 6 times [2022-04-08 10:06:40,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:40,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440272848] [2022-04-08 10:06:40,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:40,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:41,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:41,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {4261#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4250#true} is VALID [2022-04-08 10:06:41,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {4250#true} assume true; {4250#true} is VALID [2022-04-08 10:06:41,074 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4250#true} {4250#true} #83#return; {4250#true} is VALID [2022-04-08 10:06:41,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {4250#true} call ULTIMATE.init(); {4261#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:41,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {4261#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4250#true} is VALID [2022-04-08 10:06:41,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {4250#true} assume true; {4250#true} is VALID [2022-04-08 10:06:41,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4250#true} {4250#true} #83#return; {4250#true} is VALID [2022-04-08 10:06:41,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {4250#true} call #t~ret15 := main(); {4250#true} is VALID [2022-04-08 10:06:41,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {4250#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4255#(= main_~y~0 0)} is VALID [2022-04-08 10:06:41,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {4255#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4256#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:41,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {4256#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4257#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:41,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {4257#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4258#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:41,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {4258#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {4258#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:41,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {4258#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {4259#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:06:41,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {4259#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4260#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:41,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {4260#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4251#false} is VALID [2022-04-08 10:06:41,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {4251#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4251#false} is VALID [2022-04-08 10:06:41,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {4251#false} assume !(~y~0 % 4294967296 > 0); {4251#false} is VALID [2022-04-08 10:06:41,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {4251#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4251#false} is VALID [2022-04-08 10:06:41,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {4251#false} assume !(~x~0 % 4294967296 > 0); {4251#false} is VALID [2022-04-08 10:06:41,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {4251#false} assume !(~z~0 % 4294967296 > 0); {4251#false} is VALID [2022-04-08 10:06:41,080 INFO L272 TraceCheckUtils]: 18: Hoare triple {4251#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4251#false} is VALID [2022-04-08 10:06:41,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {4251#false} ~cond := #in~cond; {4251#false} is VALID [2022-04-08 10:06:41,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {4251#false} assume 0 == ~cond; {4251#false} is VALID [2022-04-08 10:06:41,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {4251#false} assume !false; {4251#false} is VALID [2022-04-08 10:06:41,080 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:06:41,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:41,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440272848] [2022-04-08 10:06:41,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440272848] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:41,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154362446] [2022-04-08 10:06:41,081 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:06:41,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:41,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:41,082 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-08 10:06:41,083 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-08 10:06:41,121 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:06:41,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:41,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-08 10:06:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:41,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:41,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {4250#true} call ULTIMATE.init(); {4250#true} is VALID [2022-04-08 10:06:41,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {4250#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4250#true} is VALID [2022-04-08 10:06:41,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {4250#true} assume true; {4250#true} is VALID [2022-04-08 10:06:41,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4250#true} {4250#true} #83#return; {4250#true} is VALID [2022-04-08 10:06:41,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {4250#true} call #t~ret15 := main(); {4250#true} is VALID [2022-04-08 10:06:41,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {4250#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4255#(= main_~y~0 0)} is VALID [2022-04-08 10:06:41,299 INFO L290 TraceCheckUtils]: 6: Hoare triple {4255#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4256#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:41,300 INFO L290 TraceCheckUtils]: 7: Hoare triple {4256#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4257#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:41,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {4257#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4258#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:41,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {4258#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {4258#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:41,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {4258#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {4295#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:41,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {4295#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4299#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:06:41,302 INFO L290 TraceCheckUtils]: 12: Hoare triple {4299#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {4299#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:06:41,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {4299#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4306#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-08 10:06:41,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {4306#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~z~0 (+ main_~y~0 1)))} assume !(~y~0 % 4294967296 > 0); {4306#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-08 10:06:41,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {4306#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~z~0 (+ main_~y~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4295#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:41,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {4295#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {4295#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:41,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {4295#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {4251#false} is VALID [2022-04-08 10:06:41,305 INFO L272 TraceCheckUtils]: 18: Hoare triple {4251#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4251#false} is VALID [2022-04-08 10:06:41,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {4251#false} ~cond := #in~cond; {4251#false} is VALID [2022-04-08 10:06:41,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {4251#false} assume 0 == ~cond; {4251#false} is VALID [2022-04-08 10:06:41,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {4251#false} assume !false; {4251#false} is VALID [2022-04-08 10:06:41,305 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:41,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:41,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {4251#false} assume !false; {4251#false} is VALID [2022-04-08 10:06:41,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {4334#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4251#false} is VALID [2022-04-08 10:06:41,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {4338#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4334#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:06:41,504 INFO L272 TraceCheckUtils]: 18: Hoare triple {4342#(= (mod main_~y~0 4294967296) 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4338#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:06:41,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {4346#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4342#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-08 10:06:41,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {4346#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {4346#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:06:41,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {4353#(or (< 0 (mod main_~z~0 4294967296)) (= (mod (+ main_~y~0 1) 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4346#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:06:41,506 INFO L290 TraceCheckUtils]: 14: Hoare triple {4353#(or (< 0 (mod main_~z~0 4294967296)) (= (mod (+ main_~y~0 1) 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {4353#(or (< 0 (mod main_~z~0 4294967296)) (= (mod (+ main_~y~0 1) 4294967296) 0))} is VALID [2022-04-08 10:06:41,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {4360#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (mod main_~y~0 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4353#(or (< 0 (mod main_~z~0 4294967296)) (= (mod (+ main_~y~0 1) 4294967296) 0))} is VALID [2022-04-08 10:06:41,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {4360#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (mod main_~y~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {4360#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-08 10:06:41,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {4346#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4360#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-08 10:06:41,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {4250#true} ~z~0 := ~y~0; {4346#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:06:41,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {4250#true} assume !(~x~0 % 4294967296 > 0); {4250#true} is VALID [2022-04-08 10:06:41,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {4250#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4250#true} is VALID [2022-04-08 10:06:41,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {4250#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4250#true} is VALID [2022-04-08 10:06:41,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {4250#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4250#true} is VALID [2022-04-08 10:06:41,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {4250#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4250#true} is VALID [2022-04-08 10:06:41,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {4250#true} call #t~ret15 := main(); {4250#true} is VALID [2022-04-08 10:06:41,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4250#true} {4250#true} #83#return; {4250#true} is VALID [2022-04-08 10:06:41,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {4250#true} assume true; {4250#true} is VALID [2022-04-08 10:06:41,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {4250#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4250#true} is VALID [2022-04-08 10:06:41,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {4250#true} call ULTIMATE.init(); {4250#true} is VALID [2022-04-08 10:06:41,509 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:06:41,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154362446] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:41,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:41,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-04-08 10:06:41,510 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:41,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1853447667] [2022-04-08 10:06:41,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1853447667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:41,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:41,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:06:41,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915132616] [2022-04-08 10:06:41,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:41,515 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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-08 10:06:41,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:41,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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-08 10:06:41,531 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-08 10:06:41,531 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:06:41,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:41,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:06:41,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:06:41,532 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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-08 10:06:42,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:42,132 INFO L93 Difference]: Finished difference Result 72 states and 99 transitions. [2022-04-08 10:06:42,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 10:06:42,132 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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-08 10:06:42,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:42,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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-08 10:06:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2022-04-08 10:06:42,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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-08 10:06:42,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2022-04-08 10:06:42,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 74 transitions. [2022-04-08 10:06:42,207 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-08 10:06:42,208 INFO L225 Difference]: With dead ends: 72 [2022-04-08 10:06:42,208 INFO L226 Difference]: Without dead ends: 58 [2022-04-08 10:06:42,209 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-04-08 10:06:42,209 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 41 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:42,209 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 54 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:06:42,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-08 10:06:42,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2022-04-08 10:06:42,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:42,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 42 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:42,302 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 42 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:42,302 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 42 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:42,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:42,303 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2022-04-08 10:06:42,303 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2022-04-08 10:06:42,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:42,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:42,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-08 10:06:42,304 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-08 10:06:42,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:42,306 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2022-04-08 10:06:42,306 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2022-04-08 10:06:42,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:42,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:42,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:42,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:42,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:42,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2022-04-08 10:06:42,307 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 22 [2022-04-08 10:06:42,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:42,308 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2022-04-08 10:06:42,308 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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-08 10:06:42,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 53 transitions. [2022-04-08 10:06:42,377 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-08 10:06:42,378 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2022-04-08 10:06:42,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 10:06:42,378 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:42,378 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:42,396 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-08 10:06:42,583 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-08 10:06:42,584 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:42,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:42,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1409588607, now seen corresponding path program 3 times [2022-04-08 10:06:42,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:42,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [153087966] [2022-04-08 10:06:42,587 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:42,587 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:42,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1409588607, now seen corresponding path program 4 times [2022-04-08 10:06:42,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:42,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251675274] [2022-04-08 10:06:42,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:42,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:42,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:42,707 INFO L290 TraceCheckUtils]: 0: Hoare triple {4772#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4760#true} is VALID [2022-04-08 10:06:42,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {4760#true} assume true; {4760#true} is VALID [2022-04-08 10:06:42,707 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4760#true} {4760#true} #83#return; {4760#true} is VALID [2022-04-08 10:06:42,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {4760#true} call ULTIMATE.init(); {4772#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:42,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {4772#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4760#true} is VALID [2022-04-08 10:06:42,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {4760#true} assume true; {4760#true} is VALID [2022-04-08 10:06:42,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4760#true} {4760#true} #83#return; {4760#true} is VALID [2022-04-08 10:06:42,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {4760#true} call #t~ret15 := main(); {4760#true} is VALID [2022-04-08 10:06:42,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {4760#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4765#(= main_~y~0 0)} is VALID [2022-04-08 10:06:42,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {4765#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4766#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:42,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {4766#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4767#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:42,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {4767#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {4767#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:42,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {4767#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {4768#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:42,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {4768#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4769#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:06:42,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {4769#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4770#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:06:42,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {4770#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4770#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:06:42,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {4770#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4769#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:06:42,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {4769#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4768#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:42,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {4768#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {4768#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:42,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {4768#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {4768#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:42,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {4768#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4771#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:06:42,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {4771#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4761#false} is VALID [2022-04-08 10:06:42,716 INFO L272 TraceCheckUtils]: 19: Hoare triple {4761#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4761#false} is VALID [2022-04-08 10:06:42,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {4761#false} ~cond := #in~cond; {4761#false} is VALID [2022-04-08 10:06:42,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {4761#false} assume 0 == ~cond; {4761#false} is VALID [2022-04-08 10:06:42,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {4761#false} assume !false; {4761#false} is VALID [2022-04-08 10:06:42,717 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-08 10:06:42,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:42,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251675274] [2022-04-08 10:06:42,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251675274] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:42,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512502014] [2022-04-08 10:06:42,717 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:06:42,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:42,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:42,727 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-08 10:06:42,729 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-08 10:06:42,774 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:06:42,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:42,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 10:06:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:42,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:42,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {4760#true} call ULTIMATE.init(); {4760#true} is VALID [2022-04-08 10:06:42,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {4760#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4760#true} is VALID [2022-04-08 10:06:42,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {4760#true} assume true; {4760#true} is VALID [2022-04-08 10:06:42,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4760#true} {4760#true} #83#return; {4760#true} is VALID [2022-04-08 10:06:42,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {4760#true} call #t~ret15 := main(); {4760#true} is VALID [2022-04-08 10:06:42,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {4760#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4760#true} is VALID [2022-04-08 10:06:42,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {4760#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4794#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:06:42,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {4794#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4798#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:06:42,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {4798#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {4798#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:06:42,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {4798#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {4798#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:06:42,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {4798#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4794#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:06:42,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {4794#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4811#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:42,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {4811#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4811#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:42,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {4811#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4811#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:42,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {4811#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4811#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:42,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {4811#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {4811#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:42,903 INFO L290 TraceCheckUtils]: 16: Hoare triple {4811#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {4761#false} is VALID [2022-04-08 10:06:42,903 INFO L290 TraceCheckUtils]: 17: Hoare triple {4761#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4761#false} is VALID [2022-04-08 10:06:42,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {4761#false} assume !(~z~0 % 4294967296 > 0); {4761#false} is VALID [2022-04-08 10:06:42,903 INFO L272 TraceCheckUtils]: 19: Hoare triple {4761#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4761#false} is VALID [2022-04-08 10:06:42,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {4761#false} ~cond := #in~cond; {4761#false} is VALID [2022-04-08 10:06:42,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {4761#false} assume 0 == ~cond; {4761#false} is VALID [2022-04-08 10:06:42,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {4761#false} assume !false; {4761#false} is VALID [2022-04-08 10:06:42,903 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 10:06:42,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:42,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {4761#false} assume !false; {4761#false} is VALID [2022-04-08 10:06:42,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {4761#false} assume 0 == ~cond; {4761#false} is VALID [2022-04-08 10:06:42,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {4761#false} ~cond := #in~cond; {4761#false} is VALID [2022-04-08 10:06:42,989 INFO L272 TraceCheckUtils]: 19: Hoare triple {4761#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4761#false} is VALID [2022-04-08 10:06:42,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {4761#false} assume !(~z~0 % 4294967296 > 0); {4761#false} is VALID [2022-04-08 10:06:42,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {4761#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4761#false} is VALID [2022-04-08 10:06:42,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {4811#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {4761#false} is VALID [2022-04-08 10:06:42,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {4811#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {4811#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:42,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {4811#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4811#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:42,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {4811#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4811#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:42,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {4811#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4811#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:42,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {4794#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4811#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:42,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {4798#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4794#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:06:42,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {4798#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {4798#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:06:42,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {4798#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {4798#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:06:42,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {4794#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4798#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:06:42,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {4760#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4794#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:06:42,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {4760#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4760#true} is VALID [2022-04-08 10:06:42,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {4760#true} call #t~ret15 := main(); {4760#true} is VALID [2022-04-08 10:06:42,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4760#true} {4760#true} #83#return; {4760#true} is VALID [2022-04-08 10:06:42,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {4760#true} assume true; {4760#true} is VALID [2022-04-08 10:06:42,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {4760#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4760#true} is VALID [2022-04-08 10:06:42,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {4760#true} call ULTIMATE.init(); {4760#true} is VALID [2022-04-08 10:06:42,996 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 10:06:42,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512502014] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:42,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:42,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 13 [2022-04-08 10:06:42,996 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:42,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [153087966] [2022-04-08 10:06:42,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [153087966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:42,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:42,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 10:06:42,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577569599] [2022-04-08 10:06:42,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:42,997 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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-08 10:06:42,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:42,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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-08 10:06:43,018 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-08 10:06:43,018 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 10:06:43,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:43,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 10:06:43,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-04-08 10:06:43,019 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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-08 10:06:43,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:43,733 INFO L93 Difference]: Finished difference Result 73 states and 99 transitions. [2022-04-08 10:06:43,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:06:43,733 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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-08 10:06:43,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:43,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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-08 10:06:43,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 72 transitions. [2022-04-08 10:06:43,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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-08 10:06:43,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 72 transitions. [2022-04-08 10:06:43,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 72 transitions. [2022-04-08 10:06:43,813 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-08 10:06:43,814 INFO L225 Difference]: With dead ends: 73 [2022-04-08 10:06:43,814 INFO L226 Difference]: Without dead ends: 60 [2022-04-08 10:06:43,815 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2022-04-08 10:06:43,815 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:43,815 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 44 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:06:43,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-08 10:06:43,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2022-04-08 10:06:43,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:43,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 49 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:43,903 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 49 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:43,904 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 49 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:43,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:43,905 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-08 10:06:43,905 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-08 10:06:43,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:43,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:43,905 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-08 10:06:43,905 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-08 10:06:43,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:43,907 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-08 10:06:43,907 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-08 10:06:43,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:43,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:43,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:43,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:43,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:43,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2022-04-08 10:06:43,908 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 23 [2022-04-08 10:06:43,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:43,908 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2022-04-08 10:06:43,908 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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-08 10:06:43,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 60 transitions. [2022-04-08 10:06:43,984 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-08 10:06:43,984 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2022-04-08 10:06:43,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 10:06:43,984 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:43,984 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:44,001 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-08 10:06:44,187 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,SelfDestructingSolverStorable14 [2022-04-08 10:06:44,188 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:44,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:44,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1359283201, now seen corresponding path program 7 times [2022-04-08 10:06:44,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:44,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1205954237] [2022-04-08 10:06:44,190 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:44,190 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:44,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1359283201, now seen corresponding path program 8 times [2022-04-08 10:06:44,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:44,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941785606] [2022-04-08 10:06:44,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:44,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:44,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:44,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {5317#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5305#true} is VALID [2022-04-08 10:06:44,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {5305#true} assume true; {5305#true} is VALID [2022-04-08 10:06:44,307 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5305#true} {5305#true} #83#return; {5305#true} is VALID [2022-04-08 10:06:44,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {5305#true} call ULTIMATE.init(); {5317#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:44,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {5317#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5305#true} is VALID [2022-04-08 10:06:44,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {5305#true} assume true; {5305#true} is VALID [2022-04-08 10:06:44,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5305#true} {5305#true} #83#return; {5305#true} is VALID [2022-04-08 10:06:44,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {5305#true} call #t~ret15 := main(); {5305#true} is VALID [2022-04-08 10:06:44,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {5305#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5310#(= main_~y~0 0)} is VALID [2022-04-08 10:06:44,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {5310#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5311#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:44,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {5311#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5312#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:44,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {5312#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5313#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:44,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {5313#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5314#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:44,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {5314#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5314#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:44,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {5314#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {5315#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:06:44,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {5315#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5316#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:06:44,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {5316#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {5306#false} is VALID [2022-04-08 10:06:44,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {5306#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5306#false} is VALID [2022-04-08 10:06:44,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {5306#false} assume !(~y~0 % 4294967296 > 0); {5306#false} is VALID [2022-04-08 10:06:44,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {5306#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5306#false} is VALID [2022-04-08 10:06:44,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {5306#false} assume !(~x~0 % 4294967296 > 0); {5306#false} is VALID [2022-04-08 10:06:44,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {5306#false} assume !(~z~0 % 4294967296 > 0); {5306#false} is VALID [2022-04-08 10:06:44,313 INFO L272 TraceCheckUtils]: 19: Hoare triple {5306#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5306#false} is VALID [2022-04-08 10:06:44,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {5306#false} ~cond := #in~cond; {5306#false} is VALID [2022-04-08 10:06:44,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {5306#false} assume 0 == ~cond; {5306#false} is VALID [2022-04-08 10:06:44,314 INFO L290 TraceCheckUtils]: 22: Hoare triple {5306#false} assume !false; {5306#false} is VALID [2022-04-08 10:06:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:06:44,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:44,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941785606] [2022-04-08 10:06:44,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941785606] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:44,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162188567] [2022-04-08 10:06:44,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:06:44,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:44,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:44,315 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-08 10:06:44,316 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-08 10:06:44,351 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:06:44,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:44,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 10:06:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:44,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:44,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {5305#true} call ULTIMATE.init(); {5305#true} is VALID [2022-04-08 10:06:44,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {5305#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5305#true} is VALID [2022-04-08 10:06:44,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {5305#true} assume true; {5305#true} is VALID [2022-04-08 10:06:44,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5305#true} {5305#true} #83#return; {5305#true} is VALID [2022-04-08 10:06:44,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {5305#true} call #t~ret15 := main(); {5305#true} is VALID [2022-04-08 10:06:44,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {5305#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5310#(= main_~y~0 0)} is VALID [2022-04-08 10:06:44,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {5310#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5311#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:44,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {5311#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5312#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:44,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {5312#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5313#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:44,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {5313#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5314#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:44,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {5314#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5314#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:44,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {5314#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {5315#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:06:44,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {5315#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5357#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:06:44,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {5357#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5306#false} is VALID [2022-04-08 10:06:44,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {5306#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5306#false} is VALID [2022-04-08 10:06:44,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {5306#false} assume !(~y~0 % 4294967296 > 0); {5306#false} is VALID [2022-04-08 10:06:44,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {5306#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5306#false} is VALID [2022-04-08 10:06:44,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {5306#false} assume !(~x~0 % 4294967296 > 0); {5306#false} is VALID [2022-04-08 10:06:44,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {5306#false} assume !(~z~0 % 4294967296 > 0); {5306#false} is VALID [2022-04-08 10:06:44,590 INFO L272 TraceCheckUtils]: 19: Hoare triple {5306#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5306#false} is VALID [2022-04-08 10:06:44,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {5306#false} ~cond := #in~cond; {5306#false} is VALID [2022-04-08 10:06:44,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {5306#false} assume 0 == ~cond; {5306#false} is VALID [2022-04-08 10:06:44,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {5306#false} assume !false; {5306#false} is VALID [2022-04-08 10:06:44,590 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:06:44,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:44,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {5306#false} assume !false; {5306#false} is VALID [2022-04-08 10:06:44,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {5306#false} assume 0 == ~cond; {5306#false} is VALID [2022-04-08 10:06:44,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {5306#false} ~cond := #in~cond; {5306#false} is VALID [2022-04-08 10:06:44,741 INFO L272 TraceCheckUtils]: 19: Hoare triple {5306#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5306#false} is VALID [2022-04-08 10:06:44,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {5306#false} assume !(~z~0 % 4294967296 > 0); {5306#false} is VALID [2022-04-08 10:06:44,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {5306#false} assume !(~x~0 % 4294967296 > 0); {5306#false} is VALID [2022-04-08 10:06:44,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {5306#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5306#false} is VALID [2022-04-08 10:06:44,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {5306#false} assume !(~y~0 % 4294967296 > 0); {5306#false} is VALID [2022-04-08 10:06:44,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {5306#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5306#false} is VALID [2022-04-08 10:06:44,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {5415#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5306#false} is VALID [2022-04-08 10:06:44,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {5419#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5415#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:44,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {5423#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {5419#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:44,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {5423#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {5423#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:44,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {5430#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5423#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:44,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {5434#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5430#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:44,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {5438#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5434#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:44,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {5442#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5438#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:44,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {5305#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5442#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:06:44,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {5305#true} call #t~ret15 := main(); {5305#true} is VALID [2022-04-08 10:06:44,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5305#true} {5305#true} #83#return; {5305#true} is VALID [2022-04-08 10:06:44,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {5305#true} assume true; {5305#true} is VALID [2022-04-08 10:06:44,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {5305#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5305#true} is VALID [2022-04-08 10:06:44,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {5305#true} call ULTIMATE.init(); {5305#true} is VALID [2022-04-08 10:06:44,747 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:06:44,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162188567] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:44,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:44,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-08 10:06:44,747 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:44,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1205954237] [2022-04-08 10:06:44,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1205954237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:44,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:44,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 10:06:44,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711858450] [2022-04-08 10:06:44,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:44,748 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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-08 10:06:44,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:44,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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-08 10:06:44,762 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-08 10:06:44,763 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 10:06:44,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:44,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 10:06:44,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:06:44,763 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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-08 10:06:45,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:45,669 INFO L93 Difference]: Finished difference Result 106 states and 143 transitions. [2022-04-08 10:06:45,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:06:45,669 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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-08 10:06:45,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:45,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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-08 10:06:45,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 86 transitions. [2022-04-08 10:06:45,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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-08 10:06:45,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 86 transitions. [2022-04-08 10:06:45,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 86 transitions. [2022-04-08 10:06:45,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:45,754 INFO L225 Difference]: With dead ends: 106 [2022-04-08 10:06:45,754 INFO L226 Difference]: Without dead ends: 92 [2022-04-08 10:06:45,754 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:06:45,755 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 52 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:45,755 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 65 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:06:45,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-08 10:06:45,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 55. [2022-04-08 10:06:45,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:45,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 55 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:45,889 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 55 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:45,889 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 55 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:45,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:45,891 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2022-04-08 10:06:45,891 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2022-04-08 10:06:45,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:45,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:45,891 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 92 states. [2022-04-08 10:06:45,892 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 92 states. [2022-04-08 10:06:45,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:45,893 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2022-04-08 10:06:45,893 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2022-04-08 10:06:45,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:45,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:45,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:45,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:45,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2022-04-08 10:06:45,895 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 23 [2022-04-08 10:06:45,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:45,895 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2022-04-08 10:06:45,895 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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-08 10:06:45,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 68 transitions. [2022-04-08 10:06:45,997 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-08 10:06:45,997 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2022-04-08 10:06:45,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 10:06:45,998 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:45,998 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:46,023 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-08 10:06:46,198 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,SelfDestructingSolverStorable15 [2022-04-08 10:06:46,198 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:46,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:46,199 INFO L85 PathProgramCache]: Analyzing trace with hash -713078750, now seen corresponding path program 5 times [2022-04-08 10:06:46,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:46,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1379138882] [2022-04-08 10:06:46,202 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:46,202 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:46,202 INFO L85 PathProgramCache]: Analyzing trace with hash -713078750, now seen corresponding path program 6 times [2022-04-08 10:06:46,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:46,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326176823] [2022-04-08 10:06:46,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:46,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:46,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:46,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {5994#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5985#true} is VALID [2022-04-08 10:06:46,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {5985#true} assume true; {5985#true} is VALID [2022-04-08 10:06:46,307 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5985#true} {5985#true} #83#return; {5985#true} is VALID [2022-04-08 10:06:46,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {5985#true} call ULTIMATE.init(); {5994#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:46,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {5994#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5985#true} is VALID [2022-04-08 10:06:46,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {5985#true} assume true; {5985#true} is VALID [2022-04-08 10:06:46,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5985#true} {5985#true} #83#return; {5985#true} is VALID [2022-04-08 10:06:46,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {5985#true} call #t~ret15 := main(); {5985#true} is VALID [2022-04-08 10:06:46,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {5985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5985#true} is VALID [2022-04-08 10:06:46,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {5985#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5990#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:06:46,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {5990#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5991#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:06:46,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {5991#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {5991#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:06:46,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {5991#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {5991#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:06:46,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {5991#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5992#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-08 10:06:46,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {5992#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5993#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:06:46,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {5993#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {5993#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:06:46,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {5993#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5993#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:06:46,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {5993#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5993#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:06:46,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {5993#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {5993#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:06:46,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {5993#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {5986#false} is VALID [2022-04-08 10:06:46,314 INFO L290 TraceCheckUtils]: 17: Hoare triple {5986#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5986#false} is VALID [2022-04-08 10:06:46,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {5986#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5986#false} is VALID [2022-04-08 10:06:46,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {5986#false} assume !(~z~0 % 4294967296 > 0); {5986#false} is VALID [2022-04-08 10:06:46,315 INFO L272 TraceCheckUtils]: 20: Hoare triple {5986#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5986#false} is VALID [2022-04-08 10:06:46,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {5986#false} ~cond := #in~cond; {5986#false} is VALID [2022-04-08 10:06:46,315 INFO L290 TraceCheckUtils]: 22: Hoare triple {5986#false} assume 0 == ~cond; {5986#false} is VALID [2022-04-08 10:06:46,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {5986#false} assume !false; {5986#false} is VALID [2022-04-08 10:06:46,315 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:06:46,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:46,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326176823] [2022-04-08 10:06:46,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326176823] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:46,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854148018] [2022-04-08 10:06:46,316 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:06:46,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:46,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:46,317 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-08 10:06:46,341 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-08 10:06:46,361 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-04-08 10:06:46,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:46,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 10:06:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:46,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:46,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {5985#true} call ULTIMATE.init(); {5985#true} is VALID [2022-04-08 10:06:46,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {5985#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5985#true} is VALID [2022-04-08 10:06:46,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {5985#true} assume true; {5985#true} is VALID [2022-04-08 10:06:46,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5985#true} {5985#true} #83#return; {5985#true} is VALID [2022-04-08 10:06:46,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {5985#true} call #t~ret15 := main(); {5985#true} is VALID [2022-04-08 10:06:46,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {5985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5985#true} is VALID [2022-04-08 10:06:46,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {5985#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5990#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:06:46,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {5990#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6019#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:06:46,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {6019#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !(~x~0 % 4294967296 > 0); {6019#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:06:46,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {6019#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} ~z~0 := ~y~0; {6019#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:06:46,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {6019#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5990#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:06:46,647 INFO L290 TraceCheckUtils]: 11: Hoare triple {5990#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:06:46,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:06:46,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:06:46,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:06:46,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:06:46,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5986#false} is VALID [2022-04-08 10:06:46,649 INFO L290 TraceCheckUtils]: 17: Hoare triple {5986#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5986#false} is VALID [2022-04-08 10:06:46,649 INFO L290 TraceCheckUtils]: 18: Hoare triple {5986#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5986#false} is VALID [2022-04-08 10:06:46,649 INFO L290 TraceCheckUtils]: 19: Hoare triple {5986#false} assume !(~z~0 % 4294967296 > 0); {5986#false} is VALID [2022-04-08 10:06:46,649 INFO L272 TraceCheckUtils]: 20: Hoare triple {5986#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5986#false} is VALID [2022-04-08 10:06:46,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {5986#false} ~cond := #in~cond; {5986#false} is VALID [2022-04-08 10:06:46,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {5986#false} assume 0 == ~cond; {5986#false} is VALID [2022-04-08 10:06:46,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {5986#false} assume !false; {5986#false} is VALID [2022-04-08 10:06:46,649 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:06:46,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:46,874 INFO L290 TraceCheckUtils]: 23: Hoare triple {5986#false} assume !false; {5986#false} is VALID [2022-04-08 10:06:46,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {5986#false} assume 0 == ~cond; {5986#false} is VALID [2022-04-08 10:06:46,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {5986#false} ~cond := #in~cond; {5986#false} is VALID [2022-04-08 10:06:46,874 INFO L272 TraceCheckUtils]: 20: Hoare triple {5986#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5986#false} is VALID [2022-04-08 10:06:46,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {5986#false} assume !(~z~0 % 4294967296 > 0); {5986#false} is VALID [2022-04-08 10:06:46,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {5986#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5986#false} is VALID [2022-04-08 10:06:46,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {5986#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5986#false} is VALID [2022-04-08 10:06:46,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5986#false} is VALID [2022-04-08 10:06:46,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:06:46,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:06:46,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:06:46,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:06:46,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {5990#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6032#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:06:46,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {6019#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5990#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:06:46,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {6019#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} ~z~0 := ~y~0; {6019#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:06:46,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {6019#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !(~x~0 % 4294967296 > 0); {6019#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:06:46,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {5990#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6019#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:06:46,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {5985#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5990#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:06:46,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {5985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5985#true} is VALID [2022-04-08 10:06:46,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {5985#true} call #t~ret15 := main(); {5985#true} is VALID [2022-04-08 10:06:46,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5985#true} {5985#true} #83#return; {5985#true} is VALID [2022-04-08 10:06:46,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {5985#true} assume true; {5985#true} is VALID [2022-04-08 10:06:46,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {5985#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5985#true} is VALID [2022-04-08 10:06:46,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {5985#true} call ULTIMATE.init(); {5985#true} is VALID [2022-04-08 10:06:46,880 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:06:46,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854148018] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:46,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:46,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 9 [2022-04-08 10:06:46,881 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:46,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1379138882] [2022-04-08 10:06:46,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1379138882] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:46,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:46,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 10:06:46,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028587940] [2022-04-08 10:06:46,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:46,881 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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 24 [2022-04-08 10:06:46,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:46,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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-08 10:06:46,903 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-08 10:06:46,903 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 10:06:46,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:46,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 10:06:46,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-08 10:06:46,904 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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-08 10:06:47,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:47,281 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-08 10:06:47,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:06:47,281 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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 24 [2022-04-08 10:06:47,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:47,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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-08 10:06:47,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-08 10:06:47,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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-08 10:06:47,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-08 10:06:47,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-08 10:06:47,340 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-08 10:06:47,341 INFO L225 Difference]: With dead ends: 80 [2022-04-08 10:06:47,341 INFO L226 Difference]: Without dead ends: 70 [2022-04-08 10:06:47,341 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-04-08 10:06:47,342 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 31 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:47,342 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 37 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:06:47,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-08 10:06:47,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-04-08 10:06:47,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:47,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 69 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:47,511 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 69 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:47,511 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 69 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:47,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:47,512 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2022-04-08 10:06:47,512 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2022-04-08 10:06:47,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:47,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:47,513 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-08 10:06:47,513 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-08 10:06:47,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:47,514 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2022-04-08 10:06:47,514 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2022-04-08 10:06:47,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:47,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:47,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:47,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:47,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:47,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 86 transitions. [2022-04-08 10:06:47,516 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 86 transitions. Word has length 24 [2022-04-08 10:06:47,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:47,516 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 86 transitions. [2022-04-08 10:06:47,516 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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-08 10:06:47,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 86 transitions. [2022-04-08 10:06:47,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:47,658 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 86 transitions. [2022-04-08 10:06:47,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 10:06:47,658 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:47,659 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:47,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-08 10:06:47,859 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,SelfDestructingSolverStorable16 [2022-04-08 10:06:47,859 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:47,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:47,859 INFO L85 PathProgramCache]: Analyzing trace with hash 295906898, now seen corresponding path program 9 times [2022-04-08 10:06:47,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:47,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [461216274] [2022-04-08 10:06:47,862 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:47,862 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:47,862 INFO L85 PathProgramCache]: Analyzing trace with hash 295906898, now seen corresponding path program 10 times [2022-04-08 10:06:47,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:47,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605803421] [2022-04-08 10:06:47,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:47,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:47,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:48,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {6599#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6586#true} is VALID [2022-04-08 10:06:48,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {6586#true} assume true; {6586#true} is VALID [2022-04-08 10:06:48,003 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6586#true} {6586#true} #83#return; {6586#true} is VALID [2022-04-08 10:06:48,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {6586#true} call ULTIMATE.init(); {6599#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:48,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {6599#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6586#true} is VALID [2022-04-08 10:06:48,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {6586#true} assume true; {6586#true} is VALID [2022-04-08 10:06:48,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6586#true} {6586#true} #83#return; {6586#true} is VALID [2022-04-08 10:06:48,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {6586#true} call #t~ret15 := main(); {6586#true} is VALID [2022-04-08 10:06:48,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {6586#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6591#(= main_~y~0 0)} is VALID [2022-04-08 10:06:48,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {6591#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6592#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:48,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {6592#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6593#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:48,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {6593#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6594#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:48,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {6594#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6595#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:48,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {6595#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6596#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:48,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {6596#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {6596#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:48,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {6596#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {6597#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:06:48,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {6597#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6598#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:06:48,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {6598#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {6587#false} is VALID [2022-04-08 10:06:48,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {6587#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6587#false} is VALID [2022-04-08 10:06:48,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {6587#false} assume !(~y~0 % 4294967296 > 0); {6587#false} is VALID [2022-04-08 10:06:48,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {6587#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6587#false} is VALID [2022-04-08 10:06:48,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {6587#false} assume !(~x~0 % 4294967296 > 0); {6587#false} is VALID [2022-04-08 10:06:48,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {6587#false} assume !(~z~0 % 4294967296 > 0); {6587#false} is VALID [2022-04-08 10:06:48,010 INFO L272 TraceCheckUtils]: 20: Hoare triple {6587#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {6587#false} is VALID [2022-04-08 10:06:48,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {6587#false} ~cond := #in~cond; {6587#false} is VALID [2022-04-08 10:06:48,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {6587#false} assume 0 == ~cond; {6587#false} is VALID [2022-04-08 10:06:48,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {6587#false} assume !false; {6587#false} is VALID [2022-04-08 10:06:48,010 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:06:48,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:48,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605803421] [2022-04-08 10:06:48,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605803421] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:48,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159339957] [2022-04-08 10:06:48,011 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:06:48,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:48,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:48,015 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-08 10:06:48,026 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-08 10:06:48,054 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:06:48,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:48,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 10:06:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:48,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:48,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {6586#true} call ULTIMATE.init(); {6586#true} is VALID [2022-04-08 10:06:48,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {6586#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6586#true} is VALID [2022-04-08 10:06:48,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {6586#true} assume true; {6586#true} is VALID [2022-04-08 10:06:48,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6586#true} {6586#true} #83#return; {6586#true} is VALID [2022-04-08 10:06:48,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {6586#true} call #t~ret15 := main(); {6586#true} is VALID [2022-04-08 10:06:48,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {6586#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6591#(= main_~y~0 0)} is VALID [2022-04-08 10:06:48,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {6591#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6592#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:48,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {6592#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6593#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:48,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {6593#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6594#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:48,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {6594#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6595#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:48,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {6595#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6596#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:48,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {6596#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {6596#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:48,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {6596#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {6597#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:06:48,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {6597#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6642#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:06:48,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {6642#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {6587#false} is VALID [2022-04-08 10:06:48,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {6587#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6587#false} is VALID [2022-04-08 10:06:48,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {6587#false} assume !(~y~0 % 4294967296 > 0); {6587#false} is VALID [2022-04-08 10:06:48,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {6587#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6587#false} is VALID [2022-04-08 10:06:48,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {6587#false} assume !(~x~0 % 4294967296 > 0); {6587#false} is VALID [2022-04-08 10:06:48,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {6587#false} assume !(~z~0 % 4294967296 > 0); {6587#false} is VALID [2022-04-08 10:06:48,301 INFO L272 TraceCheckUtils]: 20: Hoare triple {6587#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {6587#false} is VALID [2022-04-08 10:06:48,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {6587#false} ~cond := #in~cond; {6587#false} is VALID [2022-04-08 10:06:48,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {6587#false} assume 0 == ~cond; {6587#false} is VALID [2022-04-08 10:06:48,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {6587#false} assume !false; {6587#false} is VALID [2022-04-08 10:06:48,301 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:06:48,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:48,496 INFO L290 TraceCheckUtils]: 23: Hoare triple {6587#false} assume !false; {6587#false} is VALID [2022-04-08 10:06:48,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {6587#false} assume 0 == ~cond; {6587#false} is VALID [2022-04-08 10:06:48,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {6587#false} ~cond := #in~cond; {6587#false} is VALID [2022-04-08 10:06:48,496 INFO L272 TraceCheckUtils]: 20: Hoare triple {6587#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {6587#false} is VALID [2022-04-08 10:06:48,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {6587#false} assume !(~z~0 % 4294967296 > 0); {6587#false} is VALID [2022-04-08 10:06:48,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {6587#false} assume !(~x~0 % 4294967296 > 0); {6587#false} is VALID [2022-04-08 10:06:48,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {6587#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6587#false} is VALID [2022-04-08 10:06:48,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {6587#false} assume !(~y~0 % 4294967296 > 0); {6587#false} is VALID [2022-04-08 10:06:48,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {6587#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6587#false} is VALID [2022-04-08 10:06:48,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {6700#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6587#false} is VALID [2022-04-08 10:06:48,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {6704#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6700#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:48,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {6708#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {6704#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:48,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {6708#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {6708#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:48,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {6715#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6708#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:48,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {6719#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6715#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:48,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {6723#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6719#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:48,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {6727#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6723#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:48,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {6731#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6727#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:06:48,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {6586#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6731#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:06:48,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {6586#true} call #t~ret15 := main(); {6586#true} is VALID [2022-04-08 10:06:48,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6586#true} {6586#true} #83#return; {6586#true} is VALID [2022-04-08 10:06:48,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {6586#true} assume true; {6586#true} is VALID [2022-04-08 10:06:48,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {6586#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6586#true} is VALID [2022-04-08 10:06:48,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {6586#true} call ULTIMATE.init(); {6586#true} is VALID [2022-04-08 10:06:48,502 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:06:48,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159339957] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:48,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:48,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-08 10:06:48,502 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:48,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [461216274] [2022-04-08 10:06:48,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [461216274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:48,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:48,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:06:48,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280853356] [2022-04-08 10:06:48,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:48,503 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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-08 10:06:48,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:48,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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-08 10:06:48,518 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-08 10:06:48,518 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:06:48,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:48,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:06:48,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-04-08 10:06:48,519 INFO L87 Difference]: Start difference. First operand 69 states and 86 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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-08 10:06:49,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:49,772 INFO L93 Difference]: Finished difference Result 141 states and 193 transitions. [2022-04-08 10:06:49,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 10:06:49,772 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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-08 10:06:49,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:49,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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-08 10:06:49,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 98 transitions. [2022-04-08 10:06:49,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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-08 10:06:49,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 98 transitions. [2022-04-08 10:06:49,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 98 transitions. [2022-04-08 10:06:49,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:49,853 INFO L225 Difference]: With dead ends: 141 [2022-04-08 10:06:49,853 INFO L226 Difference]: Without dead ends: 124 [2022-04-08 10:06:49,854 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2022-04-08 10:06:49,854 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 62 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:49,855 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 81 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:06:49,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-08 10:06:50,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 77. [2022-04-08 10:06:50,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:50,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 77 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:50,055 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 77 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:50,055 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 77 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:50,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:50,057 INFO L93 Difference]: Finished difference Result 124 states and 160 transitions. [2022-04-08 10:06:50,057 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 160 transitions. [2022-04-08 10:06:50,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:50,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:50,058 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 124 states. [2022-04-08 10:06:50,058 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 124 states. [2022-04-08 10:06:50,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:50,060 INFO L93 Difference]: Finished difference Result 124 states and 160 transitions. [2022-04-08 10:06:50,060 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 160 transitions. [2022-04-08 10:06:50,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:50,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:50,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:50,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:50,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:50,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 97 transitions. [2022-04-08 10:06:50,061 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 97 transitions. Word has length 24 [2022-04-08 10:06:50,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:50,061 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 97 transitions. [2022-04-08 10:06:50,061 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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-08 10:06:50,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 97 transitions. [2022-04-08 10:06:50,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:50,217 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2022-04-08 10:06:50,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 10:06:50,217 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:50,217 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:50,235 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-08 10:06:50,419 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-08 10:06:50,419 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:50,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:50,420 INFO L85 PathProgramCache]: Analyzing trace with hash 67192415, now seen corresponding path program 11 times [2022-04-08 10:06:50,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:50,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [583918687] [2022-04-08 10:06:50,422 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:50,422 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:50,422 INFO L85 PathProgramCache]: Analyzing trace with hash 67192415, now seen corresponding path program 12 times [2022-04-08 10:06:50,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:50,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314379859] [2022-04-08 10:06:50,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:50,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:50,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:50,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {7468#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7454#true} is VALID [2022-04-08 10:06:50,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {7454#true} assume true; {7454#true} is VALID [2022-04-08 10:06:50,554 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7454#true} {7454#true} #83#return; {7454#true} is VALID [2022-04-08 10:06:50,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {7454#true} call ULTIMATE.init(); {7468#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:50,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {7468#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7454#true} is VALID [2022-04-08 10:06:50,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {7454#true} assume true; {7454#true} is VALID [2022-04-08 10:06:50,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7454#true} {7454#true} #83#return; {7454#true} is VALID [2022-04-08 10:06:50,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {7454#true} call #t~ret15 := main(); {7454#true} is VALID [2022-04-08 10:06:50,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {7454#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7459#(= main_~y~0 0)} is VALID [2022-04-08 10:06:50,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {7459#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7460#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:50,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {7460#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7461#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:50,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {7461#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7462#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:50,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {7462#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7463#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:50,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {7463#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7464#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:50,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {7464#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7465#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:50,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {7465#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {7465#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:50,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {7465#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {7466#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:06:50,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {7466#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7467#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:06:50,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {7467#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {7455#false} is VALID [2022-04-08 10:06:50,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {7455#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7455#false} is VALID [2022-04-08 10:06:50,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {7455#false} assume !(~y~0 % 4294967296 > 0); {7455#false} is VALID [2022-04-08 10:06:50,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {7455#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7455#false} is VALID [2022-04-08 10:06:50,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {7455#false} assume !(~x~0 % 4294967296 > 0); {7455#false} is VALID [2022-04-08 10:06:50,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {7455#false} assume !(~z~0 % 4294967296 > 0); {7455#false} is VALID [2022-04-08 10:06:50,562 INFO L272 TraceCheckUtils]: 21: Hoare triple {7455#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7455#false} is VALID [2022-04-08 10:06:50,562 INFO L290 TraceCheckUtils]: 22: Hoare triple {7455#false} ~cond := #in~cond; {7455#false} is VALID [2022-04-08 10:06:50,562 INFO L290 TraceCheckUtils]: 23: Hoare triple {7455#false} assume 0 == ~cond; {7455#false} is VALID [2022-04-08 10:06:50,562 INFO L290 TraceCheckUtils]: 24: Hoare triple {7455#false} assume !false; {7455#false} is VALID [2022-04-08 10:06:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:06:50,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:50,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314379859] [2022-04-08 10:06:50,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314379859] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:50,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890152972] [2022-04-08 10:06:50,562 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:06:50,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:50,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:50,563 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-08 10:06:50,564 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-08 10:06:50,597 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:06:50,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:50,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 10:06:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:50,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:50,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {7454#true} call ULTIMATE.init(); {7454#true} is VALID [2022-04-08 10:06:50,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {7454#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7454#true} is VALID [2022-04-08 10:06:50,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {7454#true} assume true; {7454#true} is VALID [2022-04-08 10:06:50,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7454#true} {7454#true} #83#return; {7454#true} is VALID [2022-04-08 10:06:50,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {7454#true} call #t~ret15 := main(); {7454#true} is VALID [2022-04-08 10:06:50,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {7454#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7454#true} is VALID [2022-04-08 10:06:50,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {7454#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7454#true} is VALID [2022-04-08 10:06:50,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {7454#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7454#true} is VALID [2022-04-08 10:06:50,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {7454#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7454#true} is VALID [2022-04-08 10:06:50,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {7454#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7454#true} is VALID [2022-04-08 10:06:50,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {7454#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7454#true} is VALID [2022-04-08 10:06:50,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {7454#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7454#true} is VALID [2022-04-08 10:06:50,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {7454#true} assume !(~x~0 % 4294967296 > 0); {7454#true} is VALID [2022-04-08 10:06:50,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {7454#true} ~z~0 := ~y~0; {7511#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:06:50,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {7511#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7515#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:06:50,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {7515#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {7515#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:06:50,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {7515#(= main_~y~0 (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7522#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-08 10:06:50,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {7522#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {7522#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-08 10:06:50,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {7522#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7511#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:06:50,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {7511#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {7511#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:06:50,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {7511#(= main_~z~0 main_~y~0)} assume !(~z~0 % 4294967296 > 0); {7535#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:06:50,889 INFO L272 TraceCheckUtils]: 21: Hoare triple {7535#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7539#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:06:50,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {7539#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7543#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:06:50,890 INFO L290 TraceCheckUtils]: 23: Hoare triple {7543#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7455#false} is VALID [2022-04-08 10:06:50,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {7455#false} assume !false; {7455#false} is VALID [2022-04-08 10:06:50,890 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:06:50,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:51,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {7455#false} assume !false; {7455#false} is VALID [2022-04-08 10:06:51,101 INFO L290 TraceCheckUtils]: 23: Hoare triple {7543#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7455#false} is VALID [2022-04-08 10:06:51,101 INFO L290 TraceCheckUtils]: 22: Hoare triple {7539#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7543#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:06:51,101 INFO L272 TraceCheckUtils]: 21: Hoare triple {7535#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7539#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:06:51,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {7562#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7535#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:06:51,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {7562#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {7562#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:06:51,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {7569#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7562#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:06:51,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {7569#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {7569#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-08 10:06:51,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {7576#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7569#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-08 10:06:51,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {7576#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7576#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-08 10:06:51,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {7562#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7576#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-08 10:06:51,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {7454#true} ~z~0 := ~y~0; {7562#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:06:51,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {7454#true} assume !(~x~0 % 4294967296 > 0); {7454#true} is VALID [2022-04-08 10:06:51,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {7454#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7454#true} is VALID [2022-04-08 10:06:51,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {7454#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7454#true} is VALID [2022-04-08 10:06:51,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {7454#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7454#true} is VALID [2022-04-08 10:06:51,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {7454#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7454#true} is VALID [2022-04-08 10:06:51,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {7454#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7454#true} is VALID [2022-04-08 10:06:51,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {7454#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7454#true} is VALID [2022-04-08 10:06:51,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {7454#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7454#true} is VALID [2022-04-08 10:06:51,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {7454#true} call #t~ret15 := main(); {7454#true} is VALID [2022-04-08 10:06:51,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7454#true} {7454#true} #83#return; {7454#true} is VALID [2022-04-08 10:06:51,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {7454#true} assume true; {7454#true} is VALID [2022-04-08 10:06:51,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {7454#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7454#true} is VALID [2022-04-08 10:06:51,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {7454#true} call ULTIMATE.init(); {7454#true} is VALID [2022-04-08 10:06:51,106 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:06:51,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890152972] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:51,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:51,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 21 [2022-04-08 10:06:51,107 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:51,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [583918687] [2022-04-08 10:06:51,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [583918687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:51,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:51,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:06:51,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779501249] [2022-04-08 10:06:51,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:51,107 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-08 10:06:51,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:51,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-08 10:06:51,124 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-08 10:06:51,124 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:06:51,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:51,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:06:51,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2022-04-08 10:06:51,125 INFO L87 Difference]: Start difference. First operand 77 states and 97 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-08 10:06:52,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:52,729 INFO L93 Difference]: Finished difference Result 158 states and 218 transitions. [2022-04-08 10:06:52,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 10:06:52,729 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-08 10:06:52,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:52,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-08 10:06:52,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 110 transitions. [2022-04-08 10:06:52,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-08 10:06:52,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 110 transitions. [2022-04-08 10:06:52,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 110 transitions. [2022-04-08 10:06:52,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:52,827 INFO L225 Difference]: With dead ends: 158 [2022-04-08 10:06:52,827 INFO L226 Difference]: Without dead ends: 141 [2022-04-08 10:06:52,827 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2022-04-08 10:06:52,828 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 76 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:52,828 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 90 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:06:52,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-08 10:06:53,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 85. [2022-04-08 10:06:53,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:53,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 85 states, 80 states have (on average 1.3) internal successors, (104), 80 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:53,038 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 85 states, 80 states have (on average 1.3) internal successors, (104), 80 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:53,038 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 85 states, 80 states have (on average 1.3) internal successors, (104), 80 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:53,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:53,040 INFO L93 Difference]: Finished difference Result 141 states and 183 transitions. [2022-04-08 10:06:53,040 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 183 transitions. [2022-04-08 10:06:53,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:53,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:53,041 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 80 states have (on average 1.3) internal successors, (104), 80 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 141 states. [2022-04-08 10:06:53,041 INFO L87 Difference]: Start difference. First operand has 85 states, 80 states have (on average 1.3) internal successors, (104), 80 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 141 states. [2022-04-08 10:06:53,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:53,059 INFO L93 Difference]: Finished difference Result 141 states and 183 transitions. [2022-04-08 10:06:53,059 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 183 transitions. [2022-04-08 10:06:53,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:53,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:53,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:53,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:53,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.3) internal successors, (104), 80 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:53,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 108 transitions. [2022-04-08 10:06:53,061 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 108 transitions. Word has length 25 [2022-04-08 10:06:53,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:53,061 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 108 transitions. [2022-04-08 10:06:53,061 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-08 10:06:53,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 108 transitions. [2022-04-08 10:06:53,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:53,223 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 108 transitions. [2022-04-08 10:06:53,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 10:06:53,224 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:53,224 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:53,240 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-08 10:06:53,424 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:53,424 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:53,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:53,425 INFO L85 PathProgramCache]: Analyzing trace with hash -137630238, now seen corresponding path program 5 times [2022-04-08 10:06:53,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:53,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [201803687] [2022-04-08 10:06:53,427 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:53,427 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:53,427 INFO L85 PathProgramCache]: Analyzing trace with hash -137630238, now seen corresponding path program 6 times [2022-04-08 10:06:53,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:53,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606212663] [2022-04-08 10:06:53,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:53,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:53,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:53,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {8426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8415#true} is VALID [2022-04-08 10:06:53,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {8415#true} assume true; {8415#true} is VALID [2022-04-08 10:06:53,536 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8415#true} {8415#true} #83#return; {8415#true} is VALID [2022-04-08 10:06:53,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {8415#true} call ULTIMATE.init(); {8426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:53,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {8426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8415#true} is VALID [2022-04-08 10:06:53,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {8415#true} assume true; {8415#true} is VALID [2022-04-08 10:06:53,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8415#true} {8415#true} #83#return; {8415#true} is VALID [2022-04-08 10:06:53,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {8415#true} call #t~ret15 := main(); {8415#true} is VALID [2022-04-08 10:06:53,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {8415#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8420#(= main_~y~0 0)} is VALID [2022-04-08 10:06:53,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {8420#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8421#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:53,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {8421#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:53,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {8422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {8422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:53,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {8422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {8422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:53,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {8422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:53,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {8422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:53,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {8422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~z~0 % 4294967296 > 0); {8422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:53,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {8422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8421#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:53,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {8421#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8420#(= main_~y~0 0)} is VALID [2022-04-08 10:06:53,541 INFO L290 TraceCheckUtils]: 15: Hoare triple {8420#(= main_~y~0 0)} assume !(~y~0 % 4294967296 > 0); {8420#(= main_~y~0 0)} is VALID [2022-04-08 10:06:53,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {8420#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8421#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:53,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {8421#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:53,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {8422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {8422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:53,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {8422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8421#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:53,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {8421#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8423#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:06:53,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {8423#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 > 0); {8423#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:06:53,544 INFO L272 TraceCheckUtils]: 22: Hoare triple {8423#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {8424#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:06:53,545 INFO L290 TraceCheckUtils]: 23: Hoare triple {8424#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {8425#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:06:53,545 INFO L290 TraceCheckUtils]: 24: Hoare triple {8425#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8416#false} is VALID [2022-04-08 10:06:53,545 INFO L290 TraceCheckUtils]: 25: Hoare triple {8416#false} assume !false; {8416#false} is VALID [2022-04-08 10:06:53,545 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:06:53,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:53,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606212663] [2022-04-08 10:06:53,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606212663] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:53,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290312075] [2022-04-08 10:06:53,546 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:06:53,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:53,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:53,547 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-08 10:06:53,547 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-08 10:06:53,588 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-04-08 10:06:53,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:53,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 10:06:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:53,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:53,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {8415#true} call ULTIMATE.init(); {8415#true} is VALID [2022-04-08 10:06:53,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {8415#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8415#true} is VALID [2022-04-08 10:06:53,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {8415#true} assume true; {8415#true} is VALID [2022-04-08 10:06:53,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8415#true} {8415#true} #83#return; {8415#true} is VALID [2022-04-08 10:06:53,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {8415#true} call #t~ret15 := main(); {8415#true} is VALID [2022-04-08 10:06:53,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {8415#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8415#true} is VALID [2022-04-08 10:06:53,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {8415#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8415#true} is VALID [2022-04-08 10:06:53,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {8415#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8415#true} is VALID [2022-04-08 10:06:53,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {8415#true} assume !(~x~0 % 4294967296 > 0); {8415#true} is VALID [2022-04-08 10:06:53,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {8415#true} ~z~0 := ~y~0; {8415#true} is VALID [2022-04-08 10:06:53,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {8415#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8415#true} is VALID [2022-04-08 10:06:53,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {8415#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8415#true} is VALID [2022-04-08 10:06:53,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {8415#true} assume !(~z~0 % 4294967296 > 0); {8415#true} is VALID [2022-04-08 10:06:53,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {8415#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8415#true} is VALID [2022-04-08 10:06:53,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {8415#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8415#true} is VALID [2022-04-08 10:06:53,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {8415#true} assume !(~y~0 % 4294967296 > 0); {8475#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:06:53,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {8475#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8479#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:06:53,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {8479#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8483#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:06:53,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {8483#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {8483#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:06:53,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {8483#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8479#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:06:53,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {8479#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8475#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:06:53,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {8475#(not (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8475#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:06:53,813 INFO L272 TraceCheckUtils]: 22: Hoare triple {8475#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {8499#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:06:53,813 INFO L290 TraceCheckUtils]: 23: Hoare triple {8499#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8503#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:06:53,814 INFO L290 TraceCheckUtils]: 24: Hoare triple {8503#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8416#false} is VALID [2022-04-08 10:06:53,814 INFO L290 TraceCheckUtils]: 25: Hoare triple {8416#false} assume !false; {8416#false} is VALID [2022-04-08 10:06:53,814 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 10:06:53,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:53,921 INFO L290 TraceCheckUtils]: 25: Hoare triple {8416#false} assume !false; {8416#false} is VALID [2022-04-08 10:06:53,922 INFO L290 TraceCheckUtils]: 24: Hoare triple {8503#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8416#false} is VALID [2022-04-08 10:06:53,922 INFO L290 TraceCheckUtils]: 23: Hoare triple {8499#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8503#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:06:53,927 INFO L272 TraceCheckUtils]: 22: Hoare triple {8475#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {8499#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:06:53,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {8475#(not (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8475#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:06:53,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {8479#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8475#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:06:53,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {8483#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8479#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:06:53,930 INFO L290 TraceCheckUtils]: 18: Hoare triple {8483#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {8483#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:06:53,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {8479#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8483#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:06:53,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {8475#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8479#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:06:53,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {8415#true} assume !(~y~0 % 4294967296 > 0); {8475#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:06:53,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {8415#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8415#true} is VALID [2022-04-08 10:06:53,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {8415#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8415#true} is VALID [2022-04-08 10:06:53,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {8415#true} assume !(~z~0 % 4294967296 > 0); {8415#true} is VALID [2022-04-08 10:06:53,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {8415#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8415#true} is VALID [2022-04-08 10:06:53,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {8415#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8415#true} is VALID [2022-04-08 10:06:53,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {8415#true} ~z~0 := ~y~0; {8415#true} is VALID [2022-04-08 10:06:53,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {8415#true} assume !(~x~0 % 4294967296 > 0); {8415#true} is VALID [2022-04-08 10:06:53,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {8415#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8415#true} is VALID [2022-04-08 10:06:53,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {8415#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8415#true} is VALID [2022-04-08 10:06:53,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {8415#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8415#true} is VALID [2022-04-08 10:06:53,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {8415#true} call #t~ret15 := main(); {8415#true} is VALID [2022-04-08 10:06:53,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8415#true} {8415#true} #83#return; {8415#true} is VALID [2022-04-08 10:06:53,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {8415#true} assume true; {8415#true} is VALID [2022-04-08 10:06:53,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {8415#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8415#true} is VALID [2022-04-08 10:06:53,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {8415#true} call ULTIMATE.init(); {8415#true} is VALID [2022-04-08 10:06:53,933 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 10:06:53,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290312075] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:53,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:53,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2022-04-08 10:06:53,934 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:53,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [201803687] [2022-04-08 10:06:53,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [201803687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:53,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:53,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:06:53,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329365672] [2022-04-08 10:06:53,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:53,935 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 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 26 [2022-04-08 10:06:53,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:53,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 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-08 10:06:53,954 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-08 10:06:53,955 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:06:53,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:53,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:06:53,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-08 10:06:53,955 INFO L87 Difference]: Start difference. First operand 85 states and 108 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 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-08 10:06:54,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:54,441 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2022-04-08 10:06:54,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 10:06:54,441 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 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 26 [2022-04-08 10:06:54,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:54,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 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-08 10:06:54,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-08 10:06:54,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 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-08 10:06:54,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-08 10:06:54,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-08 10:06:54,474 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-08 10:06:54,475 INFO L225 Difference]: With dead ends: 94 [2022-04-08 10:06:54,476 INFO L226 Difference]: Without dead ends: 86 [2022-04-08 10:06:54,476 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:06:54,476 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:54,477 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 46 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:06:54,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-08 10:06:54,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-08 10:06:54,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:54,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 81 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:54,729 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 81 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:54,730 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 81 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:54,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:54,731 INFO L93 Difference]: Finished difference Result 86 states and 109 transitions. [2022-04-08 10:06:54,731 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 109 transitions. [2022-04-08 10:06:54,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:54,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:54,731 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 81 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 86 states. [2022-04-08 10:06:54,731 INFO L87 Difference]: Start difference. First operand has 86 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 81 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 86 states. [2022-04-08 10:06:54,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:54,732 INFO L93 Difference]: Finished difference Result 86 states and 109 transitions. [2022-04-08 10:06:54,732 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 109 transitions. [2022-04-08 10:06:54,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:54,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:54,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:54,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:54,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 81 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:54,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 109 transitions. [2022-04-08 10:06:54,734 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 109 transitions. Word has length 26 [2022-04-08 10:06:54,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:54,734 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 109 transitions. [2022-04-08 10:06:54,734 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 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-08 10:06:54,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 109 transitions. [2022-04-08 10:06:54,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:54,908 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 109 transitions. [2022-04-08 10:06:54,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 10:06:54,908 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:54,908 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:54,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-08 10:06:55,108 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:55,109 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:55,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:55,109 INFO L85 PathProgramCache]: Analyzing trace with hash -323050508, now seen corresponding path program 13 times [2022-04-08 10:06:55,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:55,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1990852542] [2022-04-08 10:06:55,111 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:55,111 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:55,112 INFO L85 PathProgramCache]: Analyzing trace with hash -323050508, now seen corresponding path program 14 times [2022-04-08 10:06:55,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:55,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488322892] [2022-04-08 10:06:55,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:55,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:55,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:55,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {9141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9129#true} is VALID [2022-04-08 10:06:55,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {9129#true} assume true; {9129#true} is VALID [2022-04-08 10:06:55,286 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9129#true} {9129#true} #83#return; {9129#true} is VALID [2022-04-08 10:06:55,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {9129#true} call ULTIMATE.init(); {9141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:55,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {9141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9129#true} is VALID [2022-04-08 10:06:55,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {9129#true} assume true; {9129#true} is VALID [2022-04-08 10:06:55,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9129#true} {9129#true} #83#return; {9129#true} is VALID [2022-04-08 10:06:55,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {9129#true} call #t~ret15 := main(); {9129#true} is VALID [2022-04-08 10:06:55,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {9129#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9134#(= main_~y~0 0)} is VALID [2022-04-08 10:06:55,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {9134#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9135#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:55,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {9135#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9136#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:55,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {9136#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9137#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:55,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {9137#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9137#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:55,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {9137#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {9138#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:06:55,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {9138#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9139#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:55,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {9139#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9140#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:06:55,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {9140#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {9130#false} is VALID [2022-04-08 10:06:55,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {9130#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9130#false} is VALID [2022-04-08 10:06:55,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {9130#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9130#false} is VALID [2022-04-08 10:06:55,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {9130#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9130#false} is VALID [2022-04-08 10:06:55,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {9130#false} assume !(~y~0 % 4294967296 > 0); {9130#false} is VALID [2022-04-08 10:06:55,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {9130#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9130#false} is VALID [2022-04-08 10:06:55,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {9130#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9130#false} is VALID [2022-04-08 10:06:55,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {9130#false} assume !(~x~0 % 4294967296 > 0); {9130#false} is VALID [2022-04-08 10:06:55,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {9130#false} assume !(~z~0 % 4294967296 > 0); {9130#false} is VALID [2022-04-08 10:06:55,292 INFO L272 TraceCheckUtils]: 22: Hoare triple {9130#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {9130#false} is VALID [2022-04-08 10:06:55,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {9130#false} ~cond := #in~cond; {9130#false} is VALID [2022-04-08 10:06:55,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {9130#false} assume 0 == ~cond; {9130#false} is VALID [2022-04-08 10:06:55,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {9130#false} assume !false; {9130#false} is VALID [2022-04-08 10:06:55,293 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 10:06:55,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:55,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488322892] [2022-04-08 10:06:55,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488322892] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:55,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397956072] [2022-04-08 10:06:55,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:06:55,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:55,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:55,294 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-08 10:06:55,309 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-08 10:06:55,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:06:55,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:55,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 10:06:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:55,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:55,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {9129#true} call ULTIMATE.init(); {9129#true} is VALID [2022-04-08 10:06:55,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {9129#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9129#true} is VALID [2022-04-08 10:06:55,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {9129#true} assume true; {9129#true} is VALID [2022-04-08 10:06:55,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9129#true} {9129#true} #83#return; {9129#true} is VALID [2022-04-08 10:06:55,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {9129#true} call #t~ret15 := main(); {9129#true} is VALID [2022-04-08 10:06:55,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {9129#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9134#(= main_~y~0 0)} is VALID [2022-04-08 10:06:55,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {9134#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9135#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:55,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {9135#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9136#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:55,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {9136#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9137#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:55,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {9137#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9137#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:55,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {9137#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {9175#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:55,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {9175#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9179#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:06:55,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {9179#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9183#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:55,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {9183#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {9130#false} is VALID [2022-04-08 10:06:55,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {9130#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9130#false} is VALID [2022-04-08 10:06:55,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {9130#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9130#false} is VALID [2022-04-08 10:06:55,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {9130#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9130#false} is VALID [2022-04-08 10:06:55,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {9130#false} assume !(~y~0 % 4294967296 > 0); {9130#false} is VALID [2022-04-08 10:06:55,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {9130#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9130#false} is VALID [2022-04-08 10:06:55,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {9130#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9130#false} is VALID [2022-04-08 10:06:55,490 INFO L290 TraceCheckUtils]: 20: Hoare triple {9130#false} assume !(~x~0 % 4294967296 > 0); {9130#false} is VALID [2022-04-08 10:06:55,490 INFO L290 TraceCheckUtils]: 21: Hoare triple {9130#false} assume !(~z~0 % 4294967296 > 0); {9130#false} is VALID [2022-04-08 10:06:55,491 INFO L272 TraceCheckUtils]: 22: Hoare triple {9130#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {9130#false} is VALID [2022-04-08 10:06:55,491 INFO L290 TraceCheckUtils]: 23: Hoare triple {9130#false} ~cond := #in~cond; {9130#false} is VALID [2022-04-08 10:06:55,491 INFO L290 TraceCheckUtils]: 24: Hoare triple {9130#false} assume 0 == ~cond; {9130#false} is VALID [2022-04-08 10:06:55,491 INFO L290 TraceCheckUtils]: 25: Hoare triple {9130#false} assume !false; {9130#false} is VALID [2022-04-08 10:06:55,491 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 10:06:55,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:55,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {9130#false} assume !false; {9130#false} is VALID [2022-04-08 10:06:55,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {9130#false} assume 0 == ~cond; {9130#false} is VALID [2022-04-08 10:06:55,656 INFO L290 TraceCheckUtils]: 23: Hoare triple {9130#false} ~cond := #in~cond; {9130#false} is VALID [2022-04-08 10:06:55,656 INFO L272 TraceCheckUtils]: 22: Hoare triple {9130#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {9130#false} is VALID [2022-04-08 10:06:55,656 INFO L290 TraceCheckUtils]: 21: Hoare triple {9130#false} assume !(~z~0 % 4294967296 > 0); {9130#false} is VALID [2022-04-08 10:06:55,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {9130#false} assume !(~x~0 % 4294967296 > 0); {9130#false} is VALID [2022-04-08 10:06:55,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {9130#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9130#false} is VALID [2022-04-08 10:06:55,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {9130#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9130#false} is VALID [2022-04-08 10:06:55,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {9130#false} assume !(~y~0 % 4294967296 > 0); {9130#false} is VALID [2022-04-08 10:06:55,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {9250#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9130#false} is VALID [2022-04-08 10:06:55,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {9254#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9250#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:06:55,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {9258#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9254#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:06:55,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {9262#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {9258#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:06:55,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {9266#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9262#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-08 10:06:55,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {9270#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9266#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:06:55,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {9129#true} ~z~0 := ~y~0; {9270#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-08 10:06:55,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {9129#true} assume !(~x~0 % 4294967296 > 0); {9129#true} is VALID [2022-04-08 10:06:55,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {9129#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9129#true} is VALID [2022-04-08 10:06:55,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {9129#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9129#true} is VALID [2022-04-08 10:06:55,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {9129#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9129#true} is VALID [2022-04-08 10:06:55,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {9129#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9129#true} is VALID [2022-04-08 10:06:55,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {9129#true} call #t~ret15 := main(); {9129#true} is VALID [2022-04-08 10:06:55,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9129#true} {9129#true} #83#return; {9129#true} is VALID [2022-04-08 10:06:55,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {9129#true} assume true; {9129#true} is VALID [2022-04-08 10:06:55,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {9129#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9129#true} is VALID [2022-04-08 10:06:55,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {9129#true} call ULTIMATE.init(); {9129#true} is VALID [2022-04-08 10:06:55,661 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 10:06:55,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397956072] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:55,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:55,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 19 [2022-04-08 10:06:55,662 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:55,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1990852542] [2022-04-08 10:06:55,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1990852542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:55,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:55,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 10:06:55,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272912679] [2022-04-08 10:06:55,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:55,663 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 26 [2022-04-08 10:06:55,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:55,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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-08 10:06:55,691 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-08 10:06:55,691 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 10:06:55,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:55,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 10:06:55,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:06:55,692 INFO L87 Difference]: Start difference. First operand 86 states and 109 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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-08 10:06:56,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:56,534 INFO L93 Difference]: Finished difference Result 120 states and 153 transitions. [2022-04-08 10:06:56,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 10:06:56,534 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 26 [2022-04-08 10:06:56,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:56,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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-08 10:06:56,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 72 transitions. [2022-04-08 10:06:56,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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-08 10:06:56,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 72 transitions. [2022-04-08 10:06:56,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 72 transitions. [2022-04-08 10:06:56,593 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-08 10:06:56,595 INFO L225 Difference]: With dead ends: 120 [2022-04-08 10:06:56,595 INFO L226 Difference]: Without dead ends: 107 [2022-04-08 10:06:56,595 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:06:56,596 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 39 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:56,596 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 54 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:06:56,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-08 10:06:56,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 86. [2022-04-08 10:06:56,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:56,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 86 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 81 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:56,826 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 86 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 81 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:56,826 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 86 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 81 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:56,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:56,828 INFO L93 Difference]: Finished difference Result 107 states and 138 transitions. [2022-04-08 10:06:56,828 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 138 transitions. [2022-04-08 10:06:56,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:56,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:56,829 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 81 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 107 states. [2022-04-08 10:06:56,829 INFO L87 Difference]: Start difference. First operand has 86 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 81 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 107 states. [2022-04-08 10:06:56,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:56,830 INFO L93 Difference]: Finished difference Result 107 states and 138 transitions. [2022-04-08 10:06:56,830 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 138 transitions. [2022-04-08 10:06:56,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:56,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:56,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:56,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:56,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 81 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:56,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2022-04-08 10:06:56,832 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 26 [2022-04-08 10:06:56,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:56,833 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2022-04-08 10:06:56,833 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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-08 10:06:56,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 108 transitions. [2022-04-08 10:06:57,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:57,019 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-08 10:06:57,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 10:06:57,020 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:57,020 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:57,036 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-08 10:06:57,220 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:57,220 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:57,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:57,221 INFO L85 PathProgramCache]: Analyzing trace with hash -197432477, now seen corresponding path program 7 times [2022-04-08 10:06:57,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:57,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1420168951] [2022-04-08 10:06:57,223 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:57,223 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:57,223 INFO L85 PathProgramCache]: Analyzing trace with hash -197432477, now seen corresponding path program 8 times [2022-04-08 10:06:57,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:57,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837587134] [2022-04-08 10:06:57,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:57,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:57,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:57,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {9964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9950#true} is VALID [2022-04-08 10:06:57,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {9950#true} assume true; {9950#true} is VALID [2022-04-08 10:06:57,402 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9950#true} {9950#true} #83#return; {9950#true} is VALID [2022-04-08 10:06:57,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {9950#true} call ULTIMATE.init(); {9964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:57,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {9964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9950#true} is VALID [2022-04-08 10:06:57,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {9950#true} assume true; {9950#true} is VALID [2022-04-08 10:06:57,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9950#true} {9950#true} #83#return; {9950#true} is VALID [2022-04-08 10:06:57,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {9950#true} call #t~ret15 := main(); {9950#true} is VALID [2022-04-08 10:06:57,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {9950#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9955#(= main_~y~0 0)} is VALID [2022-04-08 10:06:57,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {9955#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9956#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:57,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {9956#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9957#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:57,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {9957#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9958#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:57,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {9958#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9958#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:57,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {9958#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {9959#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:06:57,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {9959#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9960#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:57,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {9960#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9961#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:06:57,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {9961#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9962#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:06:57,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {9962#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {9962#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:06:57,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {9962#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9961#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:06:57,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {9961#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9960#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:57,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {9960#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9959#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:06:57,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {9959#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {9959#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:06:57,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {9959#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {9959#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:06:57,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {9959#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9963#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:57,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {9963#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {9951#false} is VALID [2022-04-08 10:06:57,413 INFO L272 TraceCheckUtils]: 22: Hoare triple {9951#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {9951#false} is VALID [2022-04-08 10:06:57,413 INFO L290 TraceCheckUtils]: 23: Hoare triple {9951#false} ~cond := #in~cond; {9951#false} is VALID [2022-04-08 10:06:57,413 INFO L290 TraceCheckUtils]: 24: Hoare triple {9951#false} assume 0 == ~cond; {9951#false} is VALID [2022-04-08 10:06:57,414 INFO L290 TraceCheckUtils]: 25: Hoare triple {9951#false} assume !false; {9951#false} is VALID [2022-04-08 10:06:57,414 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:57,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:57,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837587134] [2022-04-08 10:06:57,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837587134] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:57,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645438015] [2022-04-08 10:06:57,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:06:57,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:57,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:57,415 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-08 10:06:57,416 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-08 10:06:57,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:06:57,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:57,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 10:06:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:57,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:57,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {9950#true} call ULTIMATE.init(); {9950#true} is VALID [2022-04-08 10:06:57,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {9950#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9950#true} is VALID [2022-04-08 10:06:57,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {9950#true} assume true; {9950#true} is VALID [2022-04-08 10:06:57,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9950#true} {9950#true} #83#return; {9950#true} is VALID [2022-04-08 10:06:57,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {9950#true} call #t~ret15 := main(); {9950#true} is VALID [2022-04-08 10:06:57,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {9950#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9950#true} is VALID [2022-04-08 10:06:57,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {9950#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9986#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:06:57,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {9986#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9990#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:06:57,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {9990#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9994#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:06:57,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {9994#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {9994#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:06:57,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {9994#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {9994#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:06:57,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {9994#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9990#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:06:57,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {9990#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9986#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:06:57,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {9986#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10010#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:57,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {10010#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10010#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:57,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {10010#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10010#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:57,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {10010#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10010#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:57,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {10010#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10010#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:57,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {10010#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {10010#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:57,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {10010#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {9951#false} is VALID [2022-04-08 10:06:57,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {9951#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9951#false} is VALID [2022-04-08 10:06:57,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {9951#false} assume !(~z~0 % 4294967296 > 0); {9951#false} is VALID [2022-04-08 10:06:57,590 INFO L272 TraceCheckUtils]: 22: Hoare triple {9951#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {9951#false} is VALID [2022-04-08 10:06:57,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {9951#false} ~cond := #in~cond; {9951#false} is VALID [2022-04-08 10:06:57,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {9951#false} assume 0 == ~cond; {9951#false} is VALID [2022-04-08 10:06:57,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {9951#false} assume !false; {9951#false} is VALID [2022-04-08 10:06:57,590 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-08 10:06:57,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:57,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {9951#false} assume !false; {9951#false} is VALID [2022-04-08 10:06:57,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {9951#false} assume 0 == ~cond; {9951#false} is VALID [2022-04-08 10:06:57,672 INFO L290 TraceCheckUtils]: 23: Hoare triple {9951#false} ~cond := #in~cond; {9951#false} is VALID [2022-04-08 10:06:57,672 INFO L272 TraceCheckUtils]: 22: Hoare triple {9951#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {9951#false} is VALID [2022-04-08 10:06:57,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {9951#false} assume !(~z~0 % 4294967296 > 0); {9951#false} is VALID [2022-04-08 10:06:57,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {9951#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9951#false} is VALID [2022-04-08 10:06:57,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {10010#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {9951#false} is VALID [2022-04-08 10:06:57,673 INFO L290 TraceCheckUtils]: 18: Hoare triple {10010#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {10010#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:57,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {10010#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10010#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:57,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {10010#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10010#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:57,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {10010#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10010#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:57,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {10010#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10010#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:57,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {9986#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10010#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:57,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {9990#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9986#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:06:57,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {9994#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9990#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:06:57,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {9994#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {9994#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:06:57,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {9994#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {9994#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:06:57,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {9990#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9994#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:06:57,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {9986#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9990#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:06:57,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {9950#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9986#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:06:57,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {9950#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9950#true} is VALID [2022-04-08 10:06:57,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {9950#true} call #t~ret15 := main(); {9950#true} is VALID [2022-04-08 10:06:57,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9950#true} {9950#true} #83#return; {9950#true} is VALID [2022-04-08 10:06:57,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {9950#true} assume true; {9950#true} is VALID [2022-04-08 10:06:57,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {9950#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9950#true} is VALID [2022-04-08 10:06:57,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {9950#true} call ULTIMATE.init(); {9950#true} is VALID [2022-04-08 10:06:57,687 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-08 10:06:57,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645438015] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:57,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:57,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 16 [2022-04-08 10:06:57,688 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:57,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1420168951] [2022-04-08 10:06:57,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1420168951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:57,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:57,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:06:57,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179841310] [2022-04-08 10:06:57,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:57,689 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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-08 10:06:57,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:57,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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-08 10:06:57,709 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-08 10:06:57,710 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:06:57,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:57,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:06:57,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:06:57,710 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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-08 10:06:59,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:59,270 INFO L93 Difference]: Finished difference Result 130 states and 174 transitions. [2022-04-08 10:06:59,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 10:06:59,270 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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-08 10:06:59,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:59,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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-08 10:06:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 106 transitions. [2022-04-08 10:06:59,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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-08 10:06:59,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 106 transitions. [2022-04-08 10:06:59,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 106 transitions. [2022-04-08 10:06:59,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:59,370 INFO L225 Difference]: With dead ends: 130 [2022-04-08 10:06:59,370 INFO L226 Difference]: Without dead ends: 116 [2022-04-08 10:06:59,371 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=1375, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:06:59,371 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 55 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:59,371 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 62 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:06:59,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-08 10:06:59,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 92. [2022-04-08 10:06:59,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:59,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 92 states, 87 states have (on average 1.264367816091954) internal successors, (110), 87 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:59,642 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 92 states, 87 states have (on average 1.264367816091954) internal successors, (110), 87 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:59,642 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 92 states, 87 states have (on average 1.264367816091954) internal successors, (110), 87 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:59,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:59,643 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-04-08 10:06:59,644 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-08 10:06:59,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:59,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:59,644 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 87 states have (on average 1.264367816091954) internal successors, (110), 87 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 116 states. [2022-04-08 10:06:59,644 INFO L87 Difference]: Start difference. First operand has 92 states, 87 states have (on average 1.264367816091954) internal successors, (110), 87 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 116 states. [2022-04-08 10:06:59,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:59,646 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-04-08 10:06:59,646 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-08 10:06:59,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:59,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:59,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:59,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:59,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 87 states have (on average 1.264367816091954) internal successors, (110), 87 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:59,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 114 transitions. [2022-04-08 10:06:59,648 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 114 transitions. Word has length 26 [2022-04-08 10:06:59,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:59,648 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 114 transitions. [2022-04-08 10:06:59,648 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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-08 10:06:59,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 114 transitions. [2022-04-08 10:06:59,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:59,867 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 114 transitions. [2022-04-08 10:06:59,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 10:06:59,867 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:59,867 INFO L499 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:59,883 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-08 10:07:00,067 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:00,068 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:00,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:00,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1566978034, now seen corresponding path program 15 times [2022-04-08 10:07:00,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:00,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1334772683] [2022-04-08 10:07:00,070 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:00,070 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:00,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1566978034, now seen corresponding path program 16 times [2022-04-08 10:07:00,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:00,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225606380] [2022-04-08 10:07:00,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:00,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:00,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:00,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {10863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10848#true} is VALID [2022-04-08 10:07:00,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {10848#true} assume true; {10848#true} is VALID [2022-04-08 10:07:00,221 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10848#true} {10848#true} #83#return; {10848#true} is VALID [2022-04-08 10:07:00,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {10848#true} call ULTIMATE.init(); {10863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:00,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {10863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10848#true} is VALID [2022-04-08 10:07:00,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {10848#true} assume true; {10848#true} is VALID [2022-04-08 10:07:00,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10848#true} {10848#true} #83#return; {10848#true} is VALID [2022-04-08 10:07:00,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {10848#true} call #t~ret15 := main(); {10848#true} is VALID [2022-04-08 10:07:00,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {10848#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10853#(= main_~y~0 0)} is VALID [2022-04-08 10:07:00,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {10853#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10854#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:00,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {10854#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10855#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:00,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {10855#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10856#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:00,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {10856#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10857#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:00,224 INFO L290 TraceCheckUtils]: 10: Hoare triple {10857#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10858#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:00,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {10858#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10859#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:00,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {10859#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10860#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:00,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {10860#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {10860#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:00,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {10860#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {10861#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:07:00,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {10861#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10862#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:07:00,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {10862#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {10849#false} is VALID [2022-04-08 10:07:00,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {10849#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10849#false} is VALID [2022-04-08 10:07:00,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {10849#false} assume !(~y~0 % 4294967296 > 0); {10849#false} is VALID [2022-04-08 10:07:00,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {10849#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10849#false} is VALID [2022-04-08 10:07:00,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {10849#false} assume !(~x~0 % 4294967296 > 0); {10849#false} is VALID [2022-04-08 10:07:00,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {10849#false} assume !(~z~0 % 4294967296 > 0); {10849#false} is VALID [2022-04-08 10:07:00,227 INFO L272 TraceCheckUtils]: 22: Hoare triple {10849#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {10849#false} is VALID [2022-04-08 10:07:00,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {10849#false} ~cond := #in~cond; {10849#false} is VALID [2022-04-08 10:07:00,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {10849#false} assume 0 == ~cond; {10849#false} is VALID [2022-04-08 10:07:00,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {10849#false} assume !false; {10849#false} is VALID [2022-04-08 10:07:00,227 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:07:00,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:00,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225606380] [2022-04-08 10:07:00,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225606380] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:00,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675122064] [2022-04-08 10:07:00,228 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:07:00,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:00,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:00,229 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-08 10:07:00,229 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-08 10:07:00,262 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:07:00,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:00,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 10:07:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:00,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:00,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {10848#true} call ULTIMATE.init(); {10848#true} is VALID [2022-04-08 10:07:00,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {10848#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10848#true} is VALID [2022-04-08 10:07:00,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {10848#true} assume true; {10848#true} is VALID [2022-04-08 10:07:00,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10848#true} {10848#true} #83#return; {10848#true} is VALID [2022-04-08 10:07:00,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {10848#true} call #t~ret15 := main(); {10848#true} is VALID [2022-04-08 10:07:00,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {10848#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10853#(= main_~y~0 0)} is VALID [2022-04-08 10:07:00,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {10853#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10854#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:00,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {10854#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10855#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:00,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {10855#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10856#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:00,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {10856#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10857#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:00,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {10857#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10858#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:00,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {10858#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10859#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:00,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {10859#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10860#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:00,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {10860#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {10860#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:00,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {10860#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {10861#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:07:00,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {10861#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10912#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:07:00,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {10912#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {10849#false} is VALID [2022-04-08 10:07:00,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {10849#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10849#false} is VALID [2022-04-08 10:07:00,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {10849#false} assume !(~y~0 % 4294967296 > 0); {10849#false} is VALID [2022-04-08 10:07:00,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {10849#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10849#false} is VALID [2022-04-08 10:07:00,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {10849#false} assume !(~x~0 % 4294967296 > 0); {10849#false} is VALID [2022-04-08 10:07:00,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {10849#false} assume !(~z~0 % 4294967296 > 0); {10849#false} is VALID [2022-04-08 10:07:00,514 INFO L272 TraceCheckUtils]: 22: Hoare triple {10849#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {10849#false} is VALID [2022-04-08 10:07:00,514 INFO L290 TraceCheckUtils]: 23: Hoare triple {10849#false} ~cond := #in~cond; {10849#false} is VALID [2022-04-08 10:07:00,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {10849#false} assume 0 == ~cond; {10849#false} is VALID [2022-04-08 10:07:00,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {10849#false} assume !false; {10849#false} is VALID [2022-04-08 10:07:00,515 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:07:00,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:00,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {10849#false} assume !false; {10849#false} is VALID [2022-04-08 10:07:00,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {10849#false} assume 0 == ~cond; {10849#false} is VALID [2022-04-08 10:07:00,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {10849#false} ~cond := #in~cond; {10849#false} is VALID [2022-04-08 10:07:00,746 INFO L272 TraceCheckUtils]: 22: Hoare triple {10849#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {10849#false} is VALID [2022-04-08 10:07:00,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {10849#false} assume !(~z~0 % 4294967296 > 0); {10849#false} is VALID [2022-04-08 10:07:00,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {10849#false} assume !(~x~0 % 4294967296 > 0); {10849#false} is VALID [2022-04-08 10:07:00,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {10849#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10849#false} is VALID [2022-04-08 10:07:00,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {10849#false} assume !(~y~0 % 4294967296 > 0); {10849#false} is VALID [2022-04-08 10:07:00,746 INFO L290 TraceCheckUtils]: 17: Hoare triple {10849#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10849#false} is VALID [2022-04-08 10:07:00,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {10970#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10849#false} is VALID [2022-04-08 10:07:00,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {10974#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10970#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:00,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {10978#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {10974#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:00,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {10978#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {10978#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:00,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {10985#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10978#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:00,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {10989#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10985#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:00,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {10993#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10989#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:00,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {10997#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10993#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:00,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {11001#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10997#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:00,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {11005#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11001#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:00,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {11009#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11005#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:00,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {10848#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11009#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:07:00,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {10848#true} call #t~ret15 := main(); {10848#true} is VALID [2022-04-08 10:07:00,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10848#true} {10848#true} #83#return; {10848#true} is VALID [2022-04-08 10:07:00,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {10848#true} assume true; {10848#true} is VALID [2022-04-08 10:07:00,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {10848#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10848#true} is VALID [2022-04-08 10:07:00,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {10848#true} call ULTIMATE.init(); {10848#true} is VALID [2022-04-08 10:07:00,755 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:07:00,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675122064] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:00,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:00,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-08 10:07:00,756 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:00,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1334772683] [2022-04-08 10:07:00,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1334772683] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:00,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:00,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:07:00,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686976618] [2022-04-08 10:07:00,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:00,756 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 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-08 10:07:00,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:00,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 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-08 10:07:00,776 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-08 10:07:00,776 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:07:00,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:00,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:07:00,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-04-08 10:07:00,777 INFO L87 Difference]: Start difference. First operand 92 states and 114 transitions. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 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-08 10:07:02,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:02,930 INFO L93 Difference]: Finished difference Result 200 states and 274 transitions. [2022-04-08 10:07:02,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 10:07:02,930 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 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-08 10:07:02,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:02,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 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-08 10:07:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 122 transitions. [2022-04-08 10:07:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 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-08 10:07:02,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 122 transitions. [2022-04-08 10:07:02,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 122 transitions. [2022-04-08 10:07:03,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:03,030 INFO L225 Difference]: With dead ends: 200 [2022-04-08 10:07:03,030 INFO L226 Difference]: Without dead ends: 183 [2022-04-08 10:07:03,031 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=931, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 10:07:03,031 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 86 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:03,031 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 101 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:07:03,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-04-08 10:07:03,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 100. [2022-04-08 10:07:03,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:03,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand has 100 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 95 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:03,295 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand has 100 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 95 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:03,295 INFO L87 Difference]: Start difference. First operand 183 states. Second operand has 100 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 95 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:03,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:03,299 INFO L93 Difference]: Finished difference Result 183 states and 237 transitions. [2022-04-08 10:07:03,299 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 237 transitions. [2022-04-08 10:07:03,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:03,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:03,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 95 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 183 states. [2022-04-08 10:07:03,300 INFO L87 Difference]: Start difference. First operand has 100 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 95 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 183 states. [2022-04-08 10:07:03,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:03,303 INFO L93 Difference]: Finished difference Result 183 states and 237 transitions. [2022-04-08 10:07:03,303 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 237 transitions. [2022-04-08 10:07:03,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:03,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:03,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:03,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:03,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 95 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:03,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 125 transitions. [2022-04-08 10:07:03,305 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 125 transitions. Word has length 26 [2022-04-08 10:07:03,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:03,305 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 125 transitions. [2022-04-08 10:07:03,305 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 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-08 10:07:03,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 125 transitions. [2022-04-08 10:07:03,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:03,532 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2022-04-08 10:07:03,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 10:07:03,533 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:03,533 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:03,548 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-08 10:07:03,733 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:03,733 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:03,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:03,733 INFO L85 PathProgramCache]: Analyzing trace with hash -438714480, now seen corresponding path program 7 times [2022-04-08 10:07:03,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:03,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [43440975] [2022-04-08 10:07:03,738 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:03,738 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:03,738 INFO L85 PathProgramCache]: Analyzing trace with hash -438714480, now seen corresponding path program 8 times [2022-04-08 10:07:03,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:03,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870030028] [2022-04-08 10:07:03,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:03,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:03,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:03,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {12026#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12018#true} is VALID [2022-04-08 10:07:03,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {12018#true} assume true; {12018#true} is VALID [2022-04-08 10:07:03,814 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12018#true} {12018#true} #83#return; {12018#true} is VALID [2022-04-08 10:07:03,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {12018#true} call ULTIMATE.init(); {12026#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:03,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {12026#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12018#true} is VALID [2022-04-08 10:07:03,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {12018#true} assume true; {12018#true} is VALID [2022-04-08 10:07:03,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12018#true} {12018#true} #83#return; {12018#true} is VALID [2022-04-08 10:07:03,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {12018#true} call #t~ret15 := main(); {12018#true} is VALID [2022-04-08 10:07:03,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {12018#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12018#true} is VALID [2022-04-08 10:07:03,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {12018#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12018#true} is VALID [2022-04-08 10:07:03,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {12018#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12018#true} is VALID [2022-04-08 10:07:03,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {12018#true} assume !(~x~0 % 4294967296 > 0); {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:03,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:03,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12024#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:03,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {12024#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:03,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:03,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:03,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:03,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:03,820 INFO L290 TraceCheckUtils]: 16: Hoare triple {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12024#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:03,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {12024#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:03,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12019#false} is VALID [2022-04-08 10:07:03,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {12019#false} assume !(~x~0 % 4294967296 > 0); {12019#false} is VALID [2022-04-08 10:07:03,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {12019#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12019#false} is VALID [2022-04-08 10:07:03,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {12019#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12019#false} is VALID [2022-04-08 10:07:03,822 INFO L290 TraceCheckUtils]: 22: Hoare triple {12019#false} assume !(~z~0 % 4294967296 > 0); {12019#false} is VALID [2022-04-08 10:07:03,822 INFO L272 TraceCheckUtils]: 23: Hoare triple {12019#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {12019#false} is VALID [2022-04-08 10:07:03,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {12019#false} ~cond := #in~cond; {12019#false} is VALID [2022-04-08 10:07:03,822 INFO L290 TraceCheckUtils]: 25: Hoare triple {12019#false} assume 0 == ~cond; {12019#false} is VALID [2022-04-08 10:07:03,822 INFO L290 TraceCheckUtils]: 26: Hoare triple {12019#false} assume !false; {12019#false} is VALID [2022-04-08 10:07:03,822 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 10:07:03,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:03,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870030028] [2022-04-08 10:07:03,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870030028] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:03,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175130385] [2022-04-08 10:07:03,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:07:03,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:03,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:03,828 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-08 10:07:03,860 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-08 10:07:03,884 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:07:03,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:03,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 10:07:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:03,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:04,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {12018#true} call ULTIMATE.init(); {12018#true} is VALID [2022-04-08 10:07:04,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {12018#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12018#true} is VALID [2022-04-08 10:07:04,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {12018#true} assume true; {12018#true} is VALID [2022-04-08 10:07:04,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12018#true} {12018#true} #83#return; {12018#true} is VALID [2022-04-08 10:07:04,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {12018#true} call #t~ret15 := main(); {12018#true} is VALID [2022-04-08 10:07:04,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {12018#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12018#true} is VALID [2022-04-08 10:07:04,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {12018#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12018#true} is VALID [2022-04-08 10:07:04,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {12018#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12018#true} is VALID [2022-04-08 10:07:04,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {12018#true} assume !(~x~0 % 4294967296 > 0); {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:04,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:04,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12024#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:04,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {12024#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:04,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:04,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:04,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:04,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:04,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12024#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:04,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {12024#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:04,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12019#false} is VALID [2022-04-08 10:07:04,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {12019#false} assume !(~x~0 % 4294967296 > 0); {12019#false} is VALID [2022-04-08 10:07:04,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {12019#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12019#false} is VALID [2022-04-08 10:07:04,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {12019#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12019#false} is VALID [2022-04-08 10:07:04,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {12019#false} assume !(~z~0 % 4294967296 > 0); {12019#false} is VALID [2022-04-08 10:07:04,094 INFO L272 TraceCheckUtils]: 23: Hoare triple {12019#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {12019#false} is VALID [2022-04-08 10:07:04,094 INFO L290 TraceCheckUtils]: 24: Hoare triple {12019#false} ~cond := #in~cond; {12019#false} is VALID [2022-04-08 10:07:04,094 INFO L290 TraceCheckUtils]: 25: Hoare triple {12019#false} assume 0 == ~cond; {12019#false} is VALID [2022-04-08 10:07:04,094 INFO L290 TraceCheckUtils]: 26: Hoare triple {12019#false} assume !false; {12019#false} is VALID [2022-04-08 10:07:04,094 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 10:07:04,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:04,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {12019#false} assume !false; {12019#false} is VALID [2022-04-08 10:07:04,190 INFO L290 TraceCheckUtils]: 25: Hoare triple {12019#false} assume 0 == ~cond; {12019#false} is VALID [2022-04-08 10:07:04,190 INFO L290 TraceCheckUtils]: 24: Hoare triple {12019#false} ~cond := #in~cond; {12019#false} is VALID [2022-04-08 10:07:04,190 INFO L272 TraceCheckUtils]: 23: Hoare triple {12019#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {12019#false} is VALID [2022-04-08 10:07:04,190 INFO L290 TraceCheckUtils]: 22: Hoare triple {12019#false} assume !(~z~0 % 4294967296 > 0); {12019#false} is VALID [2022-04-08 10:07:04,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {12019#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12019#false} is VALID [2022-04-08 10:07:04,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {12019#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12019#false} is VALID [2022-04-08 10:07:04,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {12019#false} assume !(~x~0 % 4294967296 > 0); {12019#false} is VALID [2022-04-08 10:07:04,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12019#false} is VALID [2022-04-08 10:07:04,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {12024#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:04,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12024#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:04,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:04,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:04,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:04,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:04,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {12024#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12025#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:04,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12024#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:04,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:04,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {12018#true} assume !(~x~0 % 4294967296 > 0); {12023#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:04,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {12018#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12018#true} is VALID [2022-04-08 10:07:04,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {12018#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12018#true} is VALID [2022-04-08 10:07:04,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {12018#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12018#true} is VALID [2022-04-08 10:07:04,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {12018#true} call #t~ret15 := main(); {12018#true} is VALID [2022-04-08 10:07:04,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12018#true} {12018#true} #83#return; {12018#true} is VALID [2022-04-08 10:07:04,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {12018#true} assume true; {12018#true} is VALID [2022-04-08 10:07:04,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {12018#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12018#true} is VALID [2022-04-08 10:07:04,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {12018#true} call ULTIMATE.init(); {12018#true} is VALID [2022-04-08 10:07:04,196 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 10:07:04,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175130385] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:04,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:04,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-04-08 10:07:04,197 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:04,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [43440975] [2022-04-08 10:07:04,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [43440975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:04,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:04,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:07:04,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266315475] [2022-04-08 10:07:04,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:04,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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 27 [2022-04-08 10:07:04,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:04,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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-08 10:07:04,215 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-08 10:07:04,215 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:07:04,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:04,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:07:04,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 10:07:04,215 INFO L87 Difference]: Start difference. First operand 100 states and 125 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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-08 10:07:04,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:04,635 INFO L93 Difference]: Finished difference Result 111 states and 138 transitions. [2022-04-08 10:07:04,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:07:04,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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 27 [2022-04-08 10:07:04,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:04,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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-08 10:07:04,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-08 10:07:04,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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-08 10:07:04,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-08 10:07:04,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-08 10:07:04,673 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-08 10:07:04,674 INFO L225 Difference]: With dead ends: 111 [2022-04-08 10:07:04,674 INFO L226 Difference]: Without dead ends: 90 [2022-04-08 10:07:04,674 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-08 10:07:04,674 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:04,675 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 39 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:07:04,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-08 10:07:04,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2022-04-08 10:07:04,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:04,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 88 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 83 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:04,912 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 88 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 83 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:04,912 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 88 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 83 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:04,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:04,913 INFO L93 Difference]: Finished difference Result 90 states and 113 transitions. [2022-04-08 10:07:04,913 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2022-04-08 10:07:04,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:04,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:04,914 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 83 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 90 states. [2022-04-08 10:07:04,914 INFO L87 Difference]: Start difference. First operand has 88 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 83 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 90 states. [2022-04-08 10:07:04,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:04,915 INFO L93 Difference]: Finished difference Result 90 states and 113 transitions. [2022-04-08 10:07:04,915 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2022-04-08 10:07:04,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:04,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:04,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:04,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:04,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 83 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:04,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 111 transitions. [2022-04-08 10:07:04,917 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 111 transitions. Word has length 27 [2022-04-08 10:07:04,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:04,917 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 111 transitions. [2022-04-08 10:07:04,917 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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-08 10:07:04,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 111 transitions. [2022-04-08 10:07:05,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:05,110 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 111 transitions. [2022-04-08 10:07:05,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 10:07:05,110 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:05,110 INFO L499 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:05,126 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-08 10:07:05,311 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:05,311 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:05,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:05,311 INFO L85 PathProgramCache]: Analyzing trace with hash 815691967, now seen corresponding path program 17 times [2022-04-08 10:07:05,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:05,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1595867871] [2022-04-08 10:07:05,313 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:05,313 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:05,313 INFO L85 PathProgramCache]: Analyzing trace with hash 815691967, now seen corresponding path program 18 times [2022-04-08 10:07:05,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:05,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771553968] [2022-04-08 10:07:05,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:05,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:05,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:05,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {12788#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12772#true} is VALID [2022-04-08 10:07:05,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {12772#true} assume true; {12772#true} is VALID [2022-04-08 10:07:05,474 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12772#true} {12772#true} #83#return; {12772#true} is VALID [2022-04-08 10:07:05,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {12772#true} call ULTIMATE.init(); {12788#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:05,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {12788#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12772#true} is VALID [2022-04-08 10:07:05,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {12772#true} assume true; {12772#true} is VALID [2022-04-08 10:07:05,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12772#true} {12772#true} #83#return; {12772#true} is VALID [2022-04-08 10:07:05,477 INFO L272 TraceCheckUtils]: 4: Hoare triple {12772#true} call #t~ret15 := main(); {12772#true} is VALID [2022-04-08 10:07:05,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {12772#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12777#(= main_~y~0 0)} is VALID [2022-04-08 10:07:05,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {12777#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12778#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:05,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {12778#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12779#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:05,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {12779#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12780#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:05,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {12780#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12781#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:05,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {12781#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12782#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:05,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {12782#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12783#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:05,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {12783#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12784#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:05,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {12784#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12785#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:05,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {12785#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {12785#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:05,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {12785#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {12786#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:07:05,483 INFO L290 TraceCheckUtils]: 16: Hoare triple {12786#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12787#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:05,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {12787#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {12773#false} is VALID [2022-04-08 10:07:05,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {12773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12773#false} is VALID [2022-04-08 10:07:05,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {12773#false} assume !(~y~0 % 4294967296 > 0); {12773#false} is VALID [2022-04-08 10:07:05,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {12773#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12773#false} is VALID [2022-04-08 10:07:05,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {12773#false} assume !(~x~0 % 4294967296 > 0); {12773#false} is VALID [2022-04-08 10:07:05,484 INFO L290 TraceCheckUtils]: 22: Hoare triple {12773#false} assume !(~z~0 % 4294967296 > 0); {12773#false} is VALID [2022-04-08 10:07:05,484 INFO L272 TraceCheckUtils]: 23: Hoare triple {12773#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {12773#false} is VALID [2022-04-08 10:07:05,484 INFO L290 TraceCheckUtils]: 24: Hoare triple {12773#false} ~cond := #in~cond; {12773#false} is VALID [2022-04-08 10:07:05,484 INFO L290 TraceCheckUtils]: 25: Hoare triple {12773#false} assume 0 == ~cond; {12773#false} is VALID [2022-04-08 10:07:05,484 INFO L290 TraceCheckUtils]: 26: Hoare triple {12773#false} assume !false; {12773#false} is VALID [2022-04-08 10:07:05,487 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:07:05,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:05,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771553968] [2022-04-08 10:07:05,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771553968] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:05,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882066025] [2022-04-08 10:07:05,487 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:07:05,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:05,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:05,488 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-08 10:07:05,489 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-08 10:07:05,521 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:07:05,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:05,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 10:07:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:05,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:05,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {12772#true} call ULTIMATE.init(); {12772#true} is VALID [2022-04-08 10:07:05,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {12772#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12772#true} is VALID [2022-04-08 10:07:05,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {12772#true} assume true; {12772#true} is VALID [2022-04-08 10:07:05,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12772#true} {12772#true} #83#return; {12772#true} is VALID [2022-04-08 10:07:05,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {12772#true} call #t~ret15 := main(); {12772#true} is VALID [2022-04-08 10:07:05,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {12772#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12772#true} is VALID [2022-04-08 10:07:05,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-08 10:07:05,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-08 10:07:05,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-08 10:07:05,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-08 10:07:05,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-08 10:07:05,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-08 10:07:05,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-08 10:07:05,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-08 10:07:05,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {12772#true} assume !(~x~0 % 4294967296 > 0); {12772#true} is VALID [2022-04-08 10:07:05,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {12772#true} ~z~0 := ~y~0; {12837#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:07:05,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {12837#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12841#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:07:05,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {12841#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {12841#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:07:05,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {12841#(= main_~y~0 (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12848#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-08 10:07:05,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {12848#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {12848#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-08 10:07:05,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {12848#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12837#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:07:05,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {12837#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {12837#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:07:05,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {12837#(= main_~z~0 main_~y~0)} assume !(~z~0 % 4294967296 > 0); {12861#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:07:05,777 INFO L272 TraceCheckUtils]: 23: Hoare triple {12861#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {12865#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:07:05,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {12865#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12869#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:07:05,778 INFO L290 TraceCheckUtils]: 25: Hoare triple {12869#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12773#false} is VALID [2022-04-08 10:07:05,778 INFO L290 TraceCheckUtils]: 26: Hoare triple {12773#false} assume !false; {12773#false} is VALID [2022-04-08 10:07:05,778 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:07:05,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:06,035 INFO L290 TraceCheckUtils]: 26: Hoare triple {12773#false} assume !false; {12773#false} is VALID [2022-04-08 10:07:06,036 INFO L290 TraceCheckUtils]: 25: Hoare triple {12869#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12773#false} is VALID [2022-04-08 10:07:06,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {12865#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12869#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:07:06,037 INFO L272 TraceCheckUtils]: 23: Hoare triple {12861#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {12865#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:07:06,038 INFO L290 TraceCheckUtils]: 22: Hoare triple {12888#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {12861#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:07:06,038 INFO L290 TraceCheckUtils]: 21: Hoare triple {12888#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {12888#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:07:06,039 INFO L290 TraceCheckUtils]: 20: Hoare triple {12895#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12888#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:07:06,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {12895#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {12895#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-08 10:07:06,041 INFO L290 TraceCheckUtils]: 18: Hoare triple {12902#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12895#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-08 10:07:06,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {12902#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {12902#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-08 10:07:06,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {12888#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12902#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-08 10:07:06,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {12772#true} ~z~0 := ~y~0; {12888#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:07:06,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {12772#true} assume !(~x~0 % 4294967296 > 0); {12772#true} is VALID [2022-04-08 10:07:06,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-08 10:07:06,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-08 10:07:06,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-08 10:07:06,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-08 10:07:06,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-08 10:07:06,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-08 10:07:06,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-08 10:07:06,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {12772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12772#true} is VALID [2022-04-08 10:07:06,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {12772#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12772#true} is VALID [2022-04-08 10:07:06,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {12772#true} call #t~ret15 := main(); {12772#true} is VALID [2022-04-08 10:07:06,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12772#true} {12772#true} #83#return; {12772#true} is VALID [2022-04-08 10:07:06,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {12772#true} assume true; {12772#true} is VALID [2022-04-08 10:07:06,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {12772#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12772#true} is VALID [2022-04-08 10:07:06,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {12772#true} call ULTIMATE.init(); {12772#true} is VALID [2022-04-08 10:07:06,044 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:07:06,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882066025] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:06,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:06,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 23 [2022-04-08 10:07:06,045 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:06,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1595867871] [2022-04-08 10:07:06,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1595867871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:06,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:06,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:07:06,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235212542] [2022-04-08 10:07:06,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:06,045 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-08 10:07:06,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:06,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-08 10:07:06,067 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-08 10:07:06,067 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:07:06,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:06,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:07:06,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2022-04-08 10:07:06,068 INFO L87 Difference]: Start difference. First operand 88 states and 111 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-08 10:07:08,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:08,641 INFO L93 Difference]: Finished difference Result 198 states and 273 transitions. [2022-04-08 10:07:08,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 10:07:08,641 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-08 10:07:08,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:08,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-08 10:07:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 130 transitions. [2022-04-08 10:07:08,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-08 10:07:08,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 130 transitions. [2022-04-08 10:07:08,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 130 transitions. [2022-04-08 10:07:08,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:08,759 INFO L225 Difference]: With dead ends: 198 [2022-04-08 10:07:08,759 INFO L226 Difference]: Without dead ends: 182 [2022-04-08 10:07:08,760 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=1066, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 10:07:08,760 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 85 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:08,760 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 111 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:07:08,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-08 10:07:09,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 96. [2022-04-08 10:07:09,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:09,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:09,013 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:09,014 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:09,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:09,016 INFO L93 Difference]: Finished difference Result 182 states and 235 transitions. [2022-04-08 10:07:09,016 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 235 transitions. [2022-04-08 10:07:09,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:09,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:09,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 182 states. [2022-04-08 10:07:09,017 INFO L87 Difference]: Start difference. First operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 182 states. [2022-04-08 10:07:09,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:09,020 INFO L93 Difference]: Finished difference Result 182 states and 235 transitions. [2022-04-08 10:07:09,020 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 235 transitions. [2022-04-08 10:07:09,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:09,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:09,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:09,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:09,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:09,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 122 transitions. [2022-04-08 10:07:09,022 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 122 transitions. Word has length 27 [2022-04-08 10:07:09,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:09,023 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 122 transitions. [2022-04-08 10:07:09,023 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-08 10:07:09,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 122 transitions. [2022-04-08 10:07:09,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:09,221 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 122 transitions. [2022-04-08 10:07:09,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:07:09,221 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:09,221 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:09,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:09,427 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,SelfDestructingSolverStorable24 [2022-04-08 10:07:09,427 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:09,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:09,428 INFO L85 PathProgramCache]: Analyzing trace with hash 349794051, now seen corresponding path program 9 times [2022-04-08 10:07:09,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:09,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1288566480] [2022-04-08 10:07:09,430 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:09,430 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:09,430 INFO L85 PathProgramCache]: Analyzing trace with hash 349794051, now seen corresponding path program 10 times [2022-04-08 10:07:09,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:09,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160478669] [2022-04-08 10:07:09,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:09,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:09,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:09,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:09,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {13946#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13935#true} is VALID [2022-04-08 10:07:09,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {13935#true} assume true; {13935#true} is VALID [2022-04-08 10:07:09,543 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13935#true} {13935#true} #83#return; {13935#true} is VALID [2022-04-08 10:07:09,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {13935#true} call ULTIMATE.init(); {13946#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:09,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {13946#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13935#true} is VALID [2022-04-08 10:07:09,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {13935#true} assume true; {13935#true} is VALID [2022-04-08 10:07:09,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13935#true} {13935#true} #83#return; {13935#true} is VALID [2022-04-08 10:07:09,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {13935#true} call #t~ret15 := main(); {13935#true} is VALID [2022-04-08 10:07:09,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {13935#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13935#true} is VALID [2022-04-08 10:07:09,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {13935#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13940#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:09,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {13940#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13941#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-08 10:07:09,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {13941#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13942#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:07:09,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {13942#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {13942#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:07:09,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {13942#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {13942#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:07:09,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {13942#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13943#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-08 10:07:09,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {13943#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13944#(<= (+ 2 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:07:09,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {13944#(<= (+ 2 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13945#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:09,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {13945#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {13945#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:09,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {13945#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13945#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:09,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {13945#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13945#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:09,554 INFO L290 TraceCheckUtils]: 17: Hoare triple {13945#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13945#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:09,554 INFO L290 TraceCheckUtils]: 18: Hoare triple {13945#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {13945#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:09,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {13945#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {13936#false} is VALID [2022-04-08 10:07:09,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {13936#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13936#false} is VALID [2022-04-08 10:07:09,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {13936#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13936#false} is VALID [2022-04-08 10:07:09,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {13936#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13936#false} is VALID [2022-04-08 10:07:09,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {13936#false} assume !(~z~0 % 4294967296 > 0); {13936#false} is VALID [2022-04-08 10:07:09,555 INFO L272 TraceCheckUtils]: 24: Hoare triple {13936#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {13936#false} is VALID [2022-04-08 10:07:09,555 INFO L290 TraceCheckUtils]: 25: Hoare triple {13936#false} ~cond := #in~cond; {13936#false} is VALID [2022-04-08 10:07:09,555 INFO L290 TraceCheckUtils]: 26: Hoare triple {13936#false} assume 0 == ~cond; {13936#false} is VALID [2022-04-08 10:07:09,555 INFO L290 TraceCheckUtils]: 27: Hoare triple {13936#false} assume !false; {13936#false} is VALID [2022-04-08 10:07:09,555 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 10:07:09,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:09,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160478669] [2022-04-08 10:07:09,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160478669] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:09,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300524045] [2022-04-08 10:07:09,556 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:07:09,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:09,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:09,560 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-08 10:07:09,595 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-08 10:07:09,609 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:07:09,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:09,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 10:07:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:09,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:09,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {13935#true} call ULTIMATE.init(); {13935#true} is VALID [2022-04-08 10:07:09,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {13935#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13935#true} is VALID [2022-04-08 10:07:09,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {13935#true} assume true; {13935#true} is VALID [2022-04-08 10:07:09,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13935#true} {13935#true} #83#return; {13935#true} is VALID [2022-04-08 10:07:09,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {13935#true} call #t~ret15 := main(); {13935#true} is VALID [2022-04-08 10:07:09,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {13935#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13935#true} is VALID [2022-04-08 10:07:09,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {13935#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13940#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:09,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {13940#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13971#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:07:09,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {13971#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13975#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:09,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {13975#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {13975#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:09,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {13975#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} ~z~0 := ~y~0; {13975#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:09,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {13975#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13971#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:07:09,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {13971#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13940#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:09,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {13940#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:09,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:09,987 INFO L290 TraceCheckUtils]: 15: Hoare triple {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:09,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:09,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:09,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:09,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {13936#false} is VALID [2022-04-08 10:07:09,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {13936#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13936#false} is VALID [2022-04-08 10:07:09,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {13936#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13936#false} is VALID [2022-04-08 10:07:09,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {13936#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13936#false} is VALID [2022-04-08 10:07:09,989 INFO L290 TraceCheckUtils]: 23: Hoare triple {13936#false} assume !(~z~0 % 4294967296 > 0); {13936#false} is VALID [2022-04-08 10:07:09,989 INFO L272 TraceCheckUtils]: 24: Hoare triple {13936#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {13936#false} is VALID [2022-04-08 10:07:09,989 INFO L290 TraceCheckUtils]: 25: Hoare triple {13936#false} ~cond := #in~cond; {13936#false} is VALID [2022-04-08 10:07:09,989 INFO L290 TraceCheckUtils]: 26: Hoare triple {13936#false} assume 0 == ~cond; {13936#false} is VALID [2022-04-08 10:07:09,989 INFO L290 TraceCheckUtils]: 27: Hoare triple {13936#false} assume !false; {13936#false} is VALID [2022-04-08 10:07:09,989 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 10:07:09,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:10,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {13936#false} assume !false; {13936#false} is VALID [2022-04-08 10:07:10,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {13936#false} assume 0 == ~cond; {13936#false} is VALID [2022-04-08 10:07:10,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {13936#false} ~cond := #in~cond; {13936#false} is VALID [2022-04-08 10:07:10,220 INFO L272 TraceCheckUtils]: 24: Hoare triple {13936#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {13936#false} is VALID [2022-04-08 10:07:10,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {13936#false} assume !(~z~0 % 4294967296 > 0); {13936#false} is VALID [2022-04-08 10:07:10,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {13936#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13936#false} is VALID [2022-04-08 10:07:10,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {13936#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13936#false} is VALID [2022-04-08 10:07:10,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {13936#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13936#false} is VALID [2022-04-08 10:07:10,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {13936#false} is VALID [2022-04-08 10:07:10,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:10,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:10,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:10,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:10,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:10,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {13940#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13991#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:10,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {13971#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13940#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:10,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {13975#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13971#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:07:10,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {13975#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} ~z~0 := ~y~0; {13975#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:10,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {13975#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {13975#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:10,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {13971#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13975#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:10,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {13940#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13971#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:07:10,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {13935#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13940#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:10,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {13935#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13935#true} is VALID [2022-04-08 10:07:10,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {13935#true} call #t~ret15 := main(); {13935#true} is VALID [2022-04-08 10:07:10,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13935#true} {13935#true} #83#return; {13935#true} is VALID [2022-04-08 10:07:10,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {13935#true} assume true; {13935#true} is VALID [2022-04-08 10:07:10,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {13935#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13935#true} is VALID [2022-04-08 10:07:10,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {13935#true} call ULTIMATE.init(); {13935#true} is VALID [2022-04-08 10:07:10,234 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 10:07:10,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300524045] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:10,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:10,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 12 [2022-04-08 10:07:10,235 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:10,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1288566480] [2022-04-08 10:07:10,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1288566480] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:10,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:10,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:07:10,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675305568] [2022-04-08 10:07:10,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:10,235 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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 28 [2022-04-08 10:07:10,235 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:10,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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-08 10:07:10,254 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-08 10:07:10,254 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:07:10,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:10,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:07:10,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 10:07:10,255 INFO L87 Difference]: Start difference. First operand 96 states and 122 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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-08 10:07:10,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:10,978 INFO L93 Difference]: Finished difference Result 132 states and 173 transitions. [2022-04-08 10:07:10,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:07:10,978 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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 28 [2022-04-08 10:07:10,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:10,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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-08 10:07:10,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2022-04-08 10:07:10,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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-08 10:07:10,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2022-04-08 10:07:10,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 55 transitions. [2022-04-08 10:07:11,034 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-08 10:07:11,036 INFO L225 Difference]: With dead ends: 132 [2022-04-08 10:07:11,036 INFO L226 Difference]: Without dead ends: 121 [2022-04-08 10:07:11,036 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:07:11,037 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 43 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:11,037 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 40 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:07:11,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-08 10:07:11,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2022-04-08 10:07:11,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:11,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 119 states, 114 states have (on average 1.2982456140350878) internal successors, (148), 114 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:11,417 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 119 states, 114 states have (on average 1.2982456140350878) internal successors, (148), 114 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:11,417 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 119 states, 114 states have (on average 1.2982456140350878) internal successors, (148), 114 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:11,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:11,419 INFO L93 Difference]: Finished difference Result 121 states and 156 transitions. [2022-04-08 10:07:11,419 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 156 transitions. [2022-04-08 10:07:11,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:11,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:11,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 114 states have (on average 1.2982456140350878) internal successors, (148), 114 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 121 states. [2022-04-08 10:07:11,420 INFO L87 Difference]: Start difference. First operand has 119 states, 114 states have (on average 1.2982456140350878) internal successors, (148), 114 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 121 states. [2022-04-08 10:07:11,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:11,422 INFO L93 Difference]: Finished difference Result 121 states and 156 transitions. [2022-04-08 10:07:11,422 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 156 transitions. [2022-04-08 10:07:11,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:11,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:11,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:11,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:11,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.2982456140350878) internal successors, (148), 114 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:11,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 152 transitions. [2022-04-08 10:07:11,424 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 152 transitions. Word has length 28 [2022-04-08 10:07:11,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:11,424 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 152 transitions. [2022-04-08 10:07:11,425 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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-08 10:07:11,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 152 transitions. [2022-04-08 10:07:11,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:11,753 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 152 transitions. [2022-04-08 10:07:11,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:07:11,753 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:11,754 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:11,769 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-08 10:07:11,955 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,SelfDestructingSolverStorable25 [2022-04-08 10:07:11,955 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:11,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:11,956 INFO L85 PathProgramCache]: Analyzing trace with hash -173294718, now seen corresponding path program 19 times [2022-04-08 10:07:11,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:11,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1837811705] [2022-04-08 10:07:11,958 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:11,958 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:11,958 INFO L85 PathProgramCache]: Analyzing trace with hash -173294718, now seen corresponding path program 20 times [2022-04-08 10:07:11,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:11,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692331701] [2022-04-08 10:07:11,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:11,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:12,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:12,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {14886#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14873#true} is VALID [2022-04-08 10:07:12,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {14873#true} assume true; {14873#true} is VALID [2022-04-08 10:07:12,096 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14873#true} {14873#true} #83#return; {14873#true} is VALID [2022-04-08 10:07:12,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {14873#true} call ULTIMATE.init(); {14886#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:12,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {14886#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14873#true} is VALID [2022-04-08 10:07:12,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {14873#true} assume true; {14873#true} is VALID [2022-04-08 10:07:12,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14873#true} {14873#true} #83#return; {14873#true} is VALID [2022-04-08 10:07:12,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {14873#true} call #t~ret15 := main(); {14873#true} is VALID [2022-04-08 10:07:12,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {14873#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14878#(= main_~y~0 0)} is VALID [2022-04-08 10:07:12,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {14878#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14879#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:12,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {14879#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14880#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:12,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {14880#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14881#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:12,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {14881#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14882#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:12,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {14882#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {14882#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:12,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {14882#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {14883#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:07:12,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {14883#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14884#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:07:12,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {14884#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14885#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:07:12,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {14885#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {14874#false} is VALID [2022-04-08 10:07:12,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {14874#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14874#false} is VALID [2022-04-08 10:07:12,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {14874#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14874#false} is VALID [2022-04-08 10:07:12,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {14874#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14874#false} is VALID [2022-04-08 10:07:12,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {14874#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14874#false} is VALID [2022-04-08 10:07:12,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {14874#false} assume !(~y~0 % 4294967296 > 0); {14874#false} is VALID [2022-04-08 10:07:12,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {14874#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14874#false} is VALID [2022-04-08 10:07:12,104 INFO L290 TraceCheckUtils]: 21: Hoare triple {14874#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14874#false} is VALID [2022-04-08 10:07:12,104 INFO L290 TraceCheckUtils]: 22: Hoare triple {14874#false} assume !(~x~0 % 4294967296 > 0); {14874#false} is VALID [2022-04-08 10:07:12,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {14874#false} assume !(~z~0 % 4294967296 > 0); {14874#false} is VALID [2022-04-08 10:07:12,104 INFO L272 TraceCheckUtils]: 24: Hoare triple {14874#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {14874#false} is VALID [2022-04-08 10:07:12,104 INFO L290 TraceCheckUtils]: 25: Hoare triple {14874#false} ~cond := #in~cond; {14874#false} is VALID [2022-04-08 10:07:12,104 INFO L290 TraceCheckUtils]: 26: Hoare triple {14874#false} assume 0 == ~cond; {14874#false} is VALID [2022-04-08 10:07:12,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {14874#false} assume !false; {14874#false} is VALID [2022-04-08 10:07:12,105 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-08 10:07:12,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:12,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692331701] [2022-04-08 10:07:12,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692331701] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:12,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898321971] [2022-04-08 10:07:12,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:07:12,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:12,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:12,107 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-08 10:07:12,130 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-08 10:07:12,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:07:12,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:12,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-08 10:07:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:12,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:12,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {14873#true} call ULTIMATE.init(); {14873#true} is VALID [2022-04-08 10:07:12,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {14873#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14873#true} is VALID [2022-04-08 10:07:12,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {14873#true} assume true; {14873#true} is VALID [2022-04-08 10:07:12,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14873#true} {14873#true} #83#return; {14873#true} is VALID [2022-04-08 10:07:12,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {14873#true} call #t~ret15 := main(); {14873#true} is VALID [2022-04-08 10:07:12,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {14873#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14878#(= main_~y~0 0)} is VALID [2022-04-08 10:07:12,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {14878#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14879#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:12,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {14879#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14880#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:12,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {14880#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14881#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:12,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {14881#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14882#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:12,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {14882#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {14882#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:12,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {14882#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {14923#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:12,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {14923#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14927#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:07:12,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {14927#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14931#(and (<= main_~y~0 4) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:12,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {14931#(and (<= main_~y~0 4) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 4 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {14874#false} is VALID [2022-04-08 10:07:12,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {14874#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14874#false} is VALID [2022-04-08 10:07:12,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {14874#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14874#false} is VALID [2022-04-08 10:07:12,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {14874#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14874#false} is VALID [2022-04-08 10:07:12,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {14874#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14874#false} is VALID [2022-04-08 10:07:12,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {14874#false} assume !(~y~0 % 4294967296 > 0); {14874#false} is VALID [2022-04-08 10:07:12,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {14874#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14874#false} is VALID [2022-04-08 10:07:12,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {14874#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14874#false} is VALID [2022-04-08 10:07:12,314 INFO L290 TraceCheckUtils]: 22: Hoare triple {14874#false} assume !(~x~0 % 4294967296 > 0); {14874#false} is VALID [2022-04-08 10:07:12,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {14874#false} assume !(~z~0 % 4294967296 > 0); {14874#false} is VALID [2022-04-08 10:07:12,314 INFO L272 TraceCheckUtils]: 24: Hoare triple {14874#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {14874#false} is VALID [2022-04-08 10:07:12,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {14874#false} ~cond := #in~cond; {14874#false} is VALID [2022-04-08 10:07:12,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {14874#false} assume 0 == ~cond; {14874#false} is VALID [2022-04-08 10:07:12,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {14874#false} assume !false; {14874#false} is VALID [2022-04-08 10:07:12,314 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-08 10:07:12,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:12,587 INFO L290 TraceCheckUtils]: 27: Hoare triple {14874#false} assume !false; {14874#false} is VALID [2022-04-08 10:07:12,587 INFO L290 TraceCheckUtils]: 26: Hoare triple {14977#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {14874#false} is VALID [2022-04-08 10:07:12,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {14981#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14977#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:07:12,588 INFO L272 TraceCheckUtils]: 24: Hoare triple {14985#(= (mod main_~y~0 4294967296) 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {14981#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:07:12,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {14985#(= (mod main_~y~0 4294967296) 0)} assume !(~z~0 % 4294967296 > 0); {14985#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-08 10:07:12,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {14985#(= (mod main_~y~0 4294967296) 0)} assume !(~x~0 % 4294967296 > 0); {14985#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-08 10:07:12,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {14995#(= (mod (+ main_~y~0 1) 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14985#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-08 10:07:12,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {14999#(= (mod (+ main_~y~0 2) 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14995#(= (mod (+ main_~y~0 1) 4294967296) 0)} is VALID [2022-04-08 10:07:12,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {14999#(= (mod (+ main_~y~0 2) 4294967296) 0)} assume !(~y~0 % 4294967296 > 0); {14999#(= (mod (+ main_~y~0 2) 4294967296) 0)} is VALID [2022-04-08 10:07:12,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {14995#(= (mod (+ main_~y~0 1) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14999#(= (mod (+ main_~y~0 2) 4294967296) 0)} is VALID [2022-04-08 10:07:12,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {14985#(= (mod main_~y~0 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14995#(= (mod (+ main_~y~0 1) 4294967296) 0)} is VALID [2022-04-08 10:07:12,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {15012#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14985#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-08 10:07:12,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {15016#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15012#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-08 10:07:12,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {15020#(or (< 0 (mod main_~z~0 4294967296)) (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {15016#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} is VALID [2022-04-08 10:07:12,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {15024#(or (= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15020#(or (< 0 (mod main_~z~0 4294967296)) (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-08 10:07:12,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {15028#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15024#(or (= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:07:12,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {14873#true} ~z~0 := ~y~0; {15028#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-08 10:07:12,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {14873#true} assume !(~x~0 % 4294967296 > 0); {14873#true} is VALID [2022-04-08 10:07:12,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {14873#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14873#true} is VALID [2022-04-08 10:07:12,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {14873#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14873#true} is VALID [2022-04-08 10:07:12,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {14873#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14873#true} is VALID [2022-04-08 10:07:12,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {14873#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14873#true} is VALID [2022-04-08 10:07:12,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {14873#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14873#true} is VALID [2022-04-08 10:07:12,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {14873#true} call #t~ret15 := main(); {14873#true} is VALID [2022-04-08 10:07:12,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14873#true} {14873#true} #83#return; {14873#true} is VALID [2022-04-08 10:07:12,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {14873#true} assume true; {14873#true} is VALID [2022-04-08 10:07:12,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {14873#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14873#true} is VALID [2022-04-08 10:07:12,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {14873#true} call ULTIMATE.init(); {14873#true} is VALID [2022-04-08 10:07:12,596 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:07:12,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898321971] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:12,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:12,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 24 [2022-04-08 10:07:12,596 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:12,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1837811705] [2022-04-08 10:07:12,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1837811705] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:12,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:12,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:07:12,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640561014] [2022-04-08 10:07:12,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:12,597 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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 28 [2022-04-08 10:07:12,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:12,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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-08 10:07:12,611 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-08 10:07:12,612 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:07:12,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:12,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:07:12,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2022-04-08 10:07:12,612 INFO L87 Difference]: Start difference. First operand 119 states and 152 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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-08 10:07:13,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:13,971 INFO L93 Difference]: Finished difference Result 172 states and 217 transitions. [2022-04-08 10:07:13,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 10:07:13,971 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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 28 [2022-04-08 10:07:13,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:13,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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-08 10:07:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 80 transitions. [2022-04-08 10:07:13,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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-08 10:07:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 80 transitions. [2022-04-08 10:07:13,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 80 transitions. [2022-04-08 10:07:14,053 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-08 10:07:14,055 INFO L225 Difference]: With dead ends: 172 [2022-04-08 10:07:14,055 INFO L226 Difference]: Without dead ends: 158 [2022-04-08 10:07:14,056 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=965, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:07:14,056 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 43 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:14,056 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 72 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:07:14,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-04-08 10:07:14,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 119. [2022-04-08 10:07:14,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:14,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:14,490 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:14,490 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:14,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:14,493 INFO L93 Difference]: Finished difference Result 158 states and 202 transitions. [2022-04-08 10:07:14,493 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 202 transitions. [2022-04-08 10:07:14,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:14,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:14,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 158 states. [2022-04-08 10:07:14,493 INFO L87 Difference]: Start difference. First operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 158 states. [2022-04-08 10:07:14,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:14,496 INFO L93 Difference]: Finished difference Result 158 states and 202 transitions. [2022-04-08 10:07:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 202 transitions. [2022-04-08 10:07:14,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:14,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:14,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:14,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:14,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:14,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 151 transitions. [2022-04-08 10:07:14,498 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 151 transitions. Word has length 28 [2022-04-08 10:07:14,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:14,499 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 151 transitions. [2022-04-08 10:07:14,499 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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-08 10:07:14,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 151 transitions. [2022-04-08 10:07:14,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:14,916 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 151 transitions. [2022-04-08 10:07:14,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:07:14,917 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:14,917 INFO L499 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:14,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-04-08 10:07:15,117 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-08 10:07:15,117 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:15,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:15,118 INFO L85 PathProgramCache]: Analyzing trace with hash -999339630, now seen corresponding path program 21 times [2022-04-08 10:07:15,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:15,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1367364473] [2022-04-08 10:07:15,120 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:15,120 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:15,120 INFO L85 PathProgramCache]: Analyzing trace with hash -999339630, now seen corresponding path program 22 times [2022-04-08 10:07:15,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:15,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189824574] [2022-04-08 10:07:15,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:15,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:15,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:15,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {16002#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15985#true} is VALID [2022-04-08 10:07:15,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {15985#true} assume true; {15985#true} is VALID [2022-04-08 10:07:15,326 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15985#true} {15985#true} #83#return; {15985#true} is VALID [2022-04-08 10:07:15,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {15985#true} call ULTIMATE.init(); {16002#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:15,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {16002#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15985#true} is VALID [2022-04-08 10:07:15,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {15985#true} assume true; {15985#true} is VALID [2022-04-08 10:07:15,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15985#true} {15985#true} #83#return; {15985#true} is VALID [2022-04-08 10:07:15,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {15985#true} call #t~ret15 := main(); {15985#true} is VALID [2022-04-08 10:07:15,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {15985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15990#(= main_~y~0 0)} is VALID [2022-04-08 10:07:15,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {15990#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15991#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:15,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {15991#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15992#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:15,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {15992#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15993#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:15,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {15993#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:15,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {15994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15995#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:15,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {15995#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15996#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:15,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {15996#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15997#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:15,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {15997#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15998#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:15,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {15998#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:15,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {15999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {15999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:15,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {15999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {16000#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:07:15,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {16000#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16001#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:15,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {16001#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {15986#false} is VALID [2022-04-08 10:07:15,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {15986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15986#false} is VALID [2022-04-08 10:07:15,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {15986#false} assume !(~y~0 % 4294967296 > 0); {15986#false} is VALID [2022-04-08 10:07:15,333 INFO L290 TraceCheckUtils]: 21: Hoare triple {15986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15986#false} is VALID [2022-04-08 10:07:15,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {15986#false} assume !(~x~0 % 4294967296 > 0); {15986#false} is VALID [2022-04-08 10:07:15,334 INFO L290 TraceCheckUtils]: 23: Hoare triple {15986#false} assume !(~z~0 % 4294967296 > 0); {15986#false} is VALID [2022-04-08 10:07:15,334 INFO L272 TraceCheckUtils]: 24: Hoare triple {15986#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {15986#false} is VALID [2022-04-08 10:07:15,334 INFO L290 TraceCheckUtils]: 25: Hoare triple {15986#false} ~cond := #in~cond; {15986#false} is VALID [2022-04-08 10:07:15,334 INFO L290 TraceCheckUtils]: 26: Hoare triple {15986#false} assume 0 == ~cond; {15986#false} is VALID [2022-04-08 10:07:15,334 INFO L290 TraceCheckUtils]: 27: Hoare triple {15986#false} assume !false; {15986#false} is VALID [2022-04-08 10:07:15,334 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:07:15,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:15,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189824574] [2022-04-08 10:07:15,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189824574] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:15,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277226271] [2022-04-08 10:07:15,335 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:07:15,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:15,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:15,336 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-08 10:07:15,345 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-08 10:07:15,379 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:07:15,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:15,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 10:07:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:15,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:15,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {15985#true} call ULTIMATE.init(); {15985#true} is VALID [2022-04-08 10:07:15,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {15985#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15985#true} is VALID [2022-04-08 10:07:15,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {15985#true} assume true; {15985#true} is VALID [2022-04-08 10:07:15,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15985#true} {15985#true} #83#return; {15985#true} is VALID [2022-04-08 10:07:15,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {15985#true} call #t~ret15 := main(); {15985#true} is VALID [2022-04-08 10:07:15,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {15985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15990#(= main_~y~0 0)} is VALID [2022-04-08 10:07:15,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {15990#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15991#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:15,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {15991#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15992#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:15,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {15992#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15993#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:15,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {15993#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:15,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {15994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15995#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:15,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {15995#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15996#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:15,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {15996#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15997#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:15,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {15997#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15998#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:15,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {15998#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:15,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {15999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {15999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:15,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {15999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {16000#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:07:15,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {16000#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16057#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:07:15,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {16057#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {15986#false} is VALID [2022-04-08 10:07:15,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {15986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15986#false} is VALID [2022-04-08 10:07:15,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {15986#false} assume !(~y~0 % 4294967296 > 0); {15986#false} is VALID [2022-04-08 10:07:15,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {15986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15986#false} is VALID [2022-04-08 10:07:15,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {15986#false} assume !(~x~0 % 4294967296 > 0); {15986#false} is VALID [2022-04-08 10:07:15,658 INFO L290 TraceCheckUtils]: 23: Hoare triple {15986#false} assume !(~z~0 % 4294967296 > 0); {15986#false} is VALID [2022-04-08 10:07:15,658 INFO L272 TraceCheckUtils]: 24: Hoare triple {15986#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {15986#false} is VALID [2022-04-08 10:07:15,658 INFO L290 TraceCheckUtils]: 25: Hoare triple {15986#false} ~cond := #in~cond; {15986#false} is VALID [2022-04-08 10:07:15,658 INFO L290 TraceCheckUtils]: 26: Hoare triple {15986#false} assume 0 == ~cond; {15986#false} is VALID [2022-04-08 10:07:15,658 INFO L290 TraceCheckUtils]: 27: Hoare triple {15986#false} assume !false; {15986#false} is VALID [2022-04-08 10:07:15,659 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:07:15,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:15,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {15986#false} assume !false; {15986#false} is VALID [2022-04-08 10:07:15,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {15986#false} assume 0 == ~cond; {15986#false} is VALID [2022-04-08 10:07:15,975 INFO L290 TraceCheckUtils]: 25: Hoare triple {15986#false} ~cond := #in~cond; {15986#false} is VALID [2022-04-08 10:07:15,975 INFO L272 TraceCheckUtils]: 24: Hoare triple {15986#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {15986#false} is VALID [2022-04-08 10:07:15,975 INFO L290 TraceCheckUtils]: 23: Hoare triple {15986#false} assume !(~z~0 % 4294967296 > 0); {15986#false} is VALID [2022-04-08 10:07:15,975 INFO L290 TraceCheckUtils]: 22: Hoare triple {15986#false} assume !(~x~0 % 4294967296 > 0); {15986#false} is VALID [2022-04-08 10:07:15,975 INFO L290 TraceCheckUtils]: 21: Hoare triple {15986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15986#false} is VALID [2022-04-08 10:07:15,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {15986#false} assume !(~y~0 % 4294967296 > 0); {15986#false} is VALID [2022-04-08 10:07:15,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {15986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15986#false} is VALID [2022-04-08 10:07:15,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {16115#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {15986#false} is VALID [2022-04-08 10:07:15,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {16119#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16115#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:15,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {16123#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {16119#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:15,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {16123#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {16123#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:15,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {16130#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16123#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:15,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {16134#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16130#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:15,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {16138#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16134#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:15,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {16142#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16138#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:15,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {16146#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16142#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:15,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {16150#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16146#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:15,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {16154#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16150#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:15,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {16158#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16154#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:07:15,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {16162#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16158#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:15,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {15985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16162#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:07:15,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {15985#true} call #t~ret15 := main(); {15985#true} is VALID [2022-04-08 10:07:15,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15985#true} {15985#true} #83#return; {15985#true} is VALID [2022-04-08 10:07:15,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {15985#true} assume true; {15985#true} is VALID [2022-04-08 10:07:15,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {15985#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15985#true} is VALID [2022-04-08 10:07:15,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {15985#true} call ULTIMATE.init(); {15985#true} is VALID [2022-04-08 10:07:15,983 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:07:15,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277226271] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:15,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:15,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-08 10:07:15,984 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:15,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1367364473] [2022-04-08 10:07:15,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1367364473] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:15,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:15,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:07:15,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872857065] [2022-04-08 10:07:15,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:15,984 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 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-08 10:07:15,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:15,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 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-08 10:07:16,001 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-08 10:07:16,001 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:07:16,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:16,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:07:16,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:07:16,002 INFO L87 Difference]: Start difference. First operand 119 states and 151 transitions. Second operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 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-08 10:07:18,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:18,866 INFO L93 Difference]: Finished difference Result 248 states and 345 transitions. [2022-04-08 10:07:18,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 10:07:18,866 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 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-08 10:07:18,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:18,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 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-08 10:07:18,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 142 transitions. [2022-04-08 10:07:18,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 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-08 10:07:18,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 142 transitions. [2022-04-08 10:07:18,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 142 transitions. [2022-04-08 10:07:19,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:19,020 INFO L225 Difference]: With dead ends: 248 [2022-04-08 10:07:19,020 INFO L226 Difference]: Without dead ends: 228 [2022-04-08 10:07:19,021 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=353, Invalid=1287, Unknown=0, NotChecked=0, Total=1640 [2022-04-08 10:07:19,021 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 95 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:19,021 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 117 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:07:19,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-04-08 10:07:19,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 129. [2022-04-08 10:07:19,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:19,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 228 states. Second operand has 129 states, 124 states have (on average 1.2983870967741935) internal successors, (161), 124 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:19,516 INFO L74 IsIncluded]: Start isIncluded. First operand 228 states. Second operand has 129 states, 124 states have (on average 1.2983870967741935) internal successors, (161), 124 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:19,516 INFO L87 Difference]: Start difference. First operand 228 states. Second operand has 129 states, 124 states have (on average 1.2983870967741935) internal successors, (161), 124 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:19,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:19,520 INFO L93 Difference]: Finished difference Result 228 states and 291 transitions. [2022-04-08 10:07:19,521 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 291 transitions. [2022-04-08 10:07:19,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:19,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:19,521 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 124 states have (on average 1.2983870967741935) internal successors, (161), 124 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 228 states. [2022-04-08 10:07:19,521 INFO L87 Difference]: Start difference. First operand has 129 states, 124 states have (on average 1.2983870967741935) internal successors, (161), 124 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 228 states. [2022-04-08 10:07:19,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:19,525 INFO L93 Difference]: Finished difference Result 228 states and 291 transitions. [2022-04-08 10:07:19,525 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 291 transitions. [2022-04-08 10:07:19,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:19,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:19,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:19,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:19,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 124 states have (on average 1.2983870967741935) internal successors, (161), 124 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:19,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 165 transitions. [2022-04-08 10:07:19,528 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 165 transitions. Word has length 28 [2022-04-08 10:07:19,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:19,528 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 165 transitions. [2022-04-08 10:07:19,529 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 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-08 10:07:19,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 129 states and 165 transitions. [2022-04-08 10:07:20,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:20,004 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 165 transitions. [2022-04-08 10:07:20,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 10:07:20,004 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:20,004 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:20,020 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-08 10:07:20,204 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:20,205 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:20,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:20,205 INFO L85 PathProgramCache]: Analyzing trace with hash -409683135, now seen corresponding path program 11 times [2022-04-08 10:07:20,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:20,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [290165720] [2022-04-08 10:07:20,207 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:20,207 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:20,207 INFO L85 PathProgramCache]: Analyzing trace with hash -409683135, now seen corresponding path program 12 times [2022-04-08 10:07:20,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:20,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532583144] [2022-04-08 10:07:20,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:20,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:20,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:20,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {17435#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17419#true} is VALID [2022-04-08 10:07:20,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {17419#true} assume true; {17419#true} is VALID [2022-04-08 10:07:20,410 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17419#true} {17419#true} #83#return; {17419#true} is VALID [2022-04-08 10:07:20,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {17419#true} call ULTIMATE.init(); {17435#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:20,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {17435#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17419#true} is VALID [2022-04-08 10:07:20,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {17419#true} assume true; {17419#true} is VALID [2022-04-08 10:07:20,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17419#true} {17419#true} #83#return; {17419#true} is VALID [2022-04-08 10:07:20,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {17419#true} call #t~ret15 := main(); {17419#true} is VALID [2022-04-08 10:07:20,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {17419#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17424#(= main_~y~0 0)} is VALID [2022-04-08 10:07:20,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {17424#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17425#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:20,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {17425#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17426#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:20,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {17426#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17427#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:20,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {17427#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17428#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:20,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {17428#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {17428#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:20,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {17428#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {17429#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:07:20,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {17429#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17430#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:07:20,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {17430#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17431#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:07:20,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {17431#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17432#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:07:20,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {17432#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17433#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:07:20,416 INFO L290 TraceCheckUtils]: 16: Hoare triple {17433#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {17433#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:07:20,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {17433#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17432#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:07:20,417 INFO L290 TraceCheckUtils]: 18: Hoare triple {17432#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17431#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:07:20,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {17431#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17430#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:07:20,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {17430#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17429#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:07:20,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {17429#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~y~0 % 4294967296 > 0); {17429#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:07:20,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {17429#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~x~0 % 4294967296 > 0); {17429#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:07:20,419 INFO L290 TraceCheckUtils]: 23: Hoare triple {17429#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17434#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:20,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {17434#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {17420#false} is VALID [2022-04-08 10:07:20,420 INFO L272 TraceCheckUtils]: 25: Hoare triple {17420#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {17420#false} is VALID [2022-04-08 10:07:20,420 INFO L290 TraceCheckUtils]: 26: Hoare triple {17420#false} ~cond := #in~cond; {17420#false} is VALID [2022-04-08 10:07:20,420 INFO L290 TraceCheckUtils]: 27: Hoare triple {17420#false} assume 0 == ~cond; {17420#false} is VALID [2022-04-08 10:07:20,420 INFO L290 TraceCheckUtils]: 28: Hoare triple {17420#false} assume !false; {17420#false} is VALID [2022-04-08 10:07:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:20,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:20,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532583144] [2022-04-08 10:07:20,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532583144] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:20,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123333719] [2022-04-08 10:07:20,420 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:07:20,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:20,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:20,421 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-08 10:07:20,422 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-08 10:07:20,467 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:07:20,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:20,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 10:07:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:20,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:20,619 INFO L272 TraceCheckUtils]: 0: Hoare triple {17419#true} call ULTIMATE.init(); {17419#true} is VALID [2022-04-08 10:07:20,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {17419#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17419#true} is VALID [2022-04-08 10:07:20,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {17419#true} assume true; {17419#true} is VALID [2022-04-08 10:07:20,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17419#true} {17419#true} #83#return; {17419#true} is VALID [2022-04-08 10:07:20,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {17419#true} call #t~ret15 := main(); {17419#true} is VALID [2022-04-08 10:07:20,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {17419#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17419#true} is VALID [2022-04-08 10:07:20,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {17419#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17457#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:20,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {17457#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17461#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:20,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {17461#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17465#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:07:20,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {17465#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17469#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:07:20,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {17469#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {17469#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:07:20,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {17469#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {17469#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:07:20,624 INFO L290 TraceCheckUtils]: 12: Hoare triple {17469#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17465#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:07:20,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {17465#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17461#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:20,625 INFO L290 TraceCheckUtils]: 14: Hoare triple {17461#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17457#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:20,626 INFO L290 TraceCheckUtils]: 15: Hoare triple {17457#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17488#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:20,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {17488#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {17488#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:20,626 INFO L290 TraceCheckUtils]: 17: Hoare triple {17488#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17488#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:20,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {17488#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17488#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:20,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {17488#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17488#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:20,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {17488#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17488#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:20,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {17488#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {17488#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:20,628 INFO L290 TraceCheckUtils]: 22: Hoare triple {17488#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {17420#false} is VALID [2022-04-08 10:07:20,628 INFO L290 TraceCheckUtils]: 23: Hoare triple {17420#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17420#false} is VALID [2022-04-08 10:07:20,628 INFO L290 TraceCheckUtils]: 24: Hoare triple {17420#false} assume !(~z~0 % 4294967296 > 0); {17420#false} is VALID [2022-04-08 10:07:20,628 INFO L272 TraceCheckUtils]: 25: Hoare triple {17420#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {17420#false} is VALID [2022-04-08 10:07:20,628 INFO L290 TraceCheckUtils]: 26: Hoare triple {17420#false} ~cond := #in~cond; {17420#false} is VALID [2022-04-08 10:07:20,628 INFO L290 TraceCheckUtils]: 27: Hoare triple {17420#false} assume 0 == ~cond; {17420#false} is VALID [2022-04-08 10:07:20,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {17420#false} assume !false; {17420#false} is VALID [2022-04-08 10:07:20,628 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 10:07:20,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:20,717 INFO L290 TraceCheckUtils]: 28: Hoare triple {17420#false} assume !false; {17420#false} is VALID [2022-04-08 10:07:20,717 INFO L290 TraceCheckUtils]: 27: Hoare triple {17420#false} assume 0 == ~cond; {17420#false} is VALID [2022-04-08 10:07:20,718 INFO L290 TraceCheckUtils]: 26: Hoare triple {17420#false} ~cond := #in~cond; {17420#false} is VALID [2022-04-08 10:07:20,718 INFO L272 TraceCheckUtils]: 25: Hoare triple {17420#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {17420#false} is VALID [2022-04-08 10:07:20,718 INFO L290 TraceCheckUtils]: 24: Hoare triple {17420#false} assume !(~z~0 % 4294967296 > 0); {17420#false} is VALID [2022-04-08 10:07:20,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {17420#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17420#false} is VALID [2022-04-08 10:07:20,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {17488#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {17420#false} is VALID [2022-04-08 10:07:20,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {17488#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {17488#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:20,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {17488#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17488#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:20,719 INFO L290 TraceCheckUtils]: 19: Hoare triple {17488#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17488#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:20,719 INFO L290 TraceCheckUtils]: 18: Hoare triple {17488#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17488#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:20,719 INFO L290 TraceCheckUtils]: 17: Hoare triple {17488#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17488#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:20,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {17488#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {17488#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:20,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {17457#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17488#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:20,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {17461#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17457#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:20,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {17465#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17461#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:20,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {17469#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17465#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:07:20,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {17469#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {17469#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:07:20,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {17469#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {17469#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:07:20,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {17465#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17469#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:07:20,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {17461#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17465#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:07:20,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {17457#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17461#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:20,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {17419#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17457#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:20,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {17419#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17419#true} is VALID [2022-04-08 10:07:20,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {17419#true} call #t~ret15 := main(); {17419#true} is VALID [2022-04-08 10:07:20,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17419#true} {17419#true} #83#return; {17419#true} is VALID [2022-04-08 10:07:20,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {17419#true} assume true; {17419#true} is VALID [2022-04-08 10:07:20,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {17419#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17419#true} is VALID [2022-04-08 10:07:20,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {17419#true} call ULTIMATE.init(); {17419#true} is VALID [2022-04-08 10:07:20,726 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 10:07:20,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123333719] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:20,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:20,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 19 [2022-04-08 10:07:20,726 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:20,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [290165720] [2022-04-08 10:07:20,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [290165720] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:20,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:20,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:07:20,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409330102] [2022-04-08 10:07:20,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:20,727 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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-08 10:07:20,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:20,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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-08 10:07:20,748 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-08 10:07:20,748 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:07:20,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:20,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:07:20,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:07:20,749 INFO L87 Difference]: Start difference. First operand 129 states and 165 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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-08 10:07:23,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:23,105 INFO L93 Difference]: Finished difference Result 196 states and 262 transitions. [2022-04-08 10:07:23,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-08 10:07:23,105 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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-08 10:07:23,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:23,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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-08 10:07:23,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 129 transitions. [2022-04-08 10:07:23,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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-08 10:07:23,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 129 transitions. [2022-04-08 10:07:23,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 129 transitions. [2022-04-08 10:07:23,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:23,225 INFO L225 Difference]: With dead ends: 196 [2022-04-08 10:07:23,226 INFO L226 Difference]: Without dead ends: 173 [2022-04-08 10:07:23,226 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=2499, Unknown=0, NotChecked=0, Total=2756 [2022-04-08 10:07:23,227 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 63 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:23,227 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 74 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:07:23,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-08 10:07:23,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 136. [2022-04-08 10:07:23,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:23,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 136 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 131 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:23,713 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 136 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 131 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:23,713 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 136 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 131 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:23,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:23,716 INFO L93 Difference]: Finished difference Result 173 states and 215 transitions. [2022-04-08 10:07:23,716 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 215 transitions. [2022-04-08 10:07:23,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:23,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:23,717 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 131 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 173 states. [2022-04-08 10:07:23,717 INFO L87 Difference]: Start difference. First operand has 136 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 131 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 173 states. [2022-04-08 10:07:23,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:23,719 INFO L93 Difference]: Finished difference Result 173 states and 215 transitions. [2022-04-08 10:07:23,720 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 215 transitions. [2022-04-08 10:07:23,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:23,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:23,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:23,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:23,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 131 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:23,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 171 transitions. [2022-04-08 10:07:23,723 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 171 transitions. Word has length 29 [2022-04-08 10:07:23,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:23,723 INFO L478 AbstractCegarLoop]: Abstraction has 136 states and 171 transitions. [2022-04-08 10:07:23,723 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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-08 10:07:23,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 171 transitions. [2022-04-08 10:07:24,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:24,288 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 171 transitions. [2022-04-08 10:07:24,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 10:07:24,288 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:24,288 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:24,310 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-08 10:07:24,489 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-08 10:07:24,489 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:24,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:24,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1430744289, now seen corresponding path program 23 times [2022-04-08 10:07:24,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:24,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [414988314] [2022-04-08 10:07:24,492 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:24,492 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:24,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1430744289, now seen corresponding path program 24 times [2022-04-08 10:07:24,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:24,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840761986] [2022-04-08 10:07:24,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:24,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:24,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:24,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {18710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18692#true} is VALID [2022-04-08 10:07:24,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {18692#true} assume true; {18692#true} is VALID [2022-04-08 10:07:24,705 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18692#true} {18692#true} #83#return; {18692#true} is VALID [2022-04-08 10:07:24,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {18692#true} call ULTIMATE.init(); {18710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:24,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {18710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18692#true} is VALID [2022-04-08 10:07:24,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {18692#true} assume true; {18692#true} is VALID [2022-04-08 10:07:24,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18692#true} {18692#true} #83#return; {18692#true} is VALID [2022-04-08 10:07:24,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {18692#true} call #t~ret15 := main(); {18692#true} is VALID [2022-04-08 10:07:24,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {18692#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18697#(= main_~y~0 0)} is VALID [2022-04-08 10:07:24,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {18697#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18698#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:24,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {18698#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18699#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:24,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {18699#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:24,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {18700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18701#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:24,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {18701#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18702#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:24,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {18702#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18703#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:24,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {18703#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18704#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:24,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {18704#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18705#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:24,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {18705#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18706#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:24,713 INFO L290 TraceCheckUtils]: 15: Hoare triple {18706#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18707#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:24,714 INFO L290 TraceCheckUtils]: 16: Hoare triple {18707#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {18707#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:24,714 INFO L290 TraceCheckUtils]: 17: Hoare triple {18707#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {18708#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:07:24,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {18708#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18709#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:24,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {18709#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {18693#false} is VALID [2022-04-08 10:07:24,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {18693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18693#false} is VALID [2022-04-08 10:07:24,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {18693#false} assume !(~y~0 % 4294967296 > 0); {18693#false} is VALID [2022-04-08 10:07:24,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {18693#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {18693#false} is VALID [2022-04-08 10:07:24,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {18693#false} assume !(~x~0 % 4294967296 > 0); {18693#false} is VALID [2022-04-08 10:07:24,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {18693#false} assume !(~z~0 % 4294967296 > 0); {18693#false} is VALID [2022-04-08 10:07:24,716 INFO L272 TraceCheckUtils]: 25: Hoare triple {18693#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {18693#false} is VALID [2022-04-08 10:07:24,716 INFO L290 TraceCheckUtils]: 26: Hoare triple {18693#false} ~cond := #in~cond; {18693#false} is VALID [2022-04-08 10:07:24,716 INFO L290 TraceCheckUtils]: 27: Hoare triple {18693#false} assume 0 == ~cond; {18693#false} is VALID [2022-04-08 10:07:24,716 INFO L290 TraceCheckUtils]: 28: Hoare triple {18693#false} assume !false; {18693#false} is VALID [2022-04-08 10:07:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:07:24,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:24,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840761986] [2022-04-08 10:07:24,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840761986] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:24,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877988784] [2022-04-08 10:07:24,717 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:07:24,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:24,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:24,720 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-08 10:07:24,721 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-08 10:07:24,762 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:07:24,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:24,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 10:07:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:24,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:25,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {18692#true} call ULTIMATE.init(); {18692#true} is VALID [2022-04-08 10:07:25,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {18692#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18692#true} is VALID [2022-04-08 10:07:25,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {18692#true} assume true; {18692#true} is VALID [2022-04-08 10:07:25,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18692#true} {18692#true} #83#return; {18692#true} is VALID [2022-04-08 10:07:25,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {18692#true} call #t~ret15 := main(); {18692#true} is VALID [2022-04-08 10:07:25,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {18692#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18692#true} is VALID [2022-04-08 10:07:25,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-08 10:07:25,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-08 10:07:25,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-08 10:07:25,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-08 10:07:25,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-08 10:07:25,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-08 10:07:25,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-08 10:07:25,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-08 10:07:25,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-08 10:07:25,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-08 10:07:25,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {18692#true} assume !(~x~0 % 4294967296 > 0); {18692#true} is VALID [2022-04-08 10:07:25,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {18692#true} ~z~0 := ~y~0; {18765#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:07:25,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {18765#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18769#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:07:25,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {18769#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {18769#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:07:25,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {18769#(= main_~y~0 (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18776#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-08 10:07:25,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {18776#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {18776#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-08 10:07:25,051 INFO L290 TraceCheckUtils]: 22: Hoare triple {18776#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {18765#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:07:25,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {18765#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {18765#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:07:25,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {18765#(= main_~z~0 main_~y~0)} assume !(~z~0 % 4294967296 > 0); {18789#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:07:25,052 INFO L272 TraceCheckUtils]: 25: Hoare triple {18789#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {18793#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:07:25,052 INFO L290 TraceCheckUtils]: 26: Hoare triple {18793#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18797#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:07:25,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {18797#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18693#false} is VALID [2022-04-08 10:07:25,053 INFO L290 TraceCheckUtils]: 28: Hoare triple {18693#false} assume !false; {18693#false} is VALID [2022-04-08 10:07:25,053 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:07:25,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:25,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {18693#false} assume !false; {18693#false} is VALID [2022-04-08 10:07:25,295 INFO L290 TraceCheckUtils]: 27: Hoare triple {18797#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18693#false} is VALID [2022-04-08 10:07:25,295 INFO L290 TraceCheckUtils]: 26: Hoare triple {18793#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18797#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:07:25,296 INFO L272 TraceCheckUtils]: 25: Hoare triple {18789#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {18793#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:07:25,297 INFO L290 TraceCheckUtils]: 24: Hoare triple {18816#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {18789#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:07:25,297 INFO L290 TraceCheckUtils]: 23: Hoare triple {18816#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {18816#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:07:25,298 INFO L290 TraceCheckUtils]: 22: Hoare triple {18823#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {18816#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:07:25,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {18823#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {18823#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-08 10:07:25,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {18830#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18823#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-08 10:07:25,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {18830#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {18830#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-08 10:07:25,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {18816#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18830#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-08 10:07:25,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {18692#true} ~z~0 := ~y~0; {18816#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:07:25,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {18692#true} assume !(~x~0 % 4294967296 > 0); {18692#true} is VALID [2022-04-08 10:07:25,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-08 10:07:25,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-08 10:07:25,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-08 10:07:25,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-08 10:07:25,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-08 10:07:25,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-08 10:07:25,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-08 10:07:25,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-08 10:07:25,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-08 10:07:25,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {18692#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18692#true} is VALID [2022-04-08 10:07:25,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {18692#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18692#true} is VALID [2022-04-08 10:07:25,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {18692#true} call #t~ret15 := main(); {18692#true} is VALID [2022-04-08 10:07:25,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18692#true} {18692#true} #83#return; {18692#true} is VALID [2022-04-08 10:07:25,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {18692#true} assume true; {18692#true} is VALID [2022-04-08 10:07:25,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {18692#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18692#true} is VALID [2022-04-08 10:07:25,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {18692#true} call ULTIMATE.init(); {18692#true} is VALID [2022-04-08 10:07:25,302 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:07:25,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877988784] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:25,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:25,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 25 [2022-04-08 10:07:25,302 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:25,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [414988314] [2022-04-08 10:07:25,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [414988314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:25,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:25,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:07:25,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342523600] [2022-04-08 10:07:25,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:25,303 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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-08 10:07:25,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:25,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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-08 10:07:25,324 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-08 10:07:25,324 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:07:25,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:25,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:07:25,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2022-04-08 10:07:25,325 INFO L87 Difference]: Start difference. First operand 136 states and 171 transitions. Second operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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-08 10:07:29,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:29,212 INFO L93 Difference]: Finished difference Result 304 states and 421 transitions. [2022-04-08 10:07:29,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:07:29,212 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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-08 10:07:29,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:29,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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-08 10:07:29,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 154 transitions. [2022-04-08 10:07:29,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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-08 10:07:29,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 154 transitions. [2022-04-08 10:07:29,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 154 transitions. [2022-04-08 10:07:29,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:29,382 INFO L225 Difference]: With dead ends: 304 [2022-04-08 10:07:29,382 INFO L226 Difference]: Without dead ends: 284 [2022-04-08 10:07:29,383 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=1346, Unknown=0, NotChecked=0, Total=1482 [2022-04-08 10:07:29,383 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 108 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:29,384 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 131 Invalid, 1508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-08 10:07:29,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-04-08 10:07:29,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 146. [2022-04-08 10:07:29,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:29,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 284 states. Second operand has 146 states, 141 states have (on average 1.2836879432624113) internal successors, (181), 141 states have internal predecessors, (181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:29,949 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand has 146 states, 141 states have (on average 1.2836879432624113) internal successors, (181), 141 states have internal predecessors, (181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:29,949 INFO L87 Difference]: Start difference. First operand 284 states. Second operand has 146 states, 141 states have (on average 1.2836879432624113) internal successors, (181), 141 states have internal predecessors, (181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:29,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:29,958 INFO L93 Difference]: Finished difference Result 284 states and 364 transitions. [2022-04-08 10:07:29,958 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 364 transitions. [2022-04-08 10:07:29,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:29,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:29,959 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 141 states have (on average 1.2836879432624113) internal successors, (181), 141 states have internal predecessors, (181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 284 states. [2022-04-08 10:07:29,966 INFO L87 Difference]: Start difference. First operand has 146 states, 141 states have (on average 1.2836879432624113) internal successors, (181), 141 states have internal predecessors, (181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 284 states. [2022-04-08 10:07:29,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:29,972 INFO L93 Difference]: Finished difference Result 284 states and 364 transitions. [2022-04-08 10:07:29,972 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 364 transitions. [2022-04-08 10:07:29,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:29,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:29,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:29,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:29,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 141 states have (on average 1.2836879432624113) internal successors, (181), 141 states have internal predecessors, (181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:29,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 185 transitions. [2022-04-08 10:07:29,976 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 185 transitions. Word has length 29 [2022-04-08 10:07:29,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:29,976 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 185 transitions. [2022-04-08 10:07:29,976 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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-08 10:07:29,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 185 transitions. [2022-04-08 10:07:30,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:30,520 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 185 transitions. [2022-04-08 10:07:30,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 10:07:30,522 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:30,522 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:30,538 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-08 10:07:30,722 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:30,722 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:30,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:30,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1500556532, now seen corresponding path program 25 times [2022-04-08 10:07:30,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:30,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2023920962] [2022-04-08 10:07:30,737 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:30,737 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:30,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1500556532, now seen corresponding path program 26 times [2022-04-08 10:07:30,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:30,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044601835] [2022-04-08 10:07:30,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:30,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:30,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:30,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {20403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20389#true} is VALID [2022-04-08 10:07:30,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {20389#true} assume true; {20389#true} is VALID [2022-04-08 10:07:30,891 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20389#true} {20389#true} #83#return; {20389#true} is VALID [2022-04-08 10:07:30,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {20389#true} call ULTIMATE.init(); {20403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:30,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {20403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20389#true} is VALID [2022-04-08 10:07:30,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {20389#true} assume true; {20389#true} is VALID [2022-04-08 10:07:30,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20389#true} {20389#true} #83#return; {20389#true} is VALID [2022-04-08 10:07:30,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {20389#true} call #t~ret15 := main(); {20389#true} is VALID [2022-04-08 10:07:30,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {20389#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20394#(= main_~y~0 0)} is VALID [2022-04-08 10:07:30,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {20394#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20395#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:30,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {20395#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20396#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:30,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {20396#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20397#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:30,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {20397#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20398#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:30,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {20398#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20399#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:30,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {20399#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {20399#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:30,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {20399#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {20400#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:07:30,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {20400#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20401#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:07:30,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {20401#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20402#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:30,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {20402#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {20390#false} is VALID [2022-04-08 10:07:30,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {20390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20390#false} is VALID [2022-04-08 10:07:30,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {20390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20390#false} is VALID [2022-04-08 10:07:30,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {20390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20390#false} is VALID [2022-04-08 10:07:30,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {20390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20390#false} is VALID [2022-04-08 10:07:30,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {20390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20390#false} is VALID [2022-04-08 10:07:30,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {20390#false} assume !(~y~0 % 4294967296 > 0); {20390#false} is VALID [2022-04-08 10:07:30,902 INFO L290 TraceCheckUtils]: 22: Hoare triple {20390#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20390#false} is VALID [2022-04-08 10:07:30,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {20390#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20390#false} is VALID [2022-04-08 10:07:30,902 INFO L290 TraceCheckUtils]: 24: Hoare triple {20390#false} assume !(~x~0 % 4294967296 > 0); {20390#false} is VALID [2022-04-08 10:07:30,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {20390#false} assume !(~z~0 % 4294967296 > 0); {20390#false} is VALID [2022-04-08 10:07:30,902 INFO L272 TraceCheckUtils]: 26: Hoare triple {20390#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {20390#false} is VALID [2022-04-08 10:07:30,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {20390#false} ~cond := #in~cond; {20390#false} is VALID [2022-04-08 10:07:30,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {20390#false} assume 0 == ~cond; {20390#false} is VALID [2022-04-08 10:07:30,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {20390#false} assume !false; {20390#false} is VALID [2022-04-08 10:07:30,903 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-08 10:07:30,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:30,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044601835] [2022-04-08 10:07:30,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044601835] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:30,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27936019] [2022-04-08 10:07:30,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:07:30,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:30,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:30,904 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-08 10:07:30,905 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-08 10:07:30,942 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:07:30,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:30,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 10:07:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:30,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:31,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {20389#true} call ULTIMATE.init(); {20389#true} is VALID [2022-04-08 10:07:31,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {20389#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20389#true} is VALID [2022-04-08 10:07:31,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {20389#true} assume true; {20389#true} is VALID [2022-04-08 10:07:31,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20389#true} {20389#true} #83#return; {20389#true} is VALID [2022-04-08 10:07:31,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {20389#true} call #t~ret15 := main(); {20389#true} is VALID [2022-04-08 10:07:31,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {20389#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20394#(= main_~y~0 0)} is VALID [2022-04-08 10:07:31,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {20394#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20395#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:31,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {20395#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20396#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:31,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {20396#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20397#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:31,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {20397#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20398#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:31,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {20398#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20399#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:31,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {20399#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {20399#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:31,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {20399#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {20443#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:31,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {20443#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20447#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:07:31,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {20447#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20451#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:31,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {20451#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {20390#false} is VALID [2022-04-08 10:07:31,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {20390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20390#false} is VALID [2022-04-08 10:07:31,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {20390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20390#false} is VALID [2022-04-08 10:07:31,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {20390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20390#false} is VALID [2022-04-08 10:07:31,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {20390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20390#false} is VALID [2022-04-08 10:07:31,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {20390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20390#false} is VALID [2022-04-08 10:07:31,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {20390#false} assume !(~y~0 % 4294967296 > 0); {20390#false} is VALID [2022-04-08 10:07:31,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {20390#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20390#false} is VALID [2022-04-08 10:07:31,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {20390#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20390#false} is VALID [2022-04-08 10:07:31,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {20390#false} assume !(~x~0 % 4294967296 > 0); {20390#false} is VALID [2022-04-08 10:07:31,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {20390#false} assume !(~z~0 % 4294967296 > 0); {20390#false} is VALID [2022-04-08 10:07:31,101 INFO L272 TraceCheckUtils]: 26: Hoare triple {20390#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {20390#false} is VALID [2022-04-08 10:07:31,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {20390#false} ~cond := #in~cond; {20390#false} is VALID [2022-04-08 10:07:31,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {20390#false} assume 0 == ~cond; {20390#false} is VALID [2022-04-08 10:07:31,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {20390#false} assume !false; {20390#false} is VALID [2022-04-08 10:07:31,101 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-08 10:07:31,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:31,271 INFO L290 TraceCheckUtils]: 29: Hoare triple {20390#false} assume !false; {20390#false} is VALID [2022-04-08 10:07:31,271 INFO L290 TraceCheckUtils]: 28: Hoare triple {20390#false} assume 0 == ~cond; {20390#false} is VALID [2022-04-08 10:07:31,271 INFO L290 TraceCheckUtils]: 27: Hoare triple {20390#false} ~cond := #in~cond; {20390#false} is VALID [2022-04-08 10:07:31,271 INFO L272 TraceCheckUtils]: 26: Hoare triple {20390#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {20390#false} is VALID [2022-04-08 10:07:31,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {20390#false} assume !(~z~0 % 4294967296 > 0); {20390#false} is VALID [2022-04-08 10:07:31,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {20390#false} assume !(~x~0 % 4294967296 > 0); {20390#false} is VALID [2022-04-08 10:07:31,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {20390#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20390#false} is VALID [2022-04-08 10:07:31,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {20390#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20390#false} is VALID [2022-04-08 10:07:31,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {20390#false} assume !(~y~0 % 4294967296 > 0); {20390#false} is VALID [2022-04-08 10:07:31,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {20390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20390#false} is VALID [2022-04-08 10:07:31,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {20390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20390#false} is VALID [2022-04-08 10:07:31,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {20530#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20390#false} is VALID [2022-04-08 10:07:31,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {20534#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20530#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:07:31,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {20538#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20534#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:07:31,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {20542#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {20538#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:07:31,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {20546#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20542#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-08 10:07:31,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {20550#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20546#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:07:31,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {20389#true} ~z~0 := ~y~0; {20550#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-08 10:07:31,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {20389#true} assume !(~x~0 % 4294967296 > 0); {20389#true} is VALID [2022-04-08 10:07:31,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {20389#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20389#true} is VALID [2022-04-08 10:07:31,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {20389#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20389#true} is VALID [2022-04-08 10:07:31,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {20389#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20389#true} is VALID [2022-04-08 10:07:31,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {20389#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20389#true} is VALID [2022-04-08 10:07:31,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {20389#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20389#true} is VALID [2022-04-08 10:07:31,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {20389#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20389#true} is VALID [2022-04-08 10:07:31,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {20389#true} call #t~ret15 := main(); {20389#true} is VALID [2022-04-08 10:07:31,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20389#true} {20389#true} #83#return; {20389#true} is VALID [2022-04-08 10:07:31,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {20389#true} assume true; {20389#true} is VALID [2022-04-08 10:07:31,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {20389#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20389#true} is VALID [2022-04-08 10:07:31,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {20389#true} call ULTIMATE.init(); {20389#true} is VALID [2022-04-08 10:07:31,277 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:07:31,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27936019] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:31,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:31,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 8] total 21 [2022-04-08 10:07:31,277 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:31,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2023920962] [2022-04-08 10:07:31,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2023920962] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:31,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:31,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:07:31,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698705138] [2022-04-08 10:07:31,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:31,278 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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 30 [2022-04-08 10:07:31,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:31,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-08 10:07:31,294 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-08 10:07:31,294 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:07:31,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:31,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:07:31,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-04-08 10:07:31,295 INFO L87 Difference]: Start difference. First operand 146 states and 185 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-08 10:07:33,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:33,327 INFO L93 Difference]: Finished difference Result 228 states and 288 transitions. [2022-04-08 10:07:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 10:07:33,327 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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 30 [2022-04-08 10:07:33,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:33,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-08 10:07:33,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 92 transitions. [2022-04-08 10:07:33,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-08 10:07:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 92 transitions. [2022-04-08 10:07:33,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 92 transitions. [2022-04-08 10:07:33,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:33,405 INFO L225 Difference]: With dead ends: 228 [2022-04-08 10:07:33,405 INFO L226 Difference]: Without dead ends: 213 [2022-04-08 10:07:33,405 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=888, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 10:07:33,406 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 57 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:33,406 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 82 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:07:33,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-04-08 10:07:33,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 146. [2022-04-08 10:07:33,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:33,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand has 146 states, 141 states have (on average 1.2765957446808511) internal successors, (180), 141 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:33,891 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand has 146 states, 141 states have (on average 1.2765957446808511) internal successors, (180), 141 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:33,891 INFO L87 Difference]: Start difference. First operand 213 states. Second operand has 146 states, 141 states have (on average 1.2765957446808511) internal successors, (180), 141 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:33,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:33,893 INFO L93 Difference]: Finished difference Result 213 states and 272 transitions. [2022-04-08 10:07:33,893 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 272 transitions. [2022-04-08 10:07:33,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:33,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:33,894 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 141 states have (on average 1.2765957446808511) internal successors, (180), 141 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 213 states. [2022-04-08 10:07:33,894 INFO L87 Difference]: Start difference. First operand has 146 states, 141 states have (on average 1.2765957446808511) internal successors, (180), 141 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 213 states. [2022-04-08 10:07:33,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:33,897 INFO L93 Difference]: Finished difference Result 213 states and 272 transitions. [2022-04-08 10:07:33,897 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 272 transitions. [2022-04-08 10:07:33,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:33,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:33,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:33,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:33,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 141 states have (on average 1.2765957446808511) internal successors, (180), 141 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:33,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 184 transitions. [2022-04-08 10:07:33,900 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 184 transitions. Word has length 30 [2022-04-08 10:07:33,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:33,900 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 184 transitions. [2022-04-08 10:07:33,900 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-08 10:07:33,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 184 transitions. [2022-04-08 10:07:34,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:34,302 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 184 transitions. [2022-04-08 10:07:34,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 10:07:34,302 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:34,302 INFO L499 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:34,318 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-08 10:07:34,503 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,SelfDestructingSolverStorable30 [2022-04-08 10:07:34,503 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:34,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:34,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1919386830, now seen corresponding path program 27 times [2022-04-08 10:07:34,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:34,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [642044189] [2022-04-08 10:07:34,506 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:34,506 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:34,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1919386830, now seen corresponding path program 28 times [2022-04-08 10:07:34,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:34,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051203089] [2022-04-08 10:07:34,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:34,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:34,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:34,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {21809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21790#true} is VALID [2022-04-08 10:07:34,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {21790#true} assume true; {21790#true} is VALID [2022-04-08 10:07:34,722 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21790#true} {21790#true} #83#return; {21790#true} is VALID [2022-04-08 10:07:34,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {21790#true} call ULTIMATE.init(); {21809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:34,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {21809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21790#true} is VALID [2022-04-08 10:07:34,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {21790#true} assume true; {21790#true} is VALID [2022-04-08 10:07:34,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21790#true} {21790#true} #83#return; {21790#true} is VALID [2022-04-08 10:07:34,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {21790#true} call #t~ret15 := main(); {21790#true} is VALID [2022-04-08 10:07:34,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {21790#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21795#(= main_~y~0 0)} is VALID [2022-04-08 10:07:34,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {21795#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21796#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:34,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {21796#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21797#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:34,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {21797#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21798#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:34,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {21798#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21799#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:34,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {21799#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21800#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:34,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {21800#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21801#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:34,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {21801#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21802#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:34,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {21802#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21803#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:34,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {21803#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21804#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:34,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {21804#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21805#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:34,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {21805#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21806#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:34,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {21806#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {21806#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:34,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {21806#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {21807#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:07:34,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {21807#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21808#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:34,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {21808#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {21791#false} is VALID [2022-04-08 10:07:34,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {21791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21791#false} is VALID [2022-04-08 10:07:34,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {21791#false} assume !(~y~0 % 4294967296 > 0); {21791#false} is VALID [2022-04-08 10:07:34,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {21791#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {21791#false} is VALID [2022-04-08 10:07:34,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {21791#false} assume !(~x~0 % 4294967296 > 0); {21791#false} is VALID [2022-04-08 10:07:34,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {21791#false} assume !(~z~0 % 4294967296 > 0); {21791#false} is VALID [2022-04-08 10:07:34,733 INFO L272 TraceCheckUtils]: 26: Hoare triple {21791#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {21791#false} is VALID [2022-04-08 10:07:34,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {21791#false} ~cond := #in~cond; {21791#false} is VALID [2022-04-08 10:07:34,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {21791#false} assume 0 == ~cond; {21791#false} is VALID [2022-04-08 10:07:34,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {21791#false} assume !false; {21791#false} is VALID [2022-04-08 10:07:34,734 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:07:34,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:34,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051203089] [2022-04-08 10:07:34,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051203089] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:34,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422354024] [2022-04-08 10:07:34,734 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:07:34,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:34,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:34,735 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-08 10:07:34,736 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-08 10:07:34,780 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:07:34,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:34,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 10:07:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:34,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:35,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {21790#true} call ULTIMATE.init(); {21790#true} is VALID [2022-04-08 10:07:35,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {21790#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21790#true} is VALID [2022-04-08 10:07:35,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {21790#true} assume true; {21790#true} is VALID [2022-04-08 10:07:35,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21790#true} {21790#true} #83#return; {21790#true} is VALID [2022-04-08 10:07:35,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {21790#true} call #t~ret15 := main(); {21790#true} is VALID [2022-04-08 10:07:35,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {21790#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21795#(= main_~y~0 0)} is VALID [2022-04-08 10:07:35,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {21795#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21796#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:35,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {21796#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21797#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:35,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {21797#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21798#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:35,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {21798#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21799#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:35,023 INFO L290 TraceCheckUtils]: 10: Hoare triple {21799#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21800#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:35,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {21800#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21801#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:35,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {21801#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21802#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:35,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {21802#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21803#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:35,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {21803#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21804#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:35,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {21804#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21805#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:35,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {21805#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21806#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:35,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {21806#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {21806#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:35,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {21806#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {21807#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:07:35,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {21807#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21870#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:07:35,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {21870#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {21791#false} is VALID [2022-04-08 10:07:35,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {21791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21791#false} is VALID [2022-04-08 10:07:35,027 INFO L290 TraceCheckUtils]: 22: Hoare triple {21791#false} assume !(~y~0 % 4294967296 > 0); {21791#false} is VALID [2022-04-08 10:07:35,027 INFO L290 TraceCheckUtils]: 23: Hoare triple {21791#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {21791#false} is VALID [2022-04-08 10:07:35,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {21791#false} assume !(~x~0 % 4294967296 > 0); {21791#false} is VALID [2022-04-08 10:07:35,028 INFO L290 TraceCheckUtils]: 25: Hoare triple {21791#false} assume !(~z~0 % 4294967296 > 0); {21791#false} is VALID [2022-04-08 10:07:35,028 INFO L272 TraceCheckUtils]: 26: Hoare triple {21791#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {21791#false} is VALID [2022-04-08 10:07:35,028 INFO L290 TraceCheckUtils]: 27: Hoare triple {21791#false} ~cond := #in~cond; {21791#false} is VALID [2022-04-08 10:07:35,028 INFO L290 TraceCheckUtils]: 28: Hoare triple {21791#false} assume 0 == ~cond; {21791#false} is VALID [2022-04-08 10:07:35,028 INFO L290 TraceCheckUtils]: 29: Hoare triple {21791#false} assume !false; {21791#false} is VALID [2022-04-08 10:07:35,028 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:07:35,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:35,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {21791#false} assume !false; {21791#false} is VALID [2022-04-08 10:07:35,380 INFO L290 TraceCheckUtils]: 28: Hoare triple {21791#false} assume 0 == ~cond; {21791#false} is VALID [2022-04-08 10:07:35,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {21791#false} ~cond := #in~cond; {21791#false} is VALID [2022-04-08 10:07:35,380 INFO L272 TraceCheckUtils]: 26: Hoare triple {21791#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {21791#false} is VALID [2022-04-08 10:07:35,380 INFO L290 TraceCheckUtils]: 25: Hoare triple {21791#false} assume !(~z~0 % 4294967296 > 0); {21791#false} is VALID [2022-04-08 10:07:35,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {21791#false} assume !(~x~0 % 4294967296 > 0); {21791#false} is VALID [2022-04-08 10:07:35,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {21791#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {21791#false} is VALID [2022-04-08 10:07:35,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {21791#false} assume !(~y~0 % 4294967296 > 0); {21791#false} is VALID [2022-04-08 10:07:35,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {21791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21791#false} is VALID [2022-04-08 10:07:35,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {21928#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {21791#false} is VALID [2022-04-08 10:07:35,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {21932#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21928#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:35,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {21936#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {21932#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:35,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {21936#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {21936#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:35,383 INFO L290 TraceCheckUtils]: 16: Hoare triple {21943#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21936#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:35,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {21947#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21943#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:35,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {21951#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21947#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:35,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {21955#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21951#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:35,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {21959#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21955#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:35,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {21963#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21959#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:35,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {21967#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21963#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:35,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {21971#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21967#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:07:35,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {21975#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21971#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:35,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {21979#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21975#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:07:35,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {21983#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21979#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:07:35,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {21790#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21983#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:07:35,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {21790#true} call #t~ret15 := main(); {21790#true} is VALID [2022-04-08 10:07:35,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21790#true} {21790#true} #83#return; {21790#true} is VALID [2022-04-08 10:07:35,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {21790#true} assume true; {21790#true} is VALID [2022-04-08 10:07:35,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {21790#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21790#true} is VALID [2022-04-08 10:07:35,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {21790#true} call ULTIMATE.init(); {21790#true} is VALID [2022-04-08 10:07:35,390 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:07:35,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422354024] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:35,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:35,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-08 10:07:35,391 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:35,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [642044189] [2022-04-08 10:07:35,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [642044189] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:35,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:35,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:07:35,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157949958] [2022-04-08 10:07:35,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:35,391 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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-08 10:07:35,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:35,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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-08 10:07:35,410 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-08 10:07:35,410 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:07:35,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:35,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:07:35,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=781, Unknown=0, NotChecked=0, Total=992 [2022-04-08 10:07:35,411 INFO L87 Difference]: Start difference. First operand 146 states and 184 transitions. Second operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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-08 10:07:39,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:39,645 INFO L93 Difference]: Finished difference Result 327 states and 454 transitions. [2022-04-08 10:07:39,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 10:07:39,645 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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-08 10:07:39,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:39,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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-08 10:07:39,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 166 transitions. [2022-04-08 10:07:39,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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-08 10:07:39,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 166 transitions. [2022-04-08 10:07:39,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 166 transitions. [2022-04-08 10:07:39,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:39,778 INFO L225 Difference]: With dead ends: 327 [2022-04-08 10:07:39,778 INFO L226 Difference]: Without dead ends: 307 [2022-04-08 10:07:39,778 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=463, Invalid=1699, Unknown=0, NotChecked=0, Total=2162 [2022-04-08 10:07:39,779 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 119 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:39,779 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 137 Invalid, 1656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-08 10:07:39,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-04-08 10:07:40,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 156. [2022-04-08 10:07:40,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:40,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 307 states. Second operand has 156 states, 151 states have (on average 1.2847682119205297) internal successors, (194), 151 states have internal predecessors, (194), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:40,289 INFO L74 IsIncluded]: Start isIncluded. First operand 307 states. Second operand has 156 states, 151 states have (on average 1.2847682119205297) internal successors, (194), 151 states have internal predecessors, (194), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:40,289 INFO L87 Difference]: Start difference. First operand 307 states. Second operand has 156 states, 151 states have (on average 1.2847682119205297) internal successors, (194), 151 states have internal predecessors, (194), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:40,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:40,293 INFO L93 Difference]: Finished difference Result 307 states and 394 transitions. [2022-04-08 10:07:40,293 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 394 transitions. [2022-04-08 10:07:40,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:40,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:40,294 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 151 states have (on average 1.2847682119205297) internal successors, (194), 151 states have internal predecessors, (194), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 307 states. [2022-04-08 10:07:40,294 INFO L87 Difference]: Start difference. First operand has 156 states, 151 states have (on average 1.2847682119205297) internal successors, (194), 151 states have internal predecessors, (194), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 307 states. [2022-04-08 10:07:40,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:40,299 INFO L93 Difference]: Finished difference Result 307 states and 394 transitions. [2022-04-08 10:07:40,299 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 394 transitions. [2022-04-08 10:07:40,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:40,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:40,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:40,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:40,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 151 states have (on average 1.2847682119205297) internal successors, (194), 151 states have internal predecessors, (194), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:40,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 198 transitions. [2022-04-08 10:07:40,302 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 198 transitions. Word has length 30 [2022-04-08 10:07:40,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:40,302 INFO L478 AbstractCegarLoop]: Abstraction has 156 states and 198 transitions. [2022-04-08 10:07:40,303 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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-08 10:07:40,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 156 states and 198 transitions. [2022-04-08 10:07:40,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:40,792 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 198 transitions. [2022-04-08 10:07:40,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:07:40,792 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:40,792 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:40,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-08 10:07:40,992 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:40,993 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:40,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:40,993 INFO L85 PathProgramCache]: Analyzing trace with hash -543637167, now seen corresponding path program 9 times [2022-04-08 10:07:40,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:40,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1531159304] [2022-04-08 10:07:40,995 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:40,995 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:40,995 INFO L85 PathProgramCache]: Analyzing trace with hash -543637167, now seen corresponding path program 10 times [2022-04-08 10:07:40,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:40,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677161291] [2022-04-08 10:07:40,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:40,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:41,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:41,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {23626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23614#true} is VALID [2022-04-08 10:07:41,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {23614#true} assume true; {23614#true} is VALID [2022-04-08 10:07:41,141 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23614#true} {23614#true} #83#return; {23614#true} is VALID [2022-04-08 10:07:41,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {23614#true} call ULTIMATE.init(); {23626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:41,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {23626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23614#true} is VALID [2022-04-08 10:07:41,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {23614#true} assume true; {23614#true} is VALID [2022-04-08 10:07:41,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23614#true} {23614#true} #83#return; {23614#true} is VALID [2022-04-08 10:07:41,142 INFO L272 TraceCheckUtils]: 4: Hoare triple {23614#true} call #t~ret15 := main(); {23614#true} is VALID [2022-04-08 10:07:41,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {23614#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23619#(= main_~y~0 0)} is VALID [2022-04-08 10:07:41,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {23619#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:41,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:41,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:41,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:41,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:41,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:41,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:41,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:41,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:41,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:41,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:41,149 INFO L290 TraceCheckUtils]: 17: Hoare triple {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23619#(= main_~y~0 0)} is VALID [2022-04-08 10:07:41,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {23619#(= main_~y~0 0)} assume !(~y~0 % 4294967296 > 0); {23619#(= main_~y~0 0)} is VALID [2022-04-08 10:07:41,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {23619#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:41,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:41,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:41,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:41,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:41,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:41,154 INFO L290 TraceCheckUtils]: 25: Hoare triple {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23623#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:07:41,154 INFO L290 TraceCheckUtils]: 26: Hoare triple {23623#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 > 0); {23623#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:07:41,155 INFO L272 TraceCheckUtils]: 27: Hoare triple {23623#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {23624#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:07:41,156 INFO L290 TraceCheckUtils]: 28: Hoare triple {23624#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {23625#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:07:41,156 INFO L290 TraceCheckUtils]: 29: Hoare triple {23625#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {23615#false} is VALID [2022-04-08 10:07:41,156 INFO L290 TraceCheckUtils]: 30: Hoare triple {23615#false} assume !false; {23615#false} is VALID [2022-04-08 10:07:41,156 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:07:41,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:41,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677161291] [2022-04-08 10:07:41,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677161291] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:41,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919927360] [2022-04-08 10:07:41,157 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:07:41,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:41,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:41,159 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-08 10:07:41,191 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-08 10:07:41,219 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:07:41,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:41,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-08 10:07:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:41,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:41,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {23614#true} call ULTIMATE.init(); {23614#true} is VALID [2022-04-08 10:07:41,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {23614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23614#true} is VALID [2022-04-08 10:07:41,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {23614#true} assume true; {23614#true} is VALID [2022-04-08 10:07:41,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23614#true} {23614#true} #83#return; {23614#true} is VALID [2022-04-08 10:07:41,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {23614#true} call #t~ret15 := main(); {23614#true} is VALID [2022-04-08 10:07:41,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {23614#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23619#(= main_~y~0 0)} is VALID [2022-04-08 10:07:41,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {23619#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:41,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:41,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:41,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:41,503 INFO L290 TraceCheckUtils]: 10: Hoare triple {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {23660#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:41,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {23660#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23664#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:07:41,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {23664#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23668#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:41,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {23668#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23672#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:41,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {23672#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:41,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:41,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:41,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23619#(= main_~y~0 0)} is VALID [2022-04-08 10:07:41,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {23619#(= main_~y~0 0)} assume !(~y~0 % 4294967296 > 0); {23619#(= main_~y~0 0)} is VALID [2022-04-08 10:07:41,507 INFO L290 TraceCheckUtils]: 19: Hoare triple {23619#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:41,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:41,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:41,508 INFO L290 TraceCheckUtils]: 22: Hoare triple {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:41,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {23622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:41,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {23621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:41,510 INFO L290 TraceCheckUtils]: 25: Hoare triple {23620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23619#(= main_~y~0 0)} is VALID [2022-04-08 10:07:41,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {23619#(= main_~y~0 0)} assume !(~z~0 % 4294967296 > 0); {23619#(= main_~y~0 0)} is VALID [2022-04-08 10:07:41,510 INFO L272 TraceCheckUtils]: 27: Hoare triple {23619#(= main_~y~0 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {23715#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:07:41,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {23715#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23719#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:07:41,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {23719#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23615#false} is VALID [2022-04-08 10:07:41,511 INFO L290 TraceCheckUtils]: 30: Hoare triple {23615#false} assume !false; {23615#false} is VALID [2022-04-08 10:07:41,511 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:41,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:41,761 INFO L290 TraceCheckUtils]: 30: Hoare triple {23615#false} assume !false; {23615#false} is VALID [2022-04-08 10:07:41,762 INFO L290 TraceCheckUtils]: 29: Hoare triple {23719#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23615#false} is VALID [2022-04-08 10:07:41,762 INFO L290 TraceCheckUtils]: 28: Hoare triple {23715#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23719#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:07:41,762 INFO L272 TraceCheckUtils]: 27: Hoare triple {23735#(= (mod main_~y~0 4294967296) 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {23715#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:07:41,763 INFO L290 TraceCheckUtils]: 26: Hoare triple {23735#(= (mod main_~y~0 4294967296) 0)} assume !(~z~0 % 4294967296 > 0); {23735#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-08 10:07:41,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {23742#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23735#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-08 10:07:41,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {23746#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23742#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-08 10:07:41,765 INFO L290 TraceCheckUtils]: 23: Hoare triple {23750#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23746#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} is VALID [2022-04-08 10:07:41,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {23750#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} assume !(~x~0 % 4294967296 > 0); {23750#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} is VALID [2022-04-08 10:07:41,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {23746#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23750#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} is VALID [2022-04-08 10:07:41,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {23742#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23746#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} is VALID [2022-04-08 10:07:41,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {23735#(= (mod main_~y~0 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23742#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-08 10:07:41,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {23735#(= (mod main_~y~0 4294967296) 0)} assume !(~y~0 % 4294967296 > 0); {23735#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-08 10:07:41,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {23742#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23735#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-08 10:07:41,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {23746#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23742#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-08 10:07:41,769 INFO L290 TraceCheckUtils]: 15: Hoare triple {23750#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23746#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} is VALID [2022-04-08 10:07:41,769 INFO L290 TraceCheckUtils]: 14: Hoare triple {23778#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {23750#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} is VALID [2022-04-08 10:07:41,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {23782#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23778#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:07:41,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {23786#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23782#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:07:41,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {23790#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23786#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:07:41,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {23614#true} ~z~0 := ~y~0; {23790#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:07:41,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {23614#true} assume !(~x~0 % 4294967296 > 0); {23614#true} is VALID [2022-04-08 10:07:41,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {23614#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23614#true} is VALID [2022-04-08 10:07:41,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {23614#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23614#true} is VALID [2022-04-08 10:07:41,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {23614#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23614#true} is VALID [2022-04-08 10:07:41,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {23614#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23614#true} is VALID [2022-04-08 10:07:41,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {23614#true} call #t~ret15 := main(); {23614#true} is VALID [2022-04-08 10:07:41,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23614#true} {23614#true} #83#return; {23614#true} is VALID [2022-04-08 10:07:41,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {23614#true} assume true; {23614#true} is VALID [2022-04-08 10:07:41,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {23614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23614#true} is VALID [2022-04-08 10:07:41,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {23614#true} call ULTIMATE.init(); {23614#true} is VALID [2022-04-08 10:07:41,773 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:07:41,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919927360] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:41,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:41,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 24 [2022-04-08 10:07:41,773 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:41,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1531159304] [2022-04-08 10:07:41,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1531159304] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:41,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:41,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 10:07:41,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998412349] [2022-04-08 10:07:41,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:41,774 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 8 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 31 [2022-04-08 10:07:41,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:41,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.5) internal successors, (25), 8 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-08 10:07:41,797 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-08 10:07:41,797 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 10:07:41,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:41,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 10:07:41,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2022-04-08 10:07:41,798 INFO L87 Difference]: Start difference. First operand 156 states and 198 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 8 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-08 10:07:42,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:42,694 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-04-08 10:07:42,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:07:42,694 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 8 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 31 [2022-04-08 10:07:42,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:42,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 8 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-08 10:07:42,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2022-04-08 10:07:42,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 8 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-08 10:07:42,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2022-04-08 10:07:42,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 46 transitions. [2022-04-08 10:07:42,731 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-08 10:07:42,732 INFO L225 Difference]: With dead ends: 166 [2022-04-08 10:07:42,732 INFO L226 Difference]: Without dead ends: 157 [2022-04-08 10:07:42,733 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:07:42,733 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:42,733 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 46 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:07:42,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-08 10:07:43,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-04-08 10:07:43,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:43,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 157 states, 152 states have (on average 1.2828947368421053) internal successors, (195), 152 states have internal predecessors, (195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:43,290 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 157 states, 152 states have (on average 1.2828947368421053) internal successors, (195), 152 states have internal predecessors, (195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:43,290 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 157 states, 152 states have (on average 1.2828947368421053) internal successors, (195), 152 states have internal predecessors, (195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:43,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:43,292 INFO L93 Difference]: Finished difference Result 157 states and 199 transitions. [2022-04-08 10:07:43,292 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 199 transitions. [2022-04-08 10:07:43,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:43,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:43,293 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 152 states have (on average 1.2828947368421053) internal successors, (195), 152 states have internal predecessors, (195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 157 states. [2022-04-08 10:07:43,293 INFO L87 Difference]: Start difference. First operand has 157 states, 152 states have (on average 1.2828947368421053) internal successors, (195), 152 states have internal predecessors, (195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 157 states. [2022-04-08 10:07:43,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:43,295 INFO L93 Difference]: Finished difference Result 157 states and 199 transitions. [2022-04-08 10:07:43,295 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 199 transitions. [2022-04-08 10:07:43,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:43,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:43,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:43,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:43,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 152 states have (on average 1.2828947368421053) internal successors, (195), 152 states have internal predecessors, (195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:43,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 199 transitions. [2022-04-08 10:07:43,298 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 199 transitions. Word has length 31 [2022-04-08 10:07:43,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:43,298 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 199 transitions. [2022-04-08 10:07:43,298 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 8 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-08 10:07:43,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 199 transitions. [2022-04-08 10:07:43,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:43,778 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 199 transitions. [2022-04-08 10:07:43,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:07:43,779 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:43,779 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:43,795 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-08 10:07:43,979 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:43,979 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:43,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:43,980 INFO L85 PathProgramCache]: Analyzing trace with hash -2007429169, now seen corresponding path program 13 times [2022-04-08 10:07:43,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:43,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1480730904] [2022-04-08 10:07:43,982 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:43,982 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:43,982 INFO L85 PathProgramCache]: Analyzing trace with hash -2007429169, now seen corresponding path program 14 times [2022-04-08 10:07:43,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:43,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964086459] [2022-04-08 10:07:43,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:43,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:44,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:44,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {24814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24798#true} is VALID [2022-04-08 10:07:44,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {24798#true} assume true; {24798#true} is VALID [2022-04-08 10:07:44,179 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24798#true} {24798#true} #83#return; {24798#true} is VALID [2022-04-08 10:07:44,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {24798#true} call ULTIMATE.init(); {24814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:44,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {24814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24798#true} is VALID [2022-04-08 10:07:44,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {24798#true} assume true; {24798#true} is VALID [2022-04-08 10:07:44,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24798#true} {24798#true} #83#return; {24798#true} is VALID [2022-04-08 10:07:44,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {24798#true} call #t~ret15 := main(); {24798#true} is VALID [2022-04-08 10:07:44,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {24798#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24803#(= main_~y~0 0)} is VALID [2022-04-08 10:07:44,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {24803#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24804#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:44,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {24804#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24805#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:44,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {24805#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24806#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:44,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {24806#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24807#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:44,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {24807#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24808#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:44,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {24808#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {24808#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:44,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {24808#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {24809#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:07:44,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {24809#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24810#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:07:44,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {24810#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24811#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:07:44,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {24811#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24812#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:07:44,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {24812#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24813#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:07:44,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {24813#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {24799#false} is VALID [2022-04-08 10:07:44,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {24799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24799#false} is VALID [2022-04-08 10:07:44,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {24799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24799#false} is VALID [2022-04-08 10:07:44,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {24799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24799#false} is VALID [2022-04-08 10:07:44,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {24799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24799#false} is VALID [2022-04-08 10:07:44,188 INFO L290 TraceCheckUtils]: 22: Hoare triple {24799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24799#false} is VALID [2022-04-08 10:07:44,188 INFO L290 TraceCheckUtils]: 23: Hoare triple {24799#false} assume !(~y~0 % 4294967296 > 0); {24799#false} is VALID [2022-04-08 10:07:44,188 INFO L290 TraceCheckUtils]: 24: Hoare triple {24799#false} assume !(~x~0 % 4294967296 > 0); {24799#false} is VALID [2022-04-08 10:07:44,189 INFO L290 TraceCheckUtils]: 25: Hoare triple {24799#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24799#false} is VALID [2022-04-08 10:07:44,189 INFO L290 TraceCheckUtils]: 26: Hoare triple {24799#false} assume !(~z~0 % 4294967296 > 0); {24799#false} is VALID [2022-04-08 10:07:44,189 INFO L272 TraceCheckUtils]: 27: Hoare triple {24799#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {24799#false} is VALID [2022-04-08 10:07:44,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {24799#false} ~cond := #in~cond; {24799#false} is VALID [2022-04-08 10:07:44,189 INFO L290 TraceCheckUtils]: 29: Hoare triple {24799#false} assume 0 == ~cond; {24799#false} is VALID [2022-04-08 10:07:44,189 INFO L290 TraceCheckUtils]: 30: Hoare triple {24799#false} assume !false; {24799#false} is VALID [2022-04-08 10:07:44,189 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 10:07:44,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:44,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964086459] [2022-04-08 10:07:44,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964086459] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:44,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561165243] [2022-04-08 10:07:44,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:07:44,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:44,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:44,196 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-08 10:07:44,197 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-08 10:07:44,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:07:44,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:44,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 10:07:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:44,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:44,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {24798#true} call ULTIMATE.init(); {24798#true} is VALID [2022-04-08 10:07:44,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {24798#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24798#true} is VALID [2022-04-08 10:07:44,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {24798#true} assume true; {24798#true} is VALID [2022-04-08 10:07:44,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24798#true} {24798#true} #83#return; {24798#true} is VALID [2022-04-08 10:07:44,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {24798#true} call #t~ret15 := main(); {24798#true} is VALID [2022-04-08 10:07:44,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {24798#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24798#true} is VALID [2022-04-08 10:07:44,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {24798#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24798#true} is VALID [2022-04-08 10:07:44,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {24798#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24839#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:44,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {24839#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24843#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:44,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {24843#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24847#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:07:44,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {24847#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24851#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:07:44,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {24851#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {24851#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:07:44,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {24851#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {24851#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:07:44,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {24851#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24847#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:07:44,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {24847#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24843#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:44,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {24843#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24839#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:44,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {24839#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:44,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {24870#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:44,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {24870#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:44,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {24870#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:44,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {24870#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:44,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {24870#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:44,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {24870#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:44,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {24870#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:44,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {24870#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {24799#false} is VALID [2022-04-08 10:07:44,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {24799#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24799#false} is VALID [2022-04-08 10:07:44,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {24799#false} assume !(~z~0 % 4294967296 > 0); {24799#false} is VALID [2022-04-08 10:07:44,465 INFO L272 TraceCheckUtils]: 27: Hoare triple {24799#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {24799#false} is VALID [2022-04-08 10:07:44,466 INFO L290 TraceCheckUtils]: 28: Hoare triple {24799#false} ~cond := #in~cond; {24799#false} is VALID [2022-04-08 10:07:44,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {24799#false} assume 0 == ~cond; {24799#false} is VALID [2022-04-08 10:07:44,466 INFO L290 TraceCheckUtils]: 30: Hoare triple {24799#false} assume !false; {24799#false} is VALID [2022-04-08 10:07:44,466 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-08 10:07:44,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:44,575 INFO L290 TraceCheckUtils]: 30: Hoare triple {24799#false} assume !false; {24799#false} is VALID [2022-04-08 10:07:44,575 INFO L290 TraceCheckUtils]: 29: Hoare triple {24799#false} assume 0 == ~cond; {24799#false} is VALID [2022-04-08 10:07:44,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {24799#false} ~cond := #in~cond; {24799#false} is VALID [2022-04-08 10:07:44,575 INFO L272 TraceCheckUtils]: 27: Hoare triple {24799#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {24799#false} is VALID [2022-04-08 10:07:44,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {24799#false} assume !(~z~0 % 4294967296 > 0); {24799#false} is VALID [2022-04-08 10:07:44,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {24799#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24799#false} is VALID [2022-04-08 10:07:44,576 INFO L290 TraceCheckUtils]: 24: Hoare triple {24870#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {24799#false} is VALID [2022-04-08 10:07:44,576 INFO L290 TraceCheckUtils]: 23: Hoare triple {24870#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:44,576 INFO L290 TraceCheckUtils]: 22: Hoare triple {24870#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:44,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {24870#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:44,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {24870#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:44,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {24870#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:44,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {24870#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:44,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {24870#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:44,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {24839#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24870#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:44,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {24843#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24839#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:44,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {24847#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24843#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:44,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {24851#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24847#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:07:44,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {24851#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {24851#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:07:44,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {24851#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {24851#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:07:44,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {24847#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24851#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:07:44,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {24843#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24847#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:07:44,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {24839#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24843#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:44,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {24798#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24839#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:44,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {24798#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24798#true} is VALID [2022-04-08 10:07:44,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {24798#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24798#true} is VALID [2022-04-08 10:07:44,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {24798#true} call #t~ret15 := main(); {24798#true} is VALID [2022-04-08 10:07:44,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24798#true} {24798#true} #83#return; {24798#true} is VALID [2022-04-08 10:07:44,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {24798#true} assume true; {24798#true} is VALID [2022-04-08 10:07:44,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {24798#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24798#true} is VALID [2022-04-08 10:07:44,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {24798#true} call ULTIMATE.init(); {24798#true} is VALID [2022-04-08 10:07:44,587 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-08 10:07:44,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561165243] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:44,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:44,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 19 [2022-04-08 10:07:44,587 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:44,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1480730904] [2022-04-08 10:07:44,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1480730904] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:44,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:44,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:07:44,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843233657] [2022-04-08 10:07:44,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:44,588 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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 31 [2022-04-08 10:07:44,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:44,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-08 10:07:44,606 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-08 10:07:44,606 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:07:44,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:44,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:07:44,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:07:44,606 INFO L87 Difference]: Start difference. First operand 157 states and 199 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-08 10:07:47,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:47,064 INFO L93 Difference]: Finished difference Result 239 states and 304 transitions. [2022-04-08 10:07:47,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 10:07:47,064 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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 31 [2022-04-08 10:07:47,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:47,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-08 10:07:47,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 97 transitions. [2022-04-08 10:07:47,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-08 10:07:47,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 97 transitions. [2022-04-08 10:07:47,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 97 transitions. [2022-04-08 10:07:47,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:47,141 INFO L225 Difference]: With dead ends: 239 [2022-04-08 10:07:47,142 INFO L226 Difference]: Without dead ends: 215 [2022-04-08 10:07:47,142 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=1179, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 10:07:47,142 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 51 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:47,142 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 92 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:07:47,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-04-08 10:07:47,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 158. [2022-04-08 10:07:47,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:47,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 215 states. Second operand has 158 states, 153 states have (on average 1.2745098039215685) internal successors, (195), 153 states have internal predecessors, (195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:47,670 INFO L74 IsIncluded]: Start isIncluded. First operand 215 states. Second operand has 158 states, 153 states have (on average 1.2745098039215685) internal successors, (195), 153 states have internal predecessors, (195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:47,670 INFO L87 Difference]: Start difference. First operand 215 states. Second operand has 158 states, 153 states have (on average 1.2745098039215685) internal successors, (195), 153 states have internal predecessors, (195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:47,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:47,672 INFO L93 Difference]: Finished difference Result 215 states and 276 transitions. [2022-04-08 10:07:47,672 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 276 transitions. [2022-04-08 10:07:47,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:47,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:47,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 158 states, 153 states have (on average 1.2745098039215685) internal successors, (195), 153 states have internal predecessors, (195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 215 states. [2022-04-08 10:07:47,673 INFO L87 Difference]: Start difference. First operand has 158 states, 153 states have (on average 1.2745098039215685) internal successors, (195), 153 states have internal predecessors, (195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 215 states. [2022-04-08 10:07:47,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:47,676 INFO L93 Difference]: Finished difference Result 215 states and 276 transitions. [2022-04-08 10:07:47,676 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 276 transitions. [2022-04-08 10:07:47,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:47,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:47,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:47,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:47,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 153 states have (on average 1.2745098039215685) internal successors, (195), 153 states have internal predecessors, (195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:47,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 199 transitions. [2022-04-08 10:07:47,679 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 199 transitions. Word has length 31 [2022-04-08 10:07:47,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:47,679 INFO L478 AbstractCegarLoop]: Abstraction has 158 states and 199 transitions. [2022-04-08 10:07:47,679 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-08 10:07:47,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 158 states and 199 transitions. [2022-04-08 10:07:48,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:48,170 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 199 transitions. [2022-04-08 10:07:48,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:07:48,171 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:48,171 INFO L499 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:48,187 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-08 10:07:48,371 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:48,371 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:48,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:48,372 INFO L85 PathProgramCache]: Analyzing trace with hash 112563583, now seen corresponding path program 29 times [2022-04-08 10:07:48,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:48,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [757024964] [2022-04-08 10:07:48,374 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:48,374 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:48,374 INFO L85 PathProgramCache]: Analyzing trace with hash 112563583, now seen corresponding path program 30 times [2022-04-08 10:07:48,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:48,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153288885] [2022-04-08 10:07:48,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:48,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:48,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:48,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {26285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26265#true} is VALID [2022-04-08 10:07:48,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {26265#true} assume true; {26265#true} is VALID [2022-04-08 10:07:48,645 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26265#true} {26265#true} #83#return; {26265#true} is VALID [2022-04-08 10:07:48,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {26265#true} call ULTIMATE.init(); {26285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:48,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {26285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26265#true} is VALID [2022-04-08 10:07:48,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {26265#true} assume true; {26265#true} is VALID [2022-04-08 10:07:48,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26265#true} {26265#true} #83#return; {26265#true} is VALID [2022-04-08 10:07:48,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {26265#true} call #t~ret15 := main(); {26265#true} is VALID [2022-04-08 10:07:48,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {26265#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26270#(= main_~y~0 0)} is VALID [2022-04-08 10:07:48,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {26270#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26271#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:48,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {26271#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26272#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:48,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {26272#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26273#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:48,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {26273#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26274#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:48,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {26274#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26275#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:48,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {26275#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26276#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:48,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {26276#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26277#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:48,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {26277#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26278#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:48,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {26278#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26279#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:48,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {26279#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26280#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:48,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {26280#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26281#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:48,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {26281#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26282#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:48,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {26282#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {26282#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:48,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {26282#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {26283#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:07:48,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {26283#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26284#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-08 10:07:48,656 INFO L290 TraceCheckUtils]: 21: Hoare triple {26284#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {26266#false} is VALID [2022-04-08 10:07:48,656 INFO L290 TraceCheckUtils]: 22: Hoare triple {26266#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26266#false} is VALID [2022-04-08 10:07:48,656 INFO L290 TraceCheckUtils]: 23: Hoare triple {26266#false} assume !(~y~0 % 4294967296 > 0); {26266#false} is VALID [2022-04-08 10:07:48,656 INFO L290 TraceCheckUtils]: 24: Hoare triple {26266#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26266#false} is VALID [2022-04-08 10:07:48,656 INFO L290 TraceCheckUtils]: 25: Hoare triple {26266#false} assume !(~x~0 % 4294967296 > 0); {26266#false} is VALID [2022-04-08 10:07:48,656 INFO L290 TraceCheckUtils]: 26: Hoare triple {26266#false} assume !(~z~0 % 4294967296 > 0); {26266#false} is VALID [2022-04-08 10:07:48,656 INFO L272 TraceCheckUtils]: 27: Hoare triple {26266#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {26266#false} is VALID [2022-04-08 10:07:48,656 INFO L290 TraceCheckUtils]: 28: Hoare triple {26266#false} ~cond := #in~cond; {26266#false} is VALID [2022-04-08 10:07:48,656 INFO L290 TraceCheckUtils]: 29: Hoare triple {26266#false} assume 0 == ~cond; {26266#false} is VALID [2022-04-08 10:07:48,656 INFO L290 TraceCheckUtils]: 30: Hoare triple {26266#false} assume !false; {26266#false} is VALID [2022-04-08 10:07:48,657 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:07:48,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:48,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153288885] [2022-04-08 10:07:48,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153288885] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:48,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101405317] [2022-04-08 10:07:48,657 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:07:48,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:48,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:48,659 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-08 10:07:48,665 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-08 10:07:48,698 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:07:48,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:48,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 10:07:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:48,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:48,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {26265#true} call ULTIMATE.init(); {26265#true} is VALID [2022-04-08 10:07:48,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {26265#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26265#true} is VALID [2022-04-08 10:07:48,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {26265#true} assume true; {26265#true} is VALID [2022-04-08 10:07:48,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26265#true} {26265#true} #83#return; {26265#true} is VALID [2022-04-08 10:07:48,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {26265#true} call #t~ret15 := main(); {26265#true} is VALID [2022-04-08 10:07:48,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {26265#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26265#true} is VALID [2022-04-08 10:07:48,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-08 10:07:48,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-08 10:07:48,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-08 10:07:48,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-08 10:07:48,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-08 10:07:48,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-08 10:07:48,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-08 10:07:48,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-08 10:07:48,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-08 10:07:48,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-08 10:07:48,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-08 10:07:48,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-08 10:07:48,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {26265#true} assume !(~x~0 % 4294967296 > 0); {26265#true} is VALID [2022-04-08 10:07:48,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {26265#true} ~z~0 := ~y~0; {26346#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:07:48,976 INFO L290 TraceCheckUtils]: 20: Hoare triple {26346#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26350#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:07:48,976 INFO L290 TraceCheckUtils]: 21: Hoare triple {26350#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {26350#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:07:48,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {26350#(= main_~y~0 (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26357#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-08 10:07:48,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {26357#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {26357#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-08 10:07:48,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {26357#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26346#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:07:48,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {26346#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {26346#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:07:48,979 INFO L290 TraceCheckUtils]: 26: Hoare triple {26346#(= main_~z~0 main_~y~0)} assume !(~z~0 % 4294967296 > 0); {26370#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:07:48,980 INFO L272 TraceCheckUtils]: 27: Hoare triple {26370#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {26374#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:07:48,980 INFO L290 TraceCheckUtils]: 28: Hoare triple {26374#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26378#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:07:48,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {26378#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26266#false} is VALID [2022-04-08 10:07:48,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {26266#false} assume !false; {26266#false} is VALID [2022-04-08 10:07:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:07:48,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:49,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {26266#false} assume !false; {26266#false} is VALID [2022-04-08 10:07:49,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {26378#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26266#false} is VALID [2022-04-08 10:07:49,227 INFO L290 TraceCheckUtils]: 28: Hoare triple {26374#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26378#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:07:49,228 INFO L272 TraceCheckUtils]: 27: Hoare triple {26370#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {26374#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:07:49,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {26397#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {26370#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:07:49,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {26397#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {26397#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:07:49,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {26404#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26397#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:07:49,230 INFO L290 TraceCheckUtils]: 23: Hoare triple {26404#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {26404#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-08 10:07:49,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {26411#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26404#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-08 10:07:49,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {26411#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {26411#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-08 10:07:49,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {26397#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26411#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-08 10:07:49,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {26265#true} ~z~0 := ~y~0; {26397#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:07:49,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {26265#true} assume !(~x~0 % 4294967296 > 0); {26265#true} is VALID [2022-04-08 10:07:49,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-08 10:07:49,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-08 10:07:49,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-08 10:07:49,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-08 10:07:49,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-08 10:07:49,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-08 10:07:49,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-08 10:07:49,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-08 10:07:49,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-08 10:07:49,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-08 10:07:49,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-08 10:07:49,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {26265#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26265#true} is VALID [2022-04-08 10:07:49,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {26265#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26265#true} is VALID [2022-04-08 10:07:49,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {26265#true} call #t~ret15 := main(); {26265#true} is VALID [2022-04-08 10:07:49,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26265#true} {26265#true} #83#return; {26265#true} is VALID [2022-04-08 10:07:49,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {26265#true} assume true; {26265#true} is VALID [2022-04-08 10:07:49,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {26265#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26265#true} is VALID [2022-04-08 10:07:49,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {26265#true} call ULTIMATE.init(); {26265#true} is VALID [2022-04-08 10:07:49,234 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 10:07:49,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101405317] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:49,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:49,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 8] total 27 [2022-04-08 10:07:49,235 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:49,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [757024964] [2022-04-08 10:07:49,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [757024964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:49,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:49,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:07:49,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954191347] [2022-04-08 10:07:49,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:49,235 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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-08 10:07:49,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:49,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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-08 10:07:49,260 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-08 10:07:49,260 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:07:49,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:49,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:07:49,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2022-04-08 10:07:49,261 INFO L87 Difference]: Start difference. First operand 158 states and 199 transitions. Second operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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-08 10:07:54,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:54,425 INFO L93 Difference]: Finished difference Result 351 states and 487 transitions. [2022-04-08 10:07:54,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 10:07:54,425 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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-08 10:07:54,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:54,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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-08 10:07:54,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 178 transitions. [2022-04-08 10:07:54,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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-08 10:07:54,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 178 transitions. [2022-04-08 10:07:54,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 178 transitions. [2022-04-08 10:07:54,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:54,573 INFO L225 Difference]: With dead ends: 351 [2022-04-08 10:07:54,573 INFO L226 Difference]: Without dead ends: 331 [2022-04-08 10:07:54,573 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=1658, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 10:07:54,574 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 130 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 2066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:54,574 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 153 Invalid, 2066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1973 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-08 10:07:54,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-04-08 10:07:55,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 168. [2022-04-08 10:07:55,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:55,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 331 states. Second operand has 168 states, 163 states have (on average 1.2822085889570551) internal successors, (209), 163 states have internal predecessors, (209), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:55,148 INFO L74 IsIncluded]: Start isIncluded. First operand 331 states. Second operand has 168 states, 163 states have (on average 1.2822085889570551) internal successors, (209), 163 states have internal predecessors, (209), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:55,148 INFO L87 Difference]: Start difference. First operand 331 states. Second operand has 168 states, 163 states have (on average 1.2822085889570551) internal successors, (209), 163 states have internal predecessors, (209), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:55,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:55,152 INFO L93 Difference]: Finished difference Result 331 states and 424 transitions. [2022-04-08 10:07:55,152 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 424 transitions. [2022-04-08 10:07:55,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:55,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:55,153 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 163 states have (on average 1.2822085889570551) internal successors, (209), 163 states have internal predecessors, (209), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 331 states. [2022-04-08 10:07:55,153 INFO L87 Difference]: Start difference. First operand has 168 states, 163 states have (on average 1.2822085889570551) internal successors, (209), 163 states have internal predecessors, (209), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 331 states. [2022-04-08 10:07:55,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:55,158 INFO L93 Difference]: Finished difference Result 331 states and 424 transitions. [2022-04-08 10:07:55,158 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 424 transitions. [2022-04-08 10:07:55,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:55,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:55,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:55,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:55,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 163 states have (on average 1.2822085889570551) internal successors, (209), 163 states have internal predecessors, (209), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:55,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 213 transitions. [2022-04-08 10:07:55,161 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 213 transitions. Word has length 31 [2022-04-08 10:07:55,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:55,161 INFO L478 AbstractCegarLoop]: Abstraction has 168 states and 213 transitions. [2022-04-08 10:07:55,162 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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-08 10:07:55,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 168 states and 213 transitions. [2022-04-08 10:07:55,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:55,853 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 213 transitions. [2022-04-08 10:07:55,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:07:55,854 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:55,854 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:55,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:56,054 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,SelfDestructingSolverStorable34 [2022-04-08 10:07:56,054 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:56,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:56,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1990656643, now seen corresponding path program 11 times [2022-04-08 10:07:56,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:56,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [715961942] [2022-04-08 10:07:56,057 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:56,057 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:56,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1990656643, now seen corresponding path program 12 times [2022-04-08 10:07:56,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:56,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661255979] [2022-04-08 10:07:56,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:56,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:56,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:56,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {28221#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28212#true} is VALID [2022-04-08 10:07:56,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {28212#true} assume true; {28212#true} is VALID [2022-04-08 10:07:56,148 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28212#true} {28212#true} #83#return; {28212#true} is VALID [2022-04-08 10:07:56,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {28212#true} call ULTIMATE.init(); {28221#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:56,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {28221#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28212#true} is VALID [2022-04-08 10:07:56,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {28212#true} assume true; {28212#true} is VALID [2022-04-08 10:07:56,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28212#true} {28212#true} #83#return; {28212#true} is VALID [2022-04-08 10:07:56,149 INFO L272 TraceCheckUtils]: 4: Hoare triple {28212#true} call #t~ret15 := main(); {28212#true} is VALID [2022-04-08 10:07:56,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {28212#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28212#true} is VALID [2022-04-08 10:07:56,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {28212#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28212#true} is VALID [2022-04-08 10:07:56,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {28212#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28212#true} is VALID [2022-04-08 10:07:56,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {28212#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28212#true} is VALID [2022-04-08 10:07:56,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {28212#true} assume !(~x~0 % 4294967296 > 0); {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:56,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:56,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28218#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:56,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {28218#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28219#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:56,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {28219#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:56,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:56,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:56,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:56,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:56,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:56,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28219#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:56,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {28219#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28218#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:56,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {28218#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:56,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28213#false} is VALID [2022-04-08 10:07:56,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {28213#false} assume !(~x~0 % 4294967296 > 0); {28213#false} is VALID [2022-04-08 10:07:56,159 INFO L290 TraceCheckUtils]: 24: Hoare triple {28213#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28213#false} is VALID [2022-04-08 10:07:56,159 INFO L290 TraceCheckUtils]: 25: Hoare triple {28213#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28213#false} is VALID [2022-04-08 10:07:56,159 INFO L290 TraceCheckUtils]: 26: Hoare triple {28213#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28213#false} is VALID [2022-04-08 10:07:56,159 INFO L290 TraceCheckUtils]: 27: Hoare triple {28213#false} assume !(~z~0 % 4294967296 > 0); {28213#false} is VALID [2022-04-08 10:07:56,159 INFO L272 TraceCheckUtils]: 28: Hoare triple {28213#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {28213#false} is VALID [2022-04-08 10:07:56,160 INFO L290 TraceCheckUtils]: 29: Hoare triple {28213#false} ~cond := #in~cond; {28213#false} is VALID [2022-04-08 10:07:56,160 INFO L290 TraceCheckUtils]: 30: Hoare triple {28213#false} assume 0 == ~cond; {28213#false} is VALID [2022-04-08 10:07:56,160 INFO L290 TraceCheckUtils]: 31: Hoare triple {28213#false} assume !false; {28213#false} is VALID [2022-04-08 10:07:56,160 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-08 10:07:56,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:56,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661255979] [2022-04-08 10:07:56,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661255979] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:56,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121299980] [2022-04-08 10:07:56,160 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:07:56,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:56,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:56,162 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-08 10:07:56,189 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-08 10:07:56,243 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:07:56,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:56,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 10:07:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:56,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:56,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {28212#true} call ULTIMATE.init(); {28212#true} is VALID [2022-04-08 10:07:56,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {28212#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28212#true} is VALID [2022-04-08 10:07:56,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {28212#true} assume true; {28212#true} is VALID [2022-04-08 10:07:56,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28212#true} {28212#true} #83#return; {28212#true} is VALID [2022-04-08 10:07:56,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {28212#true} call #t~ret15 := main(); {28212#true} is VALID [2022-04-08 10:07:56,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {28212#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28212#true} is VALID [2022-04-08 10:07:56,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {28212#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28212#true} is VALID [2022-04-08 10:07:56,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {28212#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28212#true} is VALID [2022-04-08 10:07:56,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {28212#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28212#true} is VALID [2022-04-08 10:07:56,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {28212#true} assume !(~x~0 % 4294967296 > 0); {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:56,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:56,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28218#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:56,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {28218#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28219#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:56,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {28219#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:56,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:56,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:56,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:56,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:56,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:56,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28219#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:56,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {28219#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28218#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:56,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {28218#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:56,541 INFO L290 TraceCheckUtils]: 22: Hoare triple {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28213#false} is VALID [2022-04-08 10:07:56,541 INFO L290 TraceCheckUtils]: 23: Hoare triple {28213#false} assume !(~x~0 % 4294967296 > 0); {28213#false} is VALID [2022-04-08 10:07:56,541 INFO L290 TraceCheckUtils]: 24: Hoare triple {28213#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28213#false} is VALID [2022-04-08 10:07:56,541 INFO L290 TraceCheckUtils]: 25: Hoare triple {28213#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28213#false} is VALID [2022-04-08 10:07:56,541 INFO L290 TraceCheckUtils]: 26: Hoare triple {28213#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28213#false} is VALID [2022-04-08 10:07:56,541 INFO L290 TraceCheckUtils]: 27: Hoare triple {28213#false} assume !(~z~0 % 4294967296 > 0); {28213#false} is VALID [2022-04-08 10:07:56,541 INFO L272 TraceCheckUtils]: 28: Hoare triple {28213#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {28213#false} is VALID [2022-04-08 10:07:56,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {28213#false} ~cond := #in~cond; {28213#false} is VALID [2022-04-08 10:07:56,541 INFO L290 TraceCheckUtils]: 30: Hoare triple {28213#false} assume 0 == ~cond; {28213#false} is VALID [2022-04-08 10:07:56,541 INFO L290 TraceCheckUtils]: 31: Hoare triple {28213#false} assume !false; {28213#false} is VALID [2022-04-08 10:07:56,542 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-08 10:07:56,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:56,796 INFO L290 TraceCheckUtils]: 31: Hoare triple {28213#false} assume !false; {28213#false} is VALID [2022-04-08 10:07:56,796 INFO L290 TraceCheckUtils]: 30: Hoare triple {28213#false} assume 0 == ~cond; {28213#false} is VALID [2022-04-08 10:07:56,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {28213#false} ~cond := #in~cond; {28213#false} is VALID [2022-04-08 10:07:56,796 INFO L272 TraceCheckUtils]: 28: Hoare triple {28213#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {28213#false} is VALID [2022-04-08 10:07:56,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {28213#false} assume !(~z~0 % 4294967296 > 0); {28213#false} is VALID [2022-04-08 10:07:56,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {28213#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28213#false} is VALID [2022-04-08 10:07:56,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {28213#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28213#false} is VALID [2022-04-08 10:07:56,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {28213#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28213#false} is VALID [2022-04-08 10:07:56,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {28213#false} assume !(~x~0 % 4294967296 > 0); {28213#false} is VALID [2022-04-08 10:07:56,797 INFO L290 TraceCheckUtils]: 22: Hoare triple {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28213#false} is VALID [2022-04-08 10:07:56,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {28218#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:56,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {28219#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28218#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:56,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28219#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:56,800 INFO L290 TraceCheckUtils]: 18: Hoare triple {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:56,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:56,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:56,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:56,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:56,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {28219#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28220#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:56,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {28218#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28219#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:56,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28218#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:56,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:56,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {28212#true} assume !(~x~0 % 4294967296 > 0); {28217#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:56,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {28212#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28212#true} is VALID [2022-04-08 10:07:56,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {28212#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28212#true} is VALID [2022-04-08 10:07:56,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {28212#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28212#true} is VALID [2022-04-08 10:07:56,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {28212#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28212#true} is VALID [2022-04-08 10:07:56,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {28212#true} call #t~ret15 := main(); {28212#true} is VALID [2022-04-08 10:07:56,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28212#true} {28212#true} #83#return; {28212#true} is VALID [2022-04-08 10:07:56,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {28212#true} assume true; {28212#true} is VALID [2022-04-08 10:07:56,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {28212#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28212#true} is VALID [2022-04-08 10:07:56,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {28212#true} call ULTIMATE.init(); {28212#true} is VALID [2022-04-08 10:07:56,807 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-08 10:07:56,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121299980] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:56,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:56,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-04-08 10:07:56,807 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:56,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [715961942] [2022-04-08 10:07:56,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [715961942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:56,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:56,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 10:07:56,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305674430] [2022-04-08 10:07:56,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:56,808 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 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 32 [2022-04-08 10:07:56,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:56,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 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-08 10:07:56,833 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-08 10:07:56,833 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 10:07:56,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:56,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 10:07:56,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 10:07:56,834 INFO L87 Difference]: Start difference. First operand 168 states and 213 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 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-08 10:07:57,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:57,639 INFO L93 Difference]: Finished difference Result 180 states and 227 transitions. [2022-04-08 10:07:57,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:07:57,640 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 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 32 [2022-04-08 10:07:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:57,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 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-08 10:07:57,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-08 10:07:57,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 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-08 10:07:57,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-08 10:07:57,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2022-04-08 10:07:57,677 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-08 10:07:57,679 INFO L225 Difference]: With dead ends: 180 [2022-04-08 10:07:57,679 INFO L226 Difference]: Without dead ends: 155 [2022-04-08 10:07:57,679 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-08 10:07:57,680 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 26 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:57,680 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 47 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:07:57,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-08 10:07:58,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2022-04-08 10:07:58,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:58,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 152 states, 147 states have (on average 1.2993197278911566) internal successors, (191), 147 states have internal predecessors, (191), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:58,171 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 152 states, 147 states have (on average 1.2993197278911566) internal successors, (191), 147 states have internal predecessors, (191), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:58,171 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 152 states, 147 states have (on average 1.2993197278911566) internal successors, (191), 147 states have internal predecessors, (191), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:58,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:58,172 INFO L93 Difference]: Finished difference Result 155 states and 198 transitions. [2022-04-08 10:07:58,172 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 198 transitions. [2022-04-08 10:07:58,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:58,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:58,173 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 147 states have (on average 1.2993197278911566) internal successors, (191), 147 states have internal predecessors, (191), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 155 states. [2022-04-08 10:07:58,173 INFO L87 Difference]: Start difference. First operand has 152 states, 147 states have (on average 1.2993197278911566) internal successors, (191), 147 states have internal predecessors, (191), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 155 states. [2022-04-08 10:07:58,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:58,174 INFO L93 Difference]: Finished difference Result 155 states and 198 transitions. [2022-04-08 10:07:58,174 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 198 transitions. [2022-04-08 10:07:58,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:58,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:58,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:58,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:58,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 147 states have (on average 1.2993197278911566) internal successors, (191), 147 states have internal predecessors, (191), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:58,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 195 transitions. [2022-04-08 10:07:58,177 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 195 transitions. Word has length 32 [2022-04-08 10:07:58,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:58,177 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 195 transitions. [2022-04-08 10:07:58,177 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 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-08 10:07:58,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 152 states and 195 transitions. [2022-04-08 10:07:58,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:58,601 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 195 transitions. [2022-04-08 10:07:58,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:07:58,601 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:58,601 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:58,617 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-08 10:07:58,801 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-08 10:07:58,801 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:58,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:58,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1320683330, now seen corresponding path program 15 times [2022-04-08 10:07:58,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:58,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1170875091] [2022-04-08 10:07:58,804 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:58,804 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:58,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1320683330, now seen corresponding path program 16 times [2022-04-08 10:07:58,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:58,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936923217] [2022-04-08 10:07:58,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:58,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:58,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:58,934 INFO L290 TraceCheckUtils]: 0: Hoare triple {29408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29395#true} is VALID [2022-04-08 10:07:58,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {29395#true} assume true; {29395#true} is VALID [2022-04-08 10:07:58,934 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29395#true} {29395#true} #83#return; {29395#true} is VALID [2022-04-08 10:07:58,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {29395#true} call ULTIMATE.init(); {29408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:58,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {29408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29395#true} is VALID [2022-04-08 10:07:58,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {29395#true} assume true; {29395#true} is VALID [2022-04-08 10:07:58,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29395#true} {29395#true} #83#return; {29395#true} is VALID [2022-04-08 10:07:58,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {29395#true} call #t~ret15 := main(); {29395#true} is VALID [2022-04-08 10:07:58,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {29395#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29395#true} is VALID [2022-04-08 10:07:58,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {29395#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29400#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:58,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {29400#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29401#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-08 10:07:58,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {29401#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29402#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:58,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {29402#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29403#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:07:58,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {29403#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {29403#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:07:58,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {29403#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {29403#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:07:58,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {29403#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29404#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:07:58,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {29404#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29405#(<= (+ 2 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:07:58,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {29405#(<= (+ 2 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29406#(<= (+ 3 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:07:58,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {29406#(<= (+ 3 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29407#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:58,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {29407#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {29407#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:58,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {29407#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29407#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:58,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {29407#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29407#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:58,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {29407#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29407#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:58,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {29407#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29407#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:58,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {29407#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {29407#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:58,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {29407#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {29396#false} is VALID [2022-04-08 10:07:58,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {29396#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {29396#false} is VALID [2022-04-08 10:07:58,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {29396#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {29396#false} is VALID [2022-04-08 10:07:58,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {29396#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {29396#false} is VALID [2022-04-08 10:07:58,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {29396#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {29396#false} is VALID [2022-04-08 10:07:58,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {29396#false} assume !(~z~0 % 4294967296 > 0); {29396#false} is VALID [2022-04-08 10:07:58,948 INFO L272 TraceCheckUtils]: 28: Hoare triple {29396#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {29396#false} is VALID [2022-04-08 10:07:58,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {29396#false} ~cond := #in~cond; {29396#false} is VALID [2022-04-08 10:07:58,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {29396#false} assume 0 == ~cond; {29396#false} is VALID [2022-04-08 10:07:58,948 INFO L290 TraceCheckUtils]: 31: Hoare triple {29396#false} assume !false; {29396#false} is VALID [2022-04-08 10:07:58,949 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-08 10:07:58,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:58,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936923217] [2022-04-08 10:07:58,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936923217] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:58,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880256375] [2022-04-08 10:07:58,949 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:07:58,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:58,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:58,952 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-08 10:07:58,976 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-08 10:07:59,004 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:07:59,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:59,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 10:07:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:59,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:59,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {29395#true} call ULTIMATE.init(); {29395#true} is VALID [2022-04-08 10:07:59,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {29395#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29395#true} is VALID [2022-04-08 10:07:59,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {29395#true} assume true; {29395#true} is VALID [2022-04-08 10:07:59,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29395#true} {29395#true} #83#return; {29395#true} is VALID [2022-04-08 10:07:59,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {29395#true} call #t~ret15 := main(); {29395#true} is VALID [2022-04-08 10:07:59,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {29395#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29395#true} is VALID [2022-04-08 10:07:59,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {29395#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29400#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:59,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {29400#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29433#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:07:59,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {29433#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29437#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:59,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {29437#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29441#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:07:59,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {29441#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !(~x~0 % 4294967296 > 0); {29441#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:07:59,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {29441#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} ~z~0 := ~y~0; {29441#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:07:59,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {29441#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29437#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:59,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {29437#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29433#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:07:59,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {29433#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29400#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:59,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {29400#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:59,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:59,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:59,327 INFO L290 TraceCheckUtils]: 18: Hoare triple {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:59,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:59,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:59,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:59,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {29396#false} is VALID [2022-04-08 10:07:59,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {29396#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {29396#false} is VALID [2022-04-08 10:07:59,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {29396#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {29396#false} is VALID [2022-04-08 10:07:59,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {29396#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {29396#false} is VALID [2022-04-08 10:07:59,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {29396#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {29396#false} is VALID [2022-04-08 10:07:59,328 INFO L290 TraceCheckUtils]: 27: Hoare triple {29396#false} assume !(~z~0 % 4294967296 > 0); {29396#false} is VALID [2022-04-08 10:07:59,328 INFO L272 TraceCheckUtils]: 28: Hoare triple {29396#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {29396#false} is VALID [2022-04-08 10:07:59,328 INFO L290 TraceCheckUtils]: 29: Hoare triple {29396#false} ~cond := #in~cond; {29396#false} is VALID [2022-04-08 10:07:59,329 INFO L290 TraceCheckUtils]: 30: Hoare triple {29396#false} assume 0 == ~cond; {29396#false} is VALID [2022-04-08 10:07:59,329 INFO L290 TraceCheckUtils]: 31: Hoare triple {29396#false} assume !false; {29396#false} is VALID [2022-04-08 10:07:59,329 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-08 10:07:59,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:59,589 INFO L290 TraceCheckUtils]: 31: Hoare triple {29396#false} assume !false; {29396#false} is VALID [2022-04-08 10:07:59,589 INFO L290 TraceCheckUtils]: 30: Hoare triple {29396#false} assume 0 == ~cond; {29396#false} is VALID [2022-04-08 10:07:59,589 INFO L290 TraceCheckUtils]: 29: Hoare triple {29396#false} ~cond := #in~cond; {29396#false} is VALID [2022-04-08 10:07:59,589 INFO L272 TraceCheckUtils]: 28: Hoare triple {29396#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {29396#false} is VALID [2022-04-08 10:07:59,589 INFO L290 TraceCheckUtils]: 27: Hoare triple {29396#false} assume !(~z~0 % 4294967296 > 0); {29396#false} is VALID [2022-04-08 10:07:59,589 INFO L290 TraceCheckUtils]: 26: Hoare triple {29396#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {29396#false} is VALID [2022-04-08 10:07:59,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {29396#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {29396#false} is VALID [2022-04-08 10:07:59,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {29396#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {29396#false} is VALID [2022-04-08 10:07:59,589 INFO L290 TraceCheckUtils]: 23: Hoare triple {29396#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {29396#false} is VALID [2022-04-08 10:07:59,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {29396#false} is VALID [2022-04-08 10:07:59,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:59,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:59,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:59,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:59,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:59,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:59,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {29400#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:59,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {29433#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29400#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:59,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {29437#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29433#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:07:59,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {29441#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29437#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:59,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {29441#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} ~z~0 := ~y~0; {29441#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:07:59,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {29441#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !(~x~0 % 4294967296 > 0); {29441#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:07:59,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {29437#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29441#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:07:59,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {29433#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29437#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:59,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {29400#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29433#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:07:59,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {29395#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29400#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:59,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {29395#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29395#true} is VALID [2022-04-08 10:07:59,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {29395#true} call #t~ret15 := main(); {29395#true} is VALID [2022-04-08 10:07:59,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29395#true} {29395#true} #83#return; {29395#true} is VALID [2022-04-08 10:07:59,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {29395#true} assume true; {29395#true} is VALID [2022-04-08 10:07:59,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {29395#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29395#true} is VALID [2022-04-08 10:07:59,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {29395#true} call ULTIMATE.init(); {29395#true} is VALID [2022-04-08 10:07:59,598 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-08 10:07:59,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880256375] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:59,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:59,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 15 [2022-04-08 10:07:59,599 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:59,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1170875091] [2022-04-08 10:07:59,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1170875091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:59,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:59,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:07:59,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065434593] [2022-04-08 10:07:59,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:59,599 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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 32 [2022-04-08 10:07:59,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:59,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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-08 10:07:59,618 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-08 10:07:59,618 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:07:59,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:59,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:07:59,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-08 10:07:59,618 INFO L87 Difference]: Start difference. First operand 152 states and 195 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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-08 10:08:00,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:00,873 INFO L93 Difference]: Finished difference Result 198 states and 261 transitions. [2022-04-08 10:08:00,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:08:00,873 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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 32 [2022-04-08 10:08:00,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:00,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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-08 10:08:00,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-08 10:08:00,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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-08 10:08:00,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-08 10:08:00,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-08 10:08:00,934 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-08 10:08:00,936 INFO L225 Difference]: With dead ends: 198 [2022-04-08 10:08:00,936 INFO L226 Difference]: Without dead ends: 186 [2022-04-08 10:08:00,937 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2022-04-08 10:08:00,937 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 38 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:00,937 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 64 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:08:00,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-08 10:08:01,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2022-04-08 10:08:01,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:01,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 183 states, 178 states have (on average 1.297752808988764) internal successors, (231), 178 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:01,648 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 183 states, 178 states have (on average 1.297752808988764) internal successors, (231), 178 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:01,648 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 183 states, 178 states have (on average 1.297752808988764) internal successors, (231), 178 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:01,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:01,650 INFO L93 Difference]: Finished difference Result 186 states and 241 transitions. [2022-04-08 10:08:01,650 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 241 transitions. [2022-04-08 10:08:01,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:01,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:01,650 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 178 states have (on average 1.297752808988764) internal successors, (231), 178 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 186 states. [2022-04-08 10:08:01,650 INFO L87 Difference]: Start difference. First operand has 183 states, 178 states have (on average 1.297752808988764) internal successors, (231), 178 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 186 states. [2022-04-08 10:08:01,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:01,652 INFO L93 Difference]: Finished difference Result 186 states and 241 transitions. [2022-04-08 10:08:01,652 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 241 transitions. [2022-04-08 10:08:01,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:01,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:01,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:01,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:01,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 178 states have (on average 1.297752808988764) internal successors, (231), 178 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:01,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 235 transitions. [2022-04-08 10:08:01,654 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 235 transitions. Word has length 32 [2022-04-08 10:08:01,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:01,654 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 235 transitions. [2022-04-08 10:08:01,655 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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-08 10:08:01,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 183 states and 235 transitions. [2022-04-08 10:08:02,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:02,289 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 235 transitions. [2022-04-08 10:08:02,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:08:02,289 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:02,289 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:02,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-04-08 10:08:02,491 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:02,491 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:02,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:02,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1032467933, now seen corresponding path program 17 times [2022-04-08 10:08:02,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:02,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1983585531] [2022-04-08 10:08:02,494 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:02,494 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:02,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1032467933, now seen corresponding path program 18 times [2022-04-08 10:08:02,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:02,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890139216] [2022-04-08 10:08:02,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:02,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:02,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:02,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {30772#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30754#true} is VALID [2022-04-08 10:08:02,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {30754#true} assume true; {30754#true} is VALID [2022-04-08 10:08:02,725 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30754#true} {30754#true} #83#return; {30754#true} is VALID [2022-04-08 10:08:02,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {30754#true} call ULTIMATE.init(); {30772#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:02,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {30772#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30754#true} is VALID [2022-04-08 10:08:02,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {30754#true} assume true; {30754#true} is VALID [2022-04-08 10:08:02,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30754#true} {30754#true} #83#return; {30754#true} is VALID [2022-04-08 10:08:02,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {30754#true} call #t~ret15 := main(); {30754#true} is VALID [2022-04-08 10:08:02,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {30754#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30759#(= main_~y~0 0)} is VALID [2022-04-08 10:08:02,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {30759#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30760#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:02,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {30760#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30761#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:02,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {30761#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30762#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:02,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {30762#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30763#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:02,728 INFO L290 TraceCheckUtils]: 10: Hoare triple {30763#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30764#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:02,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {30764#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {30764#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:02,729 INFO L290 TraceCheckUtils]: 12: Hoare triple {30764#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {30765#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:08:02,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {30765#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30766#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:08:02,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {30766#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30767#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:08:02,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {30767#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30768#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:08:02,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {30768#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30769#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:08:02,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {30769#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30770#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:08:02,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {30770#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {30770#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:08:02,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {30770#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30769#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:08:02,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {30769#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30768#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:08:02,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {30768#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30767#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:08:02,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {30767#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30766#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:08:02,735 INFO L290 TraceCheckUtils]: 23: Hoare triple {30766#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30765#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:08:02,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {30765#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {30765#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:08:02,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {30765#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {30765#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:08:02,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {30765#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30771#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:02,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {30771#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {30755#false} is VALID [2022-04-08 10:08:02,737 INFO L272 TraceCheckUtils]: 28: Hoare triple {30755#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {30755#false} is VALID [2022-04-08 10:08:02,737 INFO L290 TraceCheckUtils]: 29: Hoare triple {30755#false} ~cond := #in~cond; {30755#false} is VALID [2022-04-08 10:08:02,737 INFO L290 TraceCheckUtils]: 30: Hoare triple {30755#false} assume 0 == ~cond; {30755#false} is VALID [2022-04-08 10:08:02,737 INFO L290 TraceCheckUtils]: 31: Hoare triple {30755#false} assume !false; {30755#false} is VALID [2022-04-08 10:08:02,737 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:02,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:02,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890139216] [2022-04-08 10:08:02,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890139216] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:02,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061818096] [2022-04-08 10:08:02,738 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:08:02,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:02,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:02,738 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-08 10:08:02,739 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-08 10:08:02,790 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:08:02,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:02,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-08 10:08:02,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:02,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:02,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {30754#true} call ULTIMATE.init(); {30754#true} is VALID [2022-04-08 10:08:02,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {30754#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30754#true} is VALID [2022-04-08 10:08:02,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {30754#true} assume true; {30754#true} is VALID [2022-04-08 10:08:02,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30754#true} {30754#true} #83#return; {30754#true} is VALID [2022-04-08 10:08:02,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {30754#true} call #t~ret15 := main(); {30754#true} is VALID [2022-04-08 10:08:02,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {30754#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30754#true} is VALID [2022-04-08 10:08:02,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {30754#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30794#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:08:02,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {30794#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30798#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:08:02,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {30798#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30802#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:08:02,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {30802#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30806#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:08:02,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {30806#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30810#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:08:02,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {30810#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {30810#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:08:02,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {30810#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {30810#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:08:02,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {30810#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30806#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:08:02,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {30806#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30802#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:08:02,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {30802#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30798#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:08:02,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {30798#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30794#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:08:02,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {30794#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:02,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {30832#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:02,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {30832#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:02,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {30832#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:02,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {30832#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:02,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {30832#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:02,991 INFO L290 TraceCheckUtils]: 23: Hoare triple {30832#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:02,991 INFO L290 TraceCheckUtils]: 24: Hoare triple {30832#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:02,992 INFO L290 TraceCheckUtils]: 25: Hoare triple {30832#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {30755#false} is VALID [2022-04-08 10:08:02,992 INFO L290 TraceCheckUtils]: 26: Hoare triple {30755#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30755#false} is VALID [2022-04-08 10:08:02,992 INFO L290 TraceCheckUtils]: 27: Hoare triple {30755#false} assume !(~z~0 % 4294967296 > 0); {30755#false} is VALID [2022-04-08 10:08:02,992 INFO L272 TraceCheckUtils]: 28: Hoare triple {30755#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {30755#false} is VALID [2022-04-08 10:08:02,992 INFO L290 TraceCheckUtils]: 29: Hoare triple {30755#false} ~cond := #in~cond; {30755#false} is VALID [2022-04-08 10:08:02,992 INFO L290 TraceCheckUtils]: 30: Hoare triple {30755#false} assume 0 == ~cond; {30755#false} is VALID [2022-04-08 10:08:02,992 INFO L290 TraceCheckUtils]: 31: Hoare triple {30755#false} assume !false; {30755#false} is VALID [2022-04-08 10:08:02,992 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 10:08:02,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:03,091 INFO L290 TraceCheckUtils]: 31: Hoare triple {30755#false} assume !false; {30755#false} is VALID [2022-04-08 10:08:03,092 INFO L290 TraceCheckUtils]: 30: Hoare triple {30755#false} assume 0 == ~cond; {30755#false} is VALID [2022-04-08 10:08:03,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {30755#false} ~cond := #in~cond; {30755#false} is VALID [2022-04-08 10:08:03,092 INFO L272 TraceCheckUtils]: 28: Hoare triple {30755#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {30755#false} is VALID [2022-04-08 10:08:03,092 INFO L290 TraceCheckUtils]: 27: Hoare triple {30755#false} assume !(~z~0 % 4294967296 > 0); {30755#false} is VALID [2022-04-08 10:08:03,092 INFO L290 TraceCheckUtils]: 26: Hoare triple {30755#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30755#false} is VALID [2022-04-08 10:08:03,092 INFO L290 TraceCheckUtils]: 25: Hoare triple {30832#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {30755#false} is VALID [2022-04-08 10:08:03,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {30832#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:03,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {30832#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:03,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {30832#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:03,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {30832#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:03,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {30832#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:03,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {30832#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:03,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {30832#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:03,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {30794#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30832#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:03,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {30798#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30794#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:08:03,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {30802#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30798#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:08:03,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {30806#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30802#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:08:03,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {30810#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30806#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:08:03,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {30810#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {30810#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:08:03,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {30810#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {30810#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:08:03,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {30806#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30810#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:08:03,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {30802#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30806#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:08:03,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {30798#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30802#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:08:03,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {30794#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30798#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:08:03,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {30754#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30794#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:08:03,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {30754#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30754#true} is VALID [2022-04-08 10:08:03,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {30754#true} call #t~ret15 := main(); {30754#true} is VALID [2022-04-08 10:08:03,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30754#true} {30754#true} #83#return; {30754#true} is VALID [2022-04-08 10:08:03,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {30754#true} assume true; {30754#true} is VALID [2022-04-08 10:08:03,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {30754#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30754#true} is VALID [2022-04-08 10:08:03,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {30754#true} call ULTIMATE.init(); {30754#true} is VALID [2022-04-08 10:08:03,102 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 10:08:03,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061818096] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:03,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:03,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 22 [2022-04-08 10:08:03,103 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:03,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1983585531] [2022-04-08 10:08:03,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1983585531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:03,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:03,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:08:03,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101818077] [2022-04-08 10:08:03,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:03,104 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 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-08 10:08:03,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:03,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 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-08 10:08:03,143 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-08 10:08:03,143 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:08:03,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:03,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:08:03,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:08:03,144 INFO L87 Difference]: Start difference. First operand 183 states and 235 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 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-08 10:08:06,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:06,812 INFO L93 Difference]: Finished difference Result 254 states and 344 transitions. [2022-04-08 10:08:06,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-08 10:08:06,812 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 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-08 10:08:06,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:06,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 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-08 10:08:06,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 151 transitions. [2022-04-08 10:08:06,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 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-08 10:08:06,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 151 transitions. [2022-04-08 10:08:06,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 151 transitions. [2022-04-08 10:08:06,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:06,957 INFO L225 Difference]: With dead ends: 254 [2022-04-08 10:08:06,957 INFO L226 Difference]: Without dead ends: 238 [2022-04-08 10:08:06,958 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=343, Invalid=4213, Unknown=0, NotChecked=0, Total=4556 [2022-04-08 10:08:06,958 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 62 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:06,958 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 85 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:08:06,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-04-08 10:08:07,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 191. [2022-04-08 10:08:07,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:07,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand has 191 states, 186 states have (on average 1.2849462365591398) internal successors, (239), 186 states have internal predecessors, (239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:07,705 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand has 191 states, 186 states have (on average 1.2849462365591398) internal successors, (239), 186 states have internal predecessors, (239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:07,705 INFO L87 Difference]: Start difference. First operand 238 states. Second operand has 191 states, 186 states have (on average 1.2849462365591398) internal successors, (239), 186 states have internal predecessors, (239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:07,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:07,708 INFO L93 Difference]: Finished difference Result 238 states and 298 transitions. [2022-04-08 10:08:07,708 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 298 transitions. [2022-04-08 10:08:07,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:07,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:07,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 191 states, 186 states have (on average 1.2849462365591398) internal successors, (239), 186 states have internal predecessors, (239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 238 states. [2022-04-08 10:08:07,708 INFO L87 Difference]: Start difference. First operand has 191 states, 186 states have (on average 1.2849462365591398) internal successors, (239), 186 states have internal predecessors, (239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 238 states. [2022-04-08 10:08:07,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:07,712 INFO L93 Difference]: Finished difference Result 238 states and 298 transitions. [2022-04-08 10:08:07,712 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 298 transitions. [2022-04-08 10:08:07,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:07,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:07,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:07,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:07,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 186 states have (on average 1.2849462365591398) internal successors, (239), 186 states have internal predecessors, (239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:07,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 243 transitions. [2022-04-08 10:08:07,715 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 243 transitions. Word has length 32 [2022-04-08 10:08:07,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:07,715 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 243 transitions. [2022-04-08 10:08:07,715 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 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-08 10:08:07,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 191 states and 243 transitions. [2022-04-08 10:08:08,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:08,373 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 243 transitions. [2022-04-08 10:08:08,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:08:08,373 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:08,374 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:08,390 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-08 10:08:08,574 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,SelfDestructingSolverStorable37 [2022-04-08 10:08:08,574 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:08,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:08,575 INFO L85 PathProgramCache]: Analyzing trace with hash 904933634, now seen corresponding path program 31 times [2022-04-08 10:08:08,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:08,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [201726876] [2022-04-08 10:08:08,577 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:08,577 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:08,577 INFO L85 PathProgramCache]: Analyzing trace with hash 904933634, now seen corresponding path program 32 times [2022-04-08 10:08:08,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:08,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818982076] [2022-04-08 10:08:08,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:08,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:08,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:08,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {32443#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32428#true} is VALID [2022-04-08 10:08:08,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {32428#true} assume true; {32428#true} is VALID [2022-04-08 10:08:08,741 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32428#true} {32428#true} #83#return; {32428#true} is VALID [2022-04-08 10:08:08,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {32428#true} call ULTIMATE.init(); {32443#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:08,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {32443#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32428#true} is VALID [2022-04-08 10:08:08,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {32428#true} assume true; {32428#true} is VALID [2022-04-08 10:08:08,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32428#true} {32428#true} #83#return; {32428#true} is VALID [2022-04-08 10:08:08,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {32428#true} call #t~ret15 := main(); {32428#true} is VALID [2022-04-08 10:08:08,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {32428#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32433#(= main_~y~0 0)} is VALID [2022-04-08 10:08:08,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {32433#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32434#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:08,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {32434#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32435#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:08,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {32435#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32436#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:08,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {32436#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32437#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:08,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {32437#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32438#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:08,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {32438#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32439#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:08,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {32439#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {32439#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:08,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {32439#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {32440#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:08:08,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {32440#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32441#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:08:08,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {32441#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32442#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:08,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {32442#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {32429#false} is VALID [2022-04-08 10:08:08,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {32429#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32429#false} is VALID [2022-04-08 10:08:08,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {32429#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32429#false} is VALID [2022-04-08 10:08:08,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {32429#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32429#false} is VALID [2022-04-08 10:08:08,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {32429#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32429#false} is VALID [2022-04-08 10:08:08,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {32429#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32429#false} is VALID [2022-04-08 10:08:08,749 INFO L290 TraceCheckUtils]: 22: Hoare triple {32429#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32429#false} is VALID [2022-04-08 10:08:08,749 INFO L290 TraceCheckUtils]: 23: Hoare triple {32429#false} assume !(~y~0 % 4294967296 > 0); {32429#false} is VALID [2022-04-08 10:08:08,749 INFO L290 TraceCheckUtils]: 24: Hoare triple {32429#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32429#false} is VALID [2022-04-08 10:08:08,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {32429#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32429#false} is VALID [2022-04-08 10:08:08,749 INFO L290 TraceCheckUtils]: 26: Hoare triple {32429#false} assume !(~x~0 % 4294967296 > 0); {32429#false} is VALID [2022-04-08 10:08:08,749 INFO L290 TraceCheckUtils]: 27: Hoare triple {32429#false} assume !(~z~0 % 4294967296 > 0); {32429#false} is VALID [2022-04-08 10:08:08,749 INFO L272 TraceCheckUtils]: 28: Hoare triple {32429#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {32429#false} is VALID [2022-04-08 10:08:08,749 INFO L290 TraceCheckUtils]: 29: Hoare triple {32429#false} ~cond := #in~cond; {32429#false} is VALID [2022-04-08 10:08:08,749 INFO L290 TraceCheckUtils]: 30: Hoare triple {32429#false} assume 0 == ~cond; {32429#false} is VALID [2022-04-08 10:08:08,749 INFO L290 TraceCheckUtils]: 31: Hoare triple {32429#false} assume !false; {32429#false} is VALID [2022-04-08 10:08:08,750 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 10:08:08,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:08,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818982076] [2022-04-08 10:08:08,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818982076] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:08,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648881404] [2022-04-08 10:08:08,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:08:08,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:08,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:08,752 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-08 10:08:08,776 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-08 10:08:08,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:08:08,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:08,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 10:08:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:08,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:09,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {32428#true} call ULTIMATE.init(); {32428#true} is VALID [2022-04-08 10:08:09,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {32428#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32428#true} is VALID [2022-04-08 10:08:09,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {32428#true} assume true; {32428#true} is VALID [2022-04-08 10:08:09,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32428#true} {32428#true} #83#return; {32428#true} is VALID [2022-04-08 10:08:09,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {32428#true} call #t~ret15 := main(); {32428#true} is VALID [2022-04-08 10:08:09,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {32428#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32433#(= main_~y~0 0)} is VALID [2022-04-08 10:08:09,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {32433#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32434#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:09,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {32434#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32435#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:09,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {32435#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32436#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:09,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {32436#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32437#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:09,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {32437#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32438#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:09,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {32438#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32439#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:09,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {32439#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {32439#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:09,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {32439#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {32440#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:08:09,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {32440#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32441#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:08:09,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {32441#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32492#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:08:09,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {32492#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {32429#false} is VALID [2022-04-08 10:08:09,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {32429#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32429#false} is VALID [2022-04-08 10:08:09,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {32429#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32429#false} is VALID [2022-04-08 10:08:09,044 INFO L290 TraceCheckUtils]: 19: Hoare triple {32429#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32429#false} is VALID [2022-04-08 10:08:09,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {32429#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32429#false} is VALID [2022-04-08 10:08:09,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {32429#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32429#false} is VALID [2022-04-08 10:08:09,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {32429#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32429#false} is VALID [2022-04-08 10:08:09,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {32429#false} assume !(~y~0 % 4294967296 > 0); {32429#false} is VALID [2022-04-08 10:08:09,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {32429#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32429#false} is VALID [2022-04-08 10:08:09,044 INFO L290 TraceCheckUtils]: 25: Hoare triple {32429#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32429#false} is VALID [2022-04-08 10:08:09,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {32429#false} assume !(~x~0 % 4294967296 > 0); {32429#false} is VALID [2022-04-08 10:08:09,044 INFO L290 TraceCheckUtils]: 27: Hoare triple {32429#false} assume !(~z~0 % 4294967296 > 0); {32429#false} is VALID [2022-04-08 10:08:09,044 INFO L272 TraceCheckUtils]: 28: Hoare triple {32429#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {32429#false} is VALID [2022-04-08 10:08:09,044 INFO L290 TraceCheckUtils]: 29: Hoare triple {32429#false} ~cond := #in~cond; {32429#false} is VALID [2022-04-08 10:08:09,044 INFO L290 TraceCheckUtils]: 30: Hoare triple {32429#false} assume 0 == ~cond; {32429#false} is VALID [2022-04-08 10:08:09,045 INFO L290 TraceCheckUtils]: 31: Hoare triple {32429#false} assume !false; {32429#false} is VALID [2022-04-08 10:08:09,045 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 10:08:09,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:09,293 INFO L290 TraceCheckUtils]: 31: Hoare triple {32429#false} assume !false; {32429#false} is VALID [2022-04-08 10:08:09,294 INFO L290 TraceCheckUtils]: 30: Hoare triple {32429#false} assume 0 == ~cond; {32429#false} is VALID [2022-04-08 10:08:09,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {32429#false} ~cond := #in~cond; {32429#false} is VALID [2022-04-08 10:08:09,294 INFO L272 TraceCheckUtils]: 28: Hoare triple {32429#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {32429#false} is VALID [2022-04-08 10:08:09,294 INFO L290 TraceCheckUtils]: 27: Hoare triple {32429#false} assume !(~z~0 % 4294967296 > 0); {32429#false} is VALID [2022-04-08 10:08:09,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {32429#false} assume !(~x~0 % 4294967296 > 0); {32429#false} is VALID [2022-04-08 10:08:09,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {32429#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32429#false} is VALID [2022-04-08 10:08:09,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {32429#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32429#false} is VALID [2022-04-08 10:08:09,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {32429#false} assume !(~y~0 % 4294967296 > 0); {32429#false} is VALID [2022-04-08 10:08:09,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {32429#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32429#false} is VALID [2022-04-08 10:08:09,294 INFO L290 TraceCheckUtils]: 21: Hoare triple {32429#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32429#false} is VALID [2022-04-08 10:08:09,294 INFO L290 TraceCheckUtils]: 20: Hoare triple {32429#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32429#false} is VALID [2022-04-08 10:08:09,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {32429#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32429#false} is VALID [2022-04-08 10:08:09,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {32429#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32429#false} is VALID [2022-04-08 10:08:09,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {32429#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32429#false} is VALID [2022-04-08 10:08:09,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {32586#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {32429#false} is VALID [2022-04-08 10:08:09,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {32590#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32586#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:08:09,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {32594#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32590#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:09,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {32598#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {32594#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:09,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {32598#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {32598#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:09,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {32605#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32598#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:09,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {32609#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32605#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:09,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {32613#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32609#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:09,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {32617#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32613#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:08:09,300 INFO L290 TraceCheckUtils]: 7: Hoare triple {32621#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32617#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:08:09,300 INFO L290 TraceCheckUtils]: 6: Hoare triple {32625#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32621#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:08:09,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {32428#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32625#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:08:09,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {32428#true} call #t~ret15 := main(); {32428#true} is VALID [2022-04-08 10:08:09,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32428#true} {32428#true} #83#return; {32428#true} is VALID [2022-04-08 10:08:09,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {32428#true} assume true; {32428#true} is VALID [2022-04-08 10:08:09,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {32428#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32428#true} is VALID [2022-04-08 10:08:09,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {32428#true} call ULTIMATE.init(); {32428#true} is VALID [2022-04-08 10:08:09,301 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 10:08:09,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648881404] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:09,301 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:09,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-08 10:08:09,302 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:09,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [201726876] [2022-04-08 10:08:09,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [201726876] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:09,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:09,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:08:09,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206234618] [2022-04-08 10:08:09,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:09,302 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 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 32 [2022-04-08 10:08:09,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:09,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 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-08 10:08:09,321 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-08 10:08:09,321 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:08:09,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:09,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:08:09,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2022-04-08 10:08:09,322 INFO L87 Difference]: Start difference. First operand 191 states and 243 transitions. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 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-08 10:08:12,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:12,174 INFO L93 Difference]: Finished difference Result 300 states and 376 transitions. [2022-04-08 10:08:12,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 10:08:12,174 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 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 32 [2022-04-08 10:08:12,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 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-08 10:08:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 99 transitions. [2022-04-08 10:08:12,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 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-08 10:08:12,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 99 transitions. [2022-04-08 10:08:12,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 99 transitions. [2022-04-08 10:08:12,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:12,255 INFO L225 Difference]: With dead ends: 300 [2022-04-08 10:08:12,255 INFO L226 Difference]: Without dead ends: 284 [2022-04-08 10:08:12,255 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=282, Invalid=1050, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 10:08:12,256 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 55 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:12,256 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 85 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:08:12,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-04-08 10:08:13,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 191. [2022-04-08 10:08:13,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:13,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 284 states. Second operand has 191 states, 186 states have (on average 1.2795698924731183) internal successors, (238), 186 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:13,013 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand has 191 states, 186 states have (on average 1.2795698924731183) internal successors, (238), 186 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:13,013 INFO L87 Difference]: Start difference. First operand 284 states. Second operand has 191 states, 186 states have (on average 1.2795698924731183) internal successors, (238), 186 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:13,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:13,016 INFO L93 Difference]: Finished difference Result 284 states and 359 transitions. [2022-04-08 10:08:13,017 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 359 transitions. [2022-04-08 10:08:13,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:13,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:13,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 191 states, 186 states have (on average 1.2795698924731183) internal successors, (238), 186 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 284 states. [2022-04-08 10:08:13,017 INFO L87 Difference]: Start difference. First operand has 191 states, 186 states have (on average 1.2795698924731183) internal successors, (238), 186 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 284 states. [2022-04-08 10:08:13,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:13,021 INFO L93 Difference]: Finished difference Result 284 states and 359 transitions. [2022-04-08 10:08:13,021 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 359 transitions. [2022-04-08 10:08:13,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:13,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:13,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:13,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:13,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 186 states have (on average 1.2795698924731183) internal successors, (238), 186 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:13,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 242 transitions. [2022-04-08 10:08:13,025 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 242 transitions. Word has length 32 [2022-04-08 10:08:13,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:13,025 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 242 transitions. [2022-04-08 10:08:13,025 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 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-08 10:08:13,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 191 states and 242 transitions. [2022-04-08 10:08:13,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:13,779 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 242 transitions. [2022-04-08 10:08:13,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:08:13,779 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:13,779 INFO L499 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:13,795 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-08 10:08:13,979 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-08 10:08:13,980 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:13,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:13,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1321483054, now seen corresponding path program 33 times [2022-04-08 10:08:13,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:13,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [677334527] [2022-04-08 10:08:13,983 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:13,983 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:13,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1321483054, now seen corresponding path program 34 times [2022-04-08 10:08:13,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:13,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72796211] [2022-04-08 10:08:13,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:13,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:14,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:14,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {34243#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34222#true} is VALID [2022-04-08 10:08:14,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {34222#true} assume true; {34222#true} is VALID [2022-04-08 10:08:14,235 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34222#true} {34222#true} #83#return; {34222#true} is VALID [2022-04-08 10:08:14,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {34222#true} call ULTIMATE.init(); {34243#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:14,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {34243#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34222#true} is VALID [2022-04-08 10:08:14,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {34222#true} assume true; {34222#true} is VALID [2022-04-08 10:08:14,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34222#true} {34222#true} #83#return; {34222#true} is VALID [2022-04-08 10:08:14,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {34222#true} call #t~ret15 := main(); {34222#true} is VALID [2022-04-08 10:08:14,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {34222#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34227#(= main_~y~0 0)} is VALID [2022-04-08 10:08:14,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {34227#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34228#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:14,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {34228#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34229#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:14,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {34229#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34230#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:14,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {34230#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34231#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:14,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {34231#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:14,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {34232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34233#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:14,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {34233#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34234#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:14,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {34234#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34235#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:14,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {34235#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34236#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:14,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {34236#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34237#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:14,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {34237#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34238#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:14,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {34238#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34239#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:14,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {34239#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34240#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:14,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {34240#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {34240#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:14,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {34240#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {34241#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:08:14,246 INFO L290 TraceCheckUtils]: 21: Hoare triple {34241#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34242#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-08 10:08:14,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {34242#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {34223#false} is VALID [2022-04-08 10:08:14,247 INFO L290 TraceCheckUtils]: 23: Hoare triple {34223#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34223#false} is VALID [2022-04-08 10:08:14,247 INFO L290 TraceCheckUtils]: 24: Hoare triple {34223#false} assume !(~y~0 % 4294967296 > 0); {34223#false} is VALID [2022-04-08 10:08:14,247 INFO L290 TraceCheckUtils]: 25: Hoare triple {34223#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {34223#false} is VALID [2022-04-08 10:08:14,247 INFO L290 TraceCheckUtils]: 26: Hoare triple {34223#false} assume !(~x~0 % 4294967296 > 0); {34223#false} is VALID [2022-04-08 10:08:14,247 INFO L290 TraceCheckUtils]: 27: Hoare triple {34223#false} assume !(~z~0 % 4294967296 > 0); {34223#false} is VALID [2022-04-08 10:08:14,247 INFO L272 TraceCheckUtils]: 28: Hoare triple {34223#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {34223#false} is VALID [2022-04-08 10:08:14,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {34223#false} ~cond := #in~cond; {34223#false} is VALID [2022-04-08 10:08:14,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {34223#false} assume 0 == ~cond; {34223#false} is VALID [2022-04-08 10:08:14,247 INFO L290 TraceCheckUtils]: 31: Hoare triple {34223#false} assume !false; {34223#false} is VALID [2022-04-08 10:08:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:08:14,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:14,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72796211] [2022-04-08 10:08:14,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72796211] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:14,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429946272] [2022-04-08 10:08:14,248 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:08:14,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:14,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:14,248 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-08 10:08:14,249 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-08 10:08:14,289 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:08:14,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:14,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 10:08:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:14,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:14,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {34222#true} call ULTIMATE.init(); {34222#true} is VALID [2022-04-08 10:08:14,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {34222#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34222#true} is VALID [2022-04-08 10:08:14,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {34222#true} assume true; {34222#true} is VALID [2022-04-08 10:08:14,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34222#true} {34222#true} #83#return; {34222#true} is VALID [2022-04-08 10:08:14,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {34222#true} call #t~ret15 := main(); {34222#true} is VALID [2022-04-08 10:08:14,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {34222#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34227#(= main_~y~0 0)} is VALID [2022-04-08 10:08:14,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {34227#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34228#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:14,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {34228#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34229#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:14,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {34229#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34230#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:14,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {34230#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34231#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:14,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {34231#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:14,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {34232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34233#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:14,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {34233#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34234#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:14,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {34234#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34235#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:14,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {34235#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34236#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:14,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {34236#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34237#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:14,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {34237#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34238#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:14,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {34238#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34239#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:14,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {34239#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34240#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:14,568 INFO L290 TraceCheckUtils]: 19: Hoare triple {34240#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {34240#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:14,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {34240#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {34241#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:08:14,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {34241#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34310#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:08:14,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {34310#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {34223#false} is VALID [2022-04-08 10:08:14,570 INFO L290 TraceCheckUtils]: 23: Hoare triple {34223#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34223#false} is VALID [2022-04-08 10:08:14,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {34223#false} assume !(~y~0 % 4294967296 > 0); {34223#false} is VALID [2022-04-08 10:08:14,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {34223#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {34223#false} is VALID [2022-04-08 10:08:14,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {34223#false} assume !(~x~0 % 4294967296 > 0); {34223#false} is VALID [2022-04-08 10:08:14,570 INFO L290 TraceCheckUtils]: 27: Hoare triple {34223#false} assume !(~z~0 % 4294967296 > 0); {34223#false} is VALID [2022-04-08 10:08:14,570 INFO L272 TraceCheckUtils]: 28: Hoare triple {34223#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {34223#false} is VALID [2022-04-08 10:08:14,570 INFO L290 TraceCheckUtils]: 29: Hoare triple {34223#false} ~cond := #in~cond; {34223#false} is VALID [2022-04-08 10:08:14,570 INFO L290 TraceCheckUtils]: 30: Hoare triple {34223#false} assume 0 == ~cond; {34223#false} is VALID [2022-04-08 10:08:14,570 INFO L290 TraceCheckUtils]: 31: Hoare triple {34223#false} assume !false; {34223#false} is VALID [2022-04-08 10:08:14,570 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:08:14,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:15,025 INFO L290 TraceCheckUtils]: 31: Hoare triple {34223#false} assume !false; {34223#false} is VALID [2022-04-08 10:08:15,025 INFO L290 TraceCheckUtils]: 30: Hoare triple {34223#false} assume 0 == ~cond; {34223#false} is VALID [2022-04-08 10:08:15,025 INFO L290 TraceCheckUtils]: 29: Hoare triple {34223#false} ~cond := #in~cond; {34223#false} is VALID [2022-04-08 10:08:15,025 INFO L272 TraceCheckUtils]: 28: Hoare triple {34223#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {34223#false} is VALID [2022-04-08 10:08:15,026 INFO L290 TraceCheckUtils]: 27: Hoare triple {34223#false} assume !(~z~0 % 4294967296 > 0); {34223#false} is VALID [2022-04-08 10:08:15,026 INFO L290 TraceCheckUtils]: 26: Hoare triple {34223#false} assume !(~x~0 % 4294967296 > 0); {34223#false} is VALID [2022-04-08 10:08:15,026 INFO L290 TraceCheckUtils]: 25: Hoare triple {34223#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {34223#false} is VALID [2022-04-08 10:08:15,026 INFO L290 TraceCheckUtils]: 24: Hoare triple {34223#false} assume !(~y~0 % 4294967296 > 0); {34223#false} is VALID [2022-04-08 10:08:15,026 INFO L290 TraceCheckUtils]: 23: Hoare triple {34223#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34223#false} is VALID [2022-04-08 10:08:15,026 INFO L290 TraceCheckUtils]: 22: Hoare triple {34368#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {34223#false} is VALID [2022-04-08 10:08:15,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {34372#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34368#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:08:15,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {34376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {34372#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:15,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {34376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {34376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:15,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {34383#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:15,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {34387#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34383#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:15,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {34391#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34387#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:08:15,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {34395#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34391#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:08:15,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {34399#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34395#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:08:15,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {34403#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34399#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:08:15,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {34407#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34403#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:15,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {34411#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34407#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:08:15,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {34415#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34411#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:15,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {34419#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34415#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:08:15,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {34423#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34419#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:08:15,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {34427#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34423#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:08:15,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {34431#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34427#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:08:15,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {34222#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34431#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:08:15,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {34222#true} call #t~ret15 := main(); {34222#true} is VALID [2022-04-08 10:08:15,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34222#true} {34222#true} #83#return; {34222#true} is VALID [2022-04-08 10:08:15,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {34222#true} assume true; {34222#true} is VALID [2022-04-08 10:08:15,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {34222#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34222#true} is VALID [2022-04-08 10:08:15,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {34222#true} call ULTIMATE.init(); {34222#true} is VALID [2022-04-08 10:08:15,036 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:08:15,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429946272] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:15,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:15,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-08 10:08:15,037 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:15,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [677334527] [2022-04-08 10:08:15,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [677334527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:15,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:15,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:08:15,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294730818] [2022-04-08 10:08:15,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:15,037 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-08 10:08:15,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:15,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-08 10:08:15,058 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-08 10:08:15,058 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:08:15,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:15,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:08:15,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=989, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:08:15,059 INFO L87 Difference]: Start difference. First operand 191 states and 242 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-08 10:08:21,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:21,287 INFO L93 Difference]: Finished difference Result 430 states and 598 transitions. [2022-04-08 10:08:21,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 10:08:21,287 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-08 10:08:21,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:21,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-08 10:08:21,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 186 transitions. [2022-04-08 10:08:21,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-08 10:08:21,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 186 transitions. [2022-04-08 10:08:21,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 186 transitions. [2022-04-08 10:08:21,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:21,443 INFO L225 Difference]: With dead ends: 430 [2022-04-08 10:08:21,443 INFO L226 Difference]: Without dead ends: 407 [2022-04-08 10:08:21,443 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=589, Invalid=2167, Unknown=0, NotChecked=0, Total=2756 [2022-04-08 10:08:21,444 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 128 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 2204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:21,444 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 158 Invalid, 2204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2108 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-08 10:08:21,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-04-08 10:08:22,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 203. [2022-04-08 10:08:22,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:22,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 407 states. Second operand has 203 states, 198 states have (on average 1.2878787878787878) internal successors, (255), 198 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:22,247 INFO L74 IsIncluded]: Start isIncluded. First operand 407 states. Second operand has 203 states, 198 states have (on average 1.2878787878787878) internal successors, (255), 198 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:22,248 INFO L87 Difference]: Start difference. First operand 407 states. Second operand has 203 states, 198 states have (on average 1.2878787878787878) internal successors, (255), 198 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:22,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:22,253 INFO L93 Difference]: Finished difference Result 407 states and 515 transitions. [2022-04-08 10:08:22,253 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 515 transitions. [2022-04-08 10:08:22,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:22,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:22,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 203 states, 198 states have (on average 1.2878787878787878) internal successors, (255), 198 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 407 states. [2022-04-08 10:08:22,254 INFO L87 Difference]: Start difference. First operand has 203 states, 198 states have (on average 1.2878787878787878) internal successors, (255), 198 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 407 states. [2022-04-08 10:08:22,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:22,260 INFO L93 Difference]: Finished difference Result 407 states and 515 transitions. [2022-04-08 10:08:22,260 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 515 transitions. [2022-04-08 10:08:22,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:22,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:22,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:22,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:22,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 198 states have (on average 1.2878787878787878) internal successors, (255), 198 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:22,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 259 transitions. [2022-04-08 10:08:22,263 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 259 transitions. Word has length 32 [2022-04-08 10:08:22,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:22,263 INFO L478 AbstractCegarLoop]: Abstraction has 203 states and 259 transitions. [2022-04-08 10:08:22,263 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-08 10:08:22,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 203 states and 259 transitions. [2022-04-08 10:08:23,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:23,055 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 259 transitions. [2022-04-08 10:08:23,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 10:08:23,056 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:23,056 INFO L499 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:23,072 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-08 10:08:23,259 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-08 10:08:23,259 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:23,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:23,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1467711455, now seen corresponding path program 35 times [2022-04-08 10:08:23,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:23,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [363159685] [2022-04-08 10:08:23,262 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:23,262 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:23,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1467711455, now seen corresponding path program 36 times [2022-04-08 10:08:23,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:23,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138281334] [2022-04-08 10:08:23,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:23,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:23,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:23,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {36588#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36566#true} is VALID [2022-04-08 10:08:23,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {36566#true} assume true; {36566#true} is VALID [2022-04-08 10:08:23,547 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36566#true} {36566#true} #83#return; {36566#true} is VALID [2022-04-08 10:08:23,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {36566#true} call ULTIMATE.init(); {36588#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:23,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {36588#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36566#true} is VALID [2022-04-08 10:08:23,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {36566#true} assume true; {36566#true} is VALID [2022-04-08 10:08:23,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36566#true} {36566#true} #83#return; {36566#true} is VALID [2022-04-08 10:08:23,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {36566#true} call #t~ret15 := main(); {36566#true} is VALID [2022-04-08 10:08:23,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {36566#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36571#(= main_~y~0 0)} is VALID [2022-04-08 10:08:23,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {36571#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36572#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:23,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {36572#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36573#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:23,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {36573#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36574#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:23,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {36574#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36575#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:23,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {36575#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36576#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:23,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {36576#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36577#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:23,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {36577#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36578#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:23,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {36578#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36579#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:23,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {36579#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36580#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:23,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {36580#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36581#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:23,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {36581#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36582#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:23,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {36582#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36583#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:23,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {36583#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36584#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:23,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {36584#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36585#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:08:23,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {36585#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {36585#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:08:23,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {36585#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {36586#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:08:23,560 INFO L290 TraceCheckUtils]: 22: Hoare triple {36586#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36587#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:23,560 INFO L290 TraceCheckUtils]: 23: Hoare triple {36587#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {36567#false} is VALID [2022-04-08 10:08:23,560 INFO L290 TraceCheckUtils]: 24: Hoare triple {36567#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36567#false} is VALID [2022-04-08 10:08:23,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {36567#false} assume !(~y~0 % 4294967296 > 0); {36567#false} is VALID [2022-04-08 10:08:23,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {36567#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36567#false} is VALID [2022-04-08 10:08:23,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {36567#false} assume !(~x~0 % 4294967296 > 0); {36567#false} is VALID [2022-04-08 10:08:23,560 INFO L290 TraceCheckUtils]: 28: Hoare triple {36567#false} assume !(~z~0 % 4294967296 > 0); {36567#false} is VALID [2022-04-08 10:08:23,560 INFO L272 TraceCheckUtils]: 29: Hoare triple {36567#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {36567#false} is VALID [2022-04-08 10:08:23,560 INFO L290 TraceCheckUtils]: 30: Hoare triple {36567#false} ~cond := #in~cond; {36567#false} is VALID [2022-04-08 10:08:23,561 INFO L290 TraceCheckUtils]: 31: Hoare triple {36567#false} assume 0 == ~cond; {36567#false} is VALID [2022-04-08 10:08:23,561 INFO L290 TraceCheckUtils]: 32: Hoare triple {36567#false} assume !false; {36567#false} is VALID [2022-04-08 10:08:23,561 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:08:23,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:23,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138281334] [2022-04-08 10:08:23,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138281334] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:23,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620946922] [2022-04-08 10:08:23,561 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:08:23,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:23,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:23,562 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-08 10:08:23,562 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-08 10:08:23,599 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:08:23,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:23,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 10:08:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:23,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:23,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {36566#true} call ULTIMATE.init(); {36566#true} is VALID [2022-04-08 10:08:23,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {36566#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36566#true} is VALID [2022-04-08 10:08:23,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {36566#true} assume true; {36566#true} is VALID [2022-04-08 10:08:23,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36566#true} {36566#true} #83#return; {36566#true} is VALID [2022-04-08 10:08:23,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {36566#true} call #t~ret15 := main(); {36566#true} is VALID [2022-04-08 10:08:23,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {36566#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36566#true} is VALID [2022-04-08 10:08:23,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-08 10:08:23,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-08 10:08:23,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-08 10:08:23,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-08 10:08:23,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-08 10:08:23,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-08 10:08:23,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-08 10:08:23,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-08 10:08:23,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-08 10:08:23,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-08 10:08:23,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-08 10:08:23,871 INFO L290 TraceCheckUtils]: 17: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-08 10:08:23,871 INFO L290 TraceCheckUtils]: 18: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-08 10:08:23,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-08 10:08:23,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {36566#true} assume !(~x~0 % 4294967296 > 0); {36566#true} is VALID [2022-04-08 10:08:23,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {36566#true} ~z~0 := ~y~0; {36655#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:08:23,875 INFO L290 TraceCheckUtils]: 22: Hoare triple {36655#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36659#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:08:23,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {36659#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {36659#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:08:23,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {36659#(= main_~y~0 (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36666#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-08 10:08:23,876 INFO L290 TraceCheckUtils]: 25: Hoare triple {36666#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {36666#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-08 10:08:23,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {36666#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36655#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:08:23,877 INFO L290 TraceCheckUtils]: 27: Hoare triple {36655#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {36655#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:08:23,878 INFO L290 TraceCheckUtils]: 28: Hoare triple {36655#(= main_~z~0 main_~y~0)} assume !(~z~0 % 4294967296 > 0); {36679#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:08:23,878 INFO L272 TraceCheckUtils]: 29: Hoare triple {36679#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {36683#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:08:23,879 INFO L290 TraceCheckUtils]: 30: Hoare triple {36683#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {36687#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:08:23,879 INFO L290 TraceCheckUtils]: 31: Hoare triple {36687#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {36567#false} is VALID [2022-04-08 10:08:23,879 INFO L290 TraceCheckUtils]: 32: Hoare triple {36567#false} assume !false; {36567#false} is VALID [2022-04-08 10:08:23,880 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 10:08:23,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:24,116 INFO L290 TraceCheckUtils]: 32: Hoare triple {36567#false} assume !false; {36567#false} is VALID [2022-04-08 10:08:24,117 INFO L290 TraceCheckUtils]: 31: Hoare triple {36687#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {36567#false} is VALID [2022-04-08 10:08:24,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {36683#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {36687#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:08:24,118 INFO L272 TraceCheckUtils]: 29: Hoare triple {36679#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {36683#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:08:24,118 INFO L290 TraceCheckUtils]: 28: Hoare triple {36706#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {36679#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:08:24,118 INFO L290 TraceCheckUtils]: 27: Hoare triple {36706#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {36706#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:08:24,119 INFO L290 TraceCheckUtils]: 26: Hoare triple {36713#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36706#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:08:24,119 INFO L290 TraceCheckUtils]: 25: Hoare triple {36713#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {36713#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-08 10:08:24,120 INFO L290 TraceCheckUtils]: 24: Hoare triple {36720#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36713#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-08 10:08:24,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {36720#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {36720#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-08 10:08:24,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {36706#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36720#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-08 10:08:24,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {36566#true} ~z~0 := ~y~0; {36706#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:08:24,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {36566#true} assume !(~x~0 % 4294967296 > 0); {36566#true} is VALID [2022-04-08 10:08:24,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-08 10:08:24,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-08 10:08:24,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-08 10:08:24,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-08 10:08:24,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-08 10:08:24,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-08 10:08:24,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-08 10:08:24,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-08 10:08:24,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-08 10:08:24,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-08 10:08:24,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-08 10:08:24,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-08 10:08:24,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-08 10:08:24,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {36566#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36566#true} is VALID [2022-04-08 10:08:24,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {36566#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36566#true} is VALID [2022-04-08 10:08:24,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {36566#true} call #t~ret15 := main(); {36566#true} is VALID [2022-04-08 10:08:24,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36566#true} {36566#true} #83#return; {36566#true} is VALID [2022-04-08 10:08:24,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {36566#true} assume true; {36566#true} is VALID [2022-04-08 10:08:24,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {36566#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36566#true} is VALID [2022-04-08 10:08:24,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {36566#true} call ULTIMATE.init(); {36566#true} is VALID [2022-04-08 10:08:24,123 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 10:08:24,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620946922] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:24,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:24,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 8, 8] total 29 [2022-04-08 10:08:24,123 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:24,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [363159685] [2022-04-08 10:08:24,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [363159685] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:24,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:24,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 10:08:24,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975497120] [2022-04-08 10:08:24,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:24,124 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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-08 10:08:24,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:24,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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-08 10:08:24,152 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-08 10:08:24,152 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 10:08:24,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:24,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 10:08:24,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-04-08 10:08:24,153 INFO L87 Difference]: Start difference. First operand 203 states and 259 transitions. Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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-08 10:08:31,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:31,153 INFO L93 Difference]: Finished difference Result 457 states and 638 transitions. [2022-04-08 10:08:31,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 10:08:31,154 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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-08 10:08:31,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:31,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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-08 10:08:31,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 198 transitions. [2022-04-08 10:08:31,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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-08 10:08:31,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 198 transitions. [2022-04-08 10:08:31,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 198 transitions. [2022-04-08 10:08:31,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:31,320 INFO L225 Difference]: With dead ends: 457 [2022-04-08 10:08:31,320 INFO L226 Difference]: Without dead ends: 434 [2022-04-08 10:08:31,320 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=2002, Unknown=0, NotChecked=0, Total=2162 [2022-04-08 10:08:31,321 INFO L913 BasicCegarLoop]: 85 mSDtfsCounter, 141 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2392 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 2496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:31,321 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 167 Invalid, 2496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2392 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-08 10:08:31,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-04-08 10:08:32,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 215. [2022-04-08 10:08:32,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:32,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 434 states. Second operand has 215 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 210 states have internal predecessors, (272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:32,185 INFO L74 IsIncluded]: Start isIncluded. First operand 434 states. Second operand has 215 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 210 states have internal predecessors, (272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:32,185 INFO L87 Difference]: Start difference. First operand 434 states. Second operand has 215 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 210 states have internal predecessors, (272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:32,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:32,191 INFO L93 Difference]: Finished difference Result 434 states and 551 transitions. [2022-04-08 10:08:32,191 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 551 transitions. [2022-04-08 10:08:32,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:32,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:32,192 INFO L74 IsIncluded]: Start isIncluded. First operand has 215 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 210 states have internal predecessors, (272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 434 states. [2022-04-08 10:08:32,192 INFO L87 Difference]: Start difference. First operand has 215 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 210 states have internal predecessors, (272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 434 states. [2022-04-08 10:08:32,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:32,198 INFO L93 Difference]: Finished difference Result 434 states and 551 transitions. [2022-04-08 10:08:32,198 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 551 transitions. [2022-04-08 10:08:32,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:32,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:32,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:32,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:32,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 210 states have internal predecessors, (272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 276 transitions. [2022-04-08 10:08:32,201 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 276 transitions. Word has length 33 [2022-04-08 10:08:32,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:32,201 INFO L478 AbstractCegarLoop]: Abstraction has 215 states and 276 transitions. [2022-04-08 10:08:32,201 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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-08 10:08:32,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 215 states and 276 transitions. [2022-04-08 10:08:32,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:32,946 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 276 transitions. [2022-04-08 10:08:32,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:08:32,946 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:32,946 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:32,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-08 10:08:33,147 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:33,147 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:33,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:33,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1655978978, now seen corresponding path program 37 times [2022-04-08 10:08:33,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:33,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [51476466] [2022-04-08 10:08:33,149 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:33,149 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:33,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1655978978, now seen corresponding path program 38 times [2022-04-08 10:08:33,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:33,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879678290] [2022-04-08 10:08:33,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:33,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:33,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:33,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {39059#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {39043#true} is VALID [2022-04-08 10:08:33,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {39043#true} assume true; {39043#true} is VALID [2022-04-08 10:08:33,343 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39043#true} {39043#true} #83#return; {39043#true} is VALID [2022-04-08 10:08:33,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {39043#true} call ULTIMATE.init(); {39059#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:33,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {39059#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {39043#true} is VALID [2022-04-08 10:08:33,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {39043#true} assume true; {39043#true} is VALID [2022-04-08 10:08:33,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39043#true} {39043#true} #83#return; {39043#true} is VALID [2022-04-08 10:08:33,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {39043#true} call #t~ret15 := main(); {39043#true} is VALID [2022-04-08 10:08:33,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {39043#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39048#(= main_~y~0 0)} is VALID [2022-04-08 10:08:33,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {39048#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39049#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:33,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {39049#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39050#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:33,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {39050#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39051#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:33,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {39051#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39052#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:33,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {39052#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39053#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:33,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {39053#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39054#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:33,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {39054#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {39054#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:33,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {39054#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {39055#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:08:33,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {39055#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39056#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:08:33,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {39056#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39057#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:08:33,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {39057#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39058#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:33,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {39058#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {39044#false} is VALID [2022-04-08 10:08:33,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {39044#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39044#false} is VALID [2022-04-08 10:08:33,350 INFO L290 TraceCheckUtils]: 19: Hoare triple {39044#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39044#false} is VALID [2022-04-08 10:08:33,350 INFO L290 TraceCheckUtils]: 20: Hoare triple {39044#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39044#false} is VALID [2022-04-08 10:08:33,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {39044#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39044#false} is VALID [2022-04-08 10:08:33,350 INFO L290 TraceCheckUtils]: 22: Hoare triple {39044#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39044#false} is VALID [2022-04-08 10:08:33,350 INFO L290 TraceCheckUtils]: 23: Hoare triple {39044#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39044#false} is VALID [2022-04-08 10:08:33,350 INFO L290 TraceCheckUtils]: 24: Hoare triple {39044#false} assume !(~y~0 % 4294967296 > 0); {39044#false} is VALID [2022-04-08 10:08:33,350 INFO L290 TraceCheckUtils]: 25: Hoare triple {39044#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39044#false} is VALID [2022-04-08 10:08:33,350 INFO L290 TraceCheckUtils]: 26: Hoare triple {39044#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39044#false} is VALID [2022-04-08 10:08:33,350 INFO L290 TraceCheckUtils]: 27: Hoare triple {39044#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39044#false} is VALID [2022-04-08 10:08:33,350 INFO L290 TraceCheckUtils]: 28: Hoare triple {39044#false} assume !(~x~0 % 4294967296 > 0); {39044#false} is VALID [2022-04-08 10:08:33,350 INFO L290 TraceCheckUtils]: 29: Hoare triple {39044#false} assume !(~z~0 % 4294967296 > 0); {39044#false} is VALID [2022-04-08 10:08:33,351 INFO L272 TraceCheckUtils]: 30: Hoare triple {39044#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {39044#false} is VALID [2022-04-08 10:08:33,351 INFO L290 TraceCheckUtils]: 31: Hoare triple {39044#false} ~cond := #in~cond; {39044#false} is VALID [2022-04-08 10:08:33,351 INFO L290 TraceCheckUtils]: 32: Hoare triple {39044#false} assume 0 == ~cond; {39044#false} is VALID [2022-04-08 10:08:33,351 INFO L290 TraceCheckUtils]: 33: Hoare triple {39044#false} assume !false; {39044#false} is VALID [2022-04-08 10:08:33,351 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-08 10:08:33,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:33,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879678290] [2022-04-08 10:08:33,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879678290] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:33,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666389444] [2022-04-08 10:08:33,351 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:08:33,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:33,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:33,353 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-08 10:08:33,354 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-08 10:08:33,392 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:08:33,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:33,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-08 10:08:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:33,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:33,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {39043#true} call ULTIMATE.init(); {39043#true} is VALID [2022-04-08 10:08:33,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {39043#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {39043#true} is VALID [2022-04-08 10:08:33,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {39043#true} assume true; {39043#true} is VALID [2022-04-08 10:08:33,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39043#true} {39043#true} #83#return; {39043#true} is VALID [2022-04-08 10:08:33,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {39043#true} call #t~ret15 := main(); {39043#true} is VALID [2022-04-08 10:08:33,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {39043#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39048#(= main_~y~0 0)} is VALID [2022-04-08 10:08:33,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {39048#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39049#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:33,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {39049#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39050#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:33,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {39050#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39051#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:33,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {39051#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39052#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:33,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {39052#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39053#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:33,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {39053#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39054#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:33,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {39054#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {39054#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:33,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {39054#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {39102#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:33,600 INFO L290 TraceCheckUtils]: 14: Hoare triple {39102#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39106#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:08:33,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {39106#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39110#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:33,601 INFO L290 TraceCheckUtils]: 16: Hoare triple {39110#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39114#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:33,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {39114#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {39044#false} is VALID [2022-04-08 10:08:33,602 INFO L290 TraceCheckUtils]: 18: Hoare triple {39044#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39044#false} is VALID [2022-04-08 10:08:33,602 INFO L290 TraceCheckUtils]: 19: Hoare triple {39044#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39044#false} is VALID [2022-04-08 10:08:33,602 INFO L290 TraceCheckUtils]: 20: Hoare triple {39044#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39044#false} is VALID [2022-04-08 10:08:33,602 INFO L290 TraceCheckUtils]: 21: Hoare triple {39044#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39044#false} is VALID [2022-04-08 10:08:33,602 INFO L290 TraceCheckUtils]: 22: Hoare triple {39044#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39044#false} is VALID [2022-04-08 10:08:33,602 INFO L290 TraceCheckUtils]: 23: Hoare triple {39044#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39044#false} is VALID [2022-04-08 10:08:33,602 INFO L290 TraceCheckUtils]: 24: Hoare triple {39044#false} assume !(~y~0 % 4294967296 > 0); {39044#false} is VALID [2022-04-08 10:08:33,602 INFO L290 TraceCheckUtils]: 25: Hoare triple {39044#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39044#false} is VALID [2022-04-08 10:08:33,602 INFO L290 TraceCheckUtils]: 26: Hoare triple {39044#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39044#false} is VALID [2022-04-08 10:08:33,602 INFO L290 TraceCheckUtils]: 27: Hoare triple {39044#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39044#false} is VALID [2022-04-08 10:08:33,602 INFO L290 TraceCheckUtils]: 28: Hoare triple {39044#false} assume !(~x~0 % 4294967296 > 0); {39044#false} is VALID [2022-04-08 10:08:33,602 INFO L290 TraceCheckUtils]: 29: Hoare triple {39044#false} assume !(~z~0 % 4294967296 > 0); {39044#false} is VALID [2022-04-08 10:08:33,602 INFO L272 TraceCheckUtils]: 30: Hoare triple {39044#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {39044#false} is VALID [2022-04-08 10:08:33,602 INFO L290 TraceCheckUtils]: 31: Hoare triple {39044#false} ~cond := #in~cond; {39044#false} is VALID [2022-04-08 10:08:33,603 INFO L290 TraceCheckUtils]: 32: Hoare triple {39044#false} assume 0 == ~cond; {39044#false} is VALID [2022-04-08 10:08:33,603 INFO L290 TraceCheckUtils]: 33: Hoare triple {39044#false} assume !false; {39044#false} is VALID [2022-04-08 10:08:33,603 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-08 10:08:33,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:33,974 INFO L290 TraceCheckUtils]: 33: Hoare triple {39044#false} assume !false; {39044#false} is VALID [2022-04-08 10:08:33,974 INFO L290 TraceCheckUtils]: 32: Hoare triple {39169#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {39044#false} is VALID [2022-04-08 10:08:33,974 INFO L290 TraceCheckUtils]: 31: Hoare triple {39173#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {39169#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:08:33,975 INFO L272 TraceCheckUtils]: 30: Hoare triple {39177#(= (mod main_~y~0 4294967296) 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {39173#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:08:33,975 INFO L290 TraceCheckUtils]: 29: Hoare triple {39177#(= (mod main_~y~0 4294967296) 0)} assume !(~z~0 % 4294967296 > 0); {39177#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-08 10:08:33,975 INFO L290 TraceCheckUtils]: 28: Hoare triple {39177#(= (mod main_~y~0 4294967296) 0)} assume !(~x~0 % 4294967296 > 0); {39177#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-08 10:08:33,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {39187#(= (mod (+ main_~y~0 1) 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39177#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-08 10:08:33,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {39191#(= (mod (+ main_~y~0 2) 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39187#(= (mod (+ main_~y~0 1) 4294967296) 0)} is VALID [2022-04-08 10:08:33,977 INFO L290 TraceCheckUtils]: 25: Hoare triple {39195#(= (mod (+ main_~y~0 3) 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39191#(= (mod (+ main_~y~0 2) 4294967296) 0)} is VALID [2022-04-08 10:08:33,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {39195#(= (mod (+ main_~y~0 3) 4294967296) 0)} assume !(~y~0 % 4294967296 > 0); {39195#(= (mod (+ main_~y~0 3) 4294967296) 0)} is VALID [2022-04-08 10:08:33,988 INFO L290 TraceCheckUtils]: 23: Hoare triple {39191#(= (mod (+ main_~y~0 2) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39195#(= (mod (+ main_~y~0 3) 4294967296) 0)} is VALID [2022-04-08 10:08:33,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {39187#(= (mod (+ main_~y~0 1) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39191#(= (mod (+ main_~y~0 2) 4294967296) 0)} is VALID [2022-04-08 10:08:33,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {39177#(= (mod main_~y~0 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39187#(= (mod (+ main_~y~0 1) 4294967296) 0)} is VALID [2022-04-08 10:08:33,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {39211#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39177#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-08 10:08:33,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {39215#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39211#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-08 10:08:33,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {39219#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39215#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} is VALID [2022-04-08 10:08:33,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {39223#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {39219#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} is VALID [2022-04-08 10:08:33,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {39227#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39223#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:08:33,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {39231#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39227#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:08:33,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {39235#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39231#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:08:33,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {39043#true} ~z~0 := ~y~0; {39235#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:08:33,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {39043#true} assume !(~x~0 % 4294967296 > 0); {39043#true} is VALID [2022-04-08 10:08:33,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {39043#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39043#true} is VALID [2022-04-08 10:08:33,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {39043#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39043#true} is VALID [2022-04-08 10:08:33,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {39043#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39043#true} is VALID [2022-04-08 10:08:33,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {39043#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39043#true} is VALID [2022-04-08 10:08:33,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {39043#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39043#true} is VALID [2022-04-08 10:08:33,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {39043#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39043#true} is VALID [2022-04-08 10:08:33,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {39043#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39043#true} is VALID [2022-04-08 10:08:33,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {39043#true} call #t~ret15 := main(); {39043#true} is VALID [2022-04-08 10:08:33,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39043#true} {39043#true} #83#return; {39043#true} is VALID [2022-04-08 10:08:33,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {39043#true} assume true; {39043#true} is VALID [2022-04-08 10:08:33,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {39043#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {39043#true} is VALID [2022-04-08 10:08:33,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {39043#true} call ULTIMATE.init(); {39043#true} is VALID [2022-04-08 10:08:33,997 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:08:33,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666389444] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:33,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:33,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 15] total 31 [2022-04-08 10:08:33,997 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:33,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [51476466] [2022-04-08 10:08:33,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [51476466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:33,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:33,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:08:33,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156235920] [2022-04-08 10:08:33,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:33,998 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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 34 [2022-04-08 10:08:33,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:33,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-08 10:08:34,019 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-08 10:08:34,020 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:08:34,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:34,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:08:34,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2022-04-08 10:08:34,020 INFO L87 Difference]: Start difference. First operand 215 states and 276 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-08 10:08:37,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:37,112 INFO L93 Difference]: Finished difference Result 314 states and 399 transitions. [2022-04-08 10:08:37,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 10:08:37,112 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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 34 [2022-04-08 10:08:37,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:37,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-08 10:08:37,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 102 transitions. [2022-04-08 10:08:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-08 10:08:37,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 102 transitions. [2022-04-08 10:08:37,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 102 transitions. [2022-04-08 10:08:37,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:37,197 INFO L225 Difference]: With dead ends: 314 [2022-04-08 10:08:37,197 INFO L226 Difference]: Without dead ends: 297 [2022-04-08 10:08:37,198 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=253, Invalid=1909, Unknown=0, NotChecked=0, Total=2162 [2022-04-08 10:08:37,198 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 57 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:37,198 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 80 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:08:37,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-08 10:08:38,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 215. [2022-04-08 10:08:38,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:38,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 215 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 210 states have internal predecessors, (271), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:38,034 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 215 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 210 states have internal predecessors, (271), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:38,034 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 215 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 210 states have internal predecessors, (271), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:38,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:38,037 INFO L93 Difference]: Finished difference Result 297 states and 381 transitions. [2022-04-08 10:08:38,037 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 381 transitions. [2022-04-08 10:08:38,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:38,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:38,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 215 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 210 states have internal predecessors, (271), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 297 states. [2022-04-08 10:08:38,038 INFO L87 Difference]: Start difference. First operand has 215 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 210 states have internal predecessors, (271), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 297 states. [2022-04-08 10:08:38,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:38,042 INFO L93 Difference]: Finished difference Result 297 states and 381 transitions. [2022-04-08 10:08:38,042 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 381 transitions. [2022-04-08 10:08:38,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:38,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:38,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:38,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:38,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 210 states have internal predecessors, (271), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:38,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 275 transitions. [2022-04-08 10:08:38,046 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 275 transitions. Word has length 34 [2022-04-08 10:08:38,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:38,047 INFO L478 AbstractCegarLoop]: Abstraction has 215 states and 275 transitions. [2022-04-08 10:08:38,047 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-08 10:08:38,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 215 states and 275 transitions. [2022-04-08 10:08:38,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 275 edges. 275 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:38,912 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 275 transitions. [2022-04-08 10:08:38,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:08:38,913 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:38,913 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:38,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-04-08 10:08:39,113 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:39,113 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:39,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:39,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1305187981, now seen corresponding path program 19 times [2022-04-08 10:08:39,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:39,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1941430018] [2022-04-08 10:08:39,116 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:39,116 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:39,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1305187981, now seen corresponding path program 20 times [2022-04-08 10:08:39,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:39,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405718394] [2022-04-08 10:08:39,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:39,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:39,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:39,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {40982#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40964#true} is VALID [2022-04-08 10:08:39,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {40964#true} assume true; {40964#true} is VALID [2022-04-08 10:08:39,319 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40964#true} {40964#true} #83#return; {40964#true} is VALID [2022-04-08 10:08:39,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {40964#true} call ULTIMATE.init(); {40982#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:39,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {40982#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40964#true} is VALID [2022-04-08 10:08:39,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {40964#true} assume true; {40964#true} is VALID [2022-04-08 10:08:39,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40964#true} {40964#true} #83#return; {40964#true} is VALID [2022-04-08 10:08:39,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {40964#true} call #t~ret15 := main(); {40964#true} is VALID [2022-04-08 10:08:39,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {40964#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40969#(= main_~y~0 0)} is VALID [2022-04-08 10:08:39,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {40969#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40970#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:39,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {40970#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40971#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:39,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {40971#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40972#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:39,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {40972#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40973#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:39,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {40973#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40974#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:39,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {40974#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40975#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:39,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {40975#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {40975#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:39,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {40975#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {40976#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:08:39,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {40976#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40977#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:08:39,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {40977#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40978#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:08:39,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {40978#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40979#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:08:39,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {40979#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40980#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:08:39,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {40980#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40981#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:08:39,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {40981#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {40965#false} is VALID [2022-04-08 10:08:39,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {40965#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40965#false} is VALID [2022-04-08 10:08:39,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {40965#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40965#false} is VALID [2022-04-08 10:08:39,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {40965#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40965#false} is VALID [2022-04-08 10:08:39,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {40965#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40965#false} is VALID [2022-04-08 10:08:39,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {40965#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40965#false} is VALID [2022-04-08 10:08:39,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {40965#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40965#false} is VALID [2022-04-08 10:08:39,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {40965#false} assume !(~y~0 % 4294967296 > 0); {40965#false} is VALID [2022-04-08 10:08:39,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {40965#false} assume !(~x~0 % 4294967296 > 0); {40965#false} is VALID [2022-04-08 10:08:39,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {40965#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {40965#false} is VALID [2022-04-08 10:08:39,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {40965#false} assume !(~z~0 % 4294967296 > 0); {40965#false} is VALID [2022-04-08 10:08:39,327 INFO L272 TraceCheckUtils]: 30: Hoare triple {40965#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {40965#false} is VALID [2022-04-08 10:08:39,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {40965#false} ~cond := #in~cond; {40965#false} is VALID [2022-04-08 10:08:39,327 INFO L290 TraceCheckUtils]: 32: Hoare triple {40965#false} assume 0 == ~cond; {40965#false} is VALID [2022-04-08 10:08:39,327 INFO L290 TraceCheckUtils]: 33: Hoare triple {40965#false} assume !false; {40965#false} is VALID [2022-04-08 10:08:39,327 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-08 10:08:39,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:39,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405718394] [2022-04-08 10:08:39,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405718394] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:39,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463846356] [2022-04-08 10:08:39,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:08:39,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:39,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:39,329 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-08 10:08:39,330 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-08 10:08:39,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:08:39,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:39,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-08 10:08:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:39,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:39,566 INFO L272 TraceCheckUtils]: 0: Hoare triple {40964#true} call ULTIMATE.init(); {40964#true} is VALID [2022-04-08 10:08:39,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {40964#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40964#true} is VALID [2022-04-08 10:08:39,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {40964#true} assume true; {40964#true} is VALID [2022-04-08 10:08:39,566 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40964#true} {40964#true} #83#return; {40964#true} is VALID [2022-04-08 10:08:39,566 INFO L272 TraceCheckUtils]: 4: Hoare triple {40964#true} call #t~ret15 := main(); {40964#true} is VALID [2022-04-08 10:08:39,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {40964#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40964#true} is VALID [2022-04-08 10:08:39,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {40964#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40964#true} is VALID [2022-04-08 10:08:39,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {40964#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41007#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:08:39,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {41007#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41011#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:08:39,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {41011#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41015#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:08:39,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {41015#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41019#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:08:39,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {41019#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41023#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:08:39,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {41023#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {41023#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:08:39,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {41023#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {41023#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:08:39,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {41023#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41019#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:08:39,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {41019#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41015#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:08:39,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {41015#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41011#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:08:39,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {41011#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41007#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:08:39,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {41007#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:39,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {41045#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:39,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {41045#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:39,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {41045#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:39,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {41045#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:39,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {41045#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:39,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {41045#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:39,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {41045#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:39,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {41045#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:39,575 INFO L290 TraceCheckUtils]: 27: Hoare triple {41045#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {40965#false} is VALID [2022-04-08 10:08:39,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {40965#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {40965#false} is VALID [2022-04-08 10:08:39,575 INFO L290 TraceCheckUtils]: 29: Hoare triple {40965#false} assume !(~z~0 % 4294967296 > 0); {40965#false} is VALID [2022-04-08 10:08:39,575 INFO L272 TraceCheckUtils]: 30: Hoare triple {40965#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {40965#false} is VALID [2022-04-08 10:08:39,576 INFO L290 TraceCheckUtils]: 31: Hoare triple {40965#false} ~cond := #in~cond; {40965#false} is VALID [2022-04-08 10:08:39,576 INFO L290 TraceCheckUtils]: 32: Hoare triple {40965#false} assume 0 == ~cond; {40965#false} is VALID [2022-04-08 10:08:39,576 INFO L290 TraceCheckUtils]: 33: Hoare triple {40965#false} assume !false; {40965#false} is VALID [2022-04-08 10:08:39,576 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-08 10:08:39,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:39,684 INFO L290 TraceCheckUtils]: 33: Hoare triple {40965#false} assume !false; {40965#false} is VALID [2022-04-08 10:08:39,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {40965#false} assume 0 == ~cond; {40965#false} is VALID [2022-04-08 10:08:39,684 INFO L290 TraceCheckUtils]: 31: Hoare triple {40965#false} ~cond := #in~cond; {40965#false} is VALID [2022-04-08 10:08:39,684 INFO L272 TraceCheckUtils]: 30: Hoare triple {40965#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {40965#false} is VALID [2022-04-08 10:08:39,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {40965#false} assume !(~z~0 % 4294967296 > 0); {40965#false} is VALID [2022-04-08 10:08:39,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {40965#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {40965#false} is VALID [2022-04-08 10:08:39,685 INFO L290 TraceCheckUtils]: 27: Hoare triple {41045#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {40965#false} is VALID [2022-04-08 10:08:39,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {41045#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:39,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {41045#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:39,685 INFO L290 TraceCheckUtils]: 24: Hoare triple {41045#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:39,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {41045#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:39,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {41045#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:39,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {41045#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:39,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {41045#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:39,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {41045#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:39,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {41007#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41045#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:39,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {41011#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41007#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:08:39,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {41015#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41011#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:08:39,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {41019#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41015#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:08:39,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {41023#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41019#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:08:39,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {41023#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {41023#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:08:39,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {41023#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {41023#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:08:39,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {41019#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41023#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:08:39,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {41015#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41019#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:08:39,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {41011#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41015#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:08:39,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {41007#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41011#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:08:39,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {40964#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41007#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:08:39,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {40964#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40964#true} is VALID [2022-04-08 10:08:39,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {40964#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40964#true} is VALID [2022-04-08 10:08:39,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {40964#true} call #t~ret15 := main(); {40964#true} is VALID [2022-04-08 10:08:39,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40964#true} {40964#true} #83#return; {40964#true} is VALID [2022-04-08 10:08:39,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {40964#true} assume true; {40964#true} is VALID [2022-04-08 10:08:39,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {40964#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40964#true} is VALID [2022-04-08 10:08:39,695 INFO L272 TraceCheckUtils]: 0: Hoare triple {40964#true} call ULTIMATE.init(); {40964#true} is VALID [2022-04-08 10:08:39,695 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-08 10:08:39,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463846356] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:39,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:39,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 22 [2022-04-08 10:08:39,695 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:39,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1941430018] [2022-04-08 10:08:39,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1941430018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:39,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:39,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:08:39,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666421871] [2022-04-08 10:08:39,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:39,696 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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 34 [2022-04-08 10:08:39,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:39,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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-08 10:08:39,716 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-08 10:08:39,716 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:08:39,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:39,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:08:39,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:08:39,717 INFO L87 Difference]: Start difference. First operand 215 states and 275 transitions. Second operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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-08 10:08:43,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:43,013 INFO L93 Difference]: Finished difference Result 314 states and 401 transitions. [2022-04-08 10:08:43,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 10:08:43,013 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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 34 [2022-04-08 10:08:43,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:43,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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-08 10:08:43,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 107 transitions. [2022-04-08 10:08:43,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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-08 10:08:43,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 107 transitions. [2022-04-08 10:08:43,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 107 transitions. [2022-04-08 10:08:43,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:43,127 INFO L225 Difference]: With dead ends: 314 [2022-04-08 10:08:43,127 INFO L226 Difference]: Without dead ends: 287 [2022-04-08 10:08:43,128 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=1704, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:08:43,128 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 54 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:43,128 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 85 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:08:43,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-04-08 10:08:43,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 216. [2022-04-08 10:08:43,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:43,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states. Second operand has 216 states, 211 states have (on average 1.2843601895734598) internal successors, (271), 211 states have internal predecessors, (271), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:43,968 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand has 216 states, 211 states have (on average 1.2843601895734598) internal successors, (271), 211 states have internal predecessors, (271), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:43,969 INFO L87 Difference]: Start difference. First operand 287 states. Second operand has 216 states, 211 states have (on average 1.2843601895734598) internal successors, (271), 211 states have internal predecessors, (271), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:43,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:43,972 INFO L93 Difference]: Finished difference Result 287 states and 370 transitions. [2022-04-08 10:08:43,972 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 370 transitions. [2022-04-08 10:08:43,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:43,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:43,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 211 states have (on average 1.2843601895734598) internal successors, (271), 211 states have internal predecessors, (271), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 287 states. [2022-04-08 10:08:43,973 INFO L87 Difference]: Start difference. First operand has 216 states, 211 states have (on average 1.2843601895734598) internal successors, (271), 211 states have internal predecessors, (271), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 287 states. [2022-04-08 10:08:43,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:43,976 INFO L93 Difference]: Finished difference Result 287 states and 370 transitions. [2022-04-08 10:08:43,976 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 370 transitions. [2022-04-08 10:08:43,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:43,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:43,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:43,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:43,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 211 states have (on average 1.2843601895734598) internal successors, (271), 211 states have internal predecessors, (271), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:43,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 275 transitions. [2022-04-08 10:08:43,979 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 275 transitions. Word has length 34 [2022-04-08 10:08:43,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:43,979 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 275 transitions. [2022-04-08 10:08:43,979 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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-08 10:08:43,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 216 states and 275 transitions. [2022-04-08 10:08:44,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 275 edges. 275 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:44,958 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 275 transitions. [2022-04-08 10:08:44,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:08:44,958 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:44,958 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:44,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-08 10:08:45,158 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,SelfDestructingSolverStorable42 [2022-04-08 10:08:45,159 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:45,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:45,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1620223476, now seen corresponding path program 39 times [2022-04-08 10:08:45,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:45,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [710459780] [2022-04-08 10:08:45,161 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:45,161 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:45,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1620223476, now seen corresponding path program 40 times [2022-04-08 10:08:45,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:45,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369869681] [2022-04-08 10:08:45,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:45,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:45,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:45,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {42886#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42870#true} is VALID [2022-04-08 10:08:45,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {42870#true} assume true; {42870#true} is VALID [2022-04-08 10:08:45,327 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42870#true} {42870#true} #83#return; {42870#true} is VALID [2022-04-08 10:08:45,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {42870#true} call ULTIMATE.init(); {42886#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:45,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {42886#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42870#true} is VALID [2022-04-08 10:08:45,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {42870#true} assume true; {42870#true} is VALID [2022-04-08 10:08:45,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42870#true} {42870#true} #83#return; {42870#true} is VALID [2022-04-08 10:08:45,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {42870#true} call #t~ret15 := main(); {42870#true} is VALID [2022-04-08 10:08:45,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {42870#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42875#(= main_~y~0 0)} is VALID [2022-04-08 10:08:45,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {42875#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42876#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:45,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {42876#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42877#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:45,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {42877#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42878#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:45,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {42878#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42879#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:45,345 INFO L290 TraceCheckUtils]: 10: Hoare triple {42879#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42880#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:45,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {42880#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42881#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:45,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {42881#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42882#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:45,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {42882#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {42882#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:45,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {42882#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {42883#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:08:45,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {42883#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42884#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:08:45,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {42884#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42885#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:45,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {42885#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {42871#false} is VALID [2022-04-08 10:08:45,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {42871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42871#false} is VALID [2022-04-08 10:08:45,349 INFO L290 TraceCheckUtils]: 19: Hoare triple {42871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42871#false} is VALID [2022-04-08 10:08:45,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {42871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42871#false} is VALID [2022-04-08 10:08:45,349 INFO L290 TraceCheckUtils]: 21: Hoare triple {42871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42871#false} is VALID [2022-04-08 10:08:45,349 INFO L290 TraceCheckUtils]: 22: Hoare triple {42871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42871#false} is VALID [2022-04-08 10:08:45,349 INFO L290 TraceCheckUtils]: 23: Hoare triple {42871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42871#false} is VALID [2022-04-08 10:08:45,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {42871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42871#false} is VALID [2022-04-08 10:08:45,349 INFO L290 TraceCheckUtils]: 25: Hoare triple {42871#false} assume !(~y~0 % 4294967296 > 0); {42871#false} is VALID [2022-04-08 10:08:45,349 INFO L290 TraceCheckUtils]: 26: Hoare triple {42871#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42871#false} is VALID [2022-04-08 10:08:45,349 INFO L290 TraceCheckUtils]: 27: Hoare triple {42871#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42871#false} is VALID [2022-04-08 10:08:45,350 INFO L290 TraceCheckUtils]: 28: Hoare triple {42871#false} assume !(~x~0 % 4294967296 > 0); {42871#false} is VALID [2022-04-08 10:08:45,350 INFO L290 TraceCheckUtils]: 29: Hoare triple {42871#false} assume !(~z~0 % 4294967296 > 0); {42871#false} is VALID [2022-04-08 10:08:45,350 INFO L272 TraceCheckUtils]: 30: Hoare triple {42871#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {42871#false} is VALID [2022-04-08 10:08:45,350 INFO L290 TraceCheckUtils]: 31: Hoare triple {42871#false} ~cond := #in~cond; {42871#false} is VALID [2022-04-08 10:08:45,350 INFO L290 TraceCheckUtils]: 32: Hoare triple {42871#false} assume 0 == ~cond; {42871#false} is VALID [2022-04-08 10:08:45,350 INFO L290 TraceCheckUtils]: 33: Hoare triple {42871#false} assume !false; {42871#false} is VALID [2022-04-08 10:08:45,350 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-08 10:08:45,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:45,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369869681] [2022-04-08 10:08:45,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369869681] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:45,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863395138] [2022-04-08 10:08:45,351 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:08:45,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:45,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:45,356 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-08 10:08:45,357 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-08 10:08:45,415 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:08:45,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:45,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 10:08:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:45,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:45,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {42870#true} call ULTIMATE.init(); {42870#true} is VALID [2022-04-08 10:08:45,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {42870#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42870#true} is VALID [2022-04-08 10:08:45,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {42870#true} assume true; {42870#true} is VALID [2022-04-08 10:08:45,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42870#true} {42870#true} #83#return; {42870#true} is VALID [2022-04-08 10:08:45,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {42870#true} call #t~ret15 := main(); {42870#true} is VALID [2022-04-08 10:08:45,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {42870#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42875#(= main_~y~0 0)} is VALID [2022-04-08 10:08:45,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {42875#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42876#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:45,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {42876#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42877#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:45,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {42877#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42878#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:45,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {42878#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42879#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:45,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {42879#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42880#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:45,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {42880#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42881#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:45,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {42881#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42882#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:45,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {42882#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {42882#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:45,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {42882#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {42883#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:08:45,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {42883#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42884#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:08:45,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {42884#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42938#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:08:45,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {42938#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {42871#false} is VALID [2022-04-08 10:08:45,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {42871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42871#false} is VALID [2022-04-08 10:08:45,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {42871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42871#false} is VALID [2022-04-08 10:08:45,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {42871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42871#false} is VALID [2022-04-08 10:08:45,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {42871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42871#false} is VALID [2022-04-08 10:08:45,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {42871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42871#false} is VALID [2022-04-08 10:08:45,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {42871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42871#false} is VALID [2022-04-08 10:08:45,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {42871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42871#false} is VALID [2022-04-08 10:08:45,679 INFO L290 TraceCheckUtils]: 25: Hoare triple {42871#false} assume !(~y~0 % 4294967296 > 0); {42871#false} is VALID [2022-04-08 10:08:45,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {42871#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42871#false} is VALID [2022-04-08 10:08:45,679 INFO L290 TraceCheckUtils]: 27: Hoare triple {42871#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42871#false} is VALID [2022-04-08 10:08:45,679 INFO L290 TraceCheckUtils]: 28: Hoare triple {42871#false} assume !(~x~0 % 4294967296 > 0); {42871#false} is VALID [2022-04-08 10:08:45,679 INFO L290 TraceCheckUtils]: 29: Hoare triple {42871#false} assume !(~z~0 % 4294967296 > 0); {42871#false} is VALID [2022-04-08 10:08:45,679 INFO L272 TraceCheckUtils]: 30: Hoare triple {42871#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {42871#false} is VALID [2022-04-08 10:08:45,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {42871#false} ~cond := #in~cond; {42871#false} is VALID [2022-04-08 10:08:45,679 INFO L290 TraceCheckUtils]: 32: Hoare triple {42871#false} assume 0 == ~cond; {42871#false} is VALID [2022-04-08 10:08:45,679 INFO L290 TraceCheckUtils]: 33: Hoare triple {42871#false} assume !false; {42871#false} is VALID [2022-04-08 10:08:45,680 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-08 10:08:45,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:45,939 INFO L290 TraceCheckUtils]: 33: Hoare triple {42871#false} assume !false; {42871#false} is VALID [2022-04-08 10:08:45,939 INFO L290 TraceCheckUtils]: 32: Hoare triple {42871#false} assume 0 == ~cond; {42871#false} is VALID [2022-04-08 10:08:45,939 INFO L290 TraceCheckUtils]: 31: Hoare triple {42871#false} ~cond := #in~cond; {42871#false} is VALID [2022-04-08 10:08:45,939 INFO L272 TraceCheckUtils]: 30: Hoare triple {42871#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {42871#false} is VALID [2022-04-08 10:08:45,939 INFO L290 TraceCheckUtils]: 29: Hoare triple {42871#false} assume !(~z~0 % 4294967296 > 0); {42871#false} is VALID [2022-04-08 10:08:45,939 INFO L290 TraceCheckUtils]: 28: Hoare triple {42871#false} assume !(~x~0 % 4294967296 > 0); {42871#false} is VALID [2022-04-08 10:08:45,939 INFO L290 TraceCheckUtils]: 27: Hoare triple {42871#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42871#false} is VALID [2022-04-08 10:08:45,939 INFO L290 TraceCheckUtils]: 26: Hoare triple {42871#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42871#false} is VALID [2022-04-08 10:08:45,939 INFO L290 TraceCheckUtils]: 25: Hoare triple {42871#false} assume !(~y~0 % 4294967296 > 0); {42871#false} is VALID [2022-04-08 10:08:45,939 INFO L290 TraceCheckUtils]: 24: Hoare triple {42871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42871#false} is VALID [2022-04-08 10:08:45,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {42871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42871#false} is VALID [2022-04-08 10:08:45,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {42871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42871#false} is VALID [2022-04-08 10:08:45,939 INFO L290 TraceCheckUtils]: 21: Hoare triple {42871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42871#false} is VALID [2022-04-08 10:08:45,939 INFO L290 TraceCheckUtils]: 20: Hoare triple {42871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42871#false} is VALID [2022-04-08 10:08:45,939 INFO L290 TraceCheckUtils]: 19: Hoare triple {42871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42871#false} is VALID [2022-04-08 10:08:45,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {42871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42871#false} is VALID [2022-04-08 10:08:45,940 INFO L290 TraceCheckUtils]: 17: Hoare triple {43038#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {42871#false} is VALID [2022-04-08 10:08:45,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {43042#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43038#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:08:45,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {43046#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43042#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:45,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {43050#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {43046#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:45,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {43050#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {43050#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:45,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {43057#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43050#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:45,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {43061#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43057#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:45,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {43065#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43061#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:45,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {43069#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43065#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:08:45,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {43073#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43069#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:08:45,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {43077#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43073#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:08:45,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {43081#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43077#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:08:45,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {42870#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43081#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:45,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {42870#true} call #t~ret15 := main(); {42870#true} is VALID [2022-04-08 10:08:45,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42870#true} {42870#true} #83#return; {42870#true} is VALID [2022-04-08 10:08:45,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {42870#true} assume true; {42870#true} is VALID [2022-04-08 10:08:45,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {42870#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42870#true} is VALID [2022-04-08 10:08:45,947 INFO L272 TraceCheckUtils]: 0: Hoare triple {42870#true} call ULTIMATE.init(); {42870#true} is VALID [2022-04-08 10:08:45,947 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-08 10:08:45,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863395138] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:45,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:45,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-08 10:08:45,947 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:45,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [710459780] [2022-04-08 10:08:45,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [710459780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:45,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:45,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:08:45,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359208982] [2022-04-08 10:08:45,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:45,948 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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 34 [2022-04-08 10:08:45,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:45,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-08 10:08:45,965 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-08 10:08:45,965 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:08:45,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:45,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:08:45,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:08:45,966 INFO L87 Difference]: Start difference. First operand 216 states and 275 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-08 10:08:49,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:49,566 INFO L93 Difference]: Finished difference Result 340 states and 427 transitions. [2022-04-08 10:08:49,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:08:49,567 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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 34 [2022-04-08 10:08:49,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:49,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-08 10:08:49,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 110 transitions. [2022-04-08 10:08:49,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-08 10:08:49,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 110 transitions. [2022-04-08 10:08:49,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 110 transitions. [2022-04-08 10:08:49,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:49,657 INFO L225 Difference]: With dead ends: 340 [2022-04-08 10:08:49,657 INFO L226 Difference]: Without dead ends: 323 [2022-04-08 10:08:49,658 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=326, Invalid=1234, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:08:49,658 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 69 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:49,658 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 101 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:08:49,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-04-08 10:08:50,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 216. [2022-04-08 10:08:50,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:50,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 323 states. Second operand has 216 states, 211 states have (on average 1.2796208530805686) internal successors, (270), 211 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:50,526 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand has 216 states, 211 states have (on average 1.2796208530805686) internal successors, (270), 211 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:50,526 INFO L87 Difference]: Start difference. First operand 323 states. Second operand has 216 states, 211 states have (on average 1.2796208530805686) internal successors, (270), 211 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:50,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:50,531 INFO L93 Difference]: Finished difference Result 323 states and 409 transitions. [2022-04-08 10:08:50,532 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 409 transitions. [2022-04-08 10:08:50,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:50,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:50,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 211 states have (on average 1.2796208530805686) internal successors, (270), 211 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 323 states. [2022-04-08 10:08:50,532 INFO L87 Difference]: Start difference. First operand has 216 states, 211 states have (on average 1.2796208530805686) internal successors, (270), 211 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 323 states. [2022-04-08 10:08:50,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:50,538 INFO L93 Difference]: Finished difference Result 323 states and 409 transitions. [2022-04-08 10:08:50,538 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 409 transitions. [2022-04-08 10:08:50,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:50,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:50,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:50,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:50,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 211 states have (on average 1.2796208530805686) internal successors, (270), 211 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:50,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 274 transitions. [2022-04-08 10:08:50,542 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 274 transitions. Word has length 34 [2022-04-08 10:08:50,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:50,542 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 274 transitions. [2022-04-08 10:08:50,542 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-08 10:08:50,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 216 states and 274 transitions. [2022-04-08 10:08:51,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 274 edges. 274 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:51,381 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 274 transitions. [2022-04-08 10:08:51,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:08:51,381 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:51,381 INFO L499 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:51,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-08 10:08:51,582 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-04-08 10:08:51,582 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:51,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:51,582 INFO L85 PathProgramCache]: Analyzing trace with hash 2033395314, now seen corresponding path program 41 times [2022-04-08 10:08:51,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:51,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [962959926] [2022-04-08 10:08:51,585 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:51,585 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:51,585 INFO L85 PathProgramCache]: Analyzing trace with hash 2033395314, now seen corresponding path program 42 times [2022-04-08 10:08:51,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:51,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773577067] [2022-04-08 10:08:51,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:51,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:51,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:51,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {44911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {44888#true} is VALID [2022-04-08 10:08:51,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {44888#true} assume true; {44888#true} is VALID [2022-04-08 10:08:51,885 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44888#true} {44888#true} #83#return; {44888#true} is VALID [2022-04-08 10:08:51,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {44888#true} call ULTIMATE.init(); {44911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:51,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {44911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {44888#true} is VALID [2022-04-08 10:08:51,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {44888#true} assume true; {44888#true} is VALID [2022-04-08 10:08:51,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44888#true} {44888#true} #83#return; {44888#true} is VALID [2022-04-08 10:08:51,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {44888#true} call #t~ret15 := main(); {44888#true} is VALID [2022-04-08 10:08:51,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {44888#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {44893#(= main_~y~0 0)} is VALID [2022-04-08 10:08:51,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {44893#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44894#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:51,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {44894#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44895#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:51,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {44895#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44896#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:51,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {44896#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44897#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:51,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {44897#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44898#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:51,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {44898#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44899#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:51,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {44899#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44900#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:51,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {44900#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44901#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:51,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {44901#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44902#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:51,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {44902#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44903#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:51,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {44903#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44904#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:51,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {44904#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44905#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:51,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {44905#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44906#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:51,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {44906#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44907#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:08:51,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {44907#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44908#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:08:51,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {44908#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {44908#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:08:51,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {44908#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {44909#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:08:51,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {44909#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44910#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:51,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {44910#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {44889#false} is VALID [2022-04-08 10:08:51,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {44889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {44889#false} is VALID [2022-04-08 10:08:51,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {44889#false} assume !(~y~0 % 4294967296 > 0); {44889#false} is VALID [2022-04-08 10:08:51,895 INFO L290 TraceCheckUtils]: 27: Hoare triple {44889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {44889#false} is VALID [2022-04-08 10:08:51,895 INFO L290 TraceCheckUtils]: 28: Hoare triple {44889#false} assume !(~x~0 % 4294967296 > 0); {44889#false} is VALID [2022-04-08 10:08:51,895 INFO L290 TraceCheckUtils]: 29: Hoare triple {44889#false} assume !(~z~0 % 4294967296 > 0); {44889#false} is VALID [2022-04-08 10:08:51,895 INFO L272 TraceCheckUtils]: 30: Hoare triple {44889#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {44889#false} is VALID [2022-04-08 10:08:51,895 INFO L290 TraceCheckUtils]: 31: Hoare triple {44889#false} ~cond := #in~cond; {44889#false} is VALID [2022-04-08 10:08:51,895 INFO L290 TraceCheckUtils]: 32: Hoare triple {44889#false} assume 0 == ~cond; {44889#false} is VALID [2022-04-08 10:08:51,895 INFO L290 TraceCheckUtils]: 33: Hoare triple {44889#false} assume !false; {44889#false} is VALID [2022-04-08 10:08:51,895 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:08:51,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:51,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773577067] [2022-04-08 10:08:51,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773577067] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:51,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983087256] [2022-04-08 10:08:51,896 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:08:51,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:51,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:51,897 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:08:51,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-08 10:08:51,933 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:08:51,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:51,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 10:08:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:51,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:52,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {44888#true} call ULTIMATE.init(); {44888#true} is VALID [2022-04-08 10:08:52,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {44888#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {44888#true} is VALID [2022-04-08 10:08:52,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {44888#true} assume true; {44888#true} is VALID [2022-04-08 10:08:52,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44888#true} {44888#true} #83#return; {44888#true} is VALID [2022-04-08 10:08:52,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {44888#true} call #t~ret15 := main(); {44888#true} is VALID [2022-04-08 10:08:52,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {44888#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {44888#true} is VALID [2022-04-08 10:08:52,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {44888#true} assume !(~x~0 % 4294967296 > 0); {44888#true} is VALID [2022-04-08 10:08:52,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {44888#true} ~z~0 := ~y~0; {44981#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:08:52,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {44981#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44985#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:08:52,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {44985#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {44985#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:08:52,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {44985#(= main_~y~0 (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {44992#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-08 10:08:52,224 INFO L290 TraceCheckUtils]: 26: Hoare triple {44992#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {44992#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-08 10:08:52,225 INFO L290 TraceCheckUtils]: 27: Hoare triple {44992#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {44981#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:08:52,225 INFO L290 TraceCheckUtils]: 28: Hoare triple {44981#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {44981#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:08:52,225 INFO L290 TraceCheckUtils]: 29: Hoare triple {44981#(= main_~z~0 main_~y~0)} assume !(~z~0 % 4294967296 > 0); {45005#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:08:52,226 INFO L272 TraceCheckUtils]: 30: Hoare triple {45005#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {45009#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:08:52,226 INFO L290 TraceCheckUtils]: 31: Hoare triple {45009#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {45013#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:08:52,226 INFO L290 TraceCheckUtils]: 32: Hoare triple {45013#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {44889#false} is VALID [2022-04-08 10:08:52,226 INFO L290 TraceCheckUtils]: 33: Hoare triple {44889#false} assume !false; {44889#false} is VALID [2022-04-08 10:08:52,226 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-08 10:08:52,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:52,476 INFO L290 TraceCheckUtils]: 33: Hoare triple {44889#false} assume !false; {44889#false} is VALID [2022-04-08 10:08:52,476 INFO L290 TraceCheckUtils]: 32: Hoare triple {45013#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {44889#false} is VALID [2022-04-08 10:08:52,477 INFO L290 TraceCheckUtils]: 31: Hoare triple {45009#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {45013#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:08:52,477 INFO L272 TraceCheckUtils]: 30: Hoare triple {45005#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {45009#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:08:52,478 INFO L290 TraceCheckUtils]: 29: Hoare triple {45032#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {45005#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:08:52,478 INFO L290 TraceCheckUtils]: 28: Hoare triple {45032#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {45032#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:08:52,479 INFO L290 TraceCheckUtils]: 27: Hoare triple {45039#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {45032#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:08:52,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {45039#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {45039#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-08 10:08:52,480 INFO L290 TraceCheckUtils]: 25: Hoare triple {45046#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45039#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-08 10:08:52,480 INFO L290 TraceCheckUtils]: 24: Hoare triple {45046#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {45046#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-08 10:08:52,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {45032#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {45046#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-08 10:08:52,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {44888#true} ~z~0 := ~y~0; {45032#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:08:52,481 INFO L290 TraceCheckUtils]: 21: Hoare triple {44888#true} assume !(~x~0 % 4294967296 > 0); {44888#true} is VALID [2022-04-08 10:08:52,481 INFO L290 TraceCheckUtils]: 20: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,481 INFO L290 TraceCheckUtils]: 19: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,482 INFO L290 TraceCheckUtils]: 11: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {44888#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44888#true} is VALID [2022-04-08 10:08:52,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {44888#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {44888#true} is VALID [2022-04-08 10:08:52,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {44888#true} call #t~ret15 := main(); {44888#true} is VALID [2022-04-08 10:08:52,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44888#true} {44888#true} #83#return; {44888#true} is VALID [2022-04-08 10:08:52,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {44888#true} assume true; {44888#true} is VALID [2022-04-08 10:08:52,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {44888#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {44888#true} is VALID [2022-04-08 10:08:52,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {44888#true} call ULTIMATE.init(); {44888#true} is VALID [2022-04-08 10:08:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-08 10:08:52,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983087256] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:52,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:52,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 8, 8] total 30 [2022-04-08 10:08:52,483 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:52,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [962959926] [2022-04-08 10:08:52,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [962959926] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:52,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:52,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:08:52,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299780124] [2022-04-08 10:08:52,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:52,483 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 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-08 10:08:52,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:52,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 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-08 10:08:52,504 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-08 10:08:52,505 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:08:52,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:52,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:08:52,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=799, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:08:52,505 INFO L87 Difference]: Start difference. First operand 216 states and 274 transitions. Second operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 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-08 10:09:00,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:00,599 INFO L93 Difference]: Finished difference Result 485 states and 676 transitions. [2022-04-08 10:09:00,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 10:09:00,599 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 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-08 10:09:00,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:00,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 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-08 10:09:00,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 210 transitions. [2022-04-08 10:09:00,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 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-08 10:09:00,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 210 transitions. [2022-04-08 10:09:00,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 210 transitions. [2022-04-08 10:09:00,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:00,801 INFO L225 Difference]: With dead ends: 485 [2022-04-08 10:09:00,802 INFO L226 Difference]: Without dead ends: 462 [2022-04-08 10:09:00,802 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=2186, Unknown=0, NotChecked=0, Total=2352 [2022-04-08 10:09:00,803 INFO L913 BasicCegarLoop]: 93 mSDtfsCounter, 151 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2923 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 2923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:00,803 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 185 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 2923 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 10:09:00,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-04-08 10:09:01,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 228. [2022-04-08 10:09:01,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:01,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 462 states. Second operand has 228 states, 223 states have (on average 1.2869955156950672) internal successors, (287), 223 states have internal predecessors, (287), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:01,705 INFO L74 IsIncluded]: Start isIncluded. First operand 462 states. Second operand has 228 states, 223 states have (on average 1.2869955156950672) internal successors, (287), 223 states have internal predecessors, (287), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:01,705 INFO L87 Difference]: Start difference. First operand 462 states. Second operand has 228 states, 223 states have (on average 1.2869955156950672) internal successors, (287), 223 states have internal predecessors, (287), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:01,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:01,712 INFO L93 Difference]: Finished difference Result 462 states and 585 transitions. [2022-04-08 10:09:01,712 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 585 transitions. [2022-04-08 10:09:01,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:01,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:01,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 228 states, 223 states have (on average 1.2869955156950672) internal successors, (287), 223 states have internal predecessors, (287), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 462 states. [2022-04-08 10:09:01,713 INFO L87 Difference]: Start difference. First operand has 228 states, 223 states have (on average 1.2869955156950672) internal successors, (287), 223 states have internal predecessors, (287), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 462 states. [2022-04-08 10:09:01,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:01,723 INFO L93 Difference]: Finished difference Result 462 states and 585 transitions. [2022-04-08 10:09:01,723 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 585 transitions. [2022-04-08 10:09:01,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:01,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:01,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:01,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:01,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 223 states have (on average 1.2869955156950672) internal successors, (287), 223 states have internal predecessors, (287), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:01,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 291 transitions. [2022-04-08 10:09:01,728 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 291 transitions. Word has length 34 [2022-04-08 10:09:01,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:01,728 INFO L478 AbstractCegarLoop]: Abstraction has 228 states and 291 transitions. [2022-04-08 10:09:01,728 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 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-08 10:09:01,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 228 states and 291 transitions. [2022-04-08 10:09:02,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:02,910 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 291 transitions. [2022-04-08 10:09:02,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 10:09:02,910 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:02,910 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:02,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-04-08 10:09:03,111 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-04-08 10:09:03,111 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:03,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:03,112 INFO L85 PathProgramCache]: Analyzing trace with hash -879664127, now seen corresponding path program 21 times [2022-04-08 10:09:03,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:03,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [90997267] [2022-04-08 10:09:03,114 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:03,114 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:03,114 INFO L85 PathProgramCache]: Analyzing trace with hash -879664127, now seen corresponding path program 22 times [2022-04-08 10:09:03,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:03,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140107682] [2022-04-08 10:09:03,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:03,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:03,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:03,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {47532#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {47512#true} is VALID [2022-04-08 10:09:03,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {47512#true} assume true; {47512#true} is VALID [2022-04-08 10:09:03,402 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47512#true} {47512#true} #83#return; {47512#true} is VALID [2022-04-08 10:09:03,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {47512#true} call ULTIMATE.init(); {47532#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:03,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {47532#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {47512#true} is VALID [2022-04-08 10:09:03,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {47512#true} assume true; {47512#true} is VALID [2022-04-08 10:09:03,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47512#true} {47512#true} #83#return; {47512#true} is VALID [2022-04-08 10:09:03,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {47512#true} call #t~ret15 := main(); {47512#true} is VALID [2022-04-08 10:09:03,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {47512#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47517#(= main_~y~0 0)} is VALID [2022-04-08 10:09:03,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {47517#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47518#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:03,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {47518#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47519#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:03,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {47519#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47520#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:03,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {47520#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47521#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:03,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {47521#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47522#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:03,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {47522#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47523#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:03,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {47523#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {47523#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:03,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {47523#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {47524#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:09:03,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {47524#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47525#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:09:03,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {47525#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47526#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:09:03,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {47526#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47527#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:09:03,410 INFO L290 TraceCheckUtils]: 17: Hoare triple {47527#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47528#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:09:03,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {47528#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47529#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:09:03,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {47529#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47530#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:09:03,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {47530#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {47530#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:09:03,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {47530#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47529#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:09:03,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {47529#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47528#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:09:03,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {47528#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47527#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:09:03,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {47527#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47526#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:09:03,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {47526#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47525#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:09:03,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {47525#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47524#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:09:03,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {47524#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {47524#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:09:03,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {47524#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {47524#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:09:03,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {47524#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {47531#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:09:03,418 INFO L290 TraceCheckUtils]: 30: Hoare triple {47531#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {47513#false} is VALID [2022-04-08 10:09:03,418 INFO L272 TraceCheckUtils]: 31: Hoare triple {47513#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {47513#false} is VALID [2022-04-08 10:09:03,418 INFO L290 TraceCheckUtils]: 32: Hoare triple {47513#false} ~cond := #in~cond; {47513#false} is VALID [2022-04-08 10:09:03,418 INFO L290 TraceCheckUtils]: 33: Hoare triple {47513#false} assume 0 == ~cond; {47513#false} is VALID [2022-04-08 10:09:03,418 INFO L290 TraceCheckUtils]: 34: Hoare triple {47513#false} assume !false; {47513#false} is VALID [2022-04-08 10:09:03,418 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:03,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:03,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140107682] [2022-04-08 10:09:03,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140107682] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:03,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825256682] [2022-04-08 10:09:03,419 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:09:03,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:03,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:03,424 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:03,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-08 10:09:03,474 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:09:03,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:03,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 10:09:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:03,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:03,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {47512#true} call ULTIMATE.init(); {47512#true} is VALID [2022-04-08 10:09:03,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {47512#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {47512#true} is VALID [2022-04-08 10:09:03,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {47512#true} assume true; {47512#true} is VALID [2022-04-08 10:09:03,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47512#true} {47512#true} #83#return; {47512#true} is VALID [2022-04-08 10:09:03,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {47512#true} call #t~ret15 := main(); {47512#true} is VALID [2022-04-08 10:09:03,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {47512#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47512#true} is VALID [2022-04-08 10:09:03,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {47512#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47554#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:09:03,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {47554#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47558#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:09:03,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {47558#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47562#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:09:03,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {47562#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47566#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:09:03,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {47566#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47570#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:09:03,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {47570#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47574#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:09:03,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {47574#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {47574#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:09:03,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {47574#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {47574#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:09:03,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {47574#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47570#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:09:03,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {47570#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47566#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:09:03,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {47566#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47562#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:09:03,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {47562#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47558#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:09:03,780 INFO L290 TraceCheckUtils]: 18: Hoare triple {47558#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47554#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:09:03,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {47554#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:03,781 INFO L290 TraceCheckUtils]: 20: Hoare triple {47599#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:03,781 INFO L290 TraceCheckUtils]: 21: Hoare triple {47599#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:03,781 INFO L290 TraceCheckUtils]: 22: Hoare triple {47599#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:03,782 INFO L290 TraceCheckUtils]: 23: Hoare triple {47599#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:03,782 INFO L290 TraceCheckUtils]: 24: Hoare triple {47599#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:03,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {47599#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:03,783 INFO L290 TraceCheckUtils]: 26: Hoare triple {47599#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:03,783 INFO L290 TraceCheckUtils]: 27: Hoare triple {47599#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:03,783 INFO L290 TraceCheckUtils]: 28: Hoare triple {47599#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {47513#false} is VALID [2022-04-08 10:09:03,783 INFO L290 TraceCheckUtils]: 29: Hoare triple {47513#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {47513#false} is VALID [2022-04-08 10:09:03,783 INFO L290 TraceCheckUtils]: 30: Hoare triple {47513#false} assume !(~z~0 % 4294967296 > 0); {47513#false} is VALID [2022-04-08 10:09:03,783 INFO L272 TraceCheckUtils]: 31: Hoare triple {47513#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {47513#false} is VALID [2022-04-08 10:09:03,784 INFO L290 TraceCheckUtils]: 32: Hoare triple {47513#false} ~cond := #in~cond; {47513#false} is VALID [2022-04-08 10:09:03,784 INFO L290 TraceCheckUtils]: 33: Hoare triple {47513#false} assume 0 == ~cond; {47513#false} is VALID [2022-04-08 10:09:03,784 INFO L290 TraceCheckUtils]: 34: Hoare triple {47513#false} assume !false; {47513#false} is VALID [2022-04-08 10:09:03,784 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-08 10:09:03,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:03,930 INFO L290 TraceCheckUtils]: 34: Hoare triple {47513#false} assume !false; {47513#false} is VALID [2022-04-08 10:09:03,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {47513#false} assume 0 == ~cond; {47513#false} is VALID [2022-04-08 10:09:03,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {47513#false} ~cond := #in~cond; {47513#false} is VALID [2022-04-08 10:09:03,930 INFO L272 TraceCheckUtils]: 31: Hoare triple {47513#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {47513#false} is VALID [2022-04-08 10:09:03,931 INFO L290 TraceCheckUtils]: 30: Hoare triple {47513#false} assume !(~z~0 % 4294967296 > 0); {47513#false} is VALID [2022-04-08 10:09:03,931 INFO L290 TraceCheckUtils]: 29: Hoare triple {47513#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {47513#false} is VALID [2022-04-08 10:09:03,931 INFO L290 TraceCheckUtils]: 28: Hoare triple {47599#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {47513#false} is VALID [2022-04-08 10:09:03,931 INFO L290 TraceCheckUtils]: 27: Hoare triple {47599#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:03,932 INFO L290 TraceCheckUtils]: 26: Hoare triple {47599#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:03,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {47599#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:03,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {47599#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:03,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {47599#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:03,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {47599#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:03,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {47599#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:03,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {47599#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:03,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {47554#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47599#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:03,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {47558#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47554#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:09:03,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {47562#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47558#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:09:03,949 INFO L290 TraceCheckUtils]: 16: Hoare triple {47566#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47562#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:09:03,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {47570#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47566#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:09:03,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {47574#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47570#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:09:03,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {47574#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {47574#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:09:03,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {47574#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {47574#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:09:03,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {47570#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47574#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:09:03,953 INFO L290 TraceCheckUtils]: 10: Hoare triple {47566#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47570#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:09:03,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {47562#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47566#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:09:03,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {47558#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47562#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:09:03,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {47554#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47558#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:09:03,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {47512#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47554#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:09:03,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {47512#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47512#true} is VALID [2022-04-08 10:09:03,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {47512#true} call #t~ret15 := main(); {47512#true} is VALID [2022-04-08 10:09:03,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47512#true} {47512#true} #83#return; {47512#true} is VALID [2022-04-08 10:09:03,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {47512#true} assume true; {47512#true} is VALID [2022-04-08 10:09:03,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {47512#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {47512#true} is VALID [2022-04-08 10:09:03,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {47512#true} call ULTIMATE.init(); {47512#true} is VALID [2022-04-08 10:09:03,957 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-08 10:09:03,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825256682] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:03,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:03,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 25 [2022-04-08 10:09:03,958 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:03,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [90997267] [2022-04-08 10:09:03,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [90997267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:03,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:03,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:09:03,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938501967] [2022-04-08 10:09:03,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:03,959 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 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-08 10:09:03,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:03,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 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-08 10:09:03,989 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-08 10:09:03,990 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:09:03,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:03,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:09:03,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2022-04-08 10:09:03,990 INFO L87 Difference]: Start difference. First operand 228 states and 291 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 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-08 10:09:10,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:10,240 INFO L93 Difference]: Finished difference Result 341 states and 459 transitions. [2022-04-08 10:09:10,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-08 10:09:10,240 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 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-08 10:09:10,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 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-08 10:09:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 211 transitions. [2022-04-08 10:09:10,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 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-08 10:09:10,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 211 transitions. [2022-04-08 10:09:10,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 211 transitions. [2022-04-08 10:09:10,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:10,429 INFO L225 Difference]: With dead ends: 341 [2022-04-08 10:09:10,429 INFO L226 Difference]: Without dead ends: 324 [2022-04-08 10:09:10,430 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1844 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=457, Invalid=7025, Unknown=0, NotChecked=0, Total=7482 [2022-04-08 10:09:10,431 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 96 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:10,431 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 106 Invalid, 1959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1771 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-08 10:09:10,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-04-08 10:09:11,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 237. [2022-04-08 10:09:11,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:11,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 324 states. Second operand has 237 states, 232 states have (on average 1.2758620689655173) internal successors, (296), 232 states have internal predecessors, (296), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:11,477 INFO L74 IsIncluded]: Start isIncluded. First operand 324 states. Second operand has 237 states, 232 states have (on average 1.2758620689655173) internal successors, (296), 232 states have internal predecessors, (296), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:11,477 INFO L87 Difference]: Start difference. First operand 324 states. Second operand has 237 states, 232 states have (on average 1.2758620689655173) internal successors, (296), 232 states have internal predecessors, (296), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:11,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:11,481 INFO L93 Difference]: Finished difference Result 324 states and 404 transitions. [2022-04-08 10:09:11,481 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 404 transitions. [2022-04-08 10:09:11,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:11,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:11,481 INFO L74 IsIncluded]: Start isIncluded. First operand has 237 states, 232 states have (on average 1.2758620689655173) internal successors, (296), 232 states have internal predecessors, (296), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 324 states. [2022-04-08 10:09:11,482 INFO L87 Difference]: Start difference. First operand has 237 states, 232 states have (on average 1.2758620689655173) internal successors, (296), 232 states have internal predecessors, (296), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 324 states. [2022-04-08 10:09:11,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:11,485 INFO L93 Difference]: Finished difference Result 324 states and 404 transitions. [2022-04-08 10:09:11,485 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 404 transitions. [2022-04-08 10:09:11,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:11,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:11,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:11,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:11,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 232 states have (on average 1.2758620689655173) internal successors, (296), 232 states have internal predecessors, (296), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:11,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 300 transitions. [2022-04-08 10:09:11,488 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 300 transitions. Word has length 35 [2022-04-08 10:09:11,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:11,488 INFO L478 AbstractCegarLoop]: Abstraction has 237 states and 300 transitions. [2022-04-08 10:09:11,489 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 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-08 10:09:11,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 237 states and 300 transitions. [2022-04-08 10:09:12,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 300 edges. 300 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:12,654 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 300 transitions. [2022-04-08 10:09:12,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 10:09:12,654 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:12,654 INFO L499 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:12,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-04-08 10:09:12,855 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-04-08 10:09:12,855 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:12,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:12,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1905241537, now seen corresponding path program 43 times [2022-04-08 10:09:12,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:12,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [19916400] [2022-04-08 10:09:12,858 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:12,858 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:12,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1905241537, now seen corresponding path program 44 times [2022-04-08 10:09:12,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:12,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78789361] [2022-04-08 10:09:12,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:12,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:13,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:13,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {49701#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {49677#true} is VALID [2022-04-08 10:09:13,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {49677#true} assume true; {49677#true} is VALID [2022-04-08 10:09:13,171 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49677#true} {49677#true} #83#return; {49677#true} is VALID [2022-04-08 10:09:13,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {49677#true} call ULTIMATE.init(); {49701#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:13,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {49701#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {49677#true} is VALID [2022-04-08 10:09:13,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {49677#true} assume true; {49677#true} is VALID [2022-04-08 10:09:13,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49677#true} {49677#true} #83#return; {49677#true} is VALID [2022-04-08 10:09:13,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {49677#true} call #t~ret15 := main(); {49677#true} is VALID [2022-04-08 10:09:13,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {49677#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49682#(= main_~y~0 0)} is VALID [2022-04-08 10:09:13,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {49682#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49683#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:13,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {49683#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49684#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:13,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {49684#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49685#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:13,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {49685#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49686#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:13,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {49686#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49687#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:13,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {49687#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49688#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:13,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {49688#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49689#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:13,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {49689#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49690#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:13,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {49690#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49691#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:13,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {49691#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49692#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:13,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {49692#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49693#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:13,178 INFO L290 TraceCheckUtils]: 17: Hoare triple {49693#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49694#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:13,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {49694#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49695#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:13,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {49695#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49696#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:13,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {49696#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49697#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:09:13,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {49697#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:09:13,180 INFO L290 TraceCheckUtils]: 22: Hoare triple {49698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {49698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:09:13,181 INFO L290 TraceCheckUtils]: 23: Hoare triple {49698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {49699#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:09:13,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {49699#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49700#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} is VALID [2022-04-08 10:09:13,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {49700#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {49678#false} is VALID [2022-04-08 10:09:13,182 INFO L290 TraceCheckUtils]: 26: Hoare triple {49678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49678#false} is VALID [2022-04-08 10:09:13,182 INFO L290 TraceCheckUtils]: 27: Hoare triple {49678#false} assume !(~y~0 % 4294967296 > 0); {49678#false} is VALID [2022-04-08 10:09:13,182 INFO L290 TraceCheckUtils]: 28: Hoare triple {49678#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {49678#false} is VALID [2022-04-08 10:09:13,182 INFO L290 TraceCheckUtils]: 29: Hoare triple {49678#false} assume !(~x~0 % 4294967296 > 0); {49678#false} is VALID [2022-04-08 10:09:13,182 INFO L290 TraceCheckUtils]: 30: Hoare triple {49678#false} assume !(~z~0 % 4294967296 > 0); {49678#false} is VALID [2022-04-08 10:09:13,182 INFO L272 TraceCheckUtils]: 31: Hoare triple {49678#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {49678#false} is VALID [2022-04-08 10:09:13,182 INFO L290 TraceCheckUtils]: 32: Hoare triple {49678#false} ~cond := #in~cond; {49678#false} is VALID [2022-04-08 10:09:13,182 INFO L290 TraceCheckUtils]: 33: Hoare triple {49678#false} assume 0 == ~cond; {49678#false} is VALID [2022-04-08 10:09:13,182 INFO L290 TraceCheckUtils]: 34: Hoare triple {49678#false} assume !false; {49678#false} is VALID [2022-04-08 10:09:13,182 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:09:13,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:13,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78789361] [2022-04-08 10:09:13,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78789361] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:13,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972943170] [2022-04-08 10:09:13,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:09:13,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:13,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:13,183 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:13,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-08 10:09:13,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:09:13,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:13,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 10:09:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:13,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:13,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {49677#true} call ULTIMATE.init(); {49677#true} is VALID [2022-04-08 10:09:13,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {49677#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {49677#true} is VALID [2022-04-08 10:09:13,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {49677#true} assume true; {49677#true} is VALID [2022-04-08 10:09:13,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49677#true} {49677#true} #83#return; {49677#true} is VALID [2022-04-08 10:09:13,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {49677#true} call #t~ret15 := main(); {49677#true} is VALID [2022-04-08 10:09:13,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {49677#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49682#(= main_~y~0 0)} is VALID [2022-04-08 10:09:13,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {49682#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49683#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:13,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {49683#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49684#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:13,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {49684#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49685#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:13,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {49685#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49686#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:13,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {49686#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49687#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:13,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {49687#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49688#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:13,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {49688#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49689#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:13,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {49689#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49690#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:13,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {49690#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49691#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:13,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {49691#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49692#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:13,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {49692#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49693#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:13,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {49693#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49694#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:13,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {49694#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49695#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:13,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {49695#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49696#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:13,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {49696#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49697#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:09:13,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {49697#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:09:13,538 INFO L290 TraceCheckUtils]: 22: Hoare triple {49698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {49698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:09:13,538 INFO L290 TraceCheckUtils]: 23: Hoare triple {49698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {49699#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:09:13,539 INFO L290 TraceCheckUtils]: 24: Hoare triple {49699#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49777#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:09:13,539 INFO L290 TraceCheckUtils]: 25: Hoare triple {49777#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {49678#false} is VALID [2022-04-08 10:09:13,539 INFO L290 TraceCheckUtils]: 26: Hoare triple {49678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49678#false} is VALID [2022-04-08 10:09:13,539 INFO L290 TraceCheckUtils]: 27: Hoare triple {49678#false} assume !(~y~0 % 4294967296 > 0); {49678#false} is VALID [2022-04-08 10:09:13,539 INFO L290 TraceCheckUtils]: 28: Hoare triple {49678#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {49678#false} is VALID [2022-04-08 10:09:13,539 INFO L290 TraceCheckUtils]: 29: Hoare triple {49678#false} assume !(~x~0 % 4294967296 > 0); {49678#false} is VALID [2022-04-08 10:09:13,539 INFO L290 TraceCheckUtils]: 30: Hoare triple {49678#false} assume !(~z~0 % 4294967296 > 0); {49678#false} is VALID [2022-04-08 10:09:13,539 INFO L272 TraceCheckUtils]: 31: Hoare triple {49678#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {49678#false} is VALID [2022-04-08 10:09:13,539 INFO L290 TraceCheckUtils]: 32: Hoare triple {49678#false} ~cond := #in~cond; {49678#false} is VALID [2022-04-08 10:09:13,540 INFO L290 TraceCheckUtils]: 33: Hoare triple {49678#false} assume 0 == ~cond; {49678#false} is VALID [2022-04-08 10:09:13,540 INFO L290 TraceCheckUtils]: 34: Hoare triple {49678#false} assume !false; {49678#false} is VALID [2022-04-08 10:09:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:09:13,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:14,145 INFO L290 TraceCheckUtils]: 34: Hoare triple {49678#false} assume !false; {49678#false} is VALID [2022-04-08 10:09:14,145 INFO L290 TraceCheckUtils]: 33: Hoare triple {49678#false} assume 0 == ~cond; {49678#false} is VALID [2022-04-08 10:09:14,145 INFO L290 TraceCheckUtils]: 32: Hoare triple {49678#false} ~cond := #in~cond; {49678#false} is VALID [2022-04-08 10:09:14,145 INFO L272 TraceCheckUtils]: 31: Hoare triple {49678#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {49678#false} is VALID [2022-04-08 10:09:14,145 INFO L290 TraceCheckUtils]: 30: Hoare triple {49678#false} assume !(~z~0 % 4294967296 > 0); {49678#false} is VALID [2022-04-08 10:09:14,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {49678#false} assume !(~x~0 % 4294967296 > 0); {49678#false} is VALID [2022-04-08 10:09:14,145 INFO L290 TraceCheckUtils]: 28: Hoare triple {49678#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {49678#false} is VALID [2022-04-08 10:09:14,146 INFO L290 TraceCheckUtils]: 27: Hoare triple {49678#false} assume !(~y~0 % 4294967296 > 0); {49678#false} is VALID [2022-04-08 10:09:14,146 INFO L290 TraceCheckUtils]: 26: Hoare triple {49678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49678#false} is VALID [2022-04-08 10:09:14,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {49835#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {49678#false} is VALID [2022-04-08 10:09:14,147 INFO L290 TraceCheckUtils]: 24: Hoare triple {49839#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49835#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:09:14,147 INFO L290 TraceCheckUtils]: 23: Hoare triple {49843#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {49839#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:14,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {49843#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {49843#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:14,148 INFO L290 TraceCheckUtils]: 21: Hoare triple {49850#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49843#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:14,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {49854#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49850#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:14,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {49858#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49854#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:09:14,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {49862#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49858#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:09:14,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {49866#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49862#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:09:14,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {49870#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49866#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:09:14,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {49874#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49870#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:14,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {49878#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49874#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:09:14,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {49882#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49878#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:14,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {49886#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49882#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:09:14,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {49890#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49886#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:09:14,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {49894#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49890#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:09:14,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {49898#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49894#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:09:14,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {49902#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49898#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:09:14,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {49906#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49902#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:09:14,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {49910#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49906#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:09:14,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {49677#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49910#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:09:14,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {49677#true} call #t~ret15 := main(); {49677#true} is VALID [2022-04-08 10:09:14,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49677#true} {49677#true} #83#return; {49677#true} is VALID [2022-04-08 10:09:14,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {49677#true} assume true; {49677#true} is VALID [2022-04-08 10:09:14,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {49677#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {49677#true} is VALID [2022-04-08 10:09:14,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {49677#true} call ULTIMATE.init(); {49677#true} is VALID [2022-04-08 10:09:14,158 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:09:14,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972943170] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:14,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:14,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-08 10:09:14,158 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:14,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [19916400] [2022-04-08 10:09:14,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [19916400] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:14,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:14,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 10:09:14,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558324611] [2022-04-08 10:09:14,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:14,159 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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-08 10:09:14,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:14,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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-08 10:09:14,188 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-08 10:09:14,189 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 10:09:14,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:14,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 10:09:14,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=1346, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 10:09:14,189 INFO L87 Difference]: Start difference. First operand 237 states and 300 transitions. Second operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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-08 10:09:23,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:23,905 INFO L93 Difference]: Finished difference Result 555 states and 776 transitions. [2022-04-08 10:09:23,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 10:09:23,905 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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-08 10:09:23,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:23,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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-08 10:09:23,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 222 transitions. [2022-04-08 10:09:23,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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-08 10:09:23,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 222 transitions. [2022-04-08 10:09:23,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 222 transitions. [2022-04-08 10:09:24,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:24,098 INFO L225 Difference]: With dead ends: 555 [2022-04-08 10:09:24,098 INFO L226 Difference]: Without dead ends: 532 [2022-04-08 10:09:24,098 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=808, Invalid=2974, Unknown=0, NotChecked=0, Total=3782 [2022-04-08 10:09:24,099 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 163 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3256 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 3374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 3256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:24,099 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 194 Invalid, 3374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 3256 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 10:09:24,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-04-08 10:09:25,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 249. [2022-04-08 10:09:25,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:25,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 532 states. Second operand has 249 states, 244 states have (on average 1.2827868852459017) internal successors, (313), 244 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:25,107 INFO L74 IsIncluded]: Start isIncluded. First operand 532 states. Second operand has 249 states, 244 states have (on average 1.2827868852459017) internal successors, (313), 244 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:25,107 INFO L87 Difference]: Start difference. First operand 532 states. Second operand has 249 states, 244 states have (on average 1.2827868852459017) internal successors, (313), 244 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:25,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:25,116 INFO L93 Difference]: Finished difference Result 532 states and 681 transitions. [2022-04-08 10:09:25,116 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 681 transitions. [2022-04-08 10:09:25,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:25,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:25,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 249 states, 244 states have (on average 1.2827868852459017) internal successors, (313), 244 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 532 states. [2022-04-08 10:09:25,116 INFO L87 Difference]: Start difference. First operand has 249 states, 244 states have (on average 1.2827868852459017) internal successors, (313), 244 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 532 states. [2022-04-08 10:09:25,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:25,124 INFO L93 Difference]: Finished difference Result 532 states and 681 transitions. [2022-04-08 10:09:25,124 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 681 transitions. [2022-04-08 10:09:25,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:25,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:25,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:25,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:25,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 244 states have (on average 1.2827868852459017) internal successors, (313), 244 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:25,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 317 transitions. [2022-04-08 10:09:25,129 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 317 transitions. Word has length 35 [2022-04-08 10:09:25,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:25,130 INFO L478 AbstractCegarLoop]: Abstraction has 249 states and 317 transitions. [2022-04-08 10:09:25,130 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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-08 10:09:25,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 249 states and 317 transitions. [2022-04-08 10:09:26,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 317 edges. 317 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:26,352 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 317 transitions. [2022-04-08 10:09:26,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 10:09:26,355 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:26,355 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:26,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-08 10:09:26,575 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:26,575 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:26,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:26,576 INFO L85 PathProgramCache]: Analyzing trace with hash 955015874, now seen corresponding path program 13 times [2022-04-08 10:09:26,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:26,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [873680458] [2022-04-08 10:09:26,578 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:26,578 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:26,578 INFO L85 PathProgramCache]: Analyzing trace with hash 955015874, now seen corresponding path program 14 times [2022-04-08 10:09:26,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:26,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016569853] [2022-04-08 10:09:26,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:26,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:26,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:26,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {52656#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {52643#true} is VALID [2022-04-08 10:09:26,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {52643#true} assume true; {52643#true} is VALID [2022-04-08 10:09:26,765 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52643#true} {52643#true} #83#return; {52643#true} is VALID [2022-04-08 10:09:26,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {52643#true} call ULTIMATE.init(); {52656#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:26,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {52656#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {52643#true} is VALID [2022-04-08 10:09:26,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {52643#true} assume true; {52643#true} is VALID [2022-04-08 10:09:26,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52643#true} {52643#true} #83#return; {52643#true} is VALID [2022-04-08 10:09:26,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {52643#true} call #t~ret15 := main(); {52643#true} is VALID [2022-04-08 10:09:26,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {52643#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52648#(= main_~y~0 0)} is VALID [2022-04-08 10:09:26,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {52648#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:26,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:26,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:26,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:26,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:26,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:26,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:26,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:26,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:26,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:26,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:26,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:26,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:26,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:26,774 INFO L290 TraceCheckUtils]: 20: Hoare triple {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52648#(= main_~y~0 0)} is VALID [2022-04-08 10:09:26,774 INFO L290 TraceCheckUtils]: 21: Hoare triple {52648#(= main_~y~0 0)} assume !(~y~0 % 4294967296 > 0); {52648#(= main_~y~0 0)} is VALID [2022-04-08 10:09:26,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {52648#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:26,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:26,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:26,777 INFO L290 TraceCheckUtils]: 25: Hoare triple {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:26,777 INFO L290 TraceCheckUtils]: 26: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:26,778 INFO L290 TraceCheckUtils]: 27: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:26,778 INFO L290 TraceCheckUtils]: 28: Hoare triple {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:26,779 INFO L290 TraceCheckUtils]: 29: Hoare triple {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:26,780 INFO L290 TraceCheckUtils]: 30: Hoare triple {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {52653#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:09:26,780 INFO L290 TraceCheckUtils]: 31: Hoare triple {52653#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 > 0); {52653#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:09:26,781 INFO L272 TraceCheckUtils]: 32: Hoare triple {52653#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {52654#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:09:26,781 INFO L290 TraceCheckUtils]: 33: Hoare triple {52654#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {52655#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:09:26,782 INFO L290 TraceCheckUtils]: 34: Hoare triple {52655#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {52644#false} is VALID [2022-04-08 10:09:26,782 INFO L290 TraceCheckUtils]: 35: Hoare triple {52644#false} assume !false; {52644#false} is VALID [2022-04-08 10:09:26,782 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:09:26,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:26,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016569853] [2022-04-08 10:09:26,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016569853] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:26,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857779660] [2022-04-08 10:09:26,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:09:26,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:26,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:26,784 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:26,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-08 10:09:26,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:09:26,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:26,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-08 10:09:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:26,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:27,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {52643#true} call ULTIMATE.init(); {52643#true} is VALID [2022-04-08 10:09:27,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {52643#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {52643#true} is VALID [2022-04-08 10:09:27,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {52643#true} assume true; {52643#true} is VALID [2022-04-08 10:09:27,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52643#true} {52643#true} #83#return; {52643#true} is VALID [2022-04-08 10:09:27,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {52643#true} call #t~ret15 := main(); {52643#true} is VALID [2022-04-08 10:09:27,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {52643#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52648#(= main_~y~0 0)} is VALID [2022-04-08 10:09:27,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {52648#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:27,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:27,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:27,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:27,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:27,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {52693#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:27,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {52693#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52697#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:09:27,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {52697#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52701#(and (<= main_~y~0 4) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:27,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {52701#(and (<= main_~y~0 4) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52705#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:27,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {52705#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52709#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-08 10:09:27,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {52709#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !(~z~0 % 4294967296 > 0); {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:27,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:27,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:27,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:27,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52648#(= main_~y~0 0)} is VALID [2022-04-08 10:09:27,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {52648#(= main_~y~0 0)} assume !(~y~0 % 4294967296 > 0); {52648#(= main_~y~0 0)} is VALID [2022-04-08 10:09:27,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {52648#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:27,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:27,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:27,247 INFO L290 TraceCheckUtils]: 25: Hoare triple {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:27,247 INFO L290 TraceCheckUtils]: 26: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:27,248 INFO L290 TraceCheckUtils]: 27: Hoare triple {52652#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:27,248 INFO L290 TraceCheckUtils]: 28: Hoare triple {52651#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:27,249 INFO L290 TraceCheckUtils]: 29: Hoare triple {52650#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:27,250 INFO L290 TraceCheckUtils]: 30: Hoare triple {52649#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {52648#(= main_~y~0 0)} is VALID [2022-04-08 10:09:27,250 INFO L290 TraceCheckUtils]: 31: Hoare triple {52648#(= main_~y~0 0)} assume !(~z~0 % 4294967296 > 0); {52648#(= main_~y~0 0)} is VALID [2022-04-08 10:09:27,251 INFO L272 TraceCheckUtils]: 32: Hoare triple {52648#(= main_~y~0 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {52761#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:09:27,255 INFO L290 TraceCheckUtils]: 33: Hoare triple {52761#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {52765#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:09:27,255 INFO L290 TraceCheckUtils]: 34: Hoare triple {52765#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {52644#false} is VALID [2022-04-08 10:09:27,256 INFO L290 TraceCheckUtils]: 35: Hoare triple {52644#false} assume !false; {52644#false} is VALID [2022-04-08 10:09:27,256 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:27,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:27,589 INFO L290 TraceCheckUtils]: 35: Hoare triple {52644#false} assume !false; {52644#false} is VALID [2022-04-08 10:09:27,589 INFO L290 TraceCheckUtils]: 34: Hoare triple {52765#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {52644#false} is VALID [2022-04-08 10:09:27,590 INFO L290 TraceCheckUtils]: 33: Hoare triple {52761#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {52765#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:09:27,590 INFO L272 TraceCheckUtils]: 32: Hoare triple {52781#(= (mod main_~y~0 4294967296) 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {52761#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:09:27,590 INFO L290 TraceCheckUtils]: 31: Hoare triple {52781#(= (mod main_~y~0 4294967296) 0)} assume !(~z~0 % 4294967296 > 0); {52781#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-08 10:09:27,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {52788#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {52781#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-08 10:09:27,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {52792#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {52788#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-08 10:09:27,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {52796#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {52792#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} is VALID [2022-04-08 10:09:27,593 INFO L290 TraceCheckUtils]: 27: Hoare triple {52800#(= (mod (+ 4294967292 main_~y~0) 4294967296) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {52796#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} is VALID [2022-04-08 10:09:27,593 INFO L290 TraceCheckUtils]: 26: Hoare triple {52800#(= (mod (+ 4294967292 main_~y~0) 4294967296) 0)} assume !(~x~0 % 4294967296 > 0); {52800#(= (mod (+ 4294967292 main_~y~0) 4294967296) 0)} is VALID [2022-04-08 10:09:27,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {52796#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52800#(= (mod (+ 4294967292 main_~y~0) 4294967296) 0)} is VALID [2022-04-08 10:09:27,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {52792#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52796#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} is VALID [2022-04-08 10:09:27,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {52788#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52792#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} is VALID [2022-04-08 10:09:27,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {52781#(= (mod main_~y~0 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52788#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-08 10:09:27,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {52781#(= (mod main_~y~0 4294967296) 0)} assume !(~y~0 % 4294967296 > 0); {52781#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-08 10:09:27,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {52788#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52781#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-08 10:09:27,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {52792#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52788#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-08 10:09:27,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {52796#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52792#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} is VALID [2022-04-08 10:09:27,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {52800#(= (mod (+ 4294967292 main_~y~0) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} is VALID [2022-04-08 10:09:27,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {52834#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {52800#(= (mod (+ 4294967292 main_~y~0) 4294967296) 0)} is VALID [2022-04-08 10:09:27,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {52838#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52834#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:09:27,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {52842#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52838#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:09:27,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {52846#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52842#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:09:27,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {52850#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52846#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:09:27,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {52643#true} ~z~0 := ~y~0; {52850#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:09:27,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {52643#true} assume !(~x~0 % 4294967296 > 0); {52643#true} is VALID [2022-04-08 10:09:27,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {52643#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52643#true} is VALID [2022-04-08 10:09:27,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {52643#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52643#true} is VALID [2022-04-08 10:09:27,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {52643#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52643#true} is VALID [2022-04-08 10:09:27,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {52643#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52643#true} is VALID [2022-04-08 10:09:27,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {52643#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52643#true} is VALID [2022-04-08 10:09:27,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {52643#true} call #t~ret15 := main(); {52643#true} is VALID [2022-04-08 10:09:27,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52643#true} {52643#true} #83#return; {52643#true} is VALID [2022-04-08 10:09:27,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {52643#true} assume true; {52643#true} is VALID [2022-04-08 10:09:27,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {52643#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {52643#true} is VALID [2022-04-08 10:09:27,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {52643#true} call ULTIMATE.init(); {52643#true} is VALID [2022-04-08 10:09:27,603 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:09:27,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857779660] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:27,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:27,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 28 [2022-04-08 10:09:27,603 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:27,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [873680458] [2022-04-08 10:09:27,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [873680458] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:27,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:27,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:09:27,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449911545] [2022-04-08 10:09:27,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:27,604 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 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 36 [2022-04-08 10:09:27,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:27,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 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-08 10:09:27,634 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-08 10:09:27,635 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:09:27,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:27,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:09:27,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:09:27,635 INFO L87 Difference]: Start difference. First operand 249 states and 317 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 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-08 10:09:29,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:29,209 INFO L93 Difference]: Finished difference Result 260 states and 328 transitions. [2022-04-08 10:09:29,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 10:09:29,209 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 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 36 [2022-04-08 10:09:29,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:29,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 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-08 10:09:29,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-08 10:09:29,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 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-08 10:09:29,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-08 10:09:29,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2022-04-08 10:09:29,249 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-08 10:09:29,252 INFO L225 Difference]: With dead ends: 260 [2022-04-08 10:09:29,252 INFO L226 Difference]: Without dead ends: 250 [2022-04-08 10:09:29,252 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 62 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 10:09:29,253 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:29,253 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 58 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:09:29,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-04-08 10:09:30,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2022-04-08 10:09:30,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:30,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 250 states. Second operand has 250 states, 245 states have (on average 1.2816326530612245) internal successors, (314), 245 states have internal predecessors, (314), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:30,328 INFO L74 IsIncluded]: Start isIncluded. First operand 250 states. Second operand has 250 states, 245 states have (on average 1.2816326530612245) internal successors, (314), 245 states have internal predecessors, (314), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:30,329 INFO L87 Difference]: Start difference. First operand 250 states. Second operand has 250 states, 245 states have (on average 1.2816326530612245) internal successors, (314), 245 states have internal predecessors, (314), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:30,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:30,331 INFO L93 Difference]: Finished difference Result 250 states and 318 transitions. [2022-04-08 10:09:30,331 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 318 transitions. [2022-04-08 10:09:30,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:30,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:30,331 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.2816326530612245) internal successors, (314), 245 states have internal predecessors, (314), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 250 states. [2022-04-08 10:09:30,332 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.2816326530612245) internal successors, (314), 245 states have internal predecessors, (314), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 250 states. [2022-04-08 10:09:30,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:30,334 INFO L93 Difference]: Finished difference Result 250 states and 318 transitions. [2022-04-08 10:09:30,334 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 318 transitions. [2022-04-08 10:09:30,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:30,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:30,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:30,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:30,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.2816326530612245) internal successors, (314), 245 states have internal predecessors, (314), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:30,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 318 transitions. [2022-04-08 10:09:30,338 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 318 transitions. Word has length 36 [2022-04-08 10:09:30,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:30,338 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 318 transitions. [2022-04-08 10:09:30,338 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 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-08 10:09:30,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 318 transitions. [2022-04-08 10:09:31,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 318 edges. 318 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:31,407 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 318 transitions. [2022-04-08 10:09:31,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 10:09:31,407 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:31,407 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:31,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-08 10:09:31,607 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-04-08 10:09:31,608 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:31,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:31,608 INFO L85 PathProgramCache]: Analyzing trace with hash -562951837, now seen corresponding path program 23 times [2022-04-08 10:09:31,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:31,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [220076421] [2022-04-08 10:09:31,610 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:31,610 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:31,610 INFO L85 PathProgramCache]: Analyzing trace with hash -562951837, now seen corresponding path program 24 times [2022-04-08 10:09:31,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:31,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930203844] [2022-04-08 10:09:31,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:31,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:31,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:31,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {54438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {54423#true} is VALID [2022-04-08 10:09:31,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {54423#true} assume true; {54423#true} is VALID [2022-04-08 10:09:31,788 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54423#true} {54423#true} #83#return; {54423#true} is VALID [2022-04-08 10:09:31,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {54423#true} call ULTIMATE.init(); {54438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:31,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {54438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {54423#true} is VALID [2022-04-08 10:09:31,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {54423#true} assume true; {54423#true} is VALID [2022-04-08 10:09:31,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54423#true} {54423#true} #83#return; {54423#true} is VALID [2022-04-08 10:09:31,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {54423#true} call #t~ret15 := main(); {54423#true} is VALID [2022-04-08 10:09:31,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {54423#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {54423#true} is VALID [2022-04-08 10:09:31,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {54423#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54428#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:09:31,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {54428#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54429#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-08 10:09:31,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {54429#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54430#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:09:31,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {54430#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54431#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:09:31,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {54431#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54432#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:09:31,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {54432#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {54432#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:09:31,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {54432#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {54432#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:09:31,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {54432#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54433#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-08 10:09:31,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {54433#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54434#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 2) main_~x~0)} is VALID [2022-04-08 10:09:31,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {54434#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 2) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54435#(<= (+ 3 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:09:31,799 INFO L290 TraceCheckUtils]: 16: Hoare triple {54435#(<= (+ 3 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54436#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-08 10:09:31,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {54436#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:09:31,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:09:31,801 INFO L290 TraceCheckUtils]: 19: Hoare triple {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:09:31,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:09:31,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:09:31,802 INFO L290 TraceCheckUtils]: 22: Hoare triple {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:09:31,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:09:31,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:09:31,804 INFO L290 TraceCheckUtils]: 25: Hoare triple {54437#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {54424#false} is VALID [2022-04-08 10:09:31,804 INFO L290 TraceCheckUtils]: 26: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-08 10:09:31,804 INFO L290 TraceCheckUtils]: 27: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-08 10:09:31,804 INFO L290 TraceCheckUtils]: 28: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-08 10:09:31,804 INFO L290 TraceCheckUtils]: 29: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-08 10:09:31,804 INFO L290 TraceCheckUtils]: 30: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-08 10:09:31,804 INFO L290 TraceCheckUtils]: 31: Hoare triple {54424#false} assume !(~z~0 % 4294967296 > 0); {54424#false} is VALID [2022-04-08 10:09:31,804 INFO L272 TraceCheckUtils]: 32: Hoare triple {54424#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {54424#false} is VALID [2022-04-08 10:09:31,804 INFO L290 TraceCheckUtils]: 33: Hoare triple {54424#false} ~cond := #in~cond; {54424#false} is VALID [2022-04-08 10:09:31,805 INFO L290 TraceCheckUtils]: 34: Hoare triple {54424#false} assume 0 == ~cond; {54424#false} is VALID [2022-04-08 10:09:31,805 INFO L290 TraceCheckUtils]: 35: Hoare triple {54424#false} assume !false; {54424#false} is VALID [2022-04-08 10:09:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 10:09:31,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:31,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930203844] [2022-04-08 10:09:31,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930203844] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:31,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080011067] [2022-04-08 10:09:31,805 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:09:31,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:31,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:31,807 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:31,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-08 10:09:31,889 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:09:31,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:31,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 10:09:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:31,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:32,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {54423#true} call ULTIMATE.init(); {54423#true} is VALID [2022-04-08 10:09:32,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {54423#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {54423#true} is VALID [2022-04-08 10:09:32,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {54423#true} assume true; {54423#true} is VALID [2022-04-08 10:09:32,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54423#true} {54423#true} #83#return; {54423#true} is VALID [2022-04-08 10:09:32,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {54423#true} call #t~ret15 := main(); {54423#true} is VALID [2022-04-08 10:09:32,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {54423#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {54423#true} is VALID [2022-04-08 10:09:32,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {54423#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54428#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:09:32,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {54428#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54463#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:09:32,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {54463#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54467#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:32,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {54467#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54471#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:09:32,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {54471#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54475#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:32,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {54475#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {54475#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:32,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {54475#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} ~z~0 := ~y~0; {54475#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:32,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {54475#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54471#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:09:32,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {54471#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54467#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:32,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {54467#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54463#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:09:32,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {54463#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54428#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:09:32,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {54428#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:32,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:32,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:32,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:32,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:32,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:32,338 INFO L290 TraceCheckUtils]: 23: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:32,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:32,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {54424#false} is VALID [2022-04-08 10:09:32,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-08 10:09:32,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-08 10:09:32,339 INFO L290 TraceCheckUtils]: 28: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-08 10:09:32,339 INFO L290 TraceCheckUtils]: 29: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-08 10:09:32,339 INFO L290 TraceCheckUtils]: 30: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-08 10:09:32,339 INFO L290 TraceCheckUtils]: 31: Hoare triple {54424#false} assume !(~z~0 % 4294967296 > 0); {54424#false} is VALID [2022-04-08 10:09:32,339 INFO L272 TraceCheckUtils]: 32: Hoare triple {54424#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {54424#false} is VALID [2022-04-08 10:09:32,339 INFO L290 TraceCheckUtils]: 33: Hoare triple {54424#false} ~cond := #in~cond; {54424#false} is VALID [2022-04-08 10:09:32,339 INFO L290 TraceCheckUtils]: 34: Hoare triple {54424#false} assume 0 == ~cond; {54424#false} is VALID [2022-04-08 10:09:32,339 INFO L290 TraceCheckUtils]: 35: Hoare triple {54424#false} assume !false; {54424#false} is VALID [2022-04-08 10:09:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 10:09:32,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:32,470 INFO L290 TraceCheckUtils]: 35: Hoare triple {54424#false} assume !false; {54424#false} is VALID [2022-04-08 10:09:32,470 INFO L290 TraceCheckUtils]: 34: Hoare triple {54424#false} assume 0 == ~cond; {54424#false} is VALID [2022-04-08 10:09:32,470 INFO L290 TraceCheckUtils]: 33: Hoare triple {54424#false} ~cond := #in~cond; {54424#false} is VALID [2022-04-08 10:09:32,470 INFO L272 TraceCheckUtils]: 32: Hoare triple {54424#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {54424#false} is VALID [2022-04-08 10:09:32,470 INFO L290 TraceCheckUtils]: 31: Hoare triple {54424#false} assume !(~z~0 % 4294967296 > 0); {54424#false} is VALID [2022-04-08 10:09:32,470 INFO L290 TraceCheckUtils]: 30: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-08 10:09:32,470 INFO L290 TraceCheckUtils]: 29: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-08 10:09:32,470 INFO L290 TraceCheckUtils]: 28: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-08 10:09:32,470 INFO L290 TraceCheckUtils]: 27: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-08 10:09:32,470 INFO L290 TraceCheckUtils]: 26: Hoare triple {54424#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54424#false} is VALID [2022-04-08 10:09:32,471 INFO L290 TraceCheckUtils]: 25: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {54424#false} is VALID [2022-04-08 10:09:32,471 INFO L290 TraceCheckUtils]: 24: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:32,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:32,472 INFO L290 TraceCheckUtils]: 22: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:32,472 INFO L290 TraceCheckUtils]: 21: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:32,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:32,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:32,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:32,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {54428#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54497#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:32,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {54463#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54428#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:09:32,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {54467#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54463#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:09:32,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {54471#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54467#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:32,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {54475#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54471#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:09:32,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {54475#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} ~z~0 := ~y~0; {54475#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:32,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {54475#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {54475#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:32,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {54471#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54475#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:32,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {54467#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54471#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:09:32,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {54463#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54467#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:32,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {54428#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54463#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:09:32,480 INFO L290 TraceCheckUtils]: 6: Hoare triple {54423#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54428#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:09:32,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {54423#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {54423#true} is VALID [2022-04-08 10:09:32,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {54423#true} call #t~ret15 := main(); {54423#true} is VALID [2022-04-08 10:09:32,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54423#true} {54423#true} #83#return; {54423#true} is VALID [2022-04-08 10:09:32,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {54423#true} assume true; {54423#true} is VALID [2022-04-08 10:09:32,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {54423#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {54423#true} is VALID [2022-04-08 10:09:32,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {54423#true} call ULTIMATE.init(); {54423#true} is VALID [2022-04-08 10:09:32,480 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 10:09:32,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080011067] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:32,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:32,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 18 [2022-04-08 10:09:32,481 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:32,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [220076421] [2022-04-08 10:09:32,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [220076421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:32,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:32,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:09:32,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394763546] [2022-04-08 10:09:32,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:32,481 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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 36 [2022-04-08 10:09:32,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:32,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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-08 10:09:32,503 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-08 10:09:32,503 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:09:32,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:32,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:09:32,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:09:32,503 INFO L87 Difference]: Start difference. First operand 250 states and 318 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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-08 10:09:34,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:34,719 INFO L93 Difference]: Finished difference Result 312 states and 411 transitions. [2022-04-08 10:09:34,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 10:09:34,719 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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 36 [2022-04-08 10:09:34,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:34,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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-08 10:09:34,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-08 10:09:34,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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-08 10:09:34,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-08 10:09:34,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 74 transitions. [2022-04-08 10:09:34,794 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-08 10:09:34,798 INFO L225 Difference]: With dead ends: 312 [2022-04-08 10:09:34,798 INFO L226 Difference]: Without dead ends: 299 [2022-04-08 10:09:34,798 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:09:34,799 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 56 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:34,799 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 61 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:09:34,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-04-08 10:09:36,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 286. [2022-04-08 10:09:36,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:36,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 299 states. Second operand has 286 states, 281 states have (on average 1.2882562277580072) internal successors, (362), 281 states have internal predecessors, (362), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:36,106 INFO L74 IsIncluded]: Start isIncluded. First operand 299 states. Second operand has 286 states, 281 states have (on average 1.2882562277580072) internal successors, (362), 281 states have internal predecessors, (362), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:36,106 INFO L87 Difference]: Start difference. First operand 299 states. Second operand has 286 states, 281 states have (on average 1.2882562277580072) internal successors, (362), 281 states have internal predecessors, (362), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:36,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:36,109 INFO L93 Difference]: Finished difference Result 299 states and 388 transitions. [2022-04-08 10:09:36,110 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 388 transitions. [2022-04-08 10:09:36,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:36,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:36,110 INFO L74 IsIncluded]: Start isIncluded. First operand has 286 states, 281 states have (on average 1.2882562277580072) internal successors, (362), 281 states have internal predecessors, (362), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 299 states. [2022-04-08 10:09:36,110 INFO L87 Difference]: Start difference. First operand has 286 states, 281 states have (on average 1.2882562277580072) internal successors, (362), 281 states have internal predecessors, (362), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 299 states. [2022-04-08 10:09:36,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:36,114 INFO L93 Difference]: Finished difference Result 299 states and 388 transitions. [2022-04-08 10:09:36,114 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 388 transitions. [2022-04-08 10:09:36,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:36,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:36,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:36,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:36,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 281 states have (on average 1.2882562277580072) internal successors, (362), 281 states have internal predecessors, (362), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:36,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 366 transitions. [2022-04-08 10:09:36,120 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 366 transitions. Word has length 36 [2022-04-08 10:09:36,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:36,120 INFO L478 AbstractCegarLoop]: Abstraction has 286 states and 366 transitions. [2022-04-08 10:09:36,120 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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-08 10:09:36,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 286 states and 366 transitions. [2022-04-08 10:09:37,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 366 edges. 366 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:37,802 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 366 transitions. [2022-04-08 10:09:37,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 10:09:37,803 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:37,803 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:37,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-04-08 10:09:38,003 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-04-08 10:09:38,004 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:38,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:38,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1644820974, now seen corresponding path program 45 times [2022-04-08 10:09:38,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:38,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1723851100] [2022-04-08 10:09:38,006 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:38,006 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:38,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1644820974, now seen corresponding path program 46 times [2022-04-08 10:09:38,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:38,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671707244] [2022-04-08 10:09:38,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:38,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:38,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:38,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {56490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {56473#true} is VALID [2022-04-08 10:09:38,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {56473#true} assume true; {56473#true} is VALID [2022-04-08 10:09:38,216 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56473#true} {56473#true} #83#return; {56473#true} is VALID [2022-04-08 10:09:38,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {56473#true} call ULTIMATE.init(); {56490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:38,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {56490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {56473#true} is VALID [2022-04-08 10:09:38,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {56473#true} assume true; {56473#true} is VALID [2022-04-08 10:09:38,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56473#true} {56473#true} #83#return; {56473#true} is VALID [2022-04-08 10:09:38,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {56473#true} call #t~ret15 := main(); {56473#true} is VALID [2022-04-08 10:09:38,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {56473#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {56478#(= main_~y~0 0)} is VALID [2022-04-08 10:09:38,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {56478#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56479#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:38,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {56479#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56480#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:38,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {56480#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56481#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:38,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {56481#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56482#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:38,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {56482#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56483#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:38,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {56483#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56484#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:38,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {56484#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56485#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:38,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {56485#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {56485#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:38,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {56485#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {56486#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:09:38,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {56486#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {56487#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:09:38,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {56487#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {56488#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:09:38,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {56488#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {56489#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:09:38,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {56489#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {56474#false} is VALID [2022-04-08 10:09:38,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {56474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {56474#false} is VALID [2022-04-08 10:09:38,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {56474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {56474#false} is VALID [2022-04-08 10:09:38,225 INFO L290 TraceCheckUtils]: 21: Hoare triple {56474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {56474#false} is VALID [2022-04-08 10:09:38,225 INFO L290 TraceCheckUtils]: 22: Hoare triple {56474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {56474#false} is VALID [2022-04-08 10:09:38,225 INFO L290 TraceCheckUtils]: 23: Hoare triple {56474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {56474#false} is VALID [2022-04-08 10:09:38,225 INFO L290 TraceCheckUtils]: 24: Hoare triple {56474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {56474#false} is VALID [2022-04-08 10:09:38,225 INFO L290 TraceCheckUtils]: 25: Hoare triple {56474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {56474#false} is VALID [2022-04-08 10:09:38,225 INFO L290 TraceCheckUtils]: 26: Hoare triple {56474#false} assume !(~y~0 % 4294967296 > 0); {56474#false} is VALID [2022-04-08 10:09:38,225 INFO L290 TraceCheckUtils]: 27: Hoare triple {56474#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {56474#false} is VALID [2022-04-08 10:09:38,226 INFO L290 TraceCheckUtils]: 28: Hoare triple {56474#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {56474#false} is VALID [2022-04-08 10:09:38,226 INFO L290 TraceCheckUtils]: 29: Hoare triple {56474#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {56474#false} is VALID [2022-04-08 10:09:38,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {56474#false} assume !(~x~0 % 4294967296 > 0); {56474#false} is VALID [2022-04-08 10:09:38,226 INFO L290 TraceCheckUtils]: 31: Hoare triple {56474#false} assume !(~z~0 % 4294967296 > 0); {56474#false} is VALID [2022-04-08 10:09:38,226 INFO L272 TraceCheckUtils]: 32: Hoare triple {56474#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {56474#false} is VALID [2022-04-08 10:09:38,226 INFO L290 TraceCheckUtils]: 33: Hoare triple {56474#false} ~cond := #in~cond; {56474#false} is VALID [2022-04-08 10:09:38,226 INFO L290 TraceCheckUtils]: 34: Hoare triple {56474#false} assume 0 == ~cond; {56474#false} is VALID [2022-04-08 10:09:38,226 INFO L290 TraceCheckUtils]: 35: Hoare triple {56474#false} assume !false; {56474#false} is VALID [2022-04-08 10:09:38,226 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-08 10:09:38,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:38,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671707244] [2022-04-08 10:09:38,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671707244] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:38,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095744822] [2022-04-08 10:09:38,227 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:09:38,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:38,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:38,232 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:38,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-08 10:09:38,292 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:09:38,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:38,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 10:09:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:38,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:38,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {56473#true} call ULTIMATE.init(); {56473#true} is VALID [2022-04-08 10:09:38,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {56473#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {56473#true} is VALID [2022-04-08 10:09:38,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {56473#true} assume true; {56473#true} is VALID [2022-04-08 10:09:38,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56473#true} {56473#true} #83#return; {56473#true} is VALID [2022-04-08 10:09:38,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {56473#true} call #t~ret15 := main(); {56473#true} is VALID [2022-04-08 10:09:38,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {56473#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {56478#(= main_~y~0 0)} is VALID [2022-04-08 10:09:38,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {56478#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56479#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:38,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {56479#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56480#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:38,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {56480#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56481#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:38,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {56481#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56482#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:38,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {56482#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56483#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:38,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {56483#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56484#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:38,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {56484#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56485#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:38,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {56485#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {56485#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:38,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {56485#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {56486#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:09:38,610 INFO L290 TraceCheckUtils]: 15: Hoare triple {56486#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {56487#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:09:38,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {56487#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {56488#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:09:38,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {56488#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {56545#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:09:38,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {56545#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {56474#false} is VALID [2022-04-08 10:09:38,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {56474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {56474#false} is VALID [2022-04-08 10:09:38,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {56474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {56474#false} is VALID [2022-04-08 10:09:38,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {56474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {56474#false} is VALID [2022-04-08 10:09:38,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {56474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {56474#false} is VALID [2022-04-08 10:09:38,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {56474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {56474#false} is VALID [2022-04-08 10:09:38,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {56474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {56474#false} is VALID [2022-04-08 10:09:38,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {56474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {56474#false} is VALID [2022-04-08 10:09:38,612 INFO L290 TraceCheckUtils]: 26: Hoare triple {56474#false} assume !(~y~0 % 4294967296 > 0); {56474#false} is VALID [2022-04-08 10:09:38,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {56474#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {56474#false} is VALID [2022-04-08 10:09:38,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {56474#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {56474#false} is VALID [2022-04-08 10:09:38,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {56474#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {56474#false} is VALID [2022-04-08 10:09:38,612 INFO L290 TraceCheckUtils]: 30: Hoare triple {56474#false} assume !(~x~0 % 4294967296 > 0); {56474#false} is VALID [2022-04-08 10:09:38,612 INFO L290 TraceCheckUtils]: 31: Hoare triple {56474#false} assume !(~z~0 % 4294967296 > 0); {56474#false} is VALID [2022-04-08 10:09:38,612 INFO L272 TraceCheckUtils]: 32: Hoare triple {56474#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {56474#false} is VALID [2022-04-08 10:09:38,613 INFO L290 TraceCheckUtils]: 33: Hoare triple {56474#false} ~cond := #in~cond; {56474#false} is VALID [2022-04-08 10:09:38,613 INFO L290 TraceCheckUtils]: 34: Hoare triple {56474#false} assume 0 == ~cond; {56474#false} is VALID [2022-04-08 10:09:38,613 INFO L290 TraceCheckUtils]: 35: Hoare triple {56474#false} assume !false; {56474#false} is VALID [2022-04-08 10:09:38,613 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-08 10:09:38,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:38,942 INFO L290 TraceCheckUtils]: 35: Hoare triple {56474#false} assume !false; {56474#false} is VALID [2022-04-08 10:09:38,942 INFO L290 TraceCheckUtils]: 34: Hoare triple {56474#false} assume 0 == ~cond; {56474#false} is VALID [2022-04-08 10:09:38,942 INFO L290 TraceCheckUtils]: 33: Hoare triple {56474#false} ~cond := #in~cond; {56474#false} is VALID [2022-04-08 10:09:38,942 INFO L272 TraceCheckUtils]: 32: Hoare triple {56474#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {56474#false} is VALID [2022-04-08 10:09:38,942 INFO L290 TraceCheckUtils]: 31: Hoare triple {56474#false} assume !(~z~0 % 4294967296 > 0); {56474#false} is VALID [2022-04-08 10:09:38,942 INFO L290 TraceCheckUtils]: 30: Hoare triple {56474#false} assume !(~x~0 % 4294967296 > 0); {56474#false} is VALID [2022-04-08 10:09:38,942 INFO L290 TraceCheckUtils]: 29: Hoare triple {56474#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {56474#false} is VALID [2022-04-08 10:09:38,943 INFO L290 TraceCheckUtils]: 28: Hoare triple {56474#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {56474#false} is VALID [2022-04-08 10:09:38,943 INFO L290 TraceCheckUtils]: 27: Hoare triple {56474#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {56474#false} is VALID [2022-04-08 10:09:38,943 INFO L290 TraceCheckUtils]: 26: Hoare triple {56474#false} assume !(~y~0 % 4294967296 > 0); {56474#false} is VALID [2022-04-08 10:09:38,943 INFO L290 TraceCheckUtils]: 25: Hoare triple {56474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {56474#false} is VALID [2022-04-08 10:09:38,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {56474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {56474#false} is VALID [2022-04-08 10:09:38,943 INFO L290 TraceCheckUtils]: 23: Hoare triple {56474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {56474#false} is VALID [2022-04-08 10:09:38,943 INFO L290 TraceCheckUtils]: 22: Hoare triple {56474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {56474#false} is VALID [2022-04-08 10:09:38,943 INFO L290 TraceCheckUtils]: 21: Hoare triple {56474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {56474#false} is VALID [2022-04-08 10:09:38,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {56474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {56474#false} is VALID [2022-04-08 10:09:38,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {56474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {56474#false} is VALID [2022-04-08 10:09:38,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {56651#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {56474#false} is VALID [2022-04-08 10:09:38,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {56655#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {56651#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:09:38,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {56659#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {56655#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:38,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {56663#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {56659#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:38,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {56667#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {56663#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:09:38,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {56667#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {56667#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:09:38,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {56674#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56667#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:09:38,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {56678#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56674#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:38,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {56682#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56678#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:38,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {56686#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56682#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:38,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {56690#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56686#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:09:38,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {56694#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56690#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:09:38,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {56698#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56694#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:09:38,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {56473#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {56698#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:09:38,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {56473#true} call #t~ret15 := main(); {56473#true} is VALID [2022-04-08 10:09:38,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56473#true} {56473#true} #83#return; {56473#true} is VALID [2022-04-08 10:09:38,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {56473#true} assume true; {56473#true} is VALID [2022-04-08 10:09:38,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {56473#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {56473#true} is VALID [2022-04-08 10:09:38,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {56473#true} call ULTIMATE.init(); {56473#true} is VALID [2022-04-08 10:09:38,951 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-08 10:09:38,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095744822] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:38,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:38,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-08 10:09:38,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:38,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1723851100] [2022-04-08 10:09:38,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1723851100] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:38,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:38,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:09:38,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226196568] [2022-04-08 10:09:38,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:38,952 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 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 36 [2022-04-08 10:09:38,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:38,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 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-08 10:09:38,971 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-08 10:09:38,971 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:09:38,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:38,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:09:38,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:09:38,972 INFO L87 Difference]: Start difference. First operand 286 states and 366 transitions. Second operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 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-08 10:09:43,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:43,638 INFO L93 Difference]: Finished difference Result 422 states and 532 transitions. [2022-04-08 10:09:43,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 10:09:43,638 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 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 36 [2022-04-08 10:09:43,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:43,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 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-08 10:09:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 114 transitions. [2022-04-08 10:09:43,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 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-08 10:09:43,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 114 transitions. [2022-04-08 10:09:43,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 114 transitions. [2022-04-08 10:09:43,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:43,736 INFO L225 Difference]: With dead ends: 422 [2022-04-08 10:09:43,736 INFO L226 Difference]: Without dead ends: 404 [2022-04-08 10:09:43,736 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=421, Invalid=1649, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:09:43,737 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 65 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:43,737 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 100 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:09:43,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-04-08 10:09:45,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 286. [2022-04-08 10:09:45,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:45,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 404 states. Second operand has 286 states, 281 states have (on average 1.2846975088967971) internal successors, (361), 281 states have internal predecessors, (361), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:45,053 INFO L74 IsIncluded]: Start isIncluded. First operand 404 states. Second operand has 286 states, 281 states have (on average 1.2846975088967971) internal successors, (361), 281 states have internal predecessors, (361), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:45,054 INFO L87 Difference]: Start difference. First operand 404 states. Second operand has 286 states, 281 states have (on average 1.2846975088967971) internal successors, (361), 281 states have internal predecessors, (361), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:45,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:45,059 INFO L93 Difference]: Finished difference Result 404 states and 513 transitions. [2022-04-08 10:09:45,059 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 513 transitions. [2022-04-08 10:09:45,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:45,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:45,060 INFO L74 IsIncluded]: Start isIncluded. First operand has 286 states, 281 states have (on average 1.2846975088967971) internal successors, (361), 281 states have internal predecessors, (361), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 404 states. [2022-04-08 10:09:45,060 INFO L87 Difference]: Start difference. First operand has 286 states, 281 states have (on average 1.2846975088967971) internal successors, (361), 281 states have internal predecessors, (361), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 404 states. [2022-04-08 10:09:45,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:45,065 INFO L93 Difference]: Finished difference Result 404 states and 513 transitions. [2022-04-08 10:09:45,065 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 513 transitions. [2022-04-08 10:09:45,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:45,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:45,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:45,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:45,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 281 states have (on average 1.2846975088967971) internal successors, (361), 281 states have internal predecessors, (361), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:45,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 365 transitions. [2022-04-08 10:09:45,069 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 365 transitions. Word has length 36 [2022-04-08 10:09:45,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:45,069 INFO L478 AbstractCegarLoop]: Abstraction has 286 states and 365 transitions. [2022-04-08 10:09:45,069 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 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-08 10:09:45,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 286 states and 365 transitions. [2022-04-08 10:09:46,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 365 edges. 365 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:46,540 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 365 transitions. [2022-04-08 10:09:46,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 10:09:46,540 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:46,540 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:46,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-04-08 10:09:46,741 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-04-08 10:09:46,741 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:46,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:46,741 INFO L85 PathProgramCache]: Analyzing trace with hash -84969854, now seen corresponding path program 47 times [2022-04-08 10:09:46,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:46,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1343504416] [2022-04-08 10:09:46,743 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:46,743 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:46,743 INFO L85 PathProgramCache]: Analyzing trace with hash -84969854, now seen corresponding path program 48 times [2022-04-08 10:09:46,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:46,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415417897] [2022-04-08 10:09:46,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:46,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:46,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:46,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {58996#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58979#true} is VALID [2022-04-08 10:09:46,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {58979#true} assume true; {58979#true} is VALID [2022-04-08 10:09:46,927 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58979#true} {58979#true} #83#return; {58979#true} is VALID [2022-04-08 10:09:46,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {58979#true} call ULTIMATE.init(); {58996#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:46,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {58996#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58979#true} is VALID [2022-04-08 10:09:46,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {58979#true} assume true; {58979#true} is VALID [2022-04-08 10:09:46,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58979#true} {58979#true} #83#return; {58979#true} is VALID [2022-04-08 10:09:46,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {58979#true} call #t~ret15 := main(); {58979#true} is VALID [2022-04-08 10:09:46,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {58979#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58984#(= main_~y~0 0)} is VALID [2022-04-08 10:09:46,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {58984#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58985#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:46,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {58985#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58986#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:46,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {58986#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58987#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:46,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {58987#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58988#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:46,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {58988#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58989#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:46,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {58989#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58990#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:46,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {58990#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58991#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:46,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {58991#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:46,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {58992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {58992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:46,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {58992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {58993#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:09:46,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {58993#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58994#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:09:46,942 INFO L290 TraceCheckUtils]: 17: Hoare triple {58994#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58995#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:09:46,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {58995#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {58980#false} is VALID [2022-04-08 10:09:46,942 INFO L290 TraceCheckUtils]: 19: Hoare triple {58980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58980#false} is VALID [2022-04-08 10:09:46,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {58980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58980#false} is VALID [2022-04-08 10:09:46,942 INFO L290 TraceCheckUtils]: 21: Hoare triple {58980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58980#false} is VALID [2022-04-08 10:09:46,942 INFO L290 TraceCheckUtils]: 22: Hoare triple {58980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58980#false} is VALID [2022-04-08 10:09:46,943 INFO L290 TraceCheckUtils]: 23: Hoare triple {58980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58980#false} is VALID [2022-04-08 10:09:46,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {58980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58980#false} is VALID [2022-04-08 10:09:46,943 INFO L290 TraceCheckUtils]: 25: Hoare triple {58980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58980#false} is VALID [2022-04-08 10:09:46,943 INFO L290 TraceCheckUtils]: 26: Hoare triple {58980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58980#false} is VALID [2022-04-08 10:09:46,943 INFO L290 TraceCheckUtils]: 27: Hoare triple {58980#false} assume !(~y~0 % 4294967296 > 0); {58980#false} is VALID [2022-04-08 10:09:46,943 INFO L290 TraceCheckUtils]: 28: Hoare triple {58980#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {58980#false} is VALID [2022-04-08 10:09:46,943 INFO L290 TraceCheckUtils]: 29: Hoare triple {58980#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {58980#false} is VALID [2022-04-08 10:09:46,943 INFO L290 TraceCheckUtils]: 30: Hoare triple {58980#false} assume !(~x~0 % 4294967296 > 0); {58980#false} is VALID [2022-04-08 10:09:46,943 INFO L290 TraceCheckUtils]: 31: Hoare triple {58980#false} assume !(~z~0 % 4294967296 > 0); {58980#false} is VALID [2022-04-08 10:09:46,943 INFO L272 TraceCheckUtils]: 32: Hoare triple {58980#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {58980#false} is VALID [2022-04-08 10:09:46,943 INFO L290 TraceCheckUtils]: 33: Hoare triple {58980#false} ~cond := #in~cond; {58980#false} is VALID [2022-04-08 10:09:46,943 INFO L290 TraceCheckUtils]: 34: Hoare triple {58980#false} assume 0 == ~cond; {58980#false} is VALID [2022-04-08 10:09:46,943 INFO L290 TraceCheckUtils]: 35: Hoare triple {58980#false} assume !false; {58980#false} is VALID [2022-04-08 10:09:46,944 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 10:09:46,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:46,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415417897] [2022-04-08 10:09:46,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415417897] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:46,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294551175] [2022-04-08 10:09:46,944 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:09:46,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:46,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:46,945 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:46,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-08 10:09:47,034 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:09:47,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:47,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 10:09:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:47,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:47,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {58979#true} call ULTIMATE.init(); {58979#true} is VALID [2022-04-08 10:09:47,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {58979#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58979#true} is VALID [2022-04-08 10:09:47,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {58979#true} assume true; {58979#true} is VALID [2022-04-08 10:09:47,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58979#true} {58979#true} #83#return; {58979#true} is VALID [2022-04-08 10:09:47,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {58979#true} call #t~ret15 := main(); {58979#true} is VALID [2022-04-08 10:09:47,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {58979#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58984#(= main_~y~0 0)} is VALID [2022-04-08 10:09:47,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {58984#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58985#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:47,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {58985#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58986#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:47,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {58986#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58987#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:47,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {58987#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58988#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:47,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {58988#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58989#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:47,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {58989#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58990#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:47,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {58990#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58991#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:47,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {58991#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:47,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {58992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {58992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:47,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {58992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {58993#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:09:47,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {58993#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58994#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:09:47,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {58994#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59051#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:09:47,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {59051#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {58980#false} is VALID [2022-04-08 10:09:47,286 INFO L290 TraceCheckUtils]: 19: Hoare triple {58980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58980#false} is VALID [2022-04-08 10:09:47,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {58980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58980#false} is VALID [2022-04-08 10:09:47,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {58980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58980#false} is VALID [2022-04-08 10:09:47,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {58980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58980#false} is VALID [2022-04-08 10:09:47,286 INFO L290 TraceCheckUtils]: 23: Hoare triple {58980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58980#false} is VALID [2022-04-08 10:09:47,286 INFO L290 TraceCheckUtils]: 24: Hoare triple {58980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58980#false} is VALID [2022-04-08 10:09:47,287 INFO L290 TraceCheckUtils]: 25: Hoare triple {58980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58980#false} is VALID [2022-04-08 10:09:47,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {58980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58980#false} is VALID [2022-04-08 10:09:47,287 INFO L290 TraceCheckUtils]: 27: Hoare triple {58980#false} assume !(~y~0 % 4294967296 > 0); {58980#false} is VALID [2022-04-08 10:09:47,287 INFO L290 TraceCheckUtils]: 28: Hoare triple {58980#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {58980#false} is VALID [2022-04-08 10:09:47,287 INFO L290 TraceCheckUtils]: 29: Hoare triple {58980#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {58980#false} is VALID [2022-04-08 10:09:47,287 INFO L290 TraceCheckUtils]: 30: Hoare triple {58980#false} assume !(~x~0 % 4294967296 > 0); {58980#false} is VALID [2022-04-08 10:09:47,287 INFO L290 TraceCheckUtils]: 31: Hoare triple {58980#false} assume !(~z~0 % 4294967296 > 0); {58980#false} is VALID [2022-04-08 10:09:47,287 INFO L272 TraceCheckUtils]: 32: Hoare triple {58980#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {58980#false} is VALID [2022-04-08 10:09:47,287 INFO L290 TraceCheckUtils]: 33: Hoare triple {58980#false} ~cond := #in~cond; {58980#false} is VALID [2022-04-08 10:09:47,287 INFO L290 TraceCheckUtils]: 34: Hoare triple {58980#false} assume 0 == ~cond; {58980#false} is VALID [2022-04-08 10:09:47,287 INFO L290 TraceCheckUtils]: 35: Hoare triple {58980#false} assume !false; {58980#false} is VALID [2022-04-08 10:09:47,287 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 10:09:47,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:47,579 INFO L290 TraceCheckUtils]: 35: Hoare triple {58980#false} assume !false; {58980#false} is VALID [2022-04-08 10:09:47,579 INFO L290 TraceCheckUtils]: 34: Hoare triple {58980#false} assume 0 == ~cond; {58980#false} is VALID [2022-04-08 10:09:47,579 INFO L290 TraceCheckUtils]: 33: Hoare triple {58980#false} ~cond := #in~cond; {58980#false} is VALID [2022-04-08 10:09:47,579 INFO L272 TraceCheckUtils]: 32: Hoare triple {58980#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {58980#false} is VALID [2022-04-08 10:09:47,580 INFO L290 TraceCheckUtils]: 31: Hoare triple {58980#false} assume !(~z~0 % 4294967296 > 0); {58980#false} is VALID [2022-04-08 10:09:47,580 INFO L290 TraceCheckUtils]: 30: Hoare triple {58980#false} assume !(~x~0 % 4294967296 > 0); {58980#false} is VALID [2022-04-08 10:09:47,580 INFO L290 TraceCheckUtils]: 29: Hoare triple {58980#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {58980#false} is VALID [2022-04-08 10:09:47,580 INFO L290 TraceCheckUtils]: 28: Hoare triple {58980#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {58980#false} is VALID [2022-04-08 10:09:47,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {58980#false} assume !(~y~0 % 4294967296 > 0); {58980#false} is VALID [2022-04-08 10:09:47,580 INFO L290 TraceCheckUtils]: 26: Hoare triple {58980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58980#false} is VALID [2022-04-08 10:09:47,580 INFO L290 TraceCheckUtils]: 25: Hoare triple {58980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58980#false} is VALID [2022-04-08 10:09:47,580 INFO L290 TraceCheckUtils]: 24: Hoare triple {58980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58980#false} is VALID [2022-04-08 10:09:47,580 INFO L290 TraceCheckUtils]: 23: Hoare triple {58980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58980#false} is VALID [2022-04-08 10:09:47,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {58980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58980#false} is VALID [2022-04-08 10:09:47,580 INFO L290 TraceCheckUtils]: 21: Hoare triple {58980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58980#false} is VALID [2022-04-08 10:09:47,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {58980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58980#false} is VALID [2022-04-08 10:09:47,580 INFO L290 TraceCheckUtils]: 19: Hoare triple {58980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58980#false} is VALID [2022-04-08 10:09:47,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {59157#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {58980#false} is VALID [2022-04-08 10:09:47,581 INFO L290 TraceCheckUtils]: 17: Hoare triple {59161#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59157#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:09:47,582 INFO L290 TraceCheckUtils]: 16: Hoare triple {59165#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59161#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:47,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {59169#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {59165#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:47,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {59169#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {59169#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:47,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {59176#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59169#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:47,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {59180#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59176#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:47,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {59184#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59180#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:47,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {59188#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59184#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:09:47,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {59192#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59188#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:09:47,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {59196#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59192#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:09:47,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {59200#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59196#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:09:47,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {59204#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59200#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:47,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {58979#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59204#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:09:47,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {58979#true} call #t~ret15 := main(); {58979#true} is VALID [2022-04-08 10:09:47,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58979#true} {58979#true} #83#return; {58979#true} is VALID [2022-04-08 10:09:47,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {58979#true} assume true; {58979#true} is VALID [2022-04-08 10:09:47,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {58979#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58979#true} is VALID [2022-04-08 10:09:47,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {58979#true} call ULTIMATE.init(); {58979#true} is VALID [2022-04-08 10:09:47,588 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 10:09:47,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294551175] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:47,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:47,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-08 10:09:47,588 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:47,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1343504416] [2022-04-08 10:09:47,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1343504416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:47,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:47,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:09:47,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928137142] [2022-04-08 10:09:47,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:47,589 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 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 36 [2022-04-08 10:09:47,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:47,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 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-08 10:09:47,607 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-08 10:09:47,607 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:09:47,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:47,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:09:47,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:09:47,608 INFO L87 Difference]: Start difference. First operand 286 states and 365 transitions. Second operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 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-08 10:09:52,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:52,579 INFO L93 Difference]: Finished difference Result 451 states and 565 transitions. [2022-04-08 10:09:52,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 10:09:52,579 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 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 36 [2022-04-08 10:09:52,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:52,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 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-08 10:09:52,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 121 transitions. [2022-04-08 10:09:52,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 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-08 10:09:52,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 121 transitions. [2022-04-08 10:09:52,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 121 transitions. [2022-04-08 10:09:52,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:52,703 INFO L225 Difference]: With dead ends: 451 [2022-04-08 10:09:52,703 INFO L226 Difference]: Without dead ends: 433 [2022-04-08 10:09:52,704 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=374, Invalid=1432, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 10:09:52,704 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 79 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:52,704 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 102 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:09:52,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-04-08 10:09:54,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 286. [2022-04-08 10:09:54,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:54,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 433 states. Second operand has 286 states, 281 states have (on average 1.2811387900355873) internal successors, (360), 281 states have internal predecessors, (360), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:54,024 INFO L74 IsIncluded]: Start isIncluded. First operand 433 states. Second operand has 286 states, 281 states have (on average 1.2811387900355873) internal successors, (360), 281 states have internal predecessors, (360), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:54,024 INFO L87 Difference]: Start difference. First operand 433 states. Second operand has 286 states, 281 states have (on average 1.2811387900355873) internal successors, (360), 281 states have internal predecessors, (360), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:54,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:54,030 INFO L93 Difference]: Finished difference Result 433 states and 546 transitions. [2022-04-08 10:09:54,030 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 546 transitions. [2022-04-08 10:09:54,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:54,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:54,030 INFO L74 IsIncluded]: Start isIncluded. First operand has 286 states, 281 states have (on average 1.2811387900355873) internal successors, (360), 281 states have internal predecessors, (360), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 433 states. [2022-04-08 10:09:54,030 INFO L87 Difference]: Start difference. First operand has 286 states, 281 states have (on average 1.2811387900355873) internal successors, (360), 281 states have internal predecessors, (360), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 433 states. [2022-04-08 10:09:54,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:54,039 INFO L93 Difference]: Finished difference Result 433 states and 546 transitions. [2022-04-08 10:09:54,039 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 546 transitions. [2022-04-08 10:09:54,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:54,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:54,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:54,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:54,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 281 states have (on average 1.2811387900355873) internal successors, (360), 281 states have internal predecessors, (360), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 364 transitions. [2022-04-08 10:09:54,044 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 364 transitions. Word has length 36 [2022-04-08 10:09:54,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:54,045 INFO L478 AbstractCegarLoop]: Abstraction has 286 states and 364 transitions. [2022-04-08 10:09:54,045 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 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-08 10:09:54,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 286 states and 364 transitions. [2022-04-08 10:09:55,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 364 edges. 364 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:55,429 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 364 transitions. [2022-04-08 10:09:55,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 10:09:55,429 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:55,429 INFO L499 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:55,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-04-08 10:09:55,629 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:55,629 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:55,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:55,630 INFO L85 PathProgramCache]: Analyzing trace with hash 551067666, now seen corresponding path program 49 times [2022-04-08 10:09:55,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:55,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [408837010] [2022-04-08 10:09:55,633 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:55,633 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:55,633 INFO L85 PathProgramCache]: Analyzing trace with hash 551067666, now seen corresponding path program 50 times [2022-04-08 10:09:55,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:55,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555243892] [2022-04-08 10:09:55,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:55,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:56,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:56,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {61620#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {61595#true} is VALID [2022-04-08 10:09:56,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {61595#true} assume true; {61595#true} is VALID [2022-04-08 10:09:56,033 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61595#true} {61595#true} #83#return; {61595#true} is VALID [2022-04-08 10:09:56,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {61595#true} call ULTIMATE.init(); {61620#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:56,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {61620#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {61595#true} is VALID [2022-04-08 10:09:56,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {61595#true} assume true; {61595#true} is VALID [2022-04-08 10:09:56,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61595#true} {61595#true} #83#return; {61595#true} is VALID [2022-04-08 10:09:56,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {61595#true} call #t~ret15 := main(); {61595#true} is VALID [2022-04-08 10:09:56,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {61595#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61600#(= main_~y~0 0)} is VALID [2022-04-08 10:09:56,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {61600#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61601#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:56,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {61601#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61602#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:56,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {61602#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61603#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:56,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {61603#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61604#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:56,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {61604#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61605#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:56,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {61605#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61606#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:56,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {61606#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61607#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:56,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {61607#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61608#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:56,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {61608#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61609#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:56,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {61609#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61610#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:56,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {61610#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61611#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:56,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {61611#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61612#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:56,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {61612#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61613#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:56,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {61613#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61614#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:56,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {61614#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61615#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:09:56,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {61615#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61616#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:09:56,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {61616#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61617#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:09:56,045 INFO L290 TraceCheckUtils]: 23: Hoare triple {61617#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {61617#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:09:56,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {61617#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {61618#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-08 10:09:56,046 INFO L290 TraceCheckUtils]: 25: Hoare triple {61618#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61619#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:09:56,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {61619#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {61596#false} is VALID [2022-04-08 10:09:56,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {61596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61596#false} is VALID [2022-04-08 10:09:56,047 INFO L290 TraceCheckUtils]: 28: Hoare triple {61596#false} assume !(~y~0 % 4294967296 > 0); {61596#false} is VALID [2022-04-08 10:09:56,047 INFO L290 TraceCheckUtils]: 29: Hoare triple {61596#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61596#false} is VALID [2022-04-08 10:09:56,047 INFO L290 TraceCheckUtils]: 30: Hoare triple {61596#false} assume !(~x~0 % 4294967296 > 0); {61596#false} is VALID [2022-04-08 10:09:56,047 INFO L290 TraceCheckUtils]: 31: Hoare triple {61596#false} assume !(~z~0 % 4294967296 > 0); {61596#false} is VALID [2022-04-08 10:09:56,047 INFO L272 TraceCheckUtils]: 32: Hoare triple {61596#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {61596#false} is VALID [2022-04-08 10:09:56,047 INFO L290 TraceCheckUtils]: 33: Hoare triple {61596#false} ~cond := #in~cond; {61596#false} is VALID [2022-04-08 10:09:56,047 INFO L290 TraceCheckUtils]: 34: Hoare triple {61596#false} assume 0 == ~cond; {61596#false} is VALID [2022-04-08 10:09:56,047 INFO L290 TraceCheckUtils]: 35: Hoare triple {61596#false} assume !false; {61596#false} is VALID [2022-04-08 10:09:56,047 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:09:56,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:56,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555243892] [2022-04-08 10:09:56,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555243892] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:56,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538565690] [2022-04-08 10:09:56,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:09:56,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:56,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:56,052 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:56,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-08 10:09:56,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:09:56,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:56,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 10:09:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:56,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:56,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {61595#true} call ULTIMATE.init(); {61595#true} is VALID [2022-04-08 10:09:56,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {61595#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {61595#true} is VALID [2022-04-08 10:09:56,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {61595#true} assume true; {61595#true} is VALID [2022-04-08 10:09:56,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61595#true} {61595#true} #83#return; {61595#true} is VALID [2022-04-08 10:09:56,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {61595#true} call #t~ret15 := main(); {61595#true} is VALID [2022-04-08 10:09:56,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {61595#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61600#(= main_~y~0 0)} is VALID [2022-04-08 10:09:56,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {61600#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61601#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:56,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {61601#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61602#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:56,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {61602#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61603#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:56,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {61603#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61604#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:56,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {61604#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61605#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:56,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {61605#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61606#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:56,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {61606#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61607#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:56,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {61607#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61608#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:56,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {61608#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61609#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:56,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {61609#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61610#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:56,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {61610#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61611#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:56,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {61611#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61612#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:56,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {61612#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61613#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:56,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {61613#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61614#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:56,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {61614#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61615#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:09:56,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {61615#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61616#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:09:56,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {61616#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61617#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:09:56,443 INFO L290 TraceCheckUtils]: 23: Hoare triple {61617#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {61617#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:09:56,443 INFO L290 TraceCheckUtils]: 24: Hoare triple {61617#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {61618#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-08 10:09:56,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {61618#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61699#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:09:56,444 INFO L290 TraceCheckUtils]: 26: Hoare triple {61699#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~z~0 % 4294967296 > 0); {61596#false} is VALID [2022-04-08 10:09:56,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {61596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61596#false} is VALID [2022-04-08 10:09:56,444 INFO L290 TraceCheckUtils]: 28: Hoare triple {61596#false} assume !(~y~0 % 4294967296 > 0); {61596#false} is VALID [2022-04-08 10:09:56,444 INFO L290 TraceCheckUtils]: 29: Hoare triple {61596#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61596#false} is VALID [2022-04-08 10:09:56,445 INFO L290 TraceCheckUtils]: 30: Hoare triple {61596#false} assume !(~x~0 % 4294967296 > 0); {61596#false} is VALID [2022-04-08 10:09:56,445 INFO L290 TraceCheckUtils]: 31: Hoare triple {61596#false} assume !(~z~0 % 4294967296 > 0); {61596#false} is VALID [2022-04-08 10:09:56,445 INFO L272 TraceCheckUtils]: 32: Hoare triple {61596#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {61596#false} is VALID [2022-04-08 10:09:56,445 INFO L290 TraceCheckUtils]: 33: Hoare triple {61596#false} ~cond := #in~cond; {61596#false} is VALID [2022-04-08 10:09:56,445 INFO L290 TraceCheckUtils]: 34: Hoare triple {61596#false} assume 0 == ~cond; {61596#false} is VALID [2022-04-08 10:09:56,445 INFO L290 TraceCheckUtils]: 35: Hoare triple {61596#false} assume !false; {61596#false} is VALID [2022-04-08 10:09:56,445 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:09:56,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:57,103 INFO L290 TraceCheckUtils]: 35: Hoare triple {61596#false} assume !false; {61596#false} is VALID [2022-04-08 10:09:57,103 INFO L290 TraceCheckUtils]: 34: Hoare triple {61596#false} assume 0 == ~cond; {61596#false} is VALID [2022-04-08 10:09:57,103 INFO L290 TraceCheckUtils]: 33: Hoare triple {61596#false} ~cond := #in~cond; {61596#false} is VALID [2022-04-08 10:09:57,103 INFO L272 TraceCheckUtils]: 32: Hoare triple {61596#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {61596#false} is VALID [2022-04-08 10:09:57,103 INFO L290 TraceCheckUtils]: 31: Hoare triple {61596#false} assume !(~z~0 % 4294967296 > 0); {61596#false} is VALID [2022-04-08 10:09:57,103 INFO L290 TraceCheckUtils]: 30: Hoare triple {61596#false} assume !(~x~0 % 4294967296 > 0); {61596#false} is VALID [2022-04-08 10:09:57,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {61596#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61596#false} is VALID [2022-04-08 10:09:57,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {61596#false} assume !(~y~0 % 4294967296 > 0); {61596#false} is VALID [2022-04-08 10:09:57,104 INFO L290 TraceCheckUtils]: 27: Hoare triple {61596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61596#false} is VALID [2022-04-08 10:09:57,104 INFO L290 TraceCheckUtils]: 26: Hoare triple {61757#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {61596#false} is VALID [2022-04-08 10:09:57,106 INFO L290 TraceCheckUtils]: 25: Hoare triple {61761#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61757#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:09:57,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {61765#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {61761#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:57,107 INFO L290 TraceCheckUtils]: 23: Hoare triple {61765#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {61765#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:57,108 INFO L290 TraceCheckUtils]: 22: Hoare triple {61772#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61765#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:57,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {61776#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61772#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:57,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {61780#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61776#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:09:57,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {61784#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61780#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:09:57,110 INFO L290 TraceCheckUtils]: 18: Hoare triple {61788#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61784#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:09:57,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {61792#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61788#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:09:57,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {61796#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61792#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:57,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {61800#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61796#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:09:57,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {61804#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61800#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:57,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {61808#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61804#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:09:57,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {61812#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61808#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:09:57,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {61816#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61812#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:09:57,115 INFO L290 TraceCheckUtils]: 10: Hoare triple {61820#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61816#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:09:57,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {61824#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61820#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:09:57,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {61828#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61824#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:09:57,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {61832#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61828#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:09:57,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {61836#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61832#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:09:57,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {61595#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61836#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:09:57,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {61595#true} call #t~ret15 := main(); {61595#true} is VALID [2022-04-08 10:09:57,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61595#true} {61595#true} #83#return; {61595#true} is VALID [2022-04-08 10:09:57,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {61595#true} assume true; {61595#true} is VALID [2022-04-08 10:09:57,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {61595#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {61595#true} is VALID [2022-04-08 10:09:57,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {61595#true} call ULTIMATE.init(); {61595#true} is VALID [2022-04-08 10:09:57,119 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:09:57,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538565690] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:57,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:57,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-08 10:09:57,119 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:57,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [408837010] [2022-04-08 10:09:57,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [408837010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:57,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:57,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:09:57,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930294074] [2022-04-08 10:09:57,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:57,119 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 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-08 10:09:57,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:57,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 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-08 10:09:57,141 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-08 10:09:57,142 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:09:57,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:57,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:09:57,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=1477, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:09:57,142 INFO L87 Difference]: Start difference. First operand 286 states and 364 transitions. Second operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 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-08 10:10:08,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:08,208 INFO L93 Difference]: Finished difference Result 641 states and 899 transitions. [2022-04-08 10:10:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 10:10:08,208 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 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-08 10:10:08,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:08,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 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-08 10:10:08,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 234 transitions. [2022-04-08 10:10:08,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 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-08 10:10:08,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 234 transitions. [2022-04-08 10:10:08,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 234 transitions. [2022-04-08 10:10:08,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:08,414 INFO L225 Difference]: With dead ends: 641 [2022-04-08 10:10:08,414 INFO L226 Difference]: Without dead ends: 616 [2022-04-08 10:10:08,415 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=889, Invalid=3271, Unknown=0, NotChecked=0, Total=4160 [2022-04-08 10:10:08,415 INFO L913 BasicCegarLoop]: 103 mSDtfsCounter, 173 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3463 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 3592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 3463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:08,415 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 200 Invalid, 3592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 3463 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-08 10:10:08,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2022-04-08 10:10:09,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 300. [2022-04-08 10:10:09,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:09,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 616 states. Second operand has 300 states, 295 states have (on average 1.2881355932203389) internal successors, (380), 295 states have internal predecessors, (380), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:09,789 INFO L74 IsIncluded]: Start isIncluded. First operand 616 states. Second operand has 300 states, 295 states have (on average 1.2881355932203389) internal successors, (380), 295 states have internal predecessors, (380), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:09,789 INFO L87 Difference]: Start difference. First operand 616 states. Second operand has 300 states, 295 states have (on average 1.2881355932203389) internal successors, (380), 295 states have internal predecessors, (380), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:09,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:09,799 INFO L93 Difference]: Finished difference Result 616 states and 780 transitions. [2022-04-08 10:10:09,799 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 780 transitions. [2022-04-08 10:10:09,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:09,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:09,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 300 states, 295 states have (on average 1.2881355932203389) internal successors, (380), 295 states have internal predecessors, (380), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 616 states. [2022-04-08 10:10:09,800 INFO L87 Difference]: Start difference. First operand has 300 states, 295 states have (on average 1.2881355932203389) internal successors, (380), 295 states have internal predecessors, (380), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 616 states. [2022-04-08 10:10:09,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:09,811 INFO L93 Difference]: Finished difference Result 616 states and 780 transitions. [2022-04-08 10:10:09,811 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 780 transitions. [2022-04-08 10:10:09,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:09,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:09,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:09,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:09,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.2881355932203389) internal successors, (380), 295 states have internal predecessors, (380), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:09,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 384 transitions. [2022-04-08 10:10:09,816 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 384 transitions. Word has length 36 [2022-04-08 10:10:09,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:09,816 INFO L478 AbstractCegarLoop]: Abstraction has 300 states and 384 transitions. [2022-04-08 10:10:09,816 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 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-08 10:10:09,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 300 states and 384 transitions. [2022-04-08 10:10:11,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 384 edges. 384 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:11,461 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 384 transitions. [2022-04-08 10:10:11,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 10:10:11,461 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:11,461 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:11,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-04-08 10:10:11,661 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:11,662 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:11,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:11,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1464011024, now seen corresponding path program 15 times [2022-04-08 10:10:11,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:11,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2141619031] [2022-04-08 10:10:11,665 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:11,665 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:11,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1464011024, now seen corresponding path program 16 times [2022-04-08 10:10:11,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:11,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738644579] [2022-04-08 10:10:11,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:11,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:11,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:11,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {65023#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {65013#true} is VALID [2022-04-08 10:10:11,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {65013#true} assume true; {65013#true} is VALID [2022-04-08 10:10:11,783 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65013#true} {65013#true} #83#return; {65013#true} is VALID [2022-04-08 10:10:11,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {65013#true} call ULTIMATE.init(); {65023#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:11,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {65023#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {65013#true} is VALID [2022-04-08 10:10:11,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {65013#true} assume true; {65013#true} is VALID [2022-04-08 10:10:11,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65013#true} {65013#true} #83#return; {65013#true} is VALID [2022-04-08 10:10:11,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {65013#true} call #t~ret15 := main(); {65013#true} is VALID [2022-04-08 10:10:11,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {65013#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {65013#true} is VALID [2022-04-08 10:10:11,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {65013#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65013#true} is VALID [2022-04-08 10:10:11,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {65013#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65013#true} is VALID [2022-04-08 10:10:11,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {65013#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65013#true} is VALID [2022-04-08 10:10:11,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {65013#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65013#true} is VALID [2022-04-08 10:10:11,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {65013#true} assume !(~x~0 % 4294967296 > 0); {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:10:11,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:10:11,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65019#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:10:11,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {65019#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65020#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:11,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {65020#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65021#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:11,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {65021#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:11,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:11,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:11,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:11,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:11,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:11,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:11,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65021#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:11,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {65021#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65020#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:11,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {65020#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65019#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:10:11,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {65019#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:10:11,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65014#false} is VALID [2022-04-08 10:10:11,799 INFO L290 TraceCheckUtils]: 27: Hoare triple {65014#false} assume !(~x~0 % 4294967296 > 0); {65014#false} is VALID [2022-04-08 10:10:11,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {65014#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {65014#false} is VALID [2022-04-08 10:10:11,799 INFO L290 TraceCheckUtils]: 29: Hoare triple {65014#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {65014#false} is VALID [2022-04-08 10:10:11,799 INFO L290 TraceCheckUtils]: 30: Hoare triple {65014#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {65014#false} is VALID [2022-04-08 10:10:11,799 INFO L290 TraceCheckUtils]: 31: Hoare triple {65014#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {65014#false} is VALID [2022-04-08 10:10:11,799 INFO L290 TraceCheckUtils]: 32: Hoare triple {65014#false} assume !(~z~0 % 4294967296 > 0); {65014#false} is VALID [2022-04-08 10:10:11,800 INFO L272 TraceCheckUtils]: 33: Hoare triple {65014#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {65014#false} is VALID [2022-04-08 10:10:11,800 INFO L290 TraceCheckUtils]: 34: Hoare triple {65014#false} ~cond := #in~cond; {65014#false} is VALID [2022-04-08 10:10:11,800 INFO L290 TraceCheckUtils]: 35: Hoare triple {65014#false} assume 0 == ~cond; {65014#false} is VALID [2022-04-08 10:10:11,800 INFO L290 TraceCheckUtils]: 36: Hoare triple {65014#false} assume !false; {65014#false} is VALID [2022-04-08 10:10:11,800 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 10:10:11,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:11,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738644579] [2022-04-08 10:10:11,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738644579] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:11,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576039250] [2022-04-08 10:10:11,801 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:10:11,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:11,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:11,802 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:10:11,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-04-08 10:10:11,860 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:10:11,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:11,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 10:10:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:11,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:12,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {65013#true} call ULTIMATE.init(); {65013#true} is VALID [2022-04-08 10:10:12,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {65013#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {65013#true} is VALID [2022-04-08 10:10:12,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {65013#true} assume true; {65013#true} is VALID [2022-04-08 10:10:12,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65013#true} {65013#true} #83#return; {65013#true} is VALID [2022-04-08 10:10:12,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {65013#true} call #t~ret15 := main(); {65013#true} is VALID [2022-04-08 10:10:12,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {65013#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {65013#true} is VALID [2022-04-08 10:10:12,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {65013#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65013#true} is VALID [2022-04-08 10:10:12,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {65013#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65013#true} is VALID [2022-04-08 10:10:12,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {65013#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65013#true} is VALID [2022-04-08 10:10:12,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {65013#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65013#true} is VALID [2022-04-08 10:10:12,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {65013#true} assume !(~x~0 % 4294967296 > 0); {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:10:12,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:10:12,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65019#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:10:12,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {65019#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65020#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:12,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {65020#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65021#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:12,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {65021#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:12,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:12,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:12,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:12,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:12,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:12,095 INFO L290 TraceCheckUtils]: 21: Hoare triple {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:12,096 INFO L290 TraceCheckUtils]: 22: Hoare triple {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65021#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:12,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {65021#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65020#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:12,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {65020#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65019#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:10:12,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {65019#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:10:12,098 INFO L290 TraceCheckUtils]: 26: Hoare triple {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65014#false} is VALID [2022-04-08 10:10:12,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {65014#false} assume !(~x~0 % 4294967296 > 0); {65014#false} is VALID [2022-04-08 10:10:12,099 INFO L290 TraceCheckUtils]: 28: Hoare triple {65014#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {65014#false} is VALID [2022-04-08 10:10:12,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {65014#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {65014#false} is VALID [2022-04-08 10:10:12,099 INFO L290 TraceCheckUtils]: 30: Hoare triple {65014#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {65014#false} is VALID [2022-04-08 10:10:12,099 INFO L290 TraceCheckUtils]: 31: Hoare triple {65014#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {65014#false} is VALID [2022-04-08 10:10:12,099 INFO L290 TraceCheckUtils]: 32: Hoare triple {65014#false} assume !(~z~0 % 4294967296 > 0); {65014#false} is VALID [2022-04-08 10:10:12,099 INFO L272 TraceCheckUtils]: 33: Hoare triple {65014#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {65014#false} is VALID [2022-04-08 10:10:12,099 INFO L290 TraceCheckUtils]: 34: Hoare triple {65014#false} ~cond := #in~cond; {65014#false} is VALID [2022-04-08 10:10:12,099 INFO L290 TraceCheckUtils]: 35: Hoare triple {65014#false} assume 0 == ~cond; {65014#false} is VALID [2022-04-08 10:10:12,099 INFO L290 TraceCheckUtils]: 36: Hoare triple {65014#false} assume !false; {65014#false} is VALID [2022-04-08 10:10:12,099 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 10:10:12,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:12,211 INFO L290 TraceCheckUtils]: 36: Hoare triple {65014#false} assume !false; {65014#false} is VALID [2022-04-08 10:10:12,211 INFO L290 TraceCheckUtils]: 35: Hoare triple {65014#false} assume 0 == ~cond; {65014#false} is VALID [2022-04-08 10:10:12,211 INFO L290 TraceCheckUtils]: 34: Hoare triple {65014#false} ~cond := #in~cond; {65014#false} is VALID [2022-04-08 10:10:12,211 INFO L272 TraceCheckUtils]: 33: Hoare triple {65014#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {65014#false} is VALID [2022-04-08 10:10:12,211 INFO L290 TraceCheckUtils]: 32: Hoare triple {65014#false} assume !(~z~0 % 4294967296 > 0); {65014#false} is VALID [2022-04-08 10:10:12,220 INFO L290 TraceCheckUtils]: 31: Hoare triple {65014#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {65014#false} is VALID [2022-04-08 10:10:12,221 INFO L290 TraceCheckUtils]: 30: Hoare triple {65014#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {65014#false} is VALID [2022-04-08 10:10:12,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {65014#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {65014#false} is VALID [2022-04-08 10:10:12,221 INFO L290 TraceCheckUtils]: 28: Hoare triple {65014#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {65014#false} is VALID [2022-04-08 10:10:12,221 INFO L290 TraceCheckUtils]: 27: Hoare triple {65014#false} assume !(~x~0 % 4294967296 > 0); {65014#false} is VALID [2022-04-08 10:10:12,224 INFO L290 TraceCheckUtils]: 26: Hoare triple {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65014#false} is VALID [2022-04-08 10:10:12,225 INFO L290 TraceCheckUtils]: 25: Hoare triple {65019#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:10:12,226 INFO L290 TraceCheckUtils]: 24: Hoare triple {65020#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65019#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:10:12,226 INFO L290 TraceCheckUtils]: 23: Hoare triple {65021#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65020#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:12,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {65021#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:12,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:12,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:12,228 INFO L290 TraceCheckUtils]: 19: Hoare triple {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:12,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:12,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:12,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:12,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {65021#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65022#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:12,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {65020#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65021#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:12,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {65019#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65020#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:12,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65019#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:10:12,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:10:12,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {65013#true} assume !(~x~0 % 4294967296 > 0); {65018#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:10:12,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {65013#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65013#true} is VALID [2022-04-08 10:10:12,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {65013#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65013#true} is VALID [2022-04-08 10:10:12,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {65013#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65013#true} is VALID [2022-04-08 10:10:12,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {65013#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65013#true} is VALID [2022-04-08 10:10:12,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {65013#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {65013#true} is VALID [2022-04-08 10:10:12,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {65013#true} call #t~ret15 := main(); {65013#true} is VALID [2022-04-08 10:10:12,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65013#true} {65013#true} #83#return; {65013#true} is VALID [2022-04-08 10:10:12,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {65013#true} assume true; {65013#true} is VALID [2022-04-08 10:10:12,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {65013#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {65013#true} is VALID [2022-04-08 10:10:12,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {65013#true} call ULTIMATE.init(); {65013#true} is VALID [2022-04-08 10:10:12,233 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 10:10:12,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576039250] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:12,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:12,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2022-04-08 10:10:12,234 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:12,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2141619031] [2022-04-08 10:10:12,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2141619031] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:12,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:12,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:10:12,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380663312] [2022-04-08 10:10:12,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:12,234 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 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 37 [2022-04-08 10:10:12,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:12,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 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-08 10:10:12,256 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-08 10:10:12,256 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:10:12,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:12,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:10:12,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-08 10:10:12,256 INFO L87 Difference]: Start difference. First operand 300 states and 384 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 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-08 10:10:14,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:14,064 INFO L93 Difference]: Finished difference Result 317 states and 403 transitions. [2022-04-08 10:10:14,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 10:10:14,065 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 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 37 [2022-04-08 10:10:14,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:14,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 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-08 10:10:14,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-08 10:10:14,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 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-08 10:10:14,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-08 10:10:14,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 52 transitions. [2022-04-08 10:10:14,108 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-08 10:10:14,112 INFO L225 Difference]: With dead ends: 317 [2022-04-08 10:10:14,112 INFO L226 Difference]: Without dead ends: 288 [2022-04-08 10:10:14,112 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-08 10:10:14,113 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 29 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:14,113 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 55 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:10:14,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-04-08 10:10:15,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 284. [2022-04-08 10:10:15,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:15,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 288 states. Second operand has 284 states, 279 states have (on average 1.2974910394265233) internal successors, (362), 279 states have internal predecessors, (362), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:15,445 INFO L74 IsIncluded]: Start isIncluded. First operand 288 states. Second operand has 284 states, 279 states have (on average 1.2974910394265233) internal successors, (362), 279 states have internal predecessors, (362), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:15,445 INFO L87 Difference]: Start difference. First operand 288 states. Second operand has 284 states, 279 states have (on average 1.2974910394265233) internal successors, (362), 279 states have internal predecessors, (362), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:15,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:15,448 INFO L93 Difference]: Finished difference Result 288 states and 370 transitions. [2022-04-08 10:10:15,448 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 370 transitions. [2022-04-08 10:10:15,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:15,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:15,449 INFO L74 IsIncluded]: Start isIncluded. First operand has 284 states, 279 states have (on average 1.2974910394265233) internal successors, (362), 279 states have internal predecessors, (362), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 288 states. [2022-04-08 10:10:15,449 INFO L87 Difference]: Start difference. First operand has 284 states, 279 states have (on average 1.2974910394265233) internal successors, (362), 279 states have internal predecessors, (362), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 288 states. [2022-04-08 10:10:15,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:15,452 INFO L93 Difference]: Finished difference Result 288 states and 370 transitions. [2022-04-08 10:10:15,452 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 370 transitions. [2022-04-08 10:10:15,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:15,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:15,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:15,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:15,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 279 states have (on average 1.2974910394265233) internal successors, (362), 279 states have internal predecessors, (362), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:15,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 366 transitions. [2022-04-08 10:10:15,456 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 366 transitions. Word has length 37 [2022-04-08 10:10:15,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:15,456 INFO L478 AbstractCegarLoop]: Abstraction has 284 states and 366 transitions. [2022-04-08 10:10:15,456 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 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-08 10:10:15,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 284 states and 366 transitions. [2022-04-08 10:10:17,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 366 edges. 366 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:17,195 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 366 transitions. [2022-04-08 10:10:17,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 10:10:17,196 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:17,196 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:17,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-04-08 10:10:17,396 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:17,396 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:17,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:17,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1702220111, now seen corresponding path program 25 times [2022-04-08 10:10:17,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:17,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [90876094] [2022-04-08 10:10:17,399 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:17,399 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:17,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1702220111, now seen corresponding path program 26 times [2022-04-08 10:10:17,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:17,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685436343] [2022-04-08 10:10:17,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:17,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:17,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:17,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {67053#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {67033#true} is VALID [2022-04-08 10:10:17,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {67033#true} assume true; {67033#true} is VALID [2022-04-08 10:10:17,632 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67033#true} {67033#true} #83#return; {67033#true} is VALID [2022-04-08 10:10:17,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {67033#true} call ULTIMATE.init(); {67053#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:17,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {67053#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {67033#true} is VALID [2022-04-08 10:10:17,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {67033#true} assume true; {67033#true} is VALID [2022-04-08 10:10:17,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67033#true} {67033#true} #83#return; {67033#true} is VALID [2022-04-08 10:10:17,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {67033#true} call #t~ret15 := main(); {67033#true} is VALID [2022-04-08 10:10:17,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {67033#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67038#(= main_~y~0 0)} is VALID [2022-04-08 10:10:17,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {67038#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67039#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:17,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {67039#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67040#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:17,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {67040#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67041#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:17,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {67041#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67042#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:17,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {67042#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67043#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:17,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {67043#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67044#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:17,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {67044#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67045#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:17,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {67045#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {67045#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:17,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {67045#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {67046#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:10:17,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {67046#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67047#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:10:17,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {67047#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67048#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:10:17,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {67048#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67049#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:10:17,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {67049#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67050#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:10:17,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {67050#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67051#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:10:17,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {67051#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67052#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:10:17,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {67052#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {67034#false} is VALID [2022-04-08 10:10:17,641 INFO L290 TraceCheckUtils]: 22: Hoare triple {67034#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67034#false} is VALID [2022-04-08 10:10:17,641 INFO L290 TraceCheckUtils]: 23: Hoare triple {67034#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67034#false} is VALID [2022-04-08 10:10:17,641 INFO L290 TraceCheckUtils]: 24: Hoare triple {67034#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67034#false} is VALID [2022-04-08 10:10:17,641 INFO L290 TraceCheckUtils]: 25: Hoare triple {67034#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67034#false} is VALID [2022-04-08 10:10:17,641 INFO L290 TraceCheckUtils]: 26: Hoare triple {67034#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67034#false} is VALID [2022-04-08 10:10:17,641 INFO L290 TraceCheckUtils]: 27: Hoare triple {67034#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67034#false} is VALID [2022-04-08 10:10:17,641 INFO L290 TraceCheckUtils]: 28: Hoare triple {67034#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67034#false} is VALID [2022-04-08 10:10:17,641 INFO L290 TraceCheckUtils]: 29: Hoare triple {67034#false} assume !(~y~0 % 4294967296 > 0); {67034#false} is VALID [2022-04-08 10:10:17,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {67034#false} assume !(~x~0 % 4294967296 > 0); {67034#false} is VALID [2022-04-08 10:10:17,641 INFO L290 TraceCheckUtils]: 31: Hoare triple {67034#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {67034#false} is VALID [2022-04-08 10:10:17,641 INFO L290 TraceCheckUtils]: 32: Hoare triple {67034#false} assume !(~z~0 % 4294967296 > 0); {67034#false} is VALID [2022-04-08 10:10:17,641 INFO L272 TraceCheckUtils]: 33: Hoare triple {67034#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {67034#false} is VALID [2022-04-08 10:10:17,641 INFO L290 TraceCheckUtils]: 34: Hoare triple {67034#false} ~cond := #in~cond; {67034#false} is VALID [2022-04-08 10:10:17,641 INFO L290 TraceCheckUtils]: 35: Hoare triple {67034#false} assume 0 == ~cond; {67034#false} is VALID [2022-04-08 10:10:17,641 INFO L290 TraceCheckUtils]: 36: Hoare triple {67034#false} assume !false; {67034#false} is VALID [2022-04-08 10:10:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-08 10:10:17,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:17,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685436343] [2022-04-08 10:10:17,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685436343] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:17,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605008269] [2022-04-08 10:10:17,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:10:17,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:17,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:17,643 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:10:17,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-04-08 10:10:17,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:10:17,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:17,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 10:10:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:17,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:17,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {67033#true} call ULTIMATE.init(); {67033#true} is VALID [2022-04-08 10:10:17,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {67033#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {67033#true} is VALID [2022-04-08 10:10:17,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {67033#true} assume true; {67033#true} is VALID [2022-04-08 10:10:17,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67033#true} {67033#true} #83#return; {67033#true} is VALID [2022-04-08 10:10:17,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {67033#true} call #t~ret15 := main(); {67033#true} is VALID [2022-04-08 10:10:17,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {67033#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67033#true} is VALID [2022-04-08 10:10:17,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {67033#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67033#true} is VALID [2022-04-08 10:10:17,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {67033#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67078#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:10:17,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {67078#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67082#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:10:17,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {67082#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67086#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:10:17,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {67086#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67090#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:10:17,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {67090#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67094#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:10:17,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {67094#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67098#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:10:17,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {67098#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {67098#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:10:17,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {67098#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {67098#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:10:17,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {67098#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67094#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:10:17,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {67094#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67090#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:10:17,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {67090#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67086#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:10:17,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {67086#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67082#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:10:17,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {67082#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67078#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:10:17,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {67078#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:17,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {67123#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:17,934 INFO L290 TraceCheckUtils]: 22: Hoare triple {67123#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:17,935 INFO L290 TraceCheckUtils]: 23: Hoare triple {67123#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:17,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {67123#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:17,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {67123#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:17,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {67123#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:17,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {67123#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:17,936 INFO L290 TraceCheckUtils]: 28: Hoare triple {67123#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:17,936 INFO L290 TraceCheckUtils]: 29: Hoare triple {67123#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:17,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {67123#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {67034#false} is VALID [2022-04-08 10:10:17,937 INFO L290 TraceCheckUtils]: 31: Hoare triple {67034#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {67034#false} is VALID [2022-04-08 10:10:17,937 INFO L290 TraceCheckUtils]: 32: Hoare triple {67034#false} assume !(~z~0 % 4294967296 > 0); {67034#false} is VALID [2022-04-08 10:10:17,937 INFO L272 TraceCheckUtils]: 33: Hoare triple {67034#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {67034#false} is VALID [2022-04-08 10:10:17,937 INFO L290 TraceCheckUtils]: 34: Hoare triple {67034#false} ~cond := #in~cond; {67034#false} is VALID [2022-04-08 10:10:17,937 INFO L290 TraceCheckUtils]: 35: Hoare triple {67034#false} assume 0 == ~cond; {67034#false} is VALID [2022-04-08 10:10:17,937 INFO L290 TraceCheckUtils]: 36: Hoare triple {67034#false} assume !false; {67034#false} is VALID [2022-04-08 10:10:17,937 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 10:10:17,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:18,055 INFO L290 TraceCheckUtils]: 36: Hoare triple {67034#false} assume !false; {67034#false} is VALID [2022-04-08 10:10:18,055 INFO L290 TraceCheckUtils]: 35: Hoare triple {67034#false} assume 0 == ~cond; {67034#false} is VALID [2022-04-08 10:10:18,055 INFO L290 TraceCheckUtils]: 34: Hoare triple {67034#false} ~cond := #in~cond; {67034#false} is VALID [2022-04-08 10:10:18,055 INFO L272 TraceCheckUtils]: 33: Hoare triple {67034#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {67034#false} is VALID [2022-04-08 10:10:18,055 INFO L290 TraceCheckUtils]: 32: Hoare triple {67034#false} assume !(~z~0 % 4294967296 > 0); {67034#false} is VALID [2022-04-08 10:10:18,055 INFO L290 TraceCheckUtils]: 31: Hoare triple {67034#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {67034#false} is VALID [2022-04-08 10:10:18,055 INFO L290 TraceCheckUtils]: 30: Hoare triple {67123#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {67034#false} is VALID [2022-04-08 10:10:18,055 INFO L290 TraceCheckUtils]: 29: Hoare triple {67123#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,056 INFO L290 TraceCheckUtils]: 28: Hoare triple {67123#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,056 INFO L290 TraceCheckUtils]: 27: Hoare triple {67123#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,056 INFO L290 TraceCheckUtils]: 26: Hoare triple {67123#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,057 INFO L290 TraceCheckUtils]: 25: Hoare triple {67123#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,057 INFO L290 TraceCheckUtils]: 24: Hoare triple {67123#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {67123#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {67123#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {67123#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {67078#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67123#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {67082#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67078#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:10:18,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {67086#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67082#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:10:18,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {67090#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67086#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:10:18,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {67094#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67090#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:10:18,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {67098#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67094#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:10:18,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {67098#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {67098#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:10:18,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {67098#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {67098#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:10:18,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {67094#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67098#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:10:18,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {67090#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67094#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:10:18,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {67086#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67090#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:10:18,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {67082#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67086#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:10:18,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {67078#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67082#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:10:18,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {67033#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67078#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:10:18,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {67033#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67033#true} is VALID [2022-04-08 10:10:18,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {67033#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67033#true} is VALID [2022-04-08 10:10:18,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {67033#true} call #t~ret15 := main(); {67033#true} is VALID [2022-04-08 10:10:18,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67033#true} {67033#true} #83#return; {67033#true} is VALID [2022-04-08 10:10:18,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {67033#true} assume true; {67033#true} is VALID [2022-04-08 10:10:18,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {67033#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {67033#true} is VALID [2022-04-08 10:10:18,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {67033#true} call ULTIMATE.init(); {67033#true} is VALID [2022-04-08 10:10:18,066 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 10:10:18,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605008269] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:18,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:18,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 25 [2022-04-08 10:10:18,067 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:18,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [90876094] [2022-04-08 10:10:18,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [90876094] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:18,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:18,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:10:18,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152527842] [2022-04-08 10:10:18,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:18,067 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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 37 [2022-04-08 10:10:18,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:18,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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-08 10:10:18,088 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-08 10:10:18,088 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:10:18,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:18,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:10:18,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2022-04-08 10:10:18,088 INFO L87 Difference]: Start difference. First operand 284 states and 366 transitions. Second operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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-08 10:10:23,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:23,167 INFO L93 Difference]: Finished difference Result 413 states and 525 transitions. [2022-04-08 10:10:23,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 10:10:23,167 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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 37 [2022-04-08 10:10:23,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:23,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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-08 10:10:23,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 118 transitions. [2022-04-08 10:10:23,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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-08 10:10:23,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 118 transitions. [2022-04-08 10:10:23,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 118 transitions. [2022-04-08 10:10:23,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:23,265 INFO L225 Difference]: With dead ends: 413 [2022-04-08 10:10:23,265 INFO L226 Difference]: Without dead ends: 370 [2022-04-08 10:10:23,265 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=223, Invalid=2327, Unknown=0, NotChecked=0, Total=2550 [2022-04-08 10:10:23,266 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 55 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:23,266 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 113 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:10:23,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-04-08 10:10:24,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 285. [2022-04-08 10:10:24,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:24,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 370 states. Second operand has 285 states, 280 states have (on average 1.2892857142857144) internal successors, (361), 280 states have internal predecessors, (361), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:24,587 INFO L74 IsIncluded]: Start isIncluded. First operand 370 states. Second operand has 285 states, 280 states have (on average 1.2892857142857144) internal successors, (361), 280 states have internal predecessors, (361), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:24,588 INFO L87 Difference]: Start difference. First operand 370 states. Second operand has 285 states, 280 states have (on average 1.2892857142857144) internal successors, (361), 280 states have internal predecessors, (361), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:24,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:24,592 INFO L93 Difference]: Finished difference Result 370 states and 477 transitions. [2022-04-08 10:10:24,592 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 477 transitions. [2022-04-08 10:10:24,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:24,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:24,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 285 states, 280 states have (on average 1.2892857142857144) internal successors, (361), 280 states have internal predecessors, (361), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 370 states. [2022-04-08 10:10:24,593 INFO L87 Difference]: Start difference. First operand has 285 states, 280 states have (on average 1.2892857142857144) internal successors, (361), 280 states have internal predecessors, (361), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 370 states. [2022-04-08 10:10:24,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:24,597 INFO L93 Difference]: Finished difference Result 370 states and 477 transitions. [2022-04-08 10:10:24,597 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 477 transitions. [2022-04-08 10:10:24,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:24,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:24,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:24,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:24,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 280 states have (on average 1.2892857142857144) internal successors, (361), 280 states have internal predecessors, (361), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:24,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 365 transitions. [2022-04-08 10:10:24,601 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 365 transitions. Word has length 37 [2022-04-08 10:10:24,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:24,601 INFO L478 AbstractCegarLoop]: Abstraction has 285 states and 365 transitions. [2022-04-08 10:10:24,601 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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-08 10:10:24,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 285 states and 365 transitions. [2022-04-08 10:10:26,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 365 edges. 365 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:26,098 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 365 transitions. [2022-04-08 10:10:26,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 10:10:26,098 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:26,098 INFO L499 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:26,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-04-08 10:10:26,298 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-04-08 10:10:26,299 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:26,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:26,299 INFO L85 PathProgramCache]: Analyzing trace with hash -612758369, now seen corresponding path program 51 times [2022-04-08 10:10:26,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:26,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [396459113] [2022-04-08 10:10:26,301 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:26,301 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:26,301 INFO L85 PathProgramCache]: Analyzing trace with hash -612758369, now seen corresponding path program 52 times [2022-04-08 10:10:26,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:26,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670865398] [2022-04-08 10:10:26,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:26,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:26,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:26,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {69496#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {69470#true} is VALID [2022-04-08 10:10:26,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {69470#true} assume true; {69470#true} is VALID [2022-04-08 10:10:26,718 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {69470#true} {69470#true} #83#return; {69470#true} is VALID [2022-04-08 10:10:26,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {69470#true} call ULTIMATE.init(); {69496#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:26,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {69496#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {69470#true} is VALID [2022-04-08 10:10:26,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {69470#true} assume true; {69470#true} is VALID [2022-04-08 10:10:26,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69470#true} {69470#true} #83#return; {69470#true} is VALID [2022-04-08 10:10:26,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {69470#true} call #t~ret15 := main(); {69470#true} is VALID [2022-04-08 10:10:26,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {69470#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {69475#(= main_~y~0 0)} is VALID [2022-04-08 10:10:26,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {69475#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69476#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:26,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {69476#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69477#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:26,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {69477#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69478#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:26,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {69478#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69479#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:26,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {69479#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69480#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:26,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {69480#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69481#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:26,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {69481#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69482#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:26,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {69482#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69483#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:26,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {69483#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69484#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:26,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {69484#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69485#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:26,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {69485#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69486#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:26,727 INFO L290 TraceCheckUtils]: 17: Hoare triple {69486#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69487#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:26,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {69487#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69488#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:26,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {69488#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69489#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:10:26,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {69489#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69490#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:10:26,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {69490#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69491#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:10:26,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {69491#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69492#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:10:26,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {69492#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69493#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:10:26,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {69493#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {69493#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:10:26,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {69493#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {69494#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-08 10:10:26,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {69494#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69495#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} is VALID [2022-04-08 10:10:26,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {69495#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {69471#false} is VALID [2022-04-08 10:10:26,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {69471#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69471#false} is VALID [2022-04-08 10:10:26,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {69471#false} assume !(~y~0 % 4294967296 > 0); {69471#false} is VALID [2022-04-08 10:10:26,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {69471#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {69471#false} is VALID [2022-04-08 10:10:26,733 INFO L290 TraceCheckUtils]: 31: Hoare triple {69471#false} assume !(~x~0 % 4294967296 > 0); {69471#false} is VALID [2022-04-08 10:10:26,733 INFO L290 TraceCheckUtils]: 32: Hoare triple {69471#false} assume !(~z~0 % 4294967296 > 0); {69471#false} is VALID [2022-04-08 10:10:26,733 INFO L272 TraceCheckUtils]: 33: Hoare triple {69471#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {69471#false} is VALID [2022-04-08 10:10:26,734 INFO L290 TraceCheckUtils]: 34: Hoare triple {69471#false} ~cond := #in~cond; {69471#false} is VALID [2022-04-08 10:10:26,734 INFO L290 TraceCheckUtils]: 35: Hoare triple {69471#false} assume 0 == ~cond; {69471#false} is VALID [2022-04-08 10:10:26,734 INFO L290 TraceCheckUtils]: 36: Hoare triple {69471#false} assume !false; {69471#false} is VALID [2022-04-08 10:10:26,734 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:10:26,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:26,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670865398] [2022-04-08 10:10:26,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670865398] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:26,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080061972] [2022-04-08 10:10:26,734 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:10:26,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:26,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:26,735 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:10:26,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-04-08 10:10:26,795 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:10:26,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:26,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 10:10:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:26,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:27,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {69470#true} call ULTIMATE.init(); {69470#true} is VALID [2022-04-08 10:10:27,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {69470#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {69470#true} is VALID [2022-04-08 10:10:27,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {69470#true} assume true; {69470#true} is VALID [2022-04-08 10:10:27,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69470#true} {69470#true} #83#return; {69470#true} is VALID [2022-04-08 10:10:27,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {69470#true} call #t~ret15 := main(); {69470#true} is VALID [2022-04-08 10:10:27,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {69470#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {69475#(= main_~y~0 0)} is VALID [2022-04-08 10:10:27,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {69475#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69476#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:27,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {69476#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69477#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:27,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {69477#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69478#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:27,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {69478#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69479#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:27,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {69479#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69480#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:27,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {69480#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69481#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:27,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {69481#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69482#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:27,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {69482#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69483#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:27,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {69483#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69484#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:27,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {69484#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69485#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:27,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {69485#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69486#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:27,152 INFO L290 TraceCheckUtils]: 17: Hoare triple {69486#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69487#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:27,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {69487#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69488#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:27,153 INFO L290 TraceCheckUtils]: 19: Hoare triple {69488#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69489#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:10:27,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {69489#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69490#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:10:27,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {69490#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69491#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:10:27,155 INFO L290 TraceCheckUtils]: 22: Hoare triple {69491#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69492#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:10:27,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {69492#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69493#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:10:27,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {69493#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {69493#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:10:27,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {69493#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {69494#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-08 10:10:27,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {69494#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69578#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-08 10:10:27,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {69578#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !(~z~0 % 4294967296 > 0); {69471#false} is VALID [2022-04-08 10:10:27,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {69471#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69471#false} is VALID [2022-04-08 10:10:27,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {69471#false} assume !(~y~0 % 4294967296 > 0); {69471#false} is VALID [2022-04-08 10:10:27,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {69471#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {69471#false} is VALID [2022-04-08 10:10:27,158 INFO L290 TraceCheckUtils]: 31: Hoare triple {69471#false} assume !(~x~0 % 4294967296 > 0); {69471#false} is VALID [2022-04-08 10:10:27,158 INFO L290 TraceCheckUtils]: 32: Hoare triple {69471#false} assume !(~z~0 % 4294967296 > 0); {69471#false} is VALID [2022-04-08 10:10:27,158 INFO L272 TraceCheckUtils]: 33: Hoare triple {69471#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {69471#false} is VALID [2022-04-08 10:10:27,158 INFO L290 TraceCheckUtils]: 34: Hoare triple {69471#false} ~cond := #in~cond; {69471#false} is VALID [2022-04-08 10:10:27,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {69471#false} assume 0 == ~cond; {69471#false} is VALID [2022-04-08 10:10:27,159 INFO L290 TraceCheckUtils]: 36: Hoare triple {69471#false} assume !false; {69471#false} is VALID [2022-04-08 10:10:27,159 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:10:27,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:27,906 INFO L290 TraceCheckUtils]: 36: Hoare triple {69471#false} assume !false; {69471#false} is VALID [2022-04-08 10:10:27,906 INFO L290 TraceCheckUtils]: 35: Hoare triple {69471#false} assume 0 == ~cond; {69471#false} is VALID [2022-04-08 10:10:27,906 INFO L290 TraceCheckUtils]: 34: Hoare triple {69471#false} ~cond := #in~cond; {69471#false} is VALID [2022-04-08 10:10:27,906 INFO L272 TraceCheckUtils]: 33: Hoare triple {69471#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {69471#false} is VALID [2022-04-08 10:10:27,906 INFO L290 TraceCheckUtils]: 32: Hoare triple {69471#false} assume !(~z~0 % 4294967296 > 0); {69471#false} is VALID [2022-04-08 10:10:27,906 INFO L290 TraceCheckUtils]: 31: Hoare triple {69471#false} assume !(~x~0 % 4294967296 > 0); {69471#false} is VALID [2022-04-08 10:10:27,906 INFO L290 TraceCheckUtils]: 30: Hoare triple {69471#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {69471#false} is VALID [2022-04-08 10:10:27,906 INFO L290 TraceCheckUtils]: 29: Hoare triple {69471#false} assume !(~y~0 % 4294967296 > 0); {69471#false} is VALID [2022-04-08 10:10:27,906 INFO L290 TraceCheckUtils]: 28: Hoare triple {69471#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69471#false} is VALID [2022-04-08 10:10:27,907 INFO L290 TraceCheckUtils]: 27: Hoare triple {69636#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {69471#false} is VALID [2022-04-08 10:10:27,907 INFO L290 TraceCheckUtils]: 26: Hoare triple {69640#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69636#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:10:27,908 INFO L290 TraceCheckUtils]: 25: Hoare triple {69644#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {69640#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:27,908 INFO L290 TraceCheckUtils]: 24: Hoare triple {69644#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {69644#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:27,909 INFO L290 TraceCheckUtils]: 23: Hoare triple {69651#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69644#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:27,909 INFO L290 TraceCheckUtils]: 22: Hoare triple {69655#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69651#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:10:27,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {69659#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69655#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:10:27,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {69663#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69659#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:10:27,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {69667#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69663#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:10:27,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {69671#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69667#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:10:27,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {69675#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69671#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:27,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {69679#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69675#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:10:27,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {69683#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69679#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:27,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {69687#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69683#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:10:27,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {69691#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69687#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:10:27,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {69695#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69691#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:10:27,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {69699#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69695#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:10:27,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {69703#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69699#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:10:27,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {69707#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69703#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:10:27,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {69711#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69707#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:10:27,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {69715#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69711#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:10:27,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {69719#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69715#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:10:27,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {69470#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {69719#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:10:27,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {69470#true} call #t~ret15 := main(); {69470#true} is VALID [2022-04-08 10:10:27,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69470#true} {69470#true} #83#return; {69470#true} is VALID [2022-04-08 10:10:27,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {69470#true} assume true; {69470#true} is VALID [2022-04-08 10:10:27,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {69470#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {69470#true} is VALID [2022-04-08 10:10:27,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {69470#true} call ULTIMATE.init(); {69470#true} is VALID [2022-04-08 10:10:27,920 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:10:27,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080061972] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:27,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:27,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-08 10:10:27,920 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:27,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [396459113] [2022-04-08 10:10:27,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [396459113] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:27,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:27,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 10:10:27,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101263006] [2022-04-08 10:10:27,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:27,921 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 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-08 10:10:27,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:27,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 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-08 10:10:27,943 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-08 10:10:27,944 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 10:10:27,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:27,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 10:10:27,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=1614, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:10:27,944 INFO L87 Difference]: Start difference. First operand 285 states and 365 transitions. Second operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 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-08 10:10:40,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:40,003 INFO L93 Difference]: Finished difference Result 641 states and 897 transitions. [2022-04-08 10:10:40,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 10:10:40,003 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 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-08 10:10:40,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:40,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 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-08 10:10:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 242 transitions. [2022-04-08 10:10:40,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 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-08 10:10:40,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 242 transitions. [2022-04-08 10:10:40,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 242 transitions. [2022-04-08 10:10:40,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:40,219 INFO L225 Difference]: With dead ends: 641 [2022-04-08 10:10:40,219 INFO L226 Difference]: Without dead ends: 615 [2022-04-08 10:10:40,220 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=974, Invalid=3582, Unknown=0, NotChecked=0, Total=4556 [2022-04-08 10:10:40,220 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 173 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4018 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 4145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 4018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:40,220 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 215 Invalid, 4145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 4018 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-08 10:10:40,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-04-08 10:10:41,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 299. [2022-04-08 10:10:41,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:41,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 615 states. Second operand has 299 states, 294 states have (on average 1.2959183673469388) internal successors, (381), 294 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:41,596 INFO L74 IsIncluded]: Start isIncluded. First operand 615 states. Second operand has 299 states, 294 states have (on average 1.2959183673469388) internal successors, (381), 294 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:41,596 INFO L87 Difference]: Start difference. First operand 615 states. Second operand has 299 states, 294 states have (on average 1.2959183673469388) internal successors, (381), 294 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:41,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:41,607 INFO L93 Difference]: Finished difference Result 615 states and 772 transitions. [2022-04-08 10:10:41,607 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 772 transitions. [2022-04-08 10:10:41,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:41,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:41,607 INFO L74 IsIncluded]: Start isIncluded. First operand has 299 states, 294 states have (on average 1.2959183673469388) internal successors, (381), 294 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 615 states. [2022-04-08 10:10:41,607 INFO L87 Difference]: Start difference. First operand has 299 states, 294 states have (on average 1.2959183673469388) internal successors, (381), 294 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 615 states. [2022-04-08 10:10:41,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:41,618 INFO L93 Difference]: Finished difference Result 615 states and 772 transitions. [2022-04-08 10:10:41,618 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 772 transitions. [2022-04-08 10:10:41,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:41,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:41,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:41,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:41,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.2959183673469388) internal successors, (381), 294 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 385 transitions. [2022-04-08 10:10:41,622 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 385 transitions. Word has length 37 [2022-04-08 10:10:41,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:41,622 INFO L478 AbstractCegarLoop]: Abstraction has 299 states and 385 transitions. [2022-04-08 10:10:41,622 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 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-08 10:10:41,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 299 states and 385 transitions. [2022-04-08 10:10:43,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 385 edges. 385 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:43,285 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 385 transitions. [2022-04-08 10:10:43,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 10:10:43,286 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:43,286 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:43,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-04-08 10:10:43,486 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-04-08 10:10:43,486 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:43,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:43,486 INFO L85 PathProgramCache]: Analyzing trace with hash 2053708003, now seen corresponding path program 27 times [2022-04-08 10:10:43,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:43,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1281007955] [2022-04-08 10:10:43,489 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:43,489 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:43,489 INFO L85 PathProgramCache]: Analyzing trace with hash 2053708003, now seen corresponding path program 28 times [2022-04-08 10:10:43,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:43,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288988172] [2022-04-08 10:10:43,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:43,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:43,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:43,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {72916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {72894#true} is VALID [2022-04-08 10:10:43,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {72894#true} assume true; {72894#true} is VALID [2022-04-08 10:10:43,808 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {72894#true} {72894#true} #83#return; {72894#true} is VALID [2022-04-08 10:10:43,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {72894#true} call ULTIMATE.init(); {72916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:43,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {72916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {72894#true} is VALID [2022-04-08 10:10:43,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {72894#true} assume true; {72894#true} is VALID [2022-04-08 10:10:43,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72894#true} {72894#true} #83#return; {72894#true} is VALID [2022-04-08 10:10:43,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {72894#true} call #t~ret15 := main(); {72894#true} is VALID [2022-04-08 10:10:43,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {72894#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {72899#(= main_~y~0 0)} is VALID [2022-04-08 10:10:43,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {72899#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72900#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:43,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {72900#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72901#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:43,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {72901#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72902#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:43,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {72902#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72903#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:43,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {72903#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72904#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:43,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {72904#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72905#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:43,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {72905#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72906#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:43,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {72906#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {72906#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:43,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {72906#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {72907#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:10:43,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {72907#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72908#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:10:43,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {72908#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72909#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:10:43,814 INFO L290 TraceCheckUtils]: 17: Hoare triple {72909#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72910#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:10:43,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {72910#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72911#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:10:43,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {72911#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72912#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:10:43,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {72912#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72913#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:10:43,816 INFO L290 TraceCheckUtils]: 21: Hoare triple {72913#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72914#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:10:43,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {72914#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {72914#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:10:43,817 INFO L290 TraceCheckUtils]: 23: Hoare triple {72914#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72913#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:10:43,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {72913#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72912#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:10:43,818 INFO L290 TraceCheckUtils]: 25: Hoare triple {72912#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72911#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:10:43,818 INFO L290 TraceCheckUtils]: 26: Hoare triple {72911#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72910#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:10:43,819 INFO L290 TraceCheckUtils]: 27: Hoare triple {72910#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72909#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:10:43,819 INFO L290 TraceCheckUtils]: 28: Hoare triple {72909#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72908#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:10:43,820 INFO L290 TraceCheckUtils]: 29: Hoare triple {72908#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72907#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:10:43,820 INFO L290 TraceCheckUtils]: 30: Hoare triple {72907#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {72907#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:10:43,820 INFO L290 TraceCheckUtils]: 31: Hoare triple {72907#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {72907#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:10:43,821 INFO L290 TraceCheckUtils]: 32: Hoare triple {72907#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {72915#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:10:43,821 INFO L290 TraceCheckUtils]: 33: Hoare triple {72915#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {72895#false} is VALID [2022-04-08 10:10:43,821 INFO L272 TraceCheckUtils]: 34: Hoare triple {72895#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {72895#false} is VALID [2022-04-08 10:10:43,821 INFO L290 TraceCheckUtils]: 35: Hoare triple {72895#false} ~cond := #in~cond; {72895#false} is VALID [2022-04-08 10:10:43,821 INFO L290 TraceCheckUtils]: 36: Hoare triple {72895#false} assume 0 == ~cond; {72895#false} is VALID [2022-04-08 10:10:43,821 INFO L290 TraceCheckUtils]: 37: Hoare triple {72895#false} assume !false; {72895#false} is VALID [2022-04-08 10:10:43,822 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:10:43,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:43,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288988172] [2022-04-08 10:10:43,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288988172] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:43,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568306245] [2022-04-08 10:10:43,822 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:10:43,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:43,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:43,823 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:10:43,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-04-08 10:10:43,867 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:10:43,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:43,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-08 10:10:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:43,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:44,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {72894#true} call ULTIMATE.init(); {72894#true} is VALID [2022-04-08 10:10:44,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {72894#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {72894#true} is VALID [2022-04-08 10:10:44,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {72894#true} assume true; {72894#true} is VALID [2022-04-08 10:10:44,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72894#true} {72894#true} #83#return; {72894#true} is VALID [2022-04-08 10:10:44,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {72894#true} call #t~ret15 := main(); {72894#true} is VALID [2022-04-08 10:10:44,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {72894#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {72894#true} is VALID [2022-04-08 10:10:44,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {72894#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72938#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:10:44,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {72938#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72942#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:10:44,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {72942#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72946#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:10:44,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {72946#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72950#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:10:44,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {72950#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72954#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:10:44,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {72954#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72958#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:10:44,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {72958#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72962#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:10:44,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {72962#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {72962#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:10:44,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {72962#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {72962#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:10:44,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {72962#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72958#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:10:44,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {72958#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72954#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:10:44,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {72954#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72950#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:10:44,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {72950#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72946#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:10:44,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {72946#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72942#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:10:44,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {72942#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72938#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:10:44,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {72938#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:44,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {72990#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:44,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {72990#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:44,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {72990#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:44,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {72990#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:44,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {72990#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:44,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {72990#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:44,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {72990#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:44,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {72990#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:44,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {72990#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:44,158 INFO L290 TraceCheckUtils]: 31: Hoare triple {72990#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {72895#false} is VALID [2022-04-08 10:10:44,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {72895#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {72895#false} is VALID [2022-04-08 10:10:44,159 INFO L290 TraceCheckUtils]: 33: Hoare triple {72895#false} assume !(~z~0 % 4294967296 > 0); {72895#false} is VALID [2022-04-08 10:10:44,159 INFO L272 TraceCheckUtils]: 34: Hoare triple {72895#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {72895#false} is VALID [2022-04-08 10:10:44,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {72895#false} ~cond := #in~cond; {72895#false} is VALID [2022-04-08 10:10:44,159 INFO L290 TraceCheckUtils]: 36: Hoare triple {72895#false} assume 0 == ~cond; {72895#false} is VALID [2022-04-08 10:10:44,159 INFO L290 TraceCheckUtils]: 37: Hoare triple {72895#false} assume !false; {72895#false} is VALID [2022-04-08 10:10:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-08 10:10:44,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:44,285 INFO L290 TraceCheckUtils]: 37: Hoare triple {72895#false} assume !false; {72895#false} is VALID [2022-04-08 10:10:44,285 INFO L290 TraceCheckUtils]: 36: Hoare triple {72895#false} assume 0 == ~cond; {72895#false} is VALID [2022-04-08 10:10:44,285 INFO L290 TraceCheckUtils]: 35: Hoare triple {72895#false} ~cond := #in~cond; {72895#false} is VALID [2022-04-08 10:10:44,285 INFO L272 TraceCheckUtils]: 34: Hoare triple {72895#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {72895#false} is VALID [2022-04-08 10:10:44,285 INFO L290 TraceCheckUtils]: 33: Hoare triple {72895#false} assume !(~z~0 % 4294967296 > 0); {72895#false} is VALID [2022-04-08 10:10:44,285 INFO L290 TraceCheckUtils]: 32: Hoare triple {72895#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {72895#false} is VALID [2022-04-08 10:10:44,286 INFO L290 TraceCheckUtils]: 31: Hoare triple {72990#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {72895#false} is VALID [2022-04-08 10:10:44,286 INFO L290 TraceCheckUtils]: 30: Hoare triple {72990#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:44,286 INFO L290 TraceCheckUtils]: 29: Hoare triple {72990#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:44,286 INFO L290 TraceCheckUtils]: 28: Hoare triple {72990#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:44,287 INFO L290 TraceCheckUtils]: 27: Hoare triple {72990#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:44,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {72990#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:44,287 INFO L290 TraceCheckUtils]: 25: Hoare triple {72990#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:44,287 INFO L290 TraceCheckUtils]: 24: Hoare triple {72990#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:44,288 INFO L290 TraceCheckUtils]: 23: Hoare triple {72990#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:44,288 INFO L290 TraceCheckUtils]: 22: Hoare triple {72990#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:44,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {72938#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72990#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:44,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {72942#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72938#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:10:44,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {72946#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72942#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:10:44,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {72950#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72946#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:10:44,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {72954#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72950#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:10:44,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {72958#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72954#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:10:44,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {72962#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72958#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:10:44,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {72962#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {72962#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:10:44,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {72962#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {72962#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:10:44,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {72958#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72962#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:10:44,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {72954#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72958#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:10:44,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {72950#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72954#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:10:44,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {72946#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72950#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:10:44,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {72942#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72946#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:10:44,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {72938#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72942#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:10:44,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {72894#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72938#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:10:44,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {72894#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {72894#true} is VALID [2022-04-08 10:10:44,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {72894#true} call #t~ret15 := main(); {72894#true} is VALID [2022-04-08 10:10:44,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72894#true} {72894#true} #83#return; {72894#true} is VALID [2022-04-08 10:10:44,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {72894#true} assume true; {72894#true} is VALID [2022-04-08 10:10:44,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {72894#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {72894#true} is VALID [2022-04-08 10:10:44,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {72894#true} call ULTIMATE.init(); {72894#true} is VALID [2022-04-08 10:10:44,298 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-08 10:10:44,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568306245] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:44,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:44,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 28 [2022-04-08 10:10:44,299 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:44,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1281007955] [2022-04-08 10:10:44,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1281007955] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:44,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:44,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 10:10:44,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247451364] [2022-04-08 10:10:44,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:44,299 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 19 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-08 10:10:44,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:44,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.7) internal successors, (34), 19 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-08 10:10:44,327 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-08 10:10:44,327 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 10:10:44,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:44,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 10:10:44,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:10:44,328 INFO L87 Difference]: Start difference. First operand 299 states and 385 transitions. Second operand has 20 states, 20 states have (on average 1.7) internal successors, (34), 19 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-08 10:10:53,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:53,433 INFO L93 Difference]: Finished difference Result 434 states and 586 transitions. [2022-04-08 10:10:53,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-04-08 10:10:53,433 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 19 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-08 10:10:53,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:53,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.7) internal successors, (34), 19 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-08 10:10:53,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 243 transitions. [2022-04-08 10:10:53,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.7) internal successors, (34), 19 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-08 10:10:53,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 243 transitions. [2022-04-08 10:10:53,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 243 transitions. [2022-04-08 10:10:53,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:53,659 INFO L225 Difference]: With dead ends: 434 [2022-04-08 10:10:53,659 INFO L226 Difference]: Without dead ends: 416 [2022-04-08 10:10:53,660 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2936 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=571, Invalid=10559, Unknown=0, NotChecked=0, Total=11130 [2022-04-08 10:10:53,660 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 96 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2595 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 2789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 2595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:53,660 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 124 Invalid, 2789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 2595 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 10:10:53,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-04-08 10:10:55,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 309. [2022-04-08 10:10:55,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:55,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 416 states. Second operand has 309 states, 304 states have (on average 1.2861842105263157) internal successors, (391), 304 states have internal predecessors, (391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:55,141 INFO L74 IsIncluded]: Start isIncluded. First operand 416 states. Second operand has 309 states, 304 states have (on average 1.2861842105263157) internal successors, (391), 304 states have internal predecessors, (391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:55,142 INFO L87 Difference]: Start difference. First operand 416 states. Second operand has 309 states, 304 states have (on average 1.2861842105263157) internal successors, (391), 304 states have internal predecessors, (391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:55,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:55,147 INFO L93 Difference]: Finished difference Result 416 states and 521 transitions. [2022-04-08 10:10:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 521 transitions. [2022-04-08 10:10:55,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:55,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:55,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 304 states have (on average 1.2861842105263157) internal successors, (391), 304 states have internal predecessors, (391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 416 states. [2022-04-08 10:10:55,148 INFO L87 Difference]: Start difference. First operand has 309 states, 304 states have (on average 1.2861842105263157) internal successors, (391), 304 states have internal predecessors, (391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 416 states. [2022-04-08 10:10:55,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:55,154 INFO L93 Difference]: Finished difference Result 416 states and 521 transitions. [2022-04-08 10:10:55,154 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 521 transitions. [2022-04-08 10:10:55,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:55,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:55,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:55,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:55,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 304 states have (on average 1.2861842105263157) internal successors, (391), 304 states have internal predecessors, (391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:55,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 395 transitions. [2022-04-08 10:10:55,159 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 395 transitions. Word has length 38 [2022-04-08 10:10:55,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:55,159 INFO L478 AbstractCegarLoop]: Abstraction has 309 states and 395 transitions. [2022-04-08 10:10:55,159 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 19 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-08 10:10:55,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 395 transitions. [2022-04-08 10:10:56,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 395 edges. 395 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:56,937 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 395 transitions. [2022-04-08 10:10:56,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 10:10:56,937 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:56,937 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:56,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-04-08 10:10:57,137 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-04-08 10:10:57,138 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:57,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:57,138 INFO L85 PathProgramCache]: Analyzing trace with hash -770615006, now seen corresponding path program 53 times [2022-04-08 10:10:57,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:57,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [714969104] [2022-04-08 10:10:57,140 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:57,140 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:57,141 INFO L85 PathProgramCache]: Analyzing trace with hash -770615006, now seen corresponding path program 54 times [2022-04-08 10:10:57,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:57,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307376395] [2022-04-08 10:10:57,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:57,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:57,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:57,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {75644#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {75626#true} is VALID [2022-04-08 10:10:57,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {75626#true} assume true; {75626#true} is VALID [2022-04-08 10:10:57,344 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75626#true} {75626#true} #83#return; {75626#true} is VALID [2022-04-08 10:10:57,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {75626#true} call ULTIMATE.init(); {75644#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:57,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {75644#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {75626#true} is VALID [2022-04-08 10:10:57,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {75626#true} assume true; {75626#true} is VALID [2022-04-08 10:10:57,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75626#true} {75626#true} #83#return; {75626#true} is VALID [2022-04-08 10:10:57,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {75626#true} call #t~ret15 := main(); {75626#true} is VALID [2022-04-08 10:10:57,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {75626#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {75631#(= main_~y~0 0)} is VALID [2022-04-08 10:10:57,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {75631#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75632#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:57,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {75632#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75633#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:57,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {75633#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75634#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:57,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {75634#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75635#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:57,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {75635#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75636#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:57,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {75636#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75637#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:57,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {75637#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75638#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:57,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {75638#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:57,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {75639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {75639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:57,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {75639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {75640#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:10:57,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {75640#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {75641#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:10:57,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {75641#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {75642#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:10:57,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {75642#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {75643#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:10:57,353 INFO L290 TraceCheckUtils]: 19: Hoare triple {75643#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {75627#false} is VALID [2022-04-08 10:10:57,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {75627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75627#false} is VALID [2022-04-08 10:10:57,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {75627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75627#false} is VALID [2022-04-08 10:10:57,354 INFO L290 TraceCheckUtils]: 22: Hoare triple {75627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75627#false} is VALID [2022-04-08 10:10:57,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {75627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75627#false} is VALID [2022-04-08 10:10:57,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {75627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75627#false} is VALID [2022-04-08 10:10:57,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {75627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75627#false} is VALID [2022-04-08 10:10:57,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {75627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75627#false} is VALID [2022-04-08 10:10:57,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {75627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75627#false} is VALID [2022-04-08 10:10:57,354 INFO L290 TraceCheckUtils]: 28: Hoare triple {75627#false} assume !(~y~0 % 4294967296 > 0); {75627#false} is VALID [2022-04-08 10:10:57,354 INFO L290 TraceCheckUtils]: 29: Hoare triple {75627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75627#false} is VALID [2022-04-08 10:10:57,354 INFO L290 TraceCheckUtils]: 30: Hoare triple {75627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75627#false} is VALID [2022-04-08 10:10:57,354 INFO L290 TraceCheckUtils]: 31: Hoare triple {75627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75627#false} is VALID [2022-04-08 10:10:57,354 INFO L290 TraceCheckUtils]: 32: Hoare triple {75627#false} assume !(~x~0 % 4294967296 > 0); {75627#false} is VALID [2022-04-08 10:10:57,354 INFO L290 TraceCheckUtils]: 33: Hoare triple {75627#false} assume !(~z~0 % 4294967296 > 0); {75627#false} is VALID [2022-04-08 10:10:57,354 INFO L272 TraceCheckUtils]: 34: Hoare triple {75627#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {75627#false} is VALID [2022-04-08 10:10:57,355 INFO L290 TraceCheckUtils]: 35: Hoare triple {75627#false} ~cond := #in~cond; {75627#false} is VALID [2022-04-08 10:10:57,355 INFO L290 TraceCheckUtils]: 36: Hoare triple {75627#false} assume 0 == ~cond; {75627#false} is VALID [2022-04-08 10:10:57,355 INFO L290 TraceCheckUtils]: 37: Hoare triple {75627#false} assume !false; {75627#false} is VALID [2022-04-08 10:10:57,355 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-08 10:10:57,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:57,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307376395] [2022-04-08 10:10:57,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307376395] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:57,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917905451] [2022-04-08 10:10:57,355 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:10:57,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:57,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:57,359 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:10:57,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-04-08 10:10:57,490 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:10:57,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:57,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 10:10:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:57,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:57,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {75626#true} call ULTIMATE.init(); {75626#true} is VALID [2022-04-08 10:10:57,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {75626#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {75626#true} is VALID [2022-04-08 10:10:57,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {75626#true} assume true; {75626#true} is VALID [2022-04-08 10:10:57,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75626#true} {75626#true} #83#return; {75626#true} is VALID [2022-04-08 10:10:57,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {75626#true} call #t~ret15 := main(); {75626#true} is VALID [2022-04-08 10:10:57,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {75626#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {75631#(= main_~y~0 0)} is VALID [2022-04-08 10:10:57,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {75631#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75632#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:57,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {75632#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75633#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:57,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {75633#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75634#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:57,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {75634#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75635#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:57,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {75635#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75636#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:57,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {75636#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75637#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:57,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {75637#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75638#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:57,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {75638#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:57,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {75639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {75639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:57,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {75639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {75640#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:10:57,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {75640#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {75641#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:10:57,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {75641#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {75642#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:10:57,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {75642#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {75702#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:10:57,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {75702#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {75627#false} is VALID [2022-04-08 10:10:57,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {75627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75627#false} is VALID [2022-04-08 10:10:57,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {75627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75627#false} is VALID [2022-04-08 10:10:57,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {75627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75627#false} is VALID [2022-04-08 10:10:57,798 INFO L290 TraceCheckUtils]: 23: Hoare triple {75627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75627#false} is VALID [2022-04-08 10:10:57,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {75627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75627#false} is VALID [2022-04-08 10:10:57,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {75627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75627#false} is VALID [2022-04-08 10:10:57,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {75627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75627#false} is VALID [2022-04-08 10:10:57,798 INFO L290 TraceCheckUtils]: 27: Hoare triple {75627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75627#false} is VALID [2022-04-08 10:10:57,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {75627#false} assume !(~y~0 % 4294967296 > 0); {75627#false} is VALID [2022-04-08 10:10:57,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {75627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75627#false} is VALID [2022-04-08 10:10:57,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {75627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75627#false} is VALID [2022-04-08 10:10:57,798 INFO L290 TraceCheckUtils]: 31: Hoare triple {75627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75627#false} is VALID [2022-04-08 10:10:57,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {75627#false} assume !(~x~0 % 4294967296 > 0); {75627#false} is VALID [2022-04-08 10:10:57,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {75627#false} assume !(~z~0 % 4294967296 > 0); {75627#false} is VALID [2022-04-08 10:10:57,799 INFO L272 TraceCheckUtils]: 34: Hoare triple {75627#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {75627#false} is VALID [2022-04-08 10:10:57,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {75627#false} ~cond := #in~cond; {75627#false} is VALID [2022-04-08 10:10:57,799 INFO L290 TraceCheckUtils]: 36: Hoare triple {75627#false} assume 0 == ~cond; {75627#false} is VALID [2022-04-08 10:10:57,799 INFO L290 TraceCheckUtils]: 37: Hoare triple {75627#false} assume !false; {75627#false} is VALID [2022-04-08 10:10:57,799 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-08 10:10:57,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:58,129 INFO L290 TraceCheckUtils]: 37: Hoare triple {75627#false} assume !false; {75627#false} is VALID [2022-04-08 10:10:58,130 INFO L290 TraceCheckUtils]: 36: Hoare triple {75627#false} assume 0 == ~cond; {75627#false} is VALID [2022-04-08 10:10:58,130 INFO L290 TraceCheckUtils]: 35: Hoare triple {75627#false} ~cond := #in~cond; {75627#false} is VALID [2022-04-08 10:10:58,130 INFO L272 TraceCheckUtils]: 34: Hoare triple {75627#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {75627#false} is VALID [2022-04-08 10:10:58,130 INFO L290 TraceCheckUtils]: 33: Hoare triple {75627#false} assume !(~z~0 % 4294967296 > 0); {75627#false} is VALID [2022-04-08 10:10:58,130 INFO L290 TraceCheckUtils]: 32: Hoare triple {75627#false} assume !(~x~0 % 4294967296 > 0); {75627#false} is VALID [2022-04-08 10:10:58,130 INFO L290 TraceCheckUtils]: 31: Hoare triple {75627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75627#false} is VALID [2022-04-08 10:10:58,130 INFO L290 TraceCheckUtils]: 30: Hoare triple {75627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75627#false} is VALID [2022-04-08 10:10:58,130 INFO L290 TraceCheckUtils]: 29: Hoare triple {75627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75627#false} is VALID [2022-04-08 10:10:58,130 INFO L290 TraceCheckUtils]: 28: Hoare triple {75627#false} assume !(~y~0 % 4294967296 > 0); {75627#false} is VALID [2022-04-08 10:10:58,130 INFO L290 TraceCheckUtils]: 27: Hoare triple {75627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75627#false} is VALID [2022-04-08 10:10:58,130 INFO L290 TraceCheckUtils]: 26: Hoare triple {75627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75627#false} is VALID [2022-04-08 10:10:58,130 INFO L290 TraceCheckUtils]: 25: Hoare triple {75627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75627#false} is VALID [2022-04-08 10:10:58,130 INFO L290 TraceCheckUtils]: 24: Hoare triple {75627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75627#false} is VALID [2022-04-08 10:10:58,131 INFO L290 TraceCheckUtils]: 23: Hoare triple {75627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75627#false} is VALID [2022-04-08 10:10:58,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {75627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75627#false} is VALID [2022-04-08 10:10:58,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {75627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75627#false} is VALID [2022-04-08 10:10:58,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {75627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75627#false} is VALID [2022-04-08 10:10:58,131 INFO L290 TraceCheckUtils]: 19: Hoare triple {75814#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {75627#false} is VALID [2022-04-08 10:10:58,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {75818#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {75814#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:10:58,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {75822#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {75818#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:58,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {75826#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {75822#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:58,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {75830#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {75826#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:10:58,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {75830#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {75830#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:10:58,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {75837#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75830#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:10:58,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {75841#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75837#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:58,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {75845#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75841#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:58,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {75849#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75845#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:10:58,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {75853#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75849#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:10:58,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {75857#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75853#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:10:58,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {75861#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75857#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:10:58,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {75865#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75861#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:10:58,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {75626#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {75865#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:58,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {75626#true} call #t~ret15 := main(); {75626#true} is VALID [2022-04-08 10:10:58,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75626#true} {75626#true} #83#return; {75626#true} is VALID [2022-04-08 10:10:58,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {75626#true} assume true; {75626#true} is VALID [2022-04-08 10:10:58,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {75626#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {75626#true} is VALID [2022-04-08 10:10:58,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {75626#true} call ULTIMATE.init(); {75626#true} is VALID [2022-04-08 10:10:58,140 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-08 10:10:58,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917905451] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:58,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:58,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-08 10:10:58,140 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:58,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [714969104] [2022-04-08 10:10:58,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [714969104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:58,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:58,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:10:58,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473547045] [2022-04-08 10:10:58,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:58,140 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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 38 [2022-04-08 10:10:58,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:58,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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-08 10:10:58,159 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-08 10:10:58,159 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:10:58,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:58,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:10:58,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=712, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:10:58,160 INFO L87 Difference]: Start difference. First operand 309 states and 395 transitions. Second operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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-08 10:11:04,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:04,005 INFO L93 Difference]: Finished difference Result 472 states and 598 transitions. [2022-04-08 10:11:04,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 10:11:04,005 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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 38 [2022-04-08 10:11:04,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:11:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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-08 10:11:04,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 121 transitions. [2022-04-08 10:11:04,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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-08 10:11:04,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 121 transitions. [2022-04-08 10:11:04,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 121 transitions. [2022-04-08 10:11:04,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:04,113 INFO L225 Difference]: With dead ends: 472 [2022-04-08 10:11:04,113 INFO L226 Difference]: Without dead ends: 453 [2022-04-08 10:11:04,114 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=473, Invalid=1879, Unknown=0, NotChecked=0, Total=2352 [2022-04-08 10:11:04,114 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 69 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:11:04,114 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 108 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:11:04,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-04-08 10:11:05,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 309. [2022-04-08 10:11:05,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:11:05,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 453 states. Second operand has 309 states, 304 states have (on average 1.2828947368421053) internal successors, (390), 304 states have internal predecessors, (390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:05,564 INFO L74 IsIncluded]: Start isIncluded. First operand 453 states. Second operand has 309 states, 304 states have (on average 1.2828947368421053) internal successors, (390), 304 states have internal predecessors, (390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:05,564 INFO L87 Difference]: Start difference. First operand 453 states. Second operand has 309 states, 304 states have (on average 1.2828947368421053) internal successors, (390), 304 states have internal predecessors, (390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:05,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:05,571 INFO L93 Difference]: Finished difference Result 453 states and 578 transitions. [2022-04-08 10:11:05,571 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 578 transitions. [2022-04-08 10:11:05,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:05,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:05,571 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 304 states have (on average 1.2828947368421053) internal successors, (390), 304 states have internal predecessors, (390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 453 states. [2022-04-08 10:11:05,572 INFO L87 Difference]: Start difference. First operand has 309 states, 304 states have (on average 1.2828947368421053) internal successors, (390), 304 states have internal predecessors, (390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 453 states. [2022-04-08 10:11:05,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:05,578 INFO L93 Difference]: Finished difference Result 453 states and 578 transitions. [2022-04-08 10:11:05,578 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 578 transitions. [2022-04-08 10:11:05,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:05,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:05,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:11:05,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:11:05,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 304 states have (on average 1.2828947368421053) internal successors, (390), 304 states have internal predecessors, (390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:05,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 394 transitions. [2022-04-08 10:11:05,582 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 394 transitions. Word has length 38 [2022-04-08 10:11:05,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:11:05,582 INFO L478 AbstractCegarLoop]: Abstraction has 309 states and 394 transitions. [2022-04-08 10:11:05,583 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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-08 10:11:05,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 394 transitions. [2022-04-08 10:11:07,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 394 edges. 394 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:07,453 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 394 transitions. [2022-04-08 10:11:07,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 10:11:07,453 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:11:07,453 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:11:07,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-04-08 10:11:07,654 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-04-08 10:11:07,654 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:11:07,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:11:07,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1286566156, now seen corresponding path program 55 times [2022-04-08 10:11:07,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:07,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [109584755] [2022-04-08 10:11:07,656 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:11:07,656 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:11:07,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1286566156, now seen corresponding path program 56 times [2022-04-08 10:11:07,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:11:07,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683315769] [2022-04-08 10:11:07,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:11:07,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:11:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:07,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:11:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:07,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {78410#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {78392#true} is VALID [2022-04-08 10:11:07,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {78392#true} assume true; {78392#true} is VALID [2022-04-08 10:11:07,884 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78392#true} {78392#true} #83#return; {78392#true} is VALID [2022-04-08 10:11:07,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {78392#true} call ULTIMATE.init(); {78410#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:11:07,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {78410#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {78392#true} is VALID [2022-04-08 10:11:07,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {78392#true} assume true; {78392#true} is VALID [2022-04-08 10:11:07,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78392#true} {78392#true} #83#return; {78392#true} is VALID [2022-04-08 10:11:07,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {78392#true} call #t~ret15 := main(); {78392#true} is VALID [2022-04-08 10:11:07,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {78392#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {78397#(= main_~y~0 0)} is VALID [2022-04-08 10:11:07,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {78397#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78398#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:07,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {78398#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78399#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:07,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {78399#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78400#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:07,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {78400#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78401#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:07,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {78401#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78402#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:07,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {78402#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78403#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:07,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {78403#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78404#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:07,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {78404#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78405#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:07,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {78405#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78406#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:07,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {78406#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {78406#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:07,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {78406#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {78407#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:11:07,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {78407#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78408#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:11:07,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {78408#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78409#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:11:07,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {78409#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {78393#false} is VALID [2022-04-08 10:11:07,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {78393#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78393#false} is VALID [2022-04-08 10:11:07,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {78393#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78393#false} is VALID [2022-04-08 10:11:07,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {78393#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78393#false} is VALID [2022-04-08 10:11:07,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {78393#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78393#false} is VALID [2022-04-08 10:11:07,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {78393#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78393#false} is VALID [2022-04-08 10:11:07,894 INFO L290 TraceCheckUtils]: 25: Hoare triple {78393#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78393#false} is VALID [2022-04-08 10:11:07,894 INFO L290 TraceCheckUtils]: 26: Hoare triple {78393#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78393#false} is VALID [2022-04-08 10:11:07,894 INFO L290 TraceCheckUtils]: 27: Hoare triple {78393#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78393#false} is VALID [2022-04-08 10:11:07,894 INFO L290 TraceCheckUtils]: 28: Hoare triple {78393#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78393#false} is VALID [2022-04-08 10:11:07,894 INFO L290 TraceCheckUtils]: 29: Hoare triple {78393#false} assume !(~y~0 % 4294967296 > 0); {78393#false} is VALID [2022-04-08 10:11:07,894 INFO L290 TraceCheckUtils]: 30: Hoare triple {78393#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {78393#false} is VALID [2022-04-08 10:11:07,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {78393#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {78393#false} is VALID [2022-04-08 10:11:07,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {78393#false} assume !(~x~0 % 4294967296 > 0); {78393#false} is VALID [2022-04-08 10:11:07,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {78393#false} assume !(~z~0 % 4294967296 > 0); {78393#false} is VALID [2022-04-08 10:11:07,894 INFO L272 TraceCheckUtils]: 34: Hoare triple {78393#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {78393#false} is VALID [2022-04-08 10:11:07,894 INFO L290 TraceCheckUtils]: 35: Hoare triple {78393#false} ~cond := #in~cond; {78393#false} is VALID [2022-04-08 10:11:07,894 INFO L290 TraceCheckUtils]: 36: Hoare triple {78393#false} assume 0 == ~cond; {78393#false} is VALID [2022-04-08 10:11:07,895 INFO L290 TraceCheckUtils]: 37: Hoare triple {78393#false} assume !false; {78393#false} is VALID [2022-04-08 10:11:07,895 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 10:11:07,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:11:07,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683315769] [2022-04-08 10:11:07,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683315769] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:11:07,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274012606] [2022-04-08 10:11:07,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:11:07,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:07,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:11:07,899 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:11:07,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-04-08 10:11:07,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:11:07,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:11:07,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 10:11:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:07,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:11:08,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {78392#true} call ULTIMATE.init(); {78392#true} is VALID [2022-04-08 10:11:08,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {78392#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {78392#true} is VALID [2022-04-08 10:11:08,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {78392#true} assume true; {78392#true} is VALID [2022-04-08 10:11:08,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78392#true} {78392#true} #83#return; {78392#true} is VALID [2022-04-08 10:11:08,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {78392#true} call #t~ret15 := main(); {78392#true} is VALID [2022-04-08 10:11:08,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {78392#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {78397#(= main_~y~0 0)} is VALID [2022-04-08 10:11:08,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {78397#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78398#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:08,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {78398#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78399#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:08,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {78399#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78400#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:08,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {78400#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78401#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:08,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {78401#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78402#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:08,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {78402#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78403#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:08,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {78403#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78404#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:08,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {78404#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78405#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:08,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {78405#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78406#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:08,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {78406#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {78406#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:08,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {78406#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {78407#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:11:08,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {78407#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78408#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:11:08,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {78408#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78468#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:11:08,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {78468#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {78468#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:11:08,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {78468#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78408#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:11:08,447 INFO L290 TraceCheckUtils]: 21: Hoare triple {78408#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78407#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:11:08,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {78407#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78481#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:11:08,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {78481#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78485#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:11:08,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {78485#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78489#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:11:08,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {78489#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78493#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:11:08,450 INFO L290 TraceCheckUtils]: 26: Hoare triple {78493#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78497#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:11:08,450 INFO L290 TraceCheckUtils]: 27: Hoare triple {78497#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78501#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:11:08,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {78501#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78505#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:11:08,451 INFO L290 TraceCheckUtils]: 29: Hoare triple {78505#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~y~0 % 4294967296 > 0); {78505#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:11:08,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {78505#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {78505#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:11:08,452 INFO L290 TraceCheckUtils]: 31: Hoare triple {78505#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {78505#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:11:08,452 INFO L290 TraceCheckUtils]: 32: Hoare triple {78505#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~x~0 % 4294967296 > 0); {78505#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:11:08,453 INFO L290 TraceCheckUtils]: 33: Hoare triple {78505#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~z~0 % 4294967296 > 0); {78393#false} is VALID [2022-04-08 10:11:08,453 INFO L272 TraceCheckUtils]: 34: Hoare triple {78393#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {78393#false} is VALID [2022-04-08 10:11:08,453 INFO L290 TraceCheckUtils]: 35: Hoare triple {78393#false} ~cond := #in~cond; {78393#false} is VALID [2022-04-08 10:11:08,453 INFO L290 TraceCheckUtils]: 36: Hoare triple {78393#false} assume 0 == ~cond; {78393#false} is VALID [2022-04-08 10:11:08,453 INFO L290 TraceCheckUtils]: 37: Hoare triple {78393#false} assume !false; {78393#false} is VALID [2022-04-08 10:11:08,453 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:11:08,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:11:09,026 INFO L290 TraceCheckUtils]: 37: Hoare triple {78393#false} assume !false; {78393#false} is VALID [2022-04-08 10:11:09,026 INFO L290 TraceCheckUtils]: 36: Hoare triple {78393#false} assume 0 == ~cond; {78393#false} is VALID [2022-04-08 10:11:09,026 INFO L290 TraceCheckUtils]: 35: Hoare triple {78393#false} ~cond := #in~cond; {78393#false} is VALID [2022-04-08 10:11:09,026 INFO L272 TraceCheckUtils]: 34: Hoare triple {78393#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {78393#false} is VALID [2022-04-08 10:11:09,027 INFO L290 TraceCheckUtils]: 33: Hoare triple {78545#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {78393#false} is VALID [2022-04-08 10:11:09,027 INFO L290 TraceCheckUtils]: 32: Hoare triple {78545#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {78545#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:11:09,027 INFO L290 TraceCheckUtils]: 31: Hoare triple {78545#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {78545#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:11:09,027 INFO L290 TraceCheckUtils]: 30: Hoare triple {78545#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {78545#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:11:09,028 INFO L290 TraceCheckUtils]: 29: Hoare triple {78545#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {78545#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:11:09,028 INFO L290 TraceCheckUtils]: 28: Hoare triple {78561#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78545#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:11:09,029 INFO L290 TraceCheckUtils]: 27: Hoare triple {78565#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78561#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-08 10:11:09,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {78569#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78565#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-08 10:11:09,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {78573#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78569#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-08 10:11:09,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {78577#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78573#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-08 10:11:09,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {78581#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78577#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-08 10:11:09,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {78585#(< 0 (mod (+ 7 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78581#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-08 10:11:09,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {78589#(< 0 (mod (+ main_~z~0 8) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78585#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-08 10:11:09,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {78593#(< 0 (mod (+ main_~z~0 9) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78589#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-08 10:11:09,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {78593#(< 0 (mod (+ main_~z~0 9) 4294967296))} assume !(~z~0 % 4294967296 > 0); {78593#(< 0 (mod (+ main_~z~0 9) 4294967296))} is VALID [2022-04-08 10:11:09,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {78589#(< 0 (mod (+ main_~z~0 8) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78593#(< 0 (mod (+ main_~z~0 9) 4294967296))} is VALID [2022-04-08 10:11:09,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {78585#(< 0 (mod (+ 7 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78589#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-08 10:11:09,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {78606#(< 0 (mod (+ 7 main_~y~0) 4294967296))} ~z~0 := ~y~0; {78585#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-08 10:11:09,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {78606#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {78606#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:09,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {78613#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78606#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:09,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {78617#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78613#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:11:09,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {78621#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78617#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:11:09,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {78625#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78621#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:11:09,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {78629#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78625#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:11:09,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {78633#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78629#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:11:09,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {78637#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78633#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:11:09,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {78641#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78637#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:11:09,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {78645#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78641#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:11:09,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {78392#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {78645#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:11:09,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {78392#true} call #t~ret15 := main(); {78392#true} is VALID [2022-04-08 10:11:09,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78392#true} {78392#true} #83#return; {78392#true} is VALID [2022-04-08 10:11:09,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {78392#true} assume true; {78392#true} is VALID [2022-04-08 10:11:09,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {78392#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {78392#true} is VALID [2022-04-08 10:11:09,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {78392#true} call ULTIMATE.init(); {78392#true} is VALID [2022-04-08 10:11:09,042 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:11:09,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274012606] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:11:09,042 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:11:09,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22, 22] total 44 [2022-04-08 10:11:09,042 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:11:09,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [109584755] [2022-04-08 10:11:09,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [109584755] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:11:09,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:11:09,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:11:09,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470588062] [2022-04-08 10:11:09,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:11:09,043 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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 38 [2022-04-08 10:11:09,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:11:09,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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-08 10:11:09,061 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-08 10:11:09,061 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:11:09,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:09,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:11:09,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1596, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:11:09,061 INFO L87 Difference]: Start difference. First operand 309 states and 394 transitions. Second operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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-08 10:11:15,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:15,369 INFO L93 Difference]: Finished difference Result 503 states and 633 transitions. [2022-04-08 10:11:15,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 10:11:15,369 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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 38 [2022-04-08 10:11:15,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:11:15,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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-08 10:11:15,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 128 transitions. [2022-04-08 10:11:15,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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-08 10:11:15,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 128 transitions. [2022-04-08 10:11:15,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 128 transitions. [2022-04-08 10:11:15,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:15,482 INFO L225 Difference]: With dead ends: 503 [2022-04-08 10:11:15,482 INFO L226 Difference]: Without dead ends: 484 [2022-04-08 10:11:15,483 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=571, Invalid=2969, Unknown=0, NotChecked=0, Total=3540 [2022-04-08 10:11:15,483 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 82 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:11:15,483 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 110 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:11:15,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2022-04-08 10:11:16,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 309. [2022-04-08 10:11:16,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:11:16,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 484 states. Second operand has 309 states, 304 states have (on average 1.2796052631578947) internal successors, (389), 304 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:16,949 INFO L74 IsIncluded]: Start isIncluded. First operand 484 states. Second operand has 309 states, 304 states have (on average 1.2796052631578947) internal successors, (389), 304 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:16,950 INFO L87 Difference]: Start difference. First operand 484 states. Second operand has 309 states, 304 states have (on average 1.2796052631578947) internal successors, (389), 304 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:16,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:16,958 INFO L93 Difference]: Finished difference Result 484 states and 613 transitions. [2022-04-08 10:11:16,958 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 613 transitions. [2022-04-08 10:11:16,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:16,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:16,958 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 304 states have (on average 1.2796052631578947) internal successors, (389), 304 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 484 states. [2022-04-08 10:11:16,959 INFO L87 Difference]: Start difference. First operand has 309 states, 304 states have (on average 1.2796052631578947) internal successors, (389), 304 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 484 states. [2022-04-08 10:11:16,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:16,966 INFO L93 Difference]: Finished difference Result 484 states and 613 transitions. [2022-04-08 10:11:16,966 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 613 transitions. [2022-04-08 10:11:16,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:16,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:16,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:11:16,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:11:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 304 states have (on average 1.2796052631578947) internal successors, (389), 304 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:16,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 393 transitions. [2022-04-08 10:11:16,971 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 393 transitions. Word has length 38 [2022-04-08 10:11:16,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:11:16,971 INFO L478 AbstractCegarLoop]: Abstraction has 309 states and 393 transitions. [2022-04-08 10:11:16,971 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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-08 10:11:16,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 393 transitions. [2022-04-08 10:11:18,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 393 edges. 393 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:18,720 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 393 transitions. [2022-04-08 10:11:18,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 10:11:18,721 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:11:18,721 INFO L499 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:11:18,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-04-08 10:11:18,921 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-04-08 10:11:18,921 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:11:18,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:11:18,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1963340210, now seen corresponding path program 57 times [2022-04-08 10:11:18,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:18,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1993777580] [2022-04-08 10:11:18,924 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:11:18,924 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:11:18,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1963340210, now seen corresponding path program 58 times [2022-04-08 10:11:18,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:11:18,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25034016] [2022-04-08 10:11:18,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:11:18,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:11:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:19,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:11:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:19,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {81317#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {81290#true} is VALID [2022-04-08 10:11:19,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {81290#true} assume true; {81290#true} is VALID [2022-04-08 10:11:19,348 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {81290#true} {81290#true} #83#return; {81290#true} is VALID [2022-04-08 10:11:19,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {81290#true} call ULTIMATE.init(); {81317#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:11:19,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {81317#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {81290#true} is VALID [2022-04-08 10:11:19,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {81290#true} assume true; {81290#true} is VALID [2022-04-08 10:11:19,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81290#true} {81290#true} #83#return; {81290#true} is VALID [2022-04-08 10:11:19,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {81290#true} call #t~ret15 := main(); {81290#true} is VALID [2022-04-08 10:11:19,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {81290#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {81295#(= main_~y~0 0)} is VALID [2022-04-08 10:11:19,350 INFO L290 TraceCheckUtils]: 6: Hoare triple {81295#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81296#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:19,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {81296#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81297#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:19,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {81297#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81298#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:19,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {81298#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81299#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:19,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {81299#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81300#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:19,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {81300#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81301#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:19,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {81301#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81302#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:19,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {81302#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81303#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:19,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {81303#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81304#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:19,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {81304#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81305#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:19,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {81305#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81306#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:19,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {81306#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81307#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:19,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {81307#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81308#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:19,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {81308#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81309#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:19,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {81309#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81310#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:11:19,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {81310#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81311#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:11:19,358 INFO L290 TraceCheckUtils]: 22: Hoare triple {81311#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81312#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:11:19,359 INFO L290 TraceCheckUtils]: 23: Hoare triple {81312#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81313#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:11:19,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {81313#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81314#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:11:19,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {81314#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {81314#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:11:19,360 INFO L290 TraceCheckUtils]: 26: Hoare triple {81314#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {81315#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-08 10:11:19,360 INFO L290 TraceCheckUtils]: 27: Hoare triple {81315#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81316#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} is VALID [2022-04-08 10:11:19,361 INFO L290 TraceCheckUtils]: 28: Hoare triple {81316#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {81291#false} is VALID [2022-04-08 10:11:19,361 INFO L290 TraceCheckUtils]: 29: Hoare triple {81291#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81291#false} is VALID [2022-04-08 10:11:19,361 INFO L290 TraceCheckUtils]: 30: Hoare triple {81291#false} assume !(~y~0 % 4294967296 > 0); {81291#false} is VALID [2022-04-08 10:11:19,361 INFO L290 TraceCheckUtils]: 31: Hoare triple {81291#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {81291#false} is VALID [2022-04-08 10:11:19,361 INFO L290 TraceCheckUtils]: 32: Hoare triple {81291#false} assume !(~x~0 % 4294967296 > 0); {81291#false} is VALID [2022-04-08 10:11:19,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {81291#false} assume !(~z~0 % 4294967296 > 0); {81291#false} is VALID [2022-04-08 10:11:19,361 INFO L272 TraceCheckUtils]: 34: Hoare triple {81291#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {81291#false} is VALID [2022-04-08 10:11:19,361 INFO L290 TraceCheckUtils]: 35: Hoare triple {81291#false} ~cond := #in~cond; {81291#false} is VALID [2022-04-08 10:11:19,361 INFO L290 TraceCheckUtils]: 36: Hoare triple {81291#false} assume 0 == ~cond; {81291#false} is VALID [2022-04-08 10:11:19,361 INFO L290 TraceCheckUtils]: 37: Hoare triple {81291#false} assume !false; {81291#false} is VALID [2022-04-08 10:11:19,361 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 191 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:11:19,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:11:19,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25034016] [2022-04-08 10:11:19,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25034016] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:11:19,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685822833] [2022-04-08 10:11:19,362 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:11:19,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:19,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:11:19,363 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:11:19,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-04-08 10:11:19,404 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:11:19,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:11:19,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 10:11:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:19,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:11:19,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {81290#true} call ULTIMATE.init(); {81290#true} is VALID [2022-04-08 10:11:19,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {81290#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {81290#true} is VALID [2022-04-08 10:11:19,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {81290#true} assume true; {81290#true} is VALID [2022-04-08 10:11:19,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81290#true} {81290#true} #83#return; {81290#true} is VALID [2022-04-08 10:11:19,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {81290#true} call #t~ret15 := main(); {81290#true} is VALID [2022-04-08 10:11:19,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {81290#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {81295#(= main_~y~0 0)} is VALID [2022-04-08 10:11:19,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {81295#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81296#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:19,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {81296#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81297#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:19,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {81297#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81298#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:19,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {81298#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81299#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:19,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {81299#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81300#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:19,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {81300#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81301#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:19,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {81301#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81302#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:19,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {81302#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81303#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:19,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {81303#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81304#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:19,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {81304#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81305#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:19,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {81305#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81306#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:19,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {81306#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81307#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:19,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {81307#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81308#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:19,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {81308#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81309#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:19,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {81309#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81310#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:11:19,736 INFO L290 TraceCheckUtils]: 21: Hoare triple {81310#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81311#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:11:19,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {81311#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81312#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:11:19,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {81312#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81313#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:11:19,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {81313#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81314#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:11:19,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {81314#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {81314#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:11:19,738 INFO L290 TraceCheckUtils]: 26: Hoare triple {81314#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {81315#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-08 10:11:19,738 INFO L290 TraceCheckUtils]: 27: Hoare triple {81315#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81402#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-08 10:11:19,739 INFO L290 TraceCheckUtils]: 28: Hoare triple {81402#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !(~z~0 % 4294967296 > 0); {81291#false} is VALID [2022-04-08 10:11:19,739 INFO L290 TraceCheckUtils]: 29: Hoare triple {81291#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81291#false} is VALID [2022-04-08 10:11:19,739 INFO L290 TraceCheckUtils]: 30: Hoare triple {81291#false} assume !(~y~0 % 4294967296 > 0); {81291#false} is VALID [2022-04-08 10:11:19,739 INFO L290 TraceCheckUtils]: 31: Hoare triple {81291#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {81291#false} is VALID [2022-04-08 10:11:19,739 INFO L290 TraceCheckUtils]: 32: Hoare triple {81291#false} assume !(~x~0 % 4294967296 > 0); {81291#false} is VALID [2022-04-08 10:11:19,739 INFO L290 TraceCheckUtils]: 33: Hoare triple {81291#false} assume !(~z~0 % 4294967296 > 0); {81291#false} is VALID [2022-04-08 10:11:19,739 INFO L272 TraceCheckUtils]: 34: Hoare triple {81291#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {81291#false} is VALID [2022-04-08 10:11:19,739 INFO L290 TraceCheckUtils]: 35: Hoare triple {81291#false} ~cond := #in~cond; {81291#false} is VALID [2022-04-08 10:11:19,739 INFO L290 TraceCheckUtils]: 36: Hoare triple {81291#false} assume 0 == ~cond; {81291#false} is VALID [2022-04-08 10:11:19,739 INFO L290 TraceCheckUtils]: 37: Hoare triple {81291#false} assume !false; {81291#false} is VALID [2022-04-08 10:11:19,740 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 191 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:11:19,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:11:20,605 INFO L290 TraceCheckUtils]: 37: Hoare triple {81291#false} assume !false; {81291#false} is VALID [2022-04-08 10:11:20,606 INFO L290 TraceCheckUtils]: 36: Hoare triple {81291#false} assume 0 == ~cond; {81291#false} is VALID [2022-04-08 10:11:20,606 INFO L290 TraceCheckUtils]: 35: Hoare triple {81291#false} ~cond := #in~cond; {81291#false} is VALID [2022-04-08 10:11:20,606 INFO L272 TraceCheckUtils]: 34: Hoare triple {81291#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {81291#false} is VALID [2022-04-08 10:11:20,606 INFO L290 TraceCheckUtils]: 33: Hoare triple {81291#false} assume !(~z~0 % 4294967296 > 0); {81291#false} is VALID [2022-04-08 10:11:20,606 INFO L290 TraceCheckUtils]: 32: Hoare triple {81291#false} assume !(~x~0 % 4294967296 > 0); {81291#false} is VALID [2022-04-08 10:11:20,606 INFO L290 TraceCheckUtils]: 31: Hoare triple {81291#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {81291#false} is VALID [2022-04-08 10:11:20,606 INFO L290 TraceCheckUtils]: 30: Hoare triple {81291#false} assume !(~y~0 % 4294967296 > 0); {81291#false} is VALID [2022-04-08 10:11:20,606 INFO L290 TraceCheckUtils]: 29: Hoare triple {81291#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81291#false} is VALID [2022-04-08 10:11:20,606 INFO L290 TraceCheckUtils]: 28: Hoare triple {81460#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {81291#false} is VALID [2022-04-08 10:11:20,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {81464#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81460#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:11:20,608 INFO L290 TraceCheckUtils]: 26: Hoare triple {81468#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {81464#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:11:20,608 INFO L290 TraceCheckUtils]: 25: Hoare triple {81468#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {81468#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:11:20,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {81475#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81468#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:11:20,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {81479#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81475#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:11:20,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {81483#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81479#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:11:20,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {81487#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81483#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:11:20,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {81491#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81487#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:11:20,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {81495#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81491#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:11:20,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {81499#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81495#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:20,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {81503#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81499#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:11:20,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {81507#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81503#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:20,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {81511#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81507#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:11:20,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {81515#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81511#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:11:20,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {81519#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81515#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:11:20,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {81523#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81519#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:11:20,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {81527#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81523#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:11:20,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {81531#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81527#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:11:20,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {81535#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81531#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:11:20,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {81539#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81535#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:11:20,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {81543#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81539#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:11:20,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {81547#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81543#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:11:20,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {81290#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {81547#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:11:20,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {81290#true} call #t~ret15 := main(); {81290#true} is VALID [2022-04-08 10:11:20,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81290#true} {81290#true} #83#return; {81290#true} is VALID [2022-04-08 10:11:20,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {81290#true} assume true; {81290#true} is VALID [2022-04-08 10:11:20,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {81290#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {81290#true} is VALID [2022-04-08 10:11:20,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {81290#true} call ULTIMATE.init(); {81290#true} is VALID [2022-04-08 10:11:20,621 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 191 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:11:20,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685822833] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:11:20,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:11:20,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-08 10:11:20,621 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:11:20,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1993777580] [2022-04-08 10:11:20,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1993777580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:11:20,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:11:20,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 10:11:20,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729923879] [2022-04-08 10:11:20,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:11:20,622 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.36) internal successors, (34), 24 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-08 10:11:20,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:11:20,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.36) internal successors, (34), 24 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-08 10:11:20,645 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-08 10:11:20,645 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 10:11:20,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:20,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 10:11:20,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=1757, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:11:20,645 INFO L87 Difference]: Start difference. First operand 309 states and 393 transitions. Second operand has 25 states, 25 states have (on average 1.36) internal successors, (34), 24 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-08 10:11:34,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:34,770 INFO L93 Difference]: Finished difference Result 722 states and 1011 transitions. [2022-04-08 10:11:34,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 10:11:34,770 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.36) internal successors, (34), 24 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-08 10:11:34,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:11:34,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.36) internal successors, (34), 24 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-08 10:11:34,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 254 transitions. [2022-04-08 10:11:34,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.36) internal successors, (34), 24 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-08 10:11:34,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 254 transitions. [2022-04-08 10:11:34,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 254 transitions. [2022-04-08 10:11:34,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:34,999 INFO L225 Difference]: With dead ends: 722 [2022-04-08 10:11:34,999 INFO L226 Difference]: Without dead ends: 696 [2022-04-08 10:11:34,999 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1063, Invalid=3907, Unknown=0, NotChecked=0, Total=4970 [2022-04-08 10:11:35,000 INFO L913 BasicCegarLoop]: 114 mSDtfsCounter, 184 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4247 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 4381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 4247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:11:35,000 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 221 Invalid, 4381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 4247 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-08 10:11:35,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2022-04-08 10:11:36,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 323. [2022-04-08 10:11:36,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:11:36,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 696 states. Second operand has 323 states, 318 states have (on average 1.2861635220125787) internal successors, (409), 318 states have internal predecessors, (409), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:36,526 INFO L74 IsIncluded]: Start isIncluded. First operand 696 states. Second operand has 323 states, 318 states have (on average 1.2861635220125787) internal successors, (409), 318 states have internal predecessors, (409), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:36,526 INFO L87 Difference]: Start difference. First operand 696 states. Second operand has 323 states, 318 states have (on average 1.2861635220125787) internal successors, (409), 318 states have internal predecessors, (409), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:36,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:36,539 INFO L93 Difference]: Finished difference Result 696 states and 881 transitions. [2022-04-08 10:11:36,539 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 881 transitions. [2022-04-08 10:11:36,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:36,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:36,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 323 states, 318 states have (on average 1.2861635220125787) internal successors, (409), 318 states have internal predecessors, (409), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 696 states. [2022-04-08 10:11:36,539 INFO L87 Difference]: Start difference. First operand has 323 states, 318 states have (on average 1.2861635220125787) internal successors, (409), 318 states have internal predecessors, (409), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 696 states. [2022-04-08 10:11:36,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:36,552 INFO L93 Difference]: Finished difference Result 696 states and 881 transitions. [2022-04-08 10:11:36,552 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 881 transitions. [2022-04-08 10:11:36,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:36,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:36,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:11:36,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:11:36,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 318 states have (on average 1.2861635220125787) internal successors, (409), 318 states have internal predecessors, (409), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:36,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 413 transitions. [2022-04-08 10:11:36,557 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 413 transitions. Word has length 38 [2022-04-08 10:11:36,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:11:36,557 INFO L478 AbstractCegarLoop]: Abstraction has 323 states and 413 transitions. [2022-04-08 10:11:36,557 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.36) internal successors, (34), 24 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-08 10:11:36,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 323 states and 413 transitions. [2022-04-08 10:11:38,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 413 edges. 413 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:38,627 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 413 transitions. [2022-04-08 10:11:38,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 10:11:38,628 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:11:38,628 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:11:38,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-04-08 10:11:38,828 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-04-08 10:11:38,829 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:11:38,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:11:38,829 INFO L85 PathProgramCache]: Analyzing trace with hash -445243775, now seen corresponding path program 29 times [2022-04-08 10:11:38,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:38,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [474512175] [2022-04-08 10:11:38,832 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:11:38,832 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:11:38,832 INFO L85 PathProgramCache]: Analyzing trace with hash -445243775, now seen corresponding path program 30 times [2022-04-08 10:11:38,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:11:38,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579925875] [2022-04-08 10:11:38,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:11:38,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:11:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:39,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:11:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:39,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {85117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {85096#true} is VALID [2022-04-08 10:11:39,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {85096#true} assume true; {85096#true} is VALID [2022-04-08 10:11:39,132 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {85096#true} {85096#true} #83#return; {85096#true} is VALID [2022-04-08 10:11:39,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {85096#true} call ULTIMATE.init(); {85117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:11:39,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {85117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {85096#true} is VALID [2022-04-08 10:11:39,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {85096#true} assume true; {85096#true} is VALID [2022-04-08 10:11:39,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85096#true} {85096#true} #83#return; {85096#true} is VALID [2022-04-08 10:11:39,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {85096#true} call #t~ret15 := main(); {85096#true} is VALID [2022-04-08 10:11:39,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {85096#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {85101#(= main_~y~0 0)} is VALID [2022-04-08 10:11:39,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {85101#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85102#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:39,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {85102#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85103#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:39,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {85103#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85104#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:39,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {85104#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85105#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:39,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {85105#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85106#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:39,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {85106#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85107#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:39,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {85107#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85108#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:39,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {85108#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85109#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:39,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {85109#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {85109#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:39,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {85109#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {85110#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:11:39,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {85110#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85111#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:11:39,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {85111#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85112#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:11:39,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {85112#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85113#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:11:39,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {85113#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85114#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:11:39,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {85114#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85115#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:11:39,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {85115#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85116#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:11:39,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {85116#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {85097#false} is VALID [2022-04-08 10:11:39,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {85097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85097#false} is VALID [2022-04-08 10:11:39,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {85097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85097#false} is VALID [2022-04-08 10:11:39,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {85097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85097#false} is VALID [2022-04-08 10:11:39,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {85097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85097#false} is VALID [2022-04-08 10:11:39,142 INFO L290 TraceCheckUtils]: 27: Hoare triple {85097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85097#false} is VALID [2022-04-08 10:11:39,142 INFO L290 TraceCheckUtils]: 28: Hoare triple {85097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85097#false} is VALID [2022-04-08 10:11:39,142 INFO L290 TraceCheckUtils]: 29: Hoare triple {85097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85097#false} is VALID [2022-04-08 10:11:39,142 INFO L290 TraceCheckUtils]: 30: Hoare triple {85097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85097#false} is VALID [2022-04-08 10:11:39,142 INFO L290 TraceCheckUtils]: 31: Hoare triple {85097#false} assume !(~y~0 % 4294967296 > 0); {85097#false} is VALID [2022-04-08 10:11:39,142 INFO L290 TraceCheckUtils]: 32: Hoare triple {85097#false} assume !(~x~0 % 4294967296 > 0); {85097#false} is VALID [2022-04-08 10:11:39,142 INFO L290 TraceCheckUtils]: 33: Hoare triple {85097#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {85097#false} is VALID [2022-04-08 10:11:39,142 INFO L290 TraceCheckUtils]: 34: Hoare triple {85097#false} assume !(~z~0 % 4294967296 > 0); {85097#false} is VALID [2022-04-08 10:11:39,142 INFO L272 TraceCheckUtils]: 35: Hoare triple {85097#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {85097#false} is VALID [2022-04-08 10:11:39,142 INFO L290 TraceCheckUtils]: 36: Hoare triple {85097#false} ~cond := #in~cond; {85097#false} is VALID [2022-04-08 10:11:39,142 INFO L290 TraceCheckUtils]: 37: Hoare triple {85097#false} assume 0 == ~cond; {85097#false} is VALID [2022-04-08 10:11:39,142 INFO L290 TraceCheckUtils]: 38: Hoare triple {85097#false} assume !false; {85097#false} is VALID [2022-04-08 10:11:39,142 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-08 10:11:39,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:11:39,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579925875] [2022-04-08 10:11:39,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579925875] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:11:39,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198810062] [2022-04-08 10:11:39,143 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:11:39,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:39,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:11:39,144 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:11:39,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-04-08 10:11:39,265 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:11:39,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:11:39,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 10:11:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:39,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:11:39,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {85096#true} call ULTIMATE.init(); {85096#true} is VALID [2022-04-08 10:11:39,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {85096#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {85096#true} is VALID [2022-04-08 10:11:39,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {85096#true} assume true; {85096#true} is VALID [2022-04-08 10:11:39,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85096#true} {85096#true} #83#return; {85096#true} is VALID [2022-04-08 10:11:39,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {85096#true} call #t~ret15 := main(); {85096#true} is VALID [2022-04-08 10:11:39,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {85096#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {85096#true} is VALID [2022-04-08 10:11:39,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {85096#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85096#true} is VALID [2022-04-08 10:11:39,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {85096#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85096#true} is VALID [2022-04-08 10:11:39,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {85096#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85145#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:11:39,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {85145#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85149#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:11:39,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {85149#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85153#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:11:39,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {85153#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85157#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:11:39,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {85157#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85161#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:11:39,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {85161#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85165#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:11:39,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {85165#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {85165#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:11:39,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {85165#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {85165#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:11:39,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {85165#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85161#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:11:39,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {85161#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85157#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:11:39,527 INFO L290 TraceCheckUtils]: 18: Hoare triple {85157#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85153#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:11:39,527 INFO L290 TraceCheckUtils]: 19: Hoare triple {85153#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85149#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:11:39,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {85149#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85145#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:11:39,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {85145#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:39,529 INFO L290 TraceCheckUtils]: 22: Hoare triple {85190#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:39,529 INFO L290 TraceCheckUtils]: 23: Hoare triple {85190#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:39,529 INFO L290 TraceCheckUtils]: 24: Hoare triple {85190#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:39,530 INFO L290 TraceCheckUtils]: 25: Hoare triple {85190#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:39,530 INFO L290 TraceCheckUtils]: 26: Hoare triple {85190#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:39,530 INFO L290 TraceCheckUtils]: 27: Hoare triple {85190#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:39,530 INFO L290 TraceCheckUtils]: 28: Hoare triple {85190#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:39,531 INFO L290 TraceCheckUtils]: 29: Hoare triple {85190#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:39,531 INFO L290 TraceCheckUtils]: 30: Hoare triple {85190#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:39,531 INFO L290 TraceCheckUtils]: 31: Hoare triple {85190#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:39,531 INFO L290 TraceCheckUtils]: 32: Hoare triple {85190#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {85097#false} is VALID [2022-04-08 10:11:39,532 INFO L290 TraceCheckUtils]: 33: Hoare triple {85097#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {85097#false} is VALID [2022-04-08 10:11:39,532 INFO L290 TraceCheckUtils]: 34: Hoare triple {85097#false} assume !(~z~0 % 4294967296 > 0); {85097#false} is VALID [2022-04-08 10:11:39,532 INFO L272 TraceCheckUtils]: 35: Hoare triple {85097#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {85097#false} is VALID [2022-04-08 10:11:39,532 INFO L290 TraceCheckUtils]: 36: Hoare triple {85097#false} ~cond := #in~cond; {85097#false} is VALID [2022-04-08 10:11:39,532 INFO L290 TraceCheckUtils]: 37: Hoare triple {85097#false} assume 0 == ~cond; {85097#false} is VALID [2022-04-08 10:11:39,532 INFO L290 TraceCheckUtils]: 38: Hoare triple {85097#false} assume !false; {85097#false} is VALID [2022-04-08 10:11:39,532 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 10:11:39,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:11:39,654 INFO L290 TraceCheckUtils]: 38: Hoare triple {85097#false} assume !false; {85097#false} is VALID [2022-04-08 10:11:39,655 INFO L290 TraceCheckUtils]: 37: Hoare triple {85097#false} assume 0 == ~cond; {85097#false} is VALID [2022-04-08 10:11:39,655 INFO L290 TraceCheckUtils]: 36: Hoare triple {85097#false} ~cond := #in~cond; {85097#false} is VALID [2022-04-08 10:11:39,655 INFO L272 TraceCheckUtils]: 35: Hoare triple {85097#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {85097#false} is VALID [2022-04-08 10:11:39,655 INFO L290 TraceCheckUtils]: 34: Hoare triple {85097#false} assume !(~z~0 % 4294967296 > 0); {85097#false} is VALID [2022-04-08 10:11:39,655 INFO L290 TraceCheckUtils]: 33: Hoare triple {85097#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {85097#false} is VALID [2022-04-08 10:11:39,655 INFO L290 TraceCheckUtils]: 32: Hoare triple {85190#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {85097#false} is VALID [2022-04-08 10:11:39,655 INFO L290 TraceCheckUtils]: 31: Hoare triple {85190#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:39,656 INFO L290 TraceCheckUtils]: 30: Hoare triple {85190#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:39,656 INFO L290 TraceCheckUtils]: 29: Hoare triple {85190#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:39,656 INFO L290 TraceCheckUtils]: 28: Hoare triple {85190#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:39,656 INFO L290 TraceCheckUtils]: 27: Hoare triple {85190#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:39,657 INFO L290 TraceCheckUtils]: 26: Hoare triple {85190#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:39,657 INFO L290 TraceCheckUtils]: 25: Hoare triple {85190#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:39,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {85190#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:39,657 INFO L290 TraceCheckUtils]: 23: Hoare triple {85190#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:39,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {85190#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:39,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {85145#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85190#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:39,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {85149#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85145#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:11:39,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {85153#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85149#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:11:39,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {85157#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85153#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:11:39,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {85161#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85157#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:11:39,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {85165#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85161#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:11:39,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {85165#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {85165#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:11:39,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {85165#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {85165#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:11:39,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {85161#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85165#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:11:39,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {85157#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85161#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:11:39,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {85153#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85157#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:11:39,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {85149#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85153#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:11:39,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {85145#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85149#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:11:39,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {85096#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85145#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:11:39,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {85096#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85096#true} is VALID [2022-04-08 10:11:39,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {85096#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85096#true} is VALID [2022-04-08 10:11:39,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {85096#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {85096#true} is VALID [2022-04-08 10:11:39,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {85096#true} call #t~ret15 := main(); {85096#true} is VALID [2022-04-08 10:11:39,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85096#true} {85096#true} #83#return; {85096#true} is VALID [2022-04-08 10:11:39,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {85096#true} assume true; {85096#true} is VALID [2022-04-08 10:11:39,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {85096#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {85096#true} is VALID [2022-04-08 10:11:39,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {85096#true} call ULTIMATE.init(); {85096#true} is VALID [2022-04-08 10:11:39,666 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 10:11:39,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198810062] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:11:39,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:11:39,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9, 9] total 26 [2022-04-08 10:11:39,667 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:11:39,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [474512175] [2022-04-08 10:11:39,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [474512175] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:11:39,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:11:39,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:11:39,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626850279] [2022-04-08 10:11:39,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:11:39,667 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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 39 [2022-04-08 10:11:39,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:11:39,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-08 10:11:39,688 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-08 10:11:39,688 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:11:39,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:39,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:11:39,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:11:39,688 INFO L87 Difference]: Start difference. First operand 323 states and 413 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-08 10:11:46,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:46,451 INFO L93 Difference]: Finished difference Result 486 states and 619 transitions. [2022-04-08 10:11:46,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-08 10:11:46,452 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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 39 [2022-04-08 10:11:46,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:11:46,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-08 10:11:46,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 135 transitions. [2022-04-08 10:11:46,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-08 10:11:46,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 135 transitions. [2022-04-08 10:11:46,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 135 transitions. [2022-04-08 10:11:46,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:46,582 INFO L225 Difference]: With dead ends: 486 [2022-04-08 10:11:46,582 INFO L226 Difference]: Without dead ends: 440 [2022-04-08 10:11:46,582 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=259, Invalid=2933, Unknown=0, NotChecked=0, Total=3192 [2022-04-08 10:11:46,583 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 70 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1527 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:11:46,583 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 128 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1527 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-08 10:11:46,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-04-08 10:11:48,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 324. [2022-04-08 10:11:48,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:11:48,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 440 states. Second operand has 324 states, 319 states have (on average 1.2789968652037618) internal successors, (408), 319 states have internal predecessors, (408), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:48,099 INFO L74 IsIncluded]: Start isIncluded. First operand 440 states. Second operand has 324 states, 319 states have (on average 1.2789968652037618) internal successors, (408), 319 states have internal predecessors, (408), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:48,099 INFO L87 Difference]: Start difference. First operand 440 states. Second operand has 324 states, 319 states have (on average 1.2789968652037618) internal successors, (408), 319 states have internal predecessors, (408), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:48,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:48,105 INFO L93 Difference]: Finished difference Result 440 states and 568 transitions. [2022-04-08 10:11:48,105 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 568 transitions. [2022-04-08 10:11:48,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:48,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:48,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 324 states, 319 states have (on average 1.2789968652037618) internal successors, (408), 319 states have internal predecessors, (408), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 440 states. [2022-04-08 10:11:48,106 INFO L87 Difference]: Start difference. First operand has 324 states, 319 states have (on average 1.2789968652037618) internal successors, (408), 319 states have internal predecessors, (408), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 440 states. [2022-04-08 10:11:48,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:48,112 INFO L93 Difference]: Finished difference Result 440 states and 568 transitions. [2022-04-08 10:11:48,112 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 568 transitions. [2022-04-08 10:11:48,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:48,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:48,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:11:48,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:11:48,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 319 states have (on average 1.2789968652037618) internal successors, (408), 319 states have internal predecessors, (408), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:48,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 412 transitions. [2022-04-08 10:11:48,117 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 412 transitions. Word has length 39 [2022-04-08 10:11:48,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:11:48,118 INFO L478 AbstractCegarLoop]: Abstraction has 324 states and 412 transitions. [2022-04-08 10:11:48,118 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-08 10:11:48,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 324 states and 412 transitions. [2022-04-08 10:11:50,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 412 edges. 412 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:50,072 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 412 transitions. [2022-04-08 10:11:50,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 10:11:50,072 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:11:50,072 INFO L499 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:11:50,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-04-08 10:11:50,272 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:50,273 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:11:50,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:11:50,273 INFO L85 PathProgramCache]: Analyzing trace with hash 218017535, now seen corresponding path program 59 times [2022-04-08 10:11:50,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:50,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [958054625] [2022-04-08 10:11:50,275 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:11:50,275 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:11:50,275 INFO L85 PathProgramCache]: Analyzing trace with hash 218017535, now seen corresponding path program 60 times [2022-04-08 10:11:50,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:11:50,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518550269] [2022-04-08 10:11:50,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:11:50,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:11:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:50,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:11:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:50,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {87948#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {87920#true} is VALID [2022-04-08 10:11:50,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {87920#true} assume true; {87920#true} is VALID [2022-04-08 10:11:50,665 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87920#true} {87920#true} #83#return; {87920#true} is VALID [2022-04-08 10:11:50,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {87920#true} call ULTIMATE.init(); {87948#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:11:50,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {87948#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {87920#true} is VALID [2022-04-08 10:11:50,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {87920#true} assume true; {87920#true} is VALID [2022-04-08 10:11:50,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87920#true} {87920#true} #83#return; {87920#true} is VALID [2022-04-08 10:11:50,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {87920#true} call #t~ret15 := main(); {87920#true} is VALID [2022-04-08 10:11:50,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {87920#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {87925#(= main_~y~0 0)} is VALID [2022-04-08 10:11:50,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {87925#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87926#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:50,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {87926#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87927#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:50,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {87927#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87928#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:50,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {87928#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87929#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:50,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {87929#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87930#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:50,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {87930#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87931#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:50,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {87931#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87932#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:50,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {87932#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87933#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:50,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {87933#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87934#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:50,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {87934#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87935#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:50,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {87935#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87936#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:50,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {87936#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87937#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:50,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {87937#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87938#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:50,673 INFO L290 TraceCheckUtils]: 19: Hoare triple {87938#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87939#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:50,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {87939#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87940#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:11:50,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {87940#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87941#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:11:50,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {87941#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87942#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:11:50,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {87942#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87943#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:11:50,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {87943#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87944#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:11:50,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {87944#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87945#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:11:50,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {87945#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~x~0 % 4294967296 > 0); {87945#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:11:50,677 INFO L290 TraceCheckUtils]: 27: Hoare triple {87945#(and (<= 20 main_~y~0) (<= main_~y~0 20))} ~z~0 := ~y~0; {87946#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-08 10:11:50,677 INFO L290 TraceCheckUtils]: 28: Hoare triple {87946#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87947#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:11:50,678 INFO L290 TraceCheckUtils]: 29: Hoare triple {87947#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {87921#false} is VALID [2022-04-08 10:11:50,678 INFO L290 TraceCheckUtils]: 30: Hoare triple {87921#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87921#false} is VALID [2022-04-08 10:11:50,678 INFO L290 TraceCheckUtils]: 31: Hoare triple {87921#false} assume !(~y~0 % 4294967296 > 0); {87921#false} is VALID [2022-04-08 10:11:50,678 INFO L290 TraceCheckUtils]: 32: Hoare triple {87921#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {87921#false} is VALID [2022-04-08 10:11:50,678 INFO L290 TraceCheckUtils]: 33: Hoare triple {87921#false} assume !(~x~0 % 4294967296 > 0); {87921#false} is VALID [2022-04-08 10:11:50,678 INFO L290 TraceCheckUtils]: 34: Hoare triple {87921#false} assume !(~z~0 % 4294967296 > 0); {87921#false} is VALID [2022-04-08 10:11:50,678 INFO L272 TraceCheckUtils]: 35: Hoare triple {87921#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {87921#false} is VALID [2022-04-08 10:11:50,678 INFO L290 TraceCheckUtils]: 36: Hoare triple {87921#false} ~cond := #in~cond; {87921#false} is VALID [2022-04-08 10:11:50,678 INFO L290 TraceCheckUtils]: 37: Hoare triple {87921#false} assume 0 == ~cond; {87921#false} is VALID [2022-04-08 10:11:50,678 INFO L290 TraceCheckUtils]: 38: Hoare triple {87921#false} assume !false; {87921#false} is VALID [2022-04-08 10:11:50,678 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:11:50,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:11:50,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518550269] [2022-04-08 10:11:50,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518550269] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:11:50,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433003928] [2022-04-08 10:11:50,679 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:11:50,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:50,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:11:50,680 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:11:50,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-04-08 10:11:50,721 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:11:50,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:11:50,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 10:11:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:50,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:11:51,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {87920#true} call ULTIMATE.init(); {87920#true} is VALID [2022-04-08 10:11:51,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {87920#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {87920#true} is VALID [2022-04-08 10:11:51,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {87920#true} assume true; {87920#true} is VALID [2022-04-08 10:11:51,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87920#true} {87920#true} #83#return; {87920#true} is VALID [2022-04-08 10:11:51,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {87920#true} call #t~ret15 := main(); {87920#true} is VALID [2022-04-08 10:11:51,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {87920#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {87920#true} is VALID [2022-04-08 10:11:51,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,028 INFO L290 TraceCheckUtils]: 24: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,028 INFO L290 TraceCheckUtils]: 25: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,028 INFO L290 TraceCheckUtils]: 26: Hoare triple {87920#true} assume !(~x~0 % 4294967296 > 0); {87920#true} is VALID [2022-04-08 10:11:51,029 INFO L290 TraceCheckUtils]: 27: Hoare triple {87920#true} ~z~0 := ~y~0; {88033#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:11:51,030 INFO L290 TraceCheckUtils]: 28: Hoare triple {88033#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {88037#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:11:51,030 INFO L290 TraceCheckUtils]: 29: Hoare triple {88037#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {88037#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:11:51,031 INFO L290 TraceCheckUtils]: 30: Hoare triple {88037#(= main_~y~0 (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88044#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-08 10:11:51,031 INFO L290 TraceCheckUtils]: 31: Hoare triple {88044#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {88044#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-08 10:11:51,031 INFO L290 TraceCheckUtils]: 32: Hoare triple {88044#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {88033#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:11:51,032 INFO L290 TraceCheckUtils]: 33: Hoare triple {88033#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {88033#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:11:51,032 INFO L290 TraceCheckUtils]: 34: Hoare triple {88033#(= main_~z~0 main_~y~0)} assume !(~z~0 % 4294967296 > 0); {88057#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:11:51,033 INFO L272 TraceCheckUtils]: 35: Hoare triple {88057#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {88061#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:11:51,033 INFO L290 TraceCheckUtils]: 36: Hoare triple {88061#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {88065#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:11:51,033 INFO L290 TraceCheckUtils]: 37: Hoare triple {88065#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {87921#false} is VALID [2022-04-08 10:11:51,033 INFO L290 TraceCheckUtils]: 38: Hoare triple {87921#false} assume !false; {87921#false} is VALID [2022-04-08 10:11:51,033 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-04-08 10:11:51,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:11:51,305 INFO L290 TraceCheckUtils]: 38: Hoare triple {87921#false} assume !false; {87921#false} is VALID [2022-04-08 10:11:51,305 INFO L290 TraceCheckUtils]: 37: Hoare triple {88065#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {87921#false} is VALID [2022-04-08 10:11:51,305 INFO L290 TraceCheckUtils]: 36: Hoare triple {88061#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {88065#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:11:51,306 INFO L272 TraceCheckUtils]: 35: Hoare triple {88057#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {88061#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:11:51,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {88084#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {88057#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:11:51,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {88084#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {88084#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:11:51,307 INFO L290 TraceCheckUtils]: 32: Hoare triple {88091#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {88084#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:11:51,308 INFO L290 TraceCheckUtils]: 31: Hoare triple {88091#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {88091#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-08 10:11:51,308 INFO L290 TraceCheckUtils]: 30: Hoare triple {88098#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88091#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-08 10:11:51,309 INFO L290 TraceCheckUtils]: 29: Hoare triple {88098#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {88098#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-08 10:11:51,309 INFO L290 TraceCheckUtils]: 28: Hoare triple {88084#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {88098#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-08 10:11:51,310 INFO L290 TraceCheckUtils]: 27: Hoare triple {87920#true} ~z~0 := ~y~0; {88084#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:11:51,310 INFO L290 TraceCheckUtils]: 26: Hoare triple {87920#true} assume !(~x~0 % 4294967296 > 0); {87920#true} is VALID [2022-04-08 10:11:51,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {87920#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87920#true} is VALID [2022-04-08 10:11:51,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {87920#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {87920#true} is VALID [2022-04-08 10:11:51,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {87920#true} call #t~ret15 := main(); {87920#true} is VALID [2022-04-08 10:11:51,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87920#true} {87920#true} #83#return; {87920#true} is VALID [2022-04-08 10:11:51,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {87920#true} assume true; {87920#true} is VALID [2022-04-08 10:11:51,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {87920#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {87920#true} is VALID [2022-04-08 10:11:51,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {87920#true} call ULTIMATE.init(); {87920#true} is VALID [2022-04-08 10:11:51,311 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-04-08 10:11:51,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433003928] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:11:51,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:11:51,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 8, 8] total 35 [2022-04-08 10:11:51,312 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:11:51,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [958054625] [2022-04-08 10:11:51,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [958054625] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:11:51,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:11:51,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 10:11:51,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480641651] [2022-04-08 10:11:51,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:11:51,320 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 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-08 10:11:51,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:11:51,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 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-08 10:11:51,346 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-08 10:11:51,346 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 10:11:51,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:51,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 10:11:51,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 10:11:51,346 INFO L87 Difference]: Start difference. First operand 324 states and 412 transitions. Second operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 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-08 10:12:07,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:07,139 INFO L93 Difference]: Finished difference Result 756 states and 1059 transitions. [2022-04-08 10:12:07,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 10:12:07,139 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 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-08 10:12:07,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:12:07,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 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-08 10:12:07,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 266 transitions. [2022-04-08 10:12:07,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 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-08 10:12:07,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 266 transitions. [2022-04-08 10:12:07,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 266 transitions. [2022-04-08 10:12:07,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 266 edges. 266 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:07,381 INFO L225 Difference]: With dead ends: 756 [2022-04-08 10:12:07,381 INFO L226 Difference]: Without dead ends: 730 [2022-04-08 10:12:07,381 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=196, Invalid=3226, Unknown=0, NotChecked=0, Total=3422 [2022-04-08 10:12:07,381 INFO L913 BasicCegarLoop]: 120 mSDtfsCounter, 195 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4904 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 5045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 4904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:12:07,381 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 237 Invalid, 5045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 4904 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-08 10:12:07,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2022-04-08 10:12:08,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 338. [2022-04-08 10:12:08,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:12:08,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 730 states. Second operand has 338 states, 333 states have (on average 1.2852852852852852) internal successors, (428), 333 states have internal predecessors, (428), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:08,955 INFO L74 IsIncluded]: Start isIncluded. First operand 730 states. Second operand has 338 states, 333 states have (on average 1.2852852852852852) internal successors, (428), 333 states have internal predecessors, (428), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:08,955 INFO L87 Difference]: Start difference. First operand 730 states. Second operand has 338 states, 333 states have (on average 1.2852852852852852) internal successors, (428), 333 states have internal predecessors, (428), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:08,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:08,969 INFO L93 Difference]: Finished difference Result 730 states and 924 transitions. [2022-04-08 10:12:08,969 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 924 transitions. [2022-04-08 10:12:08,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:08,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:08,970 INFO L74 IsIncluded]: Start isIncluded. First operand has 338 states, 333 states have (on average 1.2852852852852852) internal successors, (428), 333 states have internal predecessors, (428), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 730 states. [2022-04-08 10:12:08,970 INFO L87 Difference]: Start difference. First operand has 338 states, 333 states have (on average 1.2852852852852852) internal successors, (428), 333 states have internal predecessors, (428), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 730 states. [2022-04-08 10:12:08,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:08,983 INFO L93 Difference]: Finished difference Result 730 states and 924 transitions. [2022-04-08 10:12:08,984 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 924 transitions. [2022-04-08 10:12:08,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:08,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:08,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:12:08,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:12:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 333 states have (on average 1.2852852852852852) internal successors, (428), 333 states have internal predecessors, (428), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:08,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 432 transitions. [2022-04-08 10:12:08,989 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 432 transitions. Word has length 39 [2022-04-08 10:12:08,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:12:08,989 INFO L478 AbstractCegarLoop]: Abstraction has 338 states and 432 transitions. [2022-04-08 10:12:08,989 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 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-08 10:12:08,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 338 states and 432 transitions. [2022-04-08 10:12:11,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 432 edges. 432 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:11,178 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 432 transitions. [2022-04-08 10:12:11,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 10:12:11,179 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:12:11,179 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:12:11,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-04-08 10:12:11,379 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:11,379 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:12:11,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:12:11,380 INFO L85 PathProgramCache]: Analyzing trace with hash -236102046, now seen corresponding path program 31 times [2022-04-08 10:12:11,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:11,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1700843989] [2022-04-08 10:12:11,382 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:12:11,382 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:12:11,382 INFO L85 PathProgramCache]: Analyzing trace with hash -236102046, now seen corresponding path program 32 times [2022-04-08 10:12:11,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:12:11,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142620547] [2022-04-08 10:12:11,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:12:11,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:12:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:11,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:12:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:11,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {91904#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {91887#true} is VALID [2022-04-08 10:12:11,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {91887#true} assume true; {91887#true} is VALID [2022-04-08 10:12:11,588 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {91887#true} {91887#true} #83#return; {91887#true} is VALID [2022-04-08 10:12:11,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {91887#true} call ULTIMATE.init(); {91904#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:12:11,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {91904#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {91887#true} is VALID [2022-04-08 10:12:11,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {91887#true} assume true; {91887#true} is VALID [2022-04-08 10:12:11,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91887#true} {91887#true} #83#return; {91887#true} is VALID [2022-04-08 10:12:11,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {91887#true} call #t~ret15 := main(); {91887#true} is VALID [2022-04-08 10:12:11,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {91887#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {91887#true} is VALID [2022-04-08 10:12:11,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {91887#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91892#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:12:11,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {91892#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91893#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-08 10:12:11,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {91893#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91894#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:12:11,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {91894#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91895#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:12:11,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {91895#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91896#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:12:11,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {91896#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91897#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:12:11,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {91897#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {91897#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:12:11,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {91897#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {91897#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:12:11,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {91897#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91898#(<= (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-08 10:12:11,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {91898#(<= (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91899#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 2) main_~x~0)} is VALID [2022-04-08 10:12:11,601 INFO L290 TraceCheckUtils]: 16: Hoare triple {91899#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 2) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91900#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 3) main_~x~0)} is VALID [2022-04-08 10:12:11,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {91900#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 3) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91901#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-08 10:12:11,602 INFO L290 TraceCheckUtils]: 18: Hoare triple {91901#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91902#(<= (+ 5 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:12:11,603 INFO L290 TraceCheckUtils]: 19: Hoare triple {91902#(<= (+ 5 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:12:11,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:12:11,604 INFO L290 TraceCheckUtils]: 21: Hoare triple {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:12:11,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:12:11,605 INFO L290 TraceCheckUtils]: 23: Hoare triple {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:12:11,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:12:11,606 INFO L290 TraceCheckUtils]: 25: Hoare triple {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:12:11,606 INFO L290 TraceCheckUtils]: 26: Hoare triple {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:12:11,606 INFO L290 TraceCheckUtils]: 27: Hoare triple {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:12:11,607 INFO L290 TraceCheckUtils]: 28: Hoare triple {91903#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {91888#false} is VALID [2022-04-08 10:12:11,607 INFO L290 TraceCheckUtils]: 29: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-08 10:12:11,607 INFO L290 TraceCheckUtils]: 30: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-08 10:12:11,607 INFO L290 TraceCheckUtils]: 31: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-08 10:12:11,607 INFO L290 TraceCheckUtils]: 32: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-08 10:12:11,607 INFO L290 TraceCheckUtils]: 33: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-08 10:12:11,608 INFO L290 TraceCheckUtils]: 34: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-08 10:12:11,608 INFO L290 TraceCheckUtils]: 35: Hoare triple {91888#false} assume !(~z~0 % 4294967296 > 0); {91888#false} is VALID [2022-04-08 10:12:11,608 INFO L272 TraceCheckUtils]: 36: Hoare triple {91888#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {91888#false} is VALID [2022-04-08 10:12:11,608 INFO L290 TraceCheckUtils]: 37: Hoare triple {91888#false} ~cond := #in~cond; {91888#false} is VALID [2022-04-08 10:12:11,608 INFO L290 TraceCheckUtils]: 38: Hoare triple {91888#false} assume 0 == ~cond; {91888#false} is VALID [2022-04-08 10:12:11,608 INFO L290 TraceCheckUtils]: 39: Hoare triple {91888#false} assume !false; {91888#false} is VALID [2022-04-08 10:12:11,608 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-08 10:12:11,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:12:11,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142620547] [2022-04-08 10:12:11,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142620547] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:12:11,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528348383] [2022-04-08 10:12:11,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:12:11,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:11,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:12:11,611 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:12:11,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-04-08 10:12:11,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:12:11,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:12:11,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 10:12:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:11,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:12:12,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {91887#true} call ULTIMATE.init(); {91887#true} is VALID [2022-04-08 10:12:12,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {91887#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {91887#true} is VALID [2022-04-08 10:12:12,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {91887#true} assume true; {91887#true} is VALID [2022-04-08 10:12:12,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91887#true} {91887#true} #83#return; {91887#true} is VALID [2022-04-08 10:12:12,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {91887#true} call #t~ret15 := main(); {91887#true} is VALID [2022-04-08 10:12:12,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {91887#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {91887#true} is VALID [2022-04-08 10:12:12,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {91887#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91892#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:12:12,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {91892#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91929#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:12:12,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {91929#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91933#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:12,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {91933#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:12:12,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {91937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91941#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:12,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {91941#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91945#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:12:12,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {91945#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !(~x~0 % 4294967296 > 0); {91945#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:12:12,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {91945#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} ~z~0 := ~y~0; {91945#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:12:12,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {91945#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91941#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:12,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {91941#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:12:12,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {91937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91933#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:12,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {91933#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91929#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:12:12,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {91929#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91892#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:12:12,056 INFO L290 TraceCheckUtils]: 19: Hoare triple {91892#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:12,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:12,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:12,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:12,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:12,057 INFO L290 TraceCheckUtils]: 24: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:12,058 INFO L290 TraceCheckUtils]: 25: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:12,058 INFO L290 TraceCheckUtils]: 26: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:12,058 INFO L290 TraceCheckUtils]: 27: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:12,059 INFO L290 TraceCheckUtils]: 28: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {91888#false} is VALID [2022-04-08 10:12:12,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-08 10:12:12,059 INFO L290 TraceCheckUtils]: 30: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-08 10:12:12,059 INFO L290 TraceCheckUtils]: 31: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-08 10:12:12,059 INFO L290 TraceCheckUtils]: 32: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-08 10:12:12,059 INFO L290 TraceCheckUtils]: 33: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-08 10:12:12,059 INFO L290 TraceCheckUtils]: 34: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-08 10:12:12,059 INFO L290 TraceCheckUtils]: 35: Hoare triple {91888#false} assume !(~z~0 % 4294967296 > 0); {91888#false} is VALID [2022-04-08 10:12:12,059 INFO L272 TraceCheckUtils]: 36: Hoare triple {91888#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {91888#false} is VALID [2022-04-08 10:12:12,060 INFO L290 TraceCheckUtils]: 37: Hoare triple {91888#false} ~cond := #in~cond; {91888#false} is VALID [2022-04-08 10:12:12,060 INFO L290 TraceCheckUtils]: 38: Hoare triple {91888#false} assume 0 == ~cond; {91888#false} is VALID [2022-04-08 10:12:12,060 INFO L290 TraceCheckUtils]: 39: Hoare triple {91888#false} assume !false; {91888#false} is VALID [2022-04-08 10:12:12,060 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-08 10:12:12,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:12:12,362 INFO L290 TraceCheckUtils]: 39: Hoare triple {91888#false} assume !false; {91888#false} is VALID [2022-04-08 10:12:12,362 INFO L290 TraceCheckUtils]: 38: Hoare triple {91888#false} assume 0 == ~cond; {91888#false} is VALID [2022-04-08 10:12:12,363 INFO L290 TraceCheckUtils]: 37: Hoare triple {91888#false} ~cond := #in~cond; {91888#false} is VALID [2022-04-08 10:12:12,363 INFO L272 TraceCheckUtils]: 36: Hoare triple {91888#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {91888#false} is VALID [2022-04-08 10:12:12,363 INFO L290 TraceCheckUtils]: 35: Hoare triple {91888#false} assume !(~z~0 % 4294967296 > 0); {91888#false} is VALID [2022-04-08 10:12:12,363 INFO L290 TraceCheckUtils]: 34: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-08 10:12:12,363 INFO L290 TraceCheckUtils]: 33: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-08 10:12:12,363 INFO L290 TraceCheckUtils]: 32: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-08 10:12:12,363 INFO L290 TraceCheckUtils]: 31: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-08 10:12:12,363 INFO L290 TraceCheckUtils]: 30: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-08 10:12:12,363 INFO L290 TraceCheckUtils]: 29: Hoare triple {91888#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91888#false} is VALID [2022-04-08 10:12:12,364 INFO L290 TraceCheckUtils]: 28: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {91888#false} is VALID [2022-04-08 10:12:12,364 INFO L290 TraceCheckUtils]: 27: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:12,364 INFO L290 TraceCheckUtils]: 26: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:12,364 INFO L290 TraceCheckUtils]: 25: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:12,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:12,365 INFO L290 TraceCheckUtils]: 23: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:12,365 INFO L290 TraceCheckUtils]: 22: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:12,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:12,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:12,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {91892#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91970#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:12,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {91929#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91892#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:12:12,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {91933#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91929#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:12:12,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {91937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91933#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:12,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {91941#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:12:12,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {91945#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91941#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:12,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {91945#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} ~z~0 := ~y~0; {91945#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:12:12,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {91945#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !(~x~0 % 4294967296 > 0); {91945#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:12:12,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {91941#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91945#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:12:12,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {91937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91941#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:12,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {91933#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:12:12,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {91929#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91933#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:12,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {91892#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91929#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:12:12,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {91887#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91892#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:12:12,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {91887#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {91887#true} is VALID [2022-04-08 10:12:12,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {91887#true} call #t~ret15 := main(); {91887#true} is VALID [2022-04-08 10:12:12,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91887#true} {91887#true} #83#return; {91887#true} is VALID [2022-04-08 10:12:12,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {91887#true} assume true; {91887#true} is VALID [2022-04-08 10:12:12,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {91887#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {91887#true} is VALID [2022-04-08 10:12:12,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {91887#true} call ULTIMATE.init(); {91887#true} is VALID [2022-04-08 10:12:12,375 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-08 10:12:12,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528348383] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:12:12,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:12:12,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 21 [2022-04-08 10:12:12,375 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:12:12,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1700843989] [2022-04-08 10:12:12,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1700843989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:12:12,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:12:12,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:12:12,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304281300] [2022-04-08 10:12:12,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:12:12,376 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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 40 [2022-04-08 10:12:12,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:12:12,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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-08 10:12:12,399 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-08 10:12:12,399 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:12:12,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:12,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:12:12,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2022-04-08 10:12:12,399 INFO L87 Difference]: Start difference. First operand 338 states and 432 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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-08 10:12:15,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:15,612 INFO L93 Difference]: Finished difference Result 411 states and 542 transitions. [2022-04-08 10:12:15,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 10:12:15,612 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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 40 [2022-04-08 10:12:15,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:12:15,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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-08 10:12:15,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 83 transitions. [2022-04-08 10:12:15,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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-08 10:12:15,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 83 transitions. [2022-04-08 10:12:15,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 83 transitions. [2022-04-08 10:12:15,722 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-08 10:12:15,729 INFO L225 Difference]: With dead ends: 411 [2022-04-08 10:12:15,729 INFO L226 Difference]: Without dead ends: 397 [2022-04-08 10:12:15,729 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=239, Invalid=817, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 10:12:15,729 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 88 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:12:15,729 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 44 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:12:15,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-04-08 10:12:17,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 381. [2022-04-08 10:12:17,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:12:17,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 397 states. Second operand has 381 states, 376 states have (on average 1.2898936170212767) internal successors, (485), 376 states have internal predecessors, (485), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:17,724 INFO L74 IsIncluded]: Start isIncluded. First operand 397 states. Second operand has 381 states, 376 states have (on average 1.2898936170212767) internal successors, (485), 376 states have internal predecessors, (485), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:17,724 INFO L87 Difference]: Start difference. First operand 397 states. Second operand has 381 states, 376 states have (on average 1.2898936170212767) internal successors, (485), 376 states have internal predecessors, (485), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:17,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:17,730 INFO L93 Difference]: Finished difference Result 397 states and 516 transitions. [2022-04-08 10:12:17,730 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 516 transitions. [2022-04-08 10:12:17,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:17,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:17,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 381 states, 376 states have (on average 1.2898936170212767) internal successors, (485), 376 states have internal predecessors, (485), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 397 states. [2022-04-08 10:12:17,731 INFO L87 Difference]: Start difference. First operand has 381 states, 376 states have (on average 1.2898936170212767) internal successors, (485), 376 states have internal predecessors, (485), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 397 states. [2022-04-08 10:12:17,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:17,736 INFO L93 Difference]: Finished difference Result 397 states and 516 transitions. [2022-04-08 10:12:17,736 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 516 transitions. [2022-04-08 10:12:17,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:17,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:17,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:12:17,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:12:17,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 376 states have (on average 1.2898936170212767) internal successors, (485), 376 states have internal predecessors, (485), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:17,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 489 transitions. [2022-04-08 10:12:17,742 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 489 transitions. Word has length 40 [2022-04-08 10:12:17,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:12:17,742 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 489 transitions. [2022-04-08 10:12:17,742 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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-08 10:12:17,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 381 states and 489 transitions. [2022-04-08 10:12:20,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:20,215 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 489 transitions. [2022-04-08 10:12:20,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 10:12:20,215 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:12:20,215 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:12:20,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-04-08 10:12:20,416 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:20,416 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:12:20,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:12:20,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1040873587, now seen corresponding path program 33 times [2022-04-08 10:12:20,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:20,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1000678707] [2022-04-08 10:12:20,419 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:12:20,419 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:12:20,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1040873587, now seen corresponding path program 34 times [2022-04-08 10:12:20,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:12:20,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477479895] [2022-04-08 10:12:20,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:12:20,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:12:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:20,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:12:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:20,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {94574#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {94552#true} is VALID [2022-04-08 10:12:20,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {94552#true} assume true; {94552#true} is VALID [2022-04-08 10:12:20,689 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {94552#true} {94552#true} #83#return; {94552#true} is VALID [2022-04-08 10:12:20,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {94552#true} call ULTIMATE.init(); {94574#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:12:20,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {94574#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {94552#true} is VALID [2022-04-08 10:12:20,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {94552#true} assume true; {94552#true} is VALID [2022-04-08 10:12:20,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94552#true} {94552#true} #83#return; {94552#true} is VALID [2022-04-08 10:12:20,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {94552#true} call #t~ret15 := main(); {94552#true} is VALID [2022-04-08 10:12:20,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {94552#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {94557#(= main_~y~0 0)} is VALID [2022-04-08 10:12:20,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {94557#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94558#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:20,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {94558#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94559#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:20,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {94559#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94560#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:20,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {94560#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94561#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:20,692 INFO L290 TraceCheckUtils]: 10: Hoare triple {94561#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94562#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:20,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {94562#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94563#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:20,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {94563#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94564#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:20,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {94564#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94565#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:20,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {94565#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {94565#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:20,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {94565#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {94566#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:12:20,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {94566#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94567#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:12:20,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {94567#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94568#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:12:20,696 INFO L290 TraceCheckUtils]: 18: Hoare triple {94568#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94569#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:12:20,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {94569#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94570#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:12:20,697 INFO L290 TraceCheckUtils]: 20: Hoare triple {94570#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94571#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:12:20,697 INFO L290 TraceCheckUtils]: 21: Hoare triple {94571#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94572#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:12:20,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {94572#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94573#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:12:20,698 INFO L290 TraceCheckUtils]: 23: Hoare triple {94573#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {94553#false} is VALID [2022-04-08 10:12:20,698 INFO L290 TraceCheckUtils]: 24: Hoare triple {94553#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94553#false} is VALID [2022-04-08 10:12:20,699 INFO L290 TraceCheckUtils]: 25: Hoare triple {94553#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94553#false} is VALID [2022-04-08 10:12:20,699 INFO L290 TraceCheckUtils]: 26: Hoare triple {94553#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94553#false} is VALID [2022-04-08 10:12:20,699 INFO L290 TraceCheckUtils]: 27: Hoare triple {94553#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94553#false} is VALID [2022-04-08 10:12:20,699 INFO L290 TraceCheckUtils]: 28: Hoare triple {94553#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94553#false} is VALID [2022-04-08 10:12:20,699 INFO L290 TraceCheckUtils]: 29: Hoare triple {94553#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94553#false} is VALID [2022-04-08 10:12:20,699 INFO L290 TraceCheckUtils]: 30: Hoare triple {94553#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94553#false} is VALID [2022-04-08 10:12:20,699 INFO L290 TraceCheckUtils]: 31: Hoare triple {94553#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94553#false} is VALID [2022-04-08 10:12:20,699 INFO L290 TraceCheckUtils]: 32: Hoare triple {94553#false} assume !(~y~0 % 4294967296 > 0); {94553#false} is VALID [2022-04-08 10:12:20,699 INFO L290 TraceCheckUtils]: 33: Hoare triple {94553#false} assume !(~x~0 % 4294967296 > 0); {94553#false} is VALID [2022-04-08 10:12:20,699 INFO L290 TraceCheckUtils]: 34: Hoare triple {94553#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {94553#false} is VALID [2022-04-08 10:12:20,699 INFO L290 TraceCheckUtils]: 35: Hoare triple {94553#false} assume !(~z~0 % 4294967296 > 0); {94553#false} is VALID [2022-04-08 10:12:20,699 INFO L272 TraceCheckUtils]: 36: Hoare triple {94553#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {94553#false} is VALID [2022-04-08 10:12:20,699 INFO L290 TraceCheckUtils]: 37: Hoare triple {94553#false} ~cond := #in~cond; {94553#false} is VALID [2022-04-08 10:12:20,699 INFO L290 TraceCheckUtils]: 38: Hoare triple {94553#false} assume 0 == ~cond; {94553#false} is VALID [2022-04-08 10:12:20,699 INFO L290 TraceCheckUtils]: 39: Hoare triple {94553#false} assume !false; {94553#false} is VALID [2022-04-08 10:12:20,700 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-08 10:12:20,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:12:20,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477479895] [2022-04-08 10:12:20,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477479895] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:12:20,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038698632] [2022-04-08 10:12:20,700 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:12:20,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:20,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:12:20,701 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:12:20,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-04-08 10:12:20,747 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:12:20,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:12:20,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-08 10:12:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:20,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:12:21,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {94552#true} call ULTIMATE.init(); {94552#true} is VALID [2022-04-08 10:12:21,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {94552#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {94552#true} is VALID [2022-04-08 10:12:21,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {94552#true} assume true; {94552#true} is VALID [2022-04-08 10:12:21,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94552#true} {94552#true} #83#return; {94552#true} is VALID [2022-04-08 10:12:21,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {94552#true} call #t~ret15 := main(); {94552#true} is VALID [2022-04-08 10:12:21,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {94552#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {94552#true} is VALID [2022-04-08 10:12:21,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {94552#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94552#true} is VALID [2022-04-08 10:12:21,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {94552#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94599#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:12:21,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {94599#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94603#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:12:21,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {94603#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94607#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:12:21,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {94607#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94611#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:12:21,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {94611#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94615#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:12:21,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {94615#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94619#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:12:21,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {94619#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94623#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:12:21,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {94623#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {94623#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:12:21,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {94623#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {94623#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:12:21,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {94623#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94619#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:12:21,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {94619#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94615#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:12:21,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {94615#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94611#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:12:21,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {94611#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94607#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:12:21,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {94607#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94603#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:12:21,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {94603#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94599#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:12:21,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {94599#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:21,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {94651#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:21,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {94651#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:21,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {94651#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:21,045 INFO L290 TraceCheckUtils]: 26: Hoare triple {94651#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:21,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {94651#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:21,046 INFO L290 TraceCheckUtils]: 28: Hoare triple {94651#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:21,046 INFO L290 TraceCheckUtils]: 29: Hoare triple {94651#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:21,046 INFO L290 TraceCheckUtils]: 30: Hoare triple {94651#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:21,047 INFO L290 TraceCheckUtils]: 31: Hoare triple {94651#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:21,047 INFO L290 TraceCheckUtils]: 32: Hoare triple {94651#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:21,059 INFO L290 TraceCheckUtils]: 33: Hoare triple {94651#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {94553#false} is VALID [2022-04-08 10:12:21,059 INFO L290 TraceCheckUtils]: 34: Hoare triple {94553#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {94553#false} is VALID [2022-04-08 10:12:21,059 INFO L290 TraceCheckUtils]: 35: Hoare triple {94553#false} assume !(~z~0 % 4294967296 > 0); {94553#false} is VALID [2022-04-08 10:12:21,059 INFO L272 TraceCheckUtils]: 36: Hoare triple {94553#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {94553#false} is VALID [2022-04-08 10:12:21,060 INFO L290 TraceCheckUtils]: 37: Hoare triple {94553#false} ~cond := #in~cond; {94553#false} is VALID [2022-04-08 10:12:21,060 INFO L290 TraceCheckUtils]: 38: Hoare triple {94553#false} assume 0 == ~cond; {94553#false} is VALID [2022-04-08 10:12:21,060 INFO L290 TraceCheckUtils]: 39: Hoare triple {94553#false} assume !false; {94553#false} is VALID [2022-04-08 10:12:21,060 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 14 proven. 49 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-08 10:12:21,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:12:21,224 INFO L290 TraceCheckUtils]: 39: Hoare triple {94553#false} assume !false; {94553#false} is VALID [2022-04-08 10:12:21,225 INFO L290 TraceCheckUtils]: 38: Hoare triple {94553#false} assume 0 == ~cond; {94553#false} is VALID [2022-04-08 10:12:21,225 INFO L290 TraceCheckUtils]: 37: Hoare triple {94553#false} ~cond := #in~cond; {94553#false} is VALID [2022-04-08 10:12:21,225 INFO L272 TraceCheckUtils]: 36: Hoare triple {94553#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {94553#false} is VALID [2022-04-08 10:12:21,225 INFO L290 TraceCheckUtils]: 35: Hoare triple {94553#false} assume !(~z~0 % 4294967296 > 0); {94553#false} is VALID [2022-04-08 10:12:21,225 INFO L290 TraceCheckUtils]: 34: Hoare triple {94553#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {94553#false} is VALID [2022-04-08 10:12:21,225 INFO L290 TraceCheckUtils]: 33: Hoare triple {94651#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {94553#false} is VALID [2022-04-08 10:12:21,225 INFO L290 TraceCheckUtils]: 32: Hoare triple {94651#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:21,226 INFO L290 TraceCheckUtils]: 31: Hoare triple {94651#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:21,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {94651#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:21,226 INFO L290 TraceCheckUtils]: 29: Hoare triple {94651#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:21,226 INFO L290 TraceCheckUtils]: 28: Hoare triple {94651#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:21,227 INFO L290 TraceCheckUtils]: 27: Hoare triple {94651#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:21,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {94651#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:21,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {94651#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:21,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {94651#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:21,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {94651#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:21,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {94599#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94651#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:21,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {94603#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94599#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:12:21,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {94607#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94603#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:12:21,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {94611#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94607#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:12:21,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {94615#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94611#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:12:21,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {94619#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94615#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:12:21,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {94623#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94619#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:12:21,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {94623#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {94623#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:12:21,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {94623#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {94623#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:12:21,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {94619#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94623#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:12:21,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {94615#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94619#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:12:21,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {94611#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94615#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:12:21,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {94607#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94611#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:12:21,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {94603#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94607#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:12:21,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {94599#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94603#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:12:21,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {94552#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94599#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:12:21,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {94552#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94552#true} is VALID [2022-04-08 10:12:21,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {94552#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {94552#true} is VALID [2022-04-08 10:12:21,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {94552#true} call #t~ret15 := main(); {94552#true} is VALID [2022-04-08 10:12:21,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94552#true} {94552#true} #83#return; {94552#true} is VALID [2022-04-08 10:12:21,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {94552#true} assume true; {94552#true} is VALID [2022-04-08 10:12:21,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {94552#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {94552#true} is VALID [2022-04-08 10:12:21,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {94552#true} call ULTIMATE.init(); {94552#true} is VALID [2022-04-08 10:12:21,238 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 14 proven. 49 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-08 10:12:21,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038698632] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:12:21,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:12:21,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 28 [2022-04-08 10:12:21,238 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:12:21,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1000678707] [2022-04-08 10:12:21,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1000678707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:12:21,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:12:21,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 10:12:21,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640156181] [2022-04-08 10:12:21,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:12:21,238 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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 40 [2022-04-08 10:12:21,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:12:21,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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-08 10:12:21,260 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-08 10:12:21,260 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 10:12:21,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:21,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 10:12:21,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:12:21,261 INFO L87 Difference]: Start difference. First operand 381 states and 489 transitions. Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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-08 10:12:28,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:28,183 INFO L93 Difference]: Finished difference Result 510 states and 655 transitions. [2022-04-08 10:12:28,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-08 10:12:28,183 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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 40 [2022-04-08 10:12:28,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:12:28,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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-08 10:12:28,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 134 transitions. [2022-04-08 10:12:28,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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-08 10:12:28,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 134 transitions. [2022-04-08 10:12:28,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 134 transitions. [2022-04-08 10:12:28,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:28,298 INFO L225 Difference]: With dead ends: 510 [2022-04-08 10:12:28,298 INFO L226 Difference]: Without dead ends: 492 [2022-04-08 10:12:28,299 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=296, Invalid=3610, Unknown=0, NotChecked=0, Total=3906 [2022-04-08 10:12:28,299 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 64 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:12:28,299 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 98 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:12:28,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-04-08 10:12:30,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 382. [2022-04-08 10:12:30,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:12:30,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 492 states. Second operand has 382 states, 377 states have (on average 1.2891246684350133) internal successors, (486), 377 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:30,293 INFO L74 IsIncluded]: Start isIncluded. First operand 492 states. Second operand has 382 states, 377 states have (on average 1.2891246684350133) internal successors, (486), 377 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:30,293 INFO L87 Difference]: Start difference. First operand 492 states. Second operand has 382 states, 377 states have (on average 1.2891246684350133) internal successors, (486), 377 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:30,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:30,300 INFO L93 Difference]: Finished difference Result 492 states and 634 transitions. [2022-04-08 10:12:30,300 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 634 transitions. [2022-04-08 10:12:30,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:30,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:30,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 382 states, 377 states have (on average 1.2891246684350133) internal successors, (486), 377 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 492 states. [2022-04-08 10:12:30,301 INFO L87 Difference]: Start difference. First operand has 382 states, 377 states have (on average 1.2891246684350133) internal successors, (486), 377 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 492 states. [2022-04-08 10:12:30,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:30,308 INFO L93 Difference]: Finished difference Result 492 states and 634 transitions. [2022-04-08 10:12:30,308 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 634 transitions. [2022-04-08 10:12:30,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:30,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:30,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:12:30,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:12:30,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 377 states have (on average 1.2891246684350133) internal successors, (486), 377 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:30,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 490 transitions. [2022-04-08 10:12:30,315 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 490 transitions. Word has length 40 [2022-04-08 10:12:30,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:12:30,315 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 490 transitions. [2022-04-08 10:12:30,315 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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-08 10:12:30,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 382 states and 490 transitions. [2022-04-08 10:12:32,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 490 edges. 490 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:32,862 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 490 transitions. [2022-04-08 10:12:32,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 10:12:32,862 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:12:32,862 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:12:32,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-04-08 10:12:33,067 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2022-04-08 10:12:33,067 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:12:33,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:12:33,068 INFO L85 PathProgramCache]: Analyzing trace with hash -286560430, now seen corresponding path program 61 times [2022-04-08 10:12:33,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:33,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [844860181] [2022-04-08 10:12:33,070 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:12:33,070 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:12:33,070 INFO L85 PathProgramCache]: Analyzing trace with hash -286560430, now seen corresponding path program 62 times [2022-04-08 10:12:33,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:12:33,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091805097] [2022-04-08 10:12:33,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:12:33,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:12:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:33,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:12:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:33,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {97679#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {97660#true} is VALID [2022-04-08 10:12:33,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {97660#true} assume true; {97660#true} is VALID [2022-04-08 10:12:33,282 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {97660#true} {97660#true} #83#return; {97660#true} is VALID [2022-04-08 10:12:33,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {97660#true} call ULTIMATE.init(); {97679#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:12:33,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {97679#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {97660#true} is VALID [2022-04-08 10:12:33,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {97660#true} assume true; {97660#true} is VALID [2022-04-08 10:12:33,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97660#true} {97660#true} #83#return; {97660#true} is VALID [2022-04-08 10:12:33,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {97660#true} call #t~ret15 := main(); {97660#true} is VALID [2022-04-08 10:12:33,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {97660#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {97665#(= main_~y~0 0)} is VALID [2022-04-08 10:12:33,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {97665#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97666#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:33,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {97666#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97667#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:33,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {97667#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97668#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:33,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {97668#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97669#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:33,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {97669#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97670#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:33,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {97670#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97671#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:33,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {97671#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97672#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:33,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {97672#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97673#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:33,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {97673#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97674#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:33,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {97674#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {97674#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:33,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {97674#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {97675#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:12:33,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {97675#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97676#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:12:33,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {97676#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97677#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:12:33,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {97677#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97678#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:12:33,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {97678#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {97661#false} is VALID [2022-04-08 10:12:33,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {97661#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97661#false} is VALID [2022-04-08 10:12:33,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {97661#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97661#false} is VALID [2022-04-08 10:12:33,290 INFO L290 TraceCheckUtils]: 23: Hoare triple {97661#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97661#false} is VALID [2022-04-08 10:12:33,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {97661#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97661#false} is VALID [2022-04-08 10:12:33,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {97661#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97661#false} is VALID [2022-04-08 10:12:33,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {97661#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97661#false} is VALID [2022-04-08 10:12:33,290 INFO L290 TraceCheckUtils]: 27: Hoare triple {97661#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97661#false} is VALID [2022-04-08 10:12:33,290 INFO L290 TraceCheckUtils]: 28: Hoare triple {97661#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97661#false} is VALID [2022-04-08 10:12:33,291 INFO L290 TraceCheckUtils]: 29: Hoare triple {97661#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97661#false} is VALID [2022-04-08 10:12:33,291 INFO L290 TraceCheckUtils]: 30: Hoare triple {97661#false} assume !(~y~0 % 4294967296 > 0); {97661#false} is VALID [2022-04-08 10:12:33,291 INFO L290 TraceCheckUtils]: 31: Hoare triple {97661#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {97661#false} is VALID [2022-04-08 10:12:33,291 INFO L290 TraceCheckUtils]: 32: Hoare triple {97661#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {97661#false} is VALID [2022-04-08 10:12:33,291 INFO L290 TraceCheckUtils]: 33: Hoare triple {97661#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {97661#false} is VALID [2022-04-08 10:12:33,291 INFO L290 TraceCheckUtils]: 34: Hoare triple {97661#false} assume !(~x~0 % 4294967296 > 0); {97661#false} is VALID [2022-04-08 10:12:33,291 INFO L290 TraceCheckUtils]: 35: Hoare triple {97661#false} assume !(~z~0 % 4294967296 > 0); {97661#false} is VALID [2022-04-08 10:12:33,291 INFO L272 TraceCheckUtils]: 36: Hoare triple {97661#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {97661#false} is VALID [2022-04-08 10:12:33,291 INFO L290 TraceCheckUtils]: 37: Hoare triple {97661#false} ~cond := #in~cond; {97661#false} is VALID [2022-04-08 10:12:33,291 INFO L290 TraceCheckUtils]: 38: Hoare triple {97661#false} assume 0 == ~cond; {97661#false} is VALID [2022-04-08 10:12:33,291 INFO L290 TraceCheckUtils]: 39: Hoare triple {97661#false} assume !false; {97661#false} is VALID [2022-04-08 10:12:33,291 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-04-08 10:12:33,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:12:33,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091805097] [2022-04-08 10:12:33,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091805097] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:12:33,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887405433] [2022-04-08 10:12:33,291 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:12:33,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:33,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:12:33,292 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:12:33,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-04-08 10:12:33,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:12:33,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:12:33,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-08 10:12:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:33,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:12:33,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {97660#true} call ULTIMATE.init(); {97660#true} is VALID [2022-04-08 10:12:33,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {97660#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {97660#true} is VALID [2022-04-08 10:12:33,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {97660#true} assume true; {97660#true} is VALID [2022-04-08 10:12:33,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97660#true} {97660#true} #83#return; {97660#true} is VALID [2022-04-08 10:12:33,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {97660#true} call #t~ret15 := main(); {97660#true} is VALID [2022-04-08 10:12:33,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {97660#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {97665#(= main_~y~0 0)} is VALID [2022-04-08 10:12:33,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {97665#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97666#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:33,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {97666#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97667#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:33,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {97667#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97668#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:33,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {97668#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97669#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:33,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {97669#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97670#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:33,881 INFO L290 TraceCheckUtils]: 11: Hoare triple {97670#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97671#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:33,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {97671#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97672#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:33,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {97672#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97673#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:33,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {97673#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97674#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:33,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {97674#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {97674#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:33,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {97674#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {97675#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:12:33,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {97675#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97676#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:12:33,884 INFO L290 TraceCheckUtils]: 18: Hoare triple {97676#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97677#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:12:33,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {97677#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97740#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:12:33,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {97740#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {97740#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:12:33,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {97740#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97677#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:12:33,886 INFO L290 TraceCheckUtils]: 22: Hoare triple {97677#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97676#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:12:33,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {97676#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97675#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:12:33,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {97675#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97756#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:12:33,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {97756#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97760#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:12:33,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {97760#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97764#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:12:33,889 INFO L290 TraceCheckUtils]: 27: Hoare triple {97764#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97768#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:12:33,889 INFO L290 TraceCheckUtils]: 28: Hoare triple {97768#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97772#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:12:33,890 INFO L290 TraceCheckUtils]: 29: Hoare triple {97772#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97776#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:12:33,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {97776#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {97776#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:12:33,891 INFO L290 TraceCheckUtils]: 31: Hoare triple {97776#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {97776#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:12:33,891 INFO L290 TraceCheckUtils]: 32: Hoare triple {97776#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {97776#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:12:33,891 INFO L290 TraceCheckUtils]: 33: Hoare triple {97776#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {97776#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:12:33,892 INFO L290 TraceCheckUtils]: 34: Hoare triple {97776#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {97776#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:12:33,892 INFO L290 TraceCheckUtils]: 35: Hoare triple {97776#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {97661#false} is VALID [2022-04-08 10:12:33,892 INFO L272 TraceCheckUtils]: 36: Hoare triple {97661#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {97661#false} is VALID [2022-04-08 10:12:33,892 INFO L290 TraceCheckUtils]: 37: Hoare triple {97661#false} ~cond := #in~cond; {97661#false} is VALID [2022-04-08 10:12:33,892 INFO L290 TraceCheckUtils]: 38: Hoare triple {97661#false} assume 0 == ~cond; {97661#false} is VALID [2022-04-08 10:12:33,892 INFO L290 TraceCheckUtils]: 39: Hoare triple {97661#false} assume !false; {97661#false} is VALID [2022-04-08 10:12:33,892 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:12:33,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:12:34,503 INFO L290 TraceCheckUtils]: 39: Hoare triple {97661#false} assume !false; {97661#false} is VALID [2022-04-08 10:12:34,504 INFO L290 TraceCheckUtils]: 38: Hoare triple {97661#false} assume 0 == ~cond; {97661#false} is VALID [2022-04-08 10:12:34,504 INFO L290 TraceCheckUtils]: 37: Hoare triple {97661#false} ~cond := #in~cond; {97661#false} is VALID [2022-04-08 10:12:34,504 INFO L272 TraceCheckUtils]: 36: Hoare triple {97661#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {97661#false} is VALID [2022-04-08 10:12:34,504 INFO L290 TraceCheckUtils]: 35: Hoare triple {97819#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {97661#false} is VALID [2022-04-08 10:12:34,504 INFO L290 TraceCheckUtils]: 34: Hoare triple {97819#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {97819#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:12:34,504 INFO L290 TraceCheckUtils]: 33: Hoare triple {97819#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {97819#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:12:34,505 INFO L290 TraceCheckUtils]: 32: Hoare triple {97819#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {97819#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:12:34,505 INFO L290 TraceCheckUtils]: 31: Hoare triple {97819#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {97819#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:12:34,505 INFO L290 TraceCheckUtils]: 30: Hoare triple {97819#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {97819#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:12:34,506 INFO L290 TraceCheckUtils]: 29: Hoare triple {97838#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97819#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:12:34,506 INFO L290 TraceCheckUtils]: 28: Hoare triple {97842#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97838#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-08 10:12:34,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {97846#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97842#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-08 10:12:34,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {97850#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97846#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-08 10:12:34,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {97854#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97850#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-08 10:12:34,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {97858#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97854#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-08 10:12:34,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {97862#(< 0 (mod (+ 7 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97858#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-08 10:12:34,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {97866#(< 0 (mod (+ main_~z~0 8) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97862#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-08 10:12:34,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {97870#(< 0 (mod (+ main_~z~0 9) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97866#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-08 10:12:34,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {97870#(< 0 (mod (+ main_~z~0 9) 4294967296))} assume !(~z~0 % 4294967296 > 0); {97870#(< 0 (mod (+ main_~z~0 9) 4294967296))} is VALID [2022-04-08 10:12:34,512 INFO L290 TraceCheckUtils]: 19: Hoare triple {97866#(< 0 (mod (+ main_~z~0 8) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97870#(< 0 (mod (+ main_~z~0 9) 4294967296))} is VALID [2022-04-08 10:12:34,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {97862#(< 0 (mod (+ 7 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97866#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-08 10:12:34,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {97858#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97862#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-08 10:12:34,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {97886#(< 0 (mod (+ main_~y~0 6) 4294967296))} ~z~0 := ~y~0; {97858#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-08 10:12:34,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {97886#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {97886#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:12:34,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {97893#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97886#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:12:34,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {97897#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97893#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:34,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {97901#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97897#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:12:34,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {97905#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97901#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:12:34,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {97909#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97905#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:12:34,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {97913#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97909#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:12:34,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {97917#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97913#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:12:34,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {97921#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97917#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:12:34,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {97925#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97921#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:12:34,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {97660#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {97925#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:12:34,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {97660#true} call #t~ret15 := main(); {97660#true} is VALID [2022-04-08 10:12:34,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97660#true} {97660#true} #83#return; {97660#true} is VALID [2022-04-08 10:12:34,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {97660#true} assume true; {97660#true} is VALID [2022-04-08 10:12:34,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {97660#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {97660#true} is VALID [2022-04-08 10:12:34,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {97660#true} call ULTIMATE.init(); {97660#true} is VALID [2022-04-08 10:12:34,520 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:12:34,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887405433] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:12:34,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:12:34,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 22] total 44 [2022-04-08 10:12:34,520 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:12:34,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [844860181] [2022-04-08 10:12:34,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [844860181] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:12:34,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:12:34,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:12:34,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546317707] [2022-04-08 10:12:34,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:12:34,521 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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 40 [2022-04-08 10:12:34,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:12:34,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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-08 10:12:34,550 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-08 10:12:34,550 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:12:34,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:34,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:12:34,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1596, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:12:34,551 INFO L87 Difference]: Start difference. First operand 382 states and 490 transitions. Second operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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-08 10:12:42,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:42,261 INFO L93 Difference]: Finished difference Result 573 states and 720 transitions. [2022-04-08 10:12:42,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 10:12:42,261 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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 40 [2022-04-08 10:12:42,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:12:42,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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-08 10:12:42,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 132 transitions. [2022-04-08 10:12:42,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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-08 10:12:42,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 132 transitions. [2022-04-08 10:12:42,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 132 transitions. [2022-04-08 10:12:42,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:42,378 INFO L225 Difference]: With dead ends: 573 [2022-04-08 10:12:42,378 INFO L226 Difference]: Without dead ends: 553 [2022-04-08 10:12:42,379 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=672, Invalid=3360, Unknown=0, NotChecked=0, Total=4032 [2022-04-08 10:12:42,379 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 80 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:12:42,379 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 124 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1346 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-08 10:12:42,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2022-04-08 10:12:44,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 382. [2022-04-08 10:12:44,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:12:44,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 553 states. Second operand has 382 states, 377 states have (on average 1.2864721485411141) internal successors, (485), 377 states have internal predecessors, (485), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:44,369 INFO L74 IsIncluded]: Start isIncluded. First operand 553 states. Second operand has 382 states, 377 states have (on average 1.2864721485411141) internal successors, (485), 377 states have internal predecessors, (485), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:44,370 INFO L87 Difference]: Start difference. First operand 553 states. Second operand has 382 states, 377 states have (on average 1.2864721485411141) internal successors, (485), 377 states have internal predecessors, (485), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:44,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:44,378 INFO L93 Difference]: Finished difference Result 553 states and 699 transitions. [2022-04-08 10:12:44,378 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 699 transitions. [2022-04-08 10:12:44,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:44,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:44,379 INFO L74 IsIncluded]: Start isIncluded. First operand has 382 states, 377 states have (on average 1.2864721485411141) internal successors, (485), 377 states have internal predecessors, (485), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 553 states. [2022-04-08 10:12:44,379 INFO L87 Difference]: Start difference. First operand has 382 states, 377 states have (on average 1.2864721485411141) internal successors, (485), 377 states have internal predecessors, (485), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 553 states. [2022-04-08 10:12:44,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:44,388 INFO L93 Difference]: Finished difference Result 553 states and 699 transitions. [2022-04-08 10:12:44,388 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 699 transitions. [2022-04-08 10:12:44,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:44,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:44,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:12:44,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:12:44,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 377 states have (on average 1.2864721485411141) internal successors, (485), 377 states have internal predecessors, (485), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:44,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 489 transitions. [2022-04-08 10:12:44,395 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 489 transitions. Word has length 40 [2022-04-08 10:12:44,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:12:44,395 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 489 transitions. [2022-04-08 10:12:44,395 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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-08 10:12:44,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 382 states and 489 transitions. [2022-04-08 10:12:46,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:46,979 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 489 transitions. [2022-04-08 10:12:46,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 10:12:46,979 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:12:46,979 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:12:46,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-04-08 10:12:47,180 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2022-04-08 10:12:47,180 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:12:47,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:12:47,180 INFO L85 PathProgramCache]: Analyzing trace with hash -727872510, now seen corresponding path program 63 times [2022-04-08 10:12:47,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:47,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [525890146] [2022-04-08 10:12:47,182 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:12:47,182 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:12:47,182 INFO L85 PathProgramCache]: Analyzing trace with hash -727872510, now seen corresponding path program 64 times [2022-04-08 10:12:47,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:12:47,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655270023] [2022-04-08 10:12:47,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:12:47,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:12:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:47,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:12:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:47,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {101021#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {101002#true} is VALID [2022-04-08 10:12:47,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {101002#true} assume true; {101002#true} is VALID [2022-04-08 10:12:47,420 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {101002#true} {101002#true} #83#return; {101002#true} is VALID [2022-04-08 10:12:47,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {101002#true} call ULTIMATE.init(); {101021#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:12:47,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {101021#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {101002#true} is VALID [2022-04-08 10:12:47,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {101002#true} assume true; {101002#true} is VALID [2022-04-08 10:12:47,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101002#true} {101002#true} #83#return; {101002#true} is VALID [2022-04-08 10:12:47,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {101002#true} call #t~ret15 := main(); {101002#true} is VALID [2022-04-08 10:12:47,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {101002#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {101007#(= main_~y~0 0)} is VALID [2022-04-08 10:12:47,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {101007#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101008#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:47,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {101008#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101009#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:47,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {101009#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101010#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:47,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {101010#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101011#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:47,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {101011#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101012#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:47,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {101012#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101013#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:47,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {101013#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101014#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:47,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {101014#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101015#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:47,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {101015#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101016#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:47,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {101016#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101017#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:47,429 INFO L290 TraceCheckUtils]: 16: Hoare triple {101017#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {101017#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:47,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {101017#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {101018#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:12:47,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {101018#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {101019#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:12:47,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {101019#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {101020#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:12:47,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {101020#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {101003#false} is VALID [2022-04-08 10:12:47,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:47,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:47,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:47,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:47,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:47,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:47,431 INFO L290 TraceCheckUtils]: 27: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:47,431 INFO L290 TraceCheckUtils]: 28: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:47,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:47,431 INFO L290 TraceCheckUtils]: 30: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:47,431 INFO L290 TraceCheckUtils]: 31: Hoare triple {101003#false} assume !(~y~0 % 4294967296 > 0); {101003#false} is VALID [2022-04-08 10:12:47,431 INFO L290 TraceCheckUtils]: 32: Hoare triple {101003#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101003#false} is VALID [2022-04-08 10:12:47,431 INFO L290 TraceCheckUtils]: 33: Hoare triple {101003#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101003#false} is VALID [2022-04-08 10:12:47,431 INFO L290 TraceCheckUtils]: 34: Hoare triple {101003#false} assume !(~x~0 % 4294967296 > 0); {101003#false} is VALID [2022-04-08 10:12:47,431 INFO L290 TraceCheckUtils]: 35: Hoare triple {101003#false} assume !(~z~0 % 4294967296 > 0); {101003#false} is VALID [2022-04-08 10:12:47,431 INFO L272 TraceCheckUtils]: 36: Hoare triple {101003#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {101003#false} is VALID [2022-04-08 10:12:47,431 INFO L290 TraceCheckUtils]: 37: Hoare triple {101003#false} ~cond := #in~cond; {101003#false} is VALID [2022-04-08 10:12:47,431 INFO L290 TraceCheckUtils]: 38: Hoare triple {101003#false} assume 0 == ~cond; {101003#false} is VALID [2022-04-08 10:12:47,431 INFO L290 TraceCheckUtils]: 39: Hoare triple {101003#false} assume !false; {101003#false} is VALID [2022-04-08 10:12:47,432 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-04-08 10:12:47,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:12:47,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655270023] [2022-04-08 10:12:47,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655270023] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:12:47,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822824252] [2022-04-08 10:12:47,432 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:12:47,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:47,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:12:47,433 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:12:47,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-04-08 10:12:47,480 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:12:47,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:12:47,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 10:12:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:47,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:12:47,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {101002#true} call ULTIMATE.init(); {101002#true} is VALID [2022-04-08 10:12:47,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {101002#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {101002#true} is VALID [2022-04-08 10:12:47,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {101002#true} assume true; {101002#true} is VALID [2022-04-08 10:12:47,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101002#true} {101002#true} #83#return; {101002#true} is VALID [2022-04-08 10:12:47,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {101002#true} call #t~ret15 := main(); {101002#true} is VALID [2022-04-08 10:12:47,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {101002#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {101007#(= main_~y~0 0)} is VALID [2022-04-08 10:12:47,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {101007#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101008#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:47,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {101008#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101009#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:47,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {101009#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101010#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:47,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {101010#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101011#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:47,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {101011#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101012#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:47,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {101012#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101013#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:47,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {101013#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101014#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:47,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {101014#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101015#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:47,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {101015#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101016#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:47,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {101016#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101017#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:47,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {101017#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {101017#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:47,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {101017#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {101018#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:12:47,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {101018#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {101019#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:12:47,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {101019#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {101082#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:12:47,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {101082#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {101003#false} is VALID [2022-04-08 10:12:47,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:47,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:47,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:47,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:47,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:47,754 INFO L290 TraceCheckUtils]: 26: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:47,754 INFO L290 TraceCheckUtils]: 27: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:47,754 INFO L290 TraceCheckUtils]: 28: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:47,754 INFO L290 TraceCheckUtils]: 29: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:47,754 INFO L290 TraceCheckUtils]: 30: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:47,754 INFO L290 TraceCheckUtils]: 31: Hoare triple {101003#false} assume !(~y~0 % 4294967296 > 0); {101003#false} is VALID [2022-04-08 10:12:47,754 INFO L290 TraceCheckUtils]: 32: Hoare triple {101003#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101003#false} is VALID [2022-04-08 10:12:47,754 INFO L290 TraceCheckUtils]: 33: Hoare triple {101003#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101003#false} is VALID [2022-04-08 10:12:47,754 INFO L290 TraceCheckUtils]: 34: Hoare triple {101003#false} assume !(~x~0 % 4294967296 > 0); {101003#false} is VALID [2022-04-08 10:12:47,754 INFO L290 TraceCheckUtils]: 35: Hoare triple {101003#false} assume !(~z~0 % 4294967296 > 0); {101003#false} is VALID [2022-04-08 10:12:47,754 INFO L272 TraceCheckUtils]: 36: Hoare triple {101003#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {101003#false} is VALID [2022-04-08 10:12:47,754 INFO L290 TraceCheckUtils]: 37: Hoare triple {101003#false} ~cond := #in~cond; {101003#false} is VALID [2022-04-08 10:12:47,755 INFO L290 TraceCheckUtils]: 38: Hoare triple {101003#false} assume 0 == ~cond; {101003#false} is VALID [2022-04-08 10:12:47,755 INFO L290 TraceCheckUtils]: 39: Hoare triple {101003#false} assume !false; {101003#false} is VALID [2022-04-08 10:12:47,755 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-04-08 10:12:47,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:12:48,146 INFO L290 TraceCheckUtils]: 39: Hoare triple {101003#false} assume !false; {101003#false} is VALID [2022-04-08 10:12:48,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {101003#false} assume 0 == ~cond; {101003#false} is VALID [2022-04-08 10:12:48,146 INFO L290 TraceCheckUtils]: 37: Hoare triple {101003#false} ~cond := #in~cond; {101003#false} is VALID [2022-04-08 10:12:48,146 INFO L272 TraceCheckUtils]: 36: Hoare triple {101003#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {101003#false} is VALID [2022-04-08 10:12:48,146 INFO L290 TraceCheckUtils]: 35: Hoare triple {101003#false} assume !(~z~0 % 4294967296 > 0); {101003#false} is VALID [2022-04-08 10:12:48,146 INFO L290 TraceCheckUtils]: 34: Hoare triple {101003#false} assume !(~x~0 % 4294967296 > 0); {101003#false} is VALID [2022-04-08 10:12:48,146 INFO L290 TraceCheckUtils]: 33: Hoare triple {101003#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101003#false} is VALID [2022-04-08 10:12:48,146 INFO L290 TraceCheckUtils]: 32: Hoare triple {101003#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101003#false} is VALID [2022-04-08 10:12:48,146 INFO L290 TraceCheckUtils]: 31: Hoare triple {101003#false} assume !(~y~0 % 4294967296 > 0); {101003#false} is VALID [2022-04-08 10:12:48,146 INFO L290 TraceCheckUtils]: 30: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:48,146 INFO L290 TraceCheckUtils]: 29: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:48,146 INFO L290 TraceCheckUtils]: 28: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:48,146 INFO L290 TraceCheckUtils]: 27: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:48,146 INFO L290 TraceCheckUtils]: 26: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:48,147 INFO L290 TraceCheckUtils]: 25: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:48,147 INFO L290 TraceCheckUtils]: 24: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:48,147 INFO L290 TraceCheckUtils]: 23: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:48,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:48,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {101003#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101003#false} is VALID [2022-04-08 10:12:48,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {101200#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {101003#false} is VALID [2022-04-08 10:12:48,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {101204#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {101200#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:12:48,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {101208#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {101204#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:12:48,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {101212#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {101208#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:12:48,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {101212#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {101212#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:12:48,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {101219#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101212#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:12:48,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {101223#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101219#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:12:48,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {101227#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101223#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:12:48,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {101231#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101227#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:12:48,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {101235#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101231#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:12:48,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {101239#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101235#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:12:48,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {101243#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101239#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:12:48,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {101247#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101243#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:48,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {101251#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101247#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:12:48,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {101255#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101251#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:48,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {101002#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {101255#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:12:48,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {101002#true} call #t~ret15 := main(); {101002#true} is VALID [2022-04-08 10:12:48,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101002#true} {101002#true} #83#return; {101002#true} is VALID [2022-04-08 10:12:48,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {101002#true} assume true; {101002#true} is VALID [2022-04-08 10:12:48,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {101002#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {101002#true} is VALID [2022-04-08 10:12:48,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {101002#true} call ULTIMATE.init(); {101002#true} is VALID [2022-04-08 10:12:48,158 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-04-08 10:12:48,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822824252] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:12:48,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:12:48,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-08 10:12:48,159 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:12:48,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [525890146] [2022-04-08 10:12:48,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [525890146] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:12:48,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:12:48,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:12:48,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044534631] [2022-04-08 10:12:48,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:12:48,159 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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 40 [2022-04-08 10:12:48,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:12:48,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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-08 10:12:48,178 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-08 10:12:48,178 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:12:48,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:48,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:12:48,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2022-04-08 10:12:48,179 INFO L87 Difference]: Start difference. First operand 382 states and 489 transitions. Second operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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-08 10:12:56,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:56,107 INFO L93 Difference]: Finished difference Result 606 states and 757 transitions. [2022-04-08 10:12:56,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 10:12:56,107 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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 40 [2022-04-08 10:12:56,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:12:56,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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-08 10:12:56,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 139 transitions. [2022-04-08 10:12:56,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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-08 10:12:56,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 139 transitions. [2022-04-08 10:12:56,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 139 transitions. [2022-04-08 10:12:56,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:56,233 INFO L225 Difference]: With dead ends: 606 [2022-04-08 10:12:56,233 INFO L226 Difference]: Without dead ends: 586 [2022-04-08 10:12:56,234 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=482, Invalid=1870, Unknown=0, NotChecked=0, Total=2352 [2022-04-08 10:12:56,234 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 92 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:12:56,234 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 121 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 10:12:56,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2022-04-08 10:12:58,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 382. [2022-04-08 10:12:58,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:12:58,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 586 states. Second operand has 382 states, 377 states have (on average 1.2838196286472148) internal successors, (484), 377 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:58,238 INFO L74 IsIncluded]: Start isIncluded. First operand 586 states. Second operand has 382 states, 377 states have (on average 1.2838196286472148) internal successors, (484), 377 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:58,239 INFO L87 Difference]: Start difference. First operand 586 states. Second operand has 382 states, 377 states have (on average 1.2838196286472148) internal successors, (484), 377 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:58,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:58,248 INFO L93 Difference]: Finished difference Result 586 states and 736 transitions. [2022-04-08 10:12:58,249 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 736 transitions. [2022-04-08 10:12:58,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:58,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:58,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 382 states, 377 states have (on average 1.2838196286472148) internal successors, (484), 377 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 586 states. [2022-04-08 10:12:58,249 INFO L87 Difference]: Start difference. First operand has 382 states, 377 states have (on average 1.2838196286472148) internal successors, (484), 377 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 586 states. [2022-04-08 10:12:58,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:58,259 INFO L93 Difference]: Finished difference Result 586 states and 736 transitions. [2022-04-08 10:12:58,259 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 736 transitions. [2022-04-08 10:12:58,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:58,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:58,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:12:58,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:12:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 377 states have (on average 1.2838196286472148) internal successors, (484), 377 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:58,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 488 transitions. [2022-04-08 10:12:58,265 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 488 transitions. Word has length 40 [2022-04-08 10:12:58,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:12:58,265 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 488 transitions. [2022-04-08 10:12:58,265 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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-08 10:12:58,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 382 states and 488 transitions. [2022-04-08 10:13:01,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:01,473 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 488 transitions. [2022-04-08 10:13:01,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 10:13:01,473 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:13:01,473 INFO L499 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:13:01,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2022-04-08 10:13:01,683 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:01,683 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:13:01,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:13:01,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1947589458, now seen corresponding path program 65 times [2022-04-08 10:13:01,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:01,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2006677888] [2022-04-08 10:13:01,686 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:13:01,686 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:13:01,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1947589458, now seen corresponding path program 66 times [2022-04-08 10:13:01,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:13:01,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103919515] [2022-04-08 10:13:01,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:13:01,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:13:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:02,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:13:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:02,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {104487#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {104458#true} is VALID [2022-04-08 10:13:02,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {104458#true} assume true; {104458#true} is VALID [2022-04-08 10:13:02,140 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {104458#true} {104458#true} #83#return; {104458#true} is VALID [2022-04-08 10:13:02,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {104458#true} call ULTIMATE.init(); {104487#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:13:02,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {104487#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {104458#true} is VALID [2022-04-08 10:13:02,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {104458#true} assume true; {104458#true} is VALID [2022-04-08 10:13:02,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104458#true} {104458#true} #83#return; {104458#true} is VALID [2022-04-08 10:13:02,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {104458#true} call #t~ret15 := main(); {104458#true} is VALID [2022-04-08 10:13:02,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {104458#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {104463#(= main_~y~0 0)} is VALID [2022-04-08 10:13:02,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {104463#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104464#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:02,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {104464#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104465#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:02,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {104465#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104466#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:02,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {104466#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104467#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:02,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {104467#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104468#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:02,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {104468#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104469#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:13:02,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {104469#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104470#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:02,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {104470#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104471#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:13:02,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {104471#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104472#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:13:02,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {104472#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104473#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:13:02,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {104473#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104474#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:13:02,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {104474#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104475#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:13:02,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {104475#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104476#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:02,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {104476#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104477#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:13:02,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {104477#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104478#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:13:02,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {104478#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104479#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:13:02,151 INFO L290 TraceCheckUtils]: 22: Hoare triple {104479#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104480#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:13:02,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {104480#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104481#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:13:02,152 INFO L290 TraceCheckUtils]: 24: Hoare triple {104481#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104482#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:13:02,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {104482#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104483#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:13:02,153 INFO L290 TraceCheckUtils]: 26: Hoare triple {104483#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104484#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:13:02,153 INFO L290 TraceCheckUtils]: 27: Hoare triple {104484#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {104484#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:13:02,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {104484#(and (<= main_~y~0 21) (<= 21 main_~y~0))} ~z~0 := ~y~0; {104485#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-08 10:13:02,154 INFO L290 TraceCheckUtils]: 29: Hoare triple {104485#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {104486#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} is VALID [2022-04-08 10:13:02,154 INFO L290 TraceCheckUtils]: 30: Hoare triple {104486#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {104459#false} is VALID [2022-04-08 10:13:02,155 INFO L290 TraceCheckUtils]: 31: Hoare triple {104459#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104459#false} is VALID [2022-04-08 10:13:02,155 INFO L290 TraceCheckUtils]: 32: Hoare triple {104459#false} assume !(~y~0 % 4294967296 > 0); {104459#false} is VALID [2022-04-08 10:13:02,155 INFO L290 TraceCheckUtils]: 33: Hoare triple {104459#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {104459#false} is VALID [2022-04-08 10:13:02,155 INFO L290 TraceCheckUtils]: 34: Hoare triple {104459#false} assume !(~x~0 % 4294967296 > 0); {104459#false} is VALID [2022-04-08 10:13:02,155 INFO L290 TraceCheckUtils]: 35: Hoare triple {104459#false} assume !(~z~0 % 4294967296 > 0); {104459#false} is VALID [2022-04-08 10:13:02,155 INFO L272 TraceCheckUtils]: 36: Hoare triple {104459#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {104459#false} is VALID [2022-04-08 10:13:02,155 INFO L290 TraceCheckUtils]: 37: Hoare triple {104459#false} ~cond := #in~cond; {104459#false} is VALID [2022-04-08 10:13:02,155 INFO L290 TraceCheckUtils]: 38: Hoare triple {104459#false} assume 0 == ~cond; {104459#false} is VALID [2022-04-08 10:13:02,155 INFO L290 TraceCheckUtils]: 39: Hoare triple {104459#false} assume !false; {104459#false} is VALID [2022-04-08 10:13:02,155 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 232 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:13:02,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:13:02,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103919515] [2022-04-08 10:13:02,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103919515] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:13:02,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853176955] [2022-04-08 10:13:02,155 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:13:02,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:02,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:13:02,156 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:13:02,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-04-08 10:13:02,196 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:13:02,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:13:02,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 10:13:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:02,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:13:02,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {104458#true} call ULTIMATE.init(); {104458#true} is VALID [2022-04-08 10:13:02,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {104458#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {104458#true} is VALID [2022-04-08 10:13:02,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {104458#true} assume true; {104458#true} is VALID [2022-04-08 10:13:02,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104458#true} {104458#true} #83#return; {104458#true} is VALID [2022-04-08 10:13:02,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {104458#true} call #t~ret15 := main(); {104458#true} is VALID [2022-04-08 10:13:02,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {104458#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {104458#true} is VALID [2022-04-08 10:13:02,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,518 INFO L290 TraceCheckUtils]: 22: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,518 INFO L290 TraceCheckUtils]: 23: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,518 INFO L290 TraceCheckUtils]: 24: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,518 INFO L290 TraceCheckUtils]: 25: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,518 INFO L290 TraceCheckUtils]: 26: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,518 INFO L290 TraceCheckUtils]: 27: Hoare triple {104458#true} assume !(~x~0 % 4294967296 > 0); {104458#true} is VALID [2022-04-08 10:13:02,518 INFO L290 TraceCheckUtils]: 28: Hoare triple {104458#true} ~z~0 := ~y~0; {104575#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:13:02,518 INFO L290 TraceCheckUtils]: 29: Hoare triple {104575#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {104579#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:13:02,519 INFO L290 TraceCheckUtils]: 30: Hoare triple {104579#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {104579#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:13:02,519 INFO L290 TraceCheckUtils]: 31: Hoare triple {104579#(= main_~y~0 (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104586#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-08 10:13:02,520 INFO L290 TraceCheckUtils]: 32: Hoare triple {104586#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {104586#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-08 10:13:02,520 INFO L290 TraceCheckUtils]: 33: Hoare triple {104586#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {104575#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:13:02,520 INFO L290 TraceCheckUtils]: 34: Hoare triple {104575#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {104575#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:13:02,521 INFO L290 TraceCheckUtils]: 35: Hoare triple {104575#(= main_~z~0 main_~y~0)} assume !(~z~0 % 4294967296 > 0); {104599#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:13:02,521 INFO L272 TraceCheckUtils]: 36: Hoare triple {104599#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {104603#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:13:02,522 INFO L290 TraceCheckUtils]: 37: Hoare triple {104603#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {104607#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:13:02,522 INFO L290 TraceCheckUtils]: 38: Hoare triple {104607#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {104459#false} is VALID [2022-04-08 10:13:02,522 INFO L290 TraceCheckUtils]: 39: Hoare triple {104459#false} assume !false; {104459#false} is VALID [2022-04-08 10:13:02,522 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-04-08 10:13:02,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:13:02,791 INFO L290 TraceCheckUtils]: 39: Hoare triple {104459#false} assume !false; {104459#false} is VALID [2022-04-08 10:13:02,791 INFO L290 TraceCheckUtils]: 38: Hoare triple {104607#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {104459#false} is VALID [2022-04-08 10:13:02,791 INFO L290 TraceCheckUtils]: 37: Hoare triple {104603#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {104607#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:13:02,792 INFO L272 TraceCheckUtils]: 36: Hoare triple {104599#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {104603#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:13:02,792 INFO L290 TraceCheckUtils]: 35: Hoare triple {104626#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {104599#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:13:02,792 INFO L290 TraceCheckUtils]: 34: Hoare triple {104626#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {104626#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:13:02,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {104633#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {104626#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:13:02,794 INFO L290 TraceCheckUtils]: 32: Hoare triple {104633#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {104633#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-08 10:13:02,794 INFO L290 TraceCheckUtils]: 31: Hoare triple {104640#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104633#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-08 10:13:02,795 INFO L290 TraceCheckUtils]: 30: Hoare triple {104640#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {104640#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-08 10:13:02,795 INFO L290 TraceCheckUtils]: 29: Hoare triple {104626#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {104640#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-08 10:13:02,796 INFO L290 TraceCheckUtils]: 28: Hoare triple {104458#true} ~z~0 := ~y~0; {104626#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:13:02,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {104458#true} assume !(~x~0 % 4294967296 > 0); {104458#true} is VALID [2022-04-08 10:13:02,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {104458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104458#true} is VALID [2022-04-08 10:13:02,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {104458#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {104458#true} is VALID [2022-04-08 10:13:02,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {104458#true} call #t~ret15 := main(); {104458#true} is VALID [2022-04-08 10:13:02,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104458#true} {104458#true} #83#return; {104458#true} is VALID [2022-04-08 10:13:02,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {104458#true} assume true; {104458#true} is VALID [2022-04-08 10:13:02,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {104458#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {104458#true} is VALID [2022-04-08 10:13:02,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {104458#true} call ULTIMATE.init(); {104458#true} is VALID [2022-04-08 10:13:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-04-08 10:13:02,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853176955] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:13:02,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:13:02,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 8, 8] total 36 [2022-04-08 10:13:02,798 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:13:02,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2006677888] [2022-04-08 10:13:02,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2006677888] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:13:02,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:13:02,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-08 10:13:02,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009730428] [2022-04-08 10:13:02,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:13:02,798 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 26 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-08 10:13:02,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:13:02,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 26 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-08 10:13:02,823 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-08 10:13:02,823 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-08 10:13:02,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:02,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-08 10:13:02,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1177, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:13:02,823 INFO L87 Difference]: Start difference. First operand 382 states and 488 transitions. Second operand has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 26 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-08 10:13:20,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:20,645 INFO L93 Difference]: Finished difference Result 858 states and 1206 transitions. [2022-04-08 10:13:20,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 10:13:20,645 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 26 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-08 10:13:20,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:13:20,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 26 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-08 10:13:20,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 278 transitions. [2022-04-08 10:13:20,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 26 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-08 10:13:20,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 278 transitions. [2022-04-08 10:13:20,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 278 transitions. [2022-04-08 10:13:20,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 278 edges. 278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:20,897 INFO L225 Difference]: With dead ends: 858 [2022-04-08 10:13:20,897 INFO L226 Difference]: Without dead ends: 830 [2022-04-08 10:13:20,898 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=202, Invalid=3458, Unknown=0, NotChecked=0, Total=3660 [2022-04-08 10:13:20,898 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 207 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 5333 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 5487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 5333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:13:20,898 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 246 Invalid, 5487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 5333 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-08 10:13:20,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2022-04-08 10:13:22,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 398. [2022-04-08 10:13:22,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:13:22,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 830 states. Second operand has 398 states, 393 states have (on average 1.2900763358778626) internal successors, (507), 393 states have internal predecessors, (507), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:22,970 INFO L74 IsIncluded]: Start isIncluded. First operand 830 states. Second operand has 398 states, 393 states have (on average 1.2900763358778626) internal successors, (507), 393 states have internal predecessors, (507), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:22,970 INFO L87 Difference]: Start difference. First operand 830 states. Second operand has 398 states, 393 states have (on average 1.2900763358778626) internal successors, (507), 393 states have internal predecessors, (507), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:22,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:22,989 INFO L93 Difference]: Finished difference Result 830 states and 1042 transitions. [2022-04-08 10:13:22,989 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1042 transitions. [2022-04-08 10:13:22,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:22,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:22,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 398 states, 393 states have (on average 1.2900763358778626) internal successors, (507), 393 states have internal predecessors, (507), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 830 states. [2022-04-08 10:13:22,990 INFO L87 Difference]: Start difference. First operand has 398 states, 393 states have (on average 1.2900763358778626) internal successors, (507), 393 states have internal predecessors, (507), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 830 states. [2022-04-08 10:13:23,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:23,008 INFO L93 Difference]: Finished difference Result 830 states and 1042 transitions. [2022-04-08 10:13:23,008 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1042 transitions. [2022-04-08 10:13:23,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:23,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:23,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:13:23,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:13:23,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 393 states have (on average 1.2900763358778626) internal successors, (507), 393 states have internal predecessors, (507), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:23,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 511 transitions. [2022-04-08 10:13:23,016 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 511 transitions. Word has length 40 [2022-04-08 10:13:23,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:13:23,016 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 511 transitions. [2022-04-08 10:13:23,016 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 26 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-08 10:13:23,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 398 states and 511 transitions. [2022-04-08 10:13:25,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 511 edges. 511 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:25,758 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 511 transitions. [2022-04-08 10:13:25,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 10:13:25,758 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:13:25,758 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:13:25,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-04-08 10:13:25,958 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:25,959 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:13:25,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:13:25,959 INFO L85 PathProgramCache]: Analyzing trace with hash -264974095, now seen corresponding path program 17 times [2022-04-08 10:13:25,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:25,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1825962275] [2022-04-08 10:13:25,961 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:13:25,961 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:13:25,961 INFO L85 PathProgramCache]: Analyzing trace with hash -264974095, now seen corresponding path program 18 times [2022-04-08 10:13:25,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:13:25,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024403935] [2022-04-08 10:13:25,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:13:25,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:13:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:26,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:13:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:26,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {108972#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {108958#true} is VALID [2022-04-08 10:13:26,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {108958#true} assume true; {108958#true} is VALID [2022-04-08 10:13:26,194 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {108958#true} {108958#true} #83#return; {108958#true} is VALID [2022-04-08 10:13:26,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {108958#true} call ULTIMATE.init(); {108972#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:13:26,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {108972#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {108958#true} is VALID [2022-04-08 10:13:26,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {108958#true} assume true; {108958#true} is VALID [2022-04-08 10:13:26,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108958#true} {108958#true} #83#return; {108958#true} is VALID [2022-04-08 10:13:26,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {108958#true} call #t~ret15 := main(); {108958#true} is VALID [2022-04-08 10:13:26,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {108958#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {108963#(= main_~y~0 0)} is VALID [2022-04-08 10:13:26,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {108963#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108964#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:26,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {108964#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108965#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:26,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {108965#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108966#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:26,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {108966#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108967#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:26,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {108967#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:26,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:26,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:26,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:26,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:26,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:26,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:26,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:26,201 INFO L290 TraceCheckUtils]: 18: Hoare triple {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:26,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108967#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:26,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {108967#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108966#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:26,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {108966#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108965#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:26,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {108965#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108964#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:26,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {108964#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108963#(= main_~y~0 0)} is VALID [2022-04-08 10:13:26,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {108963#(= main_~y~0 0)} assume !(~y~0 % 4294967296 > 0); {108963#(= main_~y~0 0)} is VALID [2022-04-08 10:13:26,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {108963#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {108964#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:26,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {108964#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {108965#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:26,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {108965#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {108966#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:26,205 INFO L290 TraceCheckUtils]: 28: Hoare triple {108966#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {108967#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:26,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {108967#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:26,206 INFO L290 TraceCheckUtils]: 30: Hoare triple {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:26,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108967#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:26,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {108967#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108966#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:26,208 INFO L290 TraceCheckUtils]: 33: Hoare triple {108966#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108965#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:26,208 INFO L290 TraceCheckUtils]: 34: Hoare triple {108965#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108964#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:26,209 INFO L290 TraceCheckUtils]: 35: Hoare triple {108964#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108969#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:13:26,209 INFO L290 TraceCheckUtils]: 36: Hoare triple {108969#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 > 0); {108969#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:13:26,210 INFO L272 TraceCheckUtils]: 37: Hoare triple {108969#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {108970#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:13:26,210 INFO L290 TraceCheckUtils]: 38: Hoare triple {108970#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {108971#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:13:26,210 INFO L290 TraceCheckUtils]: 39: Hoare triple {108971#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {108959#false} is VALID [2022-04-08 10:13:26,211 INFO L290 TraceCheckUtils]: 40: Hoare triple {108959#false} assume !false; {108959#false} is VALID [2022-04-08 10:13:26,211 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:13:26,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:13:26,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024403935] [2022-04-08 10:13:26,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024403935] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:13:26,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949489725] [2022-04-08 10:13:26,211 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:13:26,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:26,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:13:26,212 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:13:26,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-04-08 10:13:26,285 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:13:26,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:13:26,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 78 conjunts are in the unsatisfiable core [2022-04-08 10:13:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:26,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:13:27,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {108958#true} call ULTIMATE.init(); {108958#true} is VALID [2022-04-08 10:13:27,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {108958#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {108958#true} is VALID [2022-04-08 10:13:27,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {108958#true} assume true; {108958#true} is VALID [2022-04-08 10:13:27,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108958#true} {108958#true} #83#return; {108958#true} is VALID [2022-04-08 10:13:27,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {108958#true} call #t~ret15 := main(); {108958#true} is VALID [2022-04-08 10:13:27,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {108958#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {108963#(= main_~y~0 0)} is VALID [2022-04-08 10:13:27,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {108963#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108964#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:27,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {108964#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108965#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:27,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {108965#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108966#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:27,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {108966#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108967#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:27,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {108967#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:27,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:27,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {108968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {109012#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:27,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {109012#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {109016#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:13:27,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {109016#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {109020#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:27,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {109020#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {109024#(and (<= 5 main_~y~0) (= main_~y~0 (+ main_~z~0 3)) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:27,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {109024#(and (<= 5 main_~y~0) (= main_~y~0 (+ main_~z~0 3)) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {109028#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:27,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {109028#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {109032#(and (<= 5 main_~y~0) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:27,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {109032#(and (<= 5 main_~y~0) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {109032#(and (<= 5 main_~y~0) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:27,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {109032#(and (<= 5 main_~y~0) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {109039#(and (= (+ main_~y~0 (- 3)) main_~z~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:27,036 INFO L290 TraceCheckUtils]: 20: Hoare triple {109039#(and (= (+ main_~y~0 (- 3)) main_~z~0) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {109043#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~z~0 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:13:27,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {109043#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~z~0 (+ (- 1) main_~y~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {109047#(and (<= main_~z~0 3) (<= 3 main_~z~0) (= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-08 10:13:27,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {109047#(and (<= main_~z~0 3) (<= 3 main_~z~0) (= main_~z~0 (+ main_~y~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {109051#(and (<= 4 main_~z~0) (= (+ (- 2) main_~z~0) (+ main_~y~0 1)) (<= main_~z~0 4))} is VALID [2022-04-08 10:13:27,038 INFO L290 TraceCheckUtils]: 23: Hoare triple {109051#(and (<= 4 main_~z~0) (= (+ (- 2) main_~z~0) (+ main_~y~0 1)) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {109055#(and (<= main_~z~0 5) (= (+ main_~y~0 1) (+ main_~z~0 (- 4))) (<= 5 main_~z~0))} is VALID [2022-04-08 10:13:27,038 INFO L290 TraceCheckUtils]: 24: Hoare triple {109055#(and (<= main_~z~0 5) (= (+ main_~y~0 1) (+ main_~z~0 (- 4))) (<= 5 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {109055#(and (<= main_~z~0 5) (= (+ main_~y~0 1) (+ main_~z~0 (- 4))) (<= 5 main_~z~0))} is VALID [2022-04-08 10:13:27,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {109055#(and (<= main_~z~0 5) (= (+ main_~y~0 1) (+ main_~z~0 (- 4))) (<= 5 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109062#(and (<= main_~z~0 5) (<= 5 main_~z~0) (= main_~y~0 (+ main_~z~0 (- 4))))} is VALID [2022-04-08 10:13:27,040 INFO L290 TraceCheckUtils]: 26: Hoare triple {109062#(and (<= main_~z~0 5) (<= 5 main_~z~0) (= main_~y~0 (+ main_~z~0 (- 4))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109066#(and (<= main_~z~0 5) (<= 5 main_~z~0) (= (+ (- 1) main_~y~0) (+ main_~z~0 (- 4))))} is VALID [2022-04-08 10:13:27,040 INFO L290 TraceCheckUtils]: 27: Hoare triple {109066#(and (<= main_~z~0 5) (<= 5 main_~z~0) (= (+ (- 1) main_~y~0) (+ main_~z~0 (- 4))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109070#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 (- 4))) (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:13:27,041 INFO L290 TraceCheckUtils]: 28: Hoare triple {109070#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 (- 4))) (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109074#(and (<= main_~z~0 5) (<= 5 main_~z~0) (= main_~y~0 (+ (- 1) main_~z~0)))} is VALID [2022-04-08 10:13:27,041 INFO L290 TraceCheckUtils]: 29: Hoare triple {109074#(and (<= main_~z~0 5) (<= 5 main_~z~0) (= main_~y~0 (+ (- 1) main_~z~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109012#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:27,042 INFO L290 TraceCheckUtils]: 30: Hoare triple {109012#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {109012#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:27,042 INFO L290 TraceCheckUtils]: 31: Hoare triple {109012#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109084#(and (<= 4 main_~z~0) (<= main_~z~0 4) (= (+ main_~z~0 1) (+ main_~y~0 1)))} is VALID [2022-04-08 10:13:27,043 INFO L290 TraceCheckUtils]: 32: Hoare triple {109084#(and (<= 4 main_~z~0) (<= main_~z~0 4) (= (+ main_~z~0 1) (+ main_~y~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109088#(and (<= main_~z~0 3) (<= 3 main_~z~0) (= (+ main_~y~0 2) (+ main_~z~0 2)))} is VALID [2022-04-08 10:13:27,043 INFO L290 TraceCheckUtils]: 33: Hoare triple {109088#(and (<= main_~z~0 3) (<= 3 main_~z~0) (= (+ main_~y~0 2) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109092#(and (<= main_~z~0 2) (<= 2 main_~z~0) (= (+ main_~z~0 3) (+ main_~y~0 3)))} is VALID [2022-04-08 10:13:27,044 INFO L290 TraceCheckUtils]: 34: Hoare triple {109092#(and (<= main_~z~0 2) (<= 2 main_~z~0) (= (+ main_~z~0 3) (+ main_~y~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109096#(and (= (+ main_~y~0 4) (+ main_~z~0 4)) (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:13:27,045 INFO L290 TraceCheckUtils]: 35: Hoare triple {109096#(and (= (+ main_~y~0 4) (+ main_~z~0 4)) (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109100#(and (<= 0 main_~y~0) (<= main_~y~0 0) (= (+ main_~z~0 1) (+ main_~y~0 1)))} is VALID [2022-04-08 10:13:27,045 INFO L290 TraceCheckUtils]: 36: Hoare triple {109100#(and (<= 0 main_~y~0) (<= main_~y~0 0) (= (+ main_~z~0 1) (+ main_~y~0 1)))} assume !(~z~0 % 4294967296 > 0); {108963#(= main_~y~0 0)} is VALID [2022-04-08 10:13:27,045 INFO L272 TraceCheckUtils]: 37: Hoare triple {108963#(= main_~y~0 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {109107#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:13:27,046 INFO L290 TraceCheckUtils]: 38: Hoare triple {109107#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {109111#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:13:27,046 INFO L290 TraceCheckUtils]: 39: Hoare triple {109111#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {108959#false} is VALID [2022-04-08 10:13:27,046 INFO L290 TraceCheckUtils]: 40: Hoare triple {108959#false} assume !false; {108959#false} is VALID [2022-04-08 10:13:27,046 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:13:27,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:13:27,945 INFO L290 TraceCheckUtils]: 40: Hoare triple {108959#false} assume !false; {108959#false} is VALID [2022-04-08 10:13:27,945 INFO L290 TraceCheckUtils]: 39: Hoare triple {109111#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {108959#false} is VALID [2022-04-08 10:13:27,946 INFO L290 TraceCheckUtils]: 38: Hoare triple {109107#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {109111#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:13:27,946 INFO L272 TraceCheckUtils]: 37: Hoare triple {109127#(= (mod main_~y~0 4294967296) 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {109107#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:13:27,947 INFO L290 TraceCheckUtils]: 36: Hoare triple {109131#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {109127#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-08 10:13:27,948 INFO L290 TraceCheckUtils]: 35: Hoare triple {109135#(or (= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109131#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:13:27,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {109139#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109135#(or (= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:13:27,950 INFO L290 TraceCheckUtils]: 33: Hoare triple {109143#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109139#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-08 10:13:27,950 INFO L290 TraceCheckUtils]: 32: Hoare triple {109147#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109143#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:13:27,952 INFO L290 TraceCheckUtils]: 31: Hoare triple {109151#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109147#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:13:27,952 INFO L290 TraceCheckUtils]: 30: Hoare triple {109151#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {109151#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:13:27,953 INFO L290 TraceCheckUtils]: 29: Hoare triple {109158#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109151#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:13:27,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {109162#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109158#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:13:27,954 INFO L290 TraceCheckUtils]: 27: Hoare triple {109166#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109162#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:13:27,955 INFO L290 TraceCheckUtils]: 26: Hoare triple {109170#(or (= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109166#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-08 10:13:27,956 INFO L290 TraceCheckUtils]: 25: Hoare triple {109174#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109170#(or (= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:13:27,956 INFO L290 TraceCheckUtils]: 24: Hoare triple {109174#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {109174#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:13:27,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {109181#(or (= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {109174#(or (= (mod main_~y~0 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:13:27,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {109185#(or (= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {109181#(or (= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:13:27,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {109189#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {109185#(or (= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:13:27,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {109193#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {109189#(or (= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:13:27,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {109197#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {109193#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:13:27,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {109197#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {109197#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:13:27,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {109204#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {109197#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:13:27,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {109208#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {109204#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:13:27,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {109212#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {109208#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:13:27,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {109216#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {109212#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:13:27,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {109151#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {109216#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:13:27,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {108958#true} ~z~0 := ~y~0; {109151#(or (= (mod (+ 4294967291 main_~y~0) 4294967296) 0) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:13:27,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {108958#true} assume !(~x~0 % 4294967296 > 0); {108958#true} is VALID [2022-04-08 10:13:27,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {108958#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108958#true} is VALID [2022-04-08 10:13:27,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {108958#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108958#true} is VALID [2022-04-08 10:13:27,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {108958#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108958#true} is VALID [2022-04-08 10:13:27,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {108958#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108958#true} is VALID [2022-04-08 10:13:27,965 INFO L290 TraceCheckUtils]: 6: Hoare triple {108958#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108958#true} is VALID [2022-04-08 10:13:27,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {108958#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {108958#true} is VALID [2022-04-08 10:13:27,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {108958#true} call #t~ret15 := main(); {108958#true} is VALID [2022-04-08 10:13:27,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108958#true} {108958#true} #83#return; {108958#true} is VALID [2022-04-08 10:13:27,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {108958#true} assume true; {108958#true} is VALID [2022-04-08 10:13:27,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {108958#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {108958#true} is VALID [2022-04-08 10:13:27,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {108958#true} call ULTIMATE.init(); {108958#true} is VALID [2022-04-08 10:13:27,966 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:13:27,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949489725] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:13:27,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:13:27,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 30, 25] total 55 [2022-04-08 10:13:27,966 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:13:27,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1825962275] [2022-04-08 10:13:27,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1825962275] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:13:27,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:13:27,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:13:27,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068548979] [2022-04-08 10:13:27,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:13:27,967 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 10 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 41 [2022-04-08 10:13:27,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:13:27,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.75) internal successors, (33), 10 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-08 10:13:27,994 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-08 10:13:27,994 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:13:27,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:27,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:13:27,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=504, Invalid=2466, Unknown=0, NotChecked=0, Total=2970 [2022-04-08 10:13:27,995 INFO L87 Difference]: Start difference. First operand 398 states and 511 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 10 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-08 10:13:30,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:30,869 INFO L93 Difference]: Finished difference Result 410 states and 523 transitions. [2022-04-08 10:13:30,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:13:30,869 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 10 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 41 [2022-04-08 10:13:30,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:13:30,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 10 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-08 10:13:30,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-08 10:13:30,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 10 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-08 10:13:30,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-08 10:13:30,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 54 transitions. [2022-04-08 10:13:30,913 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-08 10:13:30,920 INFO L225 Difference]: With dead ends: 410 [2022-04-08 10:13:30,920 INFO L226 Difference]: Without dead ends: 399 [2022-04-08 10:13:30,920 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1212 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=560, Invalid=3346, Unknown=0, NotChecked=0, Total=3906 [2022-04-08 10:13:30,921 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:13:30,921 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 56 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:13:30,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-04-08 10:13:33,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2022-04-08 10:13:33,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:13:33,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 399 states. Second operand has 399 states, 394 states have (on average 1.2893401015228427) internal successors, (508), 394 states have internal predecessors, (508), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:33,027 INFO L74 IsIncluded]: Start isIncluded. First operand 399 states. Second operand has 399 states, 394 states have (on average 1.2893401015228427) internal successors, (508), 394 states have internal predecessors, (508), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:33,028 INFO L87 Difference]: Start difference. First operand 399 states. Second operand has 399 states, 394 states have (on average 1.2893401015228427) internal successors, (508), 394 states have internal predecessors, (508), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:33,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:33,033 INFO L93 Difference]: Finished difference Result 399 states and 512 transitions. [2022-04-08 10:13:33,033 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 512 transitions. [2022-04-08 10:13:33,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:33,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:33,033 INFO L74 IsIncluded]: Start isIncluded. First operand has 399 states, 394 states have (on average 1.2893401015228427) internal successors, (508), 394 states have internal predecessors, (508), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 399 states. [2022-04-08 10:13:33,034 INFO L87 Difference]: Start difference. First operand has 399 states, 394 states have (on average 1.2893401015228427) internal successors, (508), 394 states have internal predecessors, (508), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 399 states. [2022-04-08 10:13:33,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:33,039 INFO L93 Difference]: Finished difference Result 399 states and 512 transitions. [2022-04-08 10:13:33,039 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 512 transitions. [2022-04-08 10:13:33,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:33,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:33,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:13:33,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:13:33,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 394 states have (on average 1.2893401015228427) internal successors, (508), 394 states have internal predecessors, (508), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:33,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 512 transitions. [2022-04-08 10:13:33,046 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 512 transitions. Word has length 41 [2022-04-08 10:13:33,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:13:33,046 INFO L478 AbstractCegarLoop]: Abstraction has 399 states and 512 transitions. [2022-04-08 10:13:33,046 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 10 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-08 10:13:33,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 399 states and 512 transitions. [2022-04-08 10:13:35,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 512 edges. 512 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:35,769 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 512 transitions. [2022-04-08 10:13:35,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 10:13:35,769 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:13:35,769 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:13:35,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-04-08 10:13:35,970 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-04-08 10:13:35,970 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:13:35,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:13:35,970 INFO L85 PathProgramCache]: Analyzing trace with hash -134128447, now seen corresponding path program 35 times [2022-04-08 10:13:35,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:35,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [687282927] [2022-04-08 10:13:35,975 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:13:35,975 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:13:35,975 INFO L85 PathProgramCache]: Analyzing trace with hash -134128447, now seen corresponding path program 36 times [2022-04-08 10:13:35,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:13:35,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813544568] [2022-04-08 10:13:35,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:13:35,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:13:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:36,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:13:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:36,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {111717#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {111693#true} is VALID [2022-04-08 10:13:36,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {111693#true} assume true; {111693#true} is VALID [2022-04-08 10:13:36,398 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {111693#true} {111693#true} #83#return; {111693#true} is VALID [2022-04-08 10:13:36,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {111693#true} call ULTIMATE.init(); {111717#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:13:36,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {111717#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {111693#true} is VALID [2022-04-08 10:13:36,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {111693#true} assume true; {111693#true} is VALID [2022-04-08 10:13:36,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111693#true} {111693#true} #83#return; {111693#true} is VALID [2022-04-08 10:13:36,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {111693#true} call #t~ret15 := main(); {111693#true} is VALID [2022-04-08 10:13:36,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {111693#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {111698#(= main_~y~0 0)} is VALID [2022-04-08 10:13:36,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {111698#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111699#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:36,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {111699#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111700#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:36,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {111700#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111701#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:36,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {111701#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111702#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:36,401 INFO L290 TraceCheckUtils]: 10: Hoare triple {111702#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111703#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:36,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {111703#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111704#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:13:36,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {111704#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111705#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:36,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {111705#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111706#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:13:36,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {111706#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {111706#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:13:36,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {111706#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:13:36,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111708#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:13:36,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {111708#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111709#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:13:36,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {111709#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111710#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:13:36,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {111710#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111711#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:13:36,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {111711#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111712#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:13:36,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {111712#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111713#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:13:36,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {111713#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111714#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:13:36,408 INFO L290 TraceCheckUtils]: 23: Hoare triple {111714#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111715#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:13:36,408 INFO L290 TraceCheckUtils]: 24: Hoare triple {111715#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {111715#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:13:36,408 INFO L290 TraceCheckUtils]: 25: Hoare triple {111715#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111714#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:13:36,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {111714#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111713#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:13:36,409 INFO L290 TraceCheckUtils]: 27: Hoare triple {111713#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111712#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:13:36,410 INFO L290 TraceCheckUtils]: 28: Hoare triple {111712#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111711#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:13:36,410 INFO L290 TraceCheckUtils]: 29: Hoare triple {111711#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111710#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:13:36,411 INFO L290 TraceCheckUtils]: 30: Hoare triple {111710#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111709#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:13:36,411 INFO L290 TraceCheckUtils]: 31: Hoare triple {111709#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111708#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:13:36,412 INFO L290 TraceCheckUtils]: 32: Hoare triple {111708#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:13:36,412 INFO L290 TraceCheckUtils]: 33: Hoare triple {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~y~0 % 4294967296 > 0); {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:13:36,413 INFO L290 TraceCheckUtils]: 34: Hoare triple {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~x~0 % 4294967296 > 0); {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:13:36,413 INFO L290 TraceCheckUtils]: 35: Hoare triple {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {111716#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:13:36,414 INFO L290 TraceCheckUtils]: 36: Hoare triple {111716#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {111694#false} is VALID [2022-04-08 10:13:36,414 INFO L272 TraceCheckUtils]: 37: Hoare triple {111694#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {111694#false} is VALID [2022-04-08 10:13:36,414 INFO L290 TraceCheckUtils]: 38: Hoare triple {111694#false} ~cond := #in~cond; {111694#false} is VALID [2022-04-08 10:13:36,414 INFO L290 TraceCheckUtils]: 39: Hoare triple {111694#false} assume 0 == ~cond; {111694#false} is VALID [2022-04-08 10:13:36,414 INFO L290 TraceCheckUtils]: 40: Hoare triple {111694#false} assume !false; {111694#false} is VALID [2022-04-08 10:13:36,414 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:13:36,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:13:36,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813544568] [2022-04-08 10:13:36,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813544568] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:13:36,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962851359] [2022-04-08 10:13:36,414 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:13:36,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:36,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:13:36,415 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:13:36,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-04-08 10:13:36,551 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:13:36,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:13:36,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-08 10:13:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:36,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:13:36,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {111693#true} call ULTIMATE.init(); {111693#true} is VALID [2022-04-08 10:13:36,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {111693#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {111693#true} is VALID [2022-04-08 10:13:36,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {111693#true} assume true; {111693#true} is VALID [2022-04-08 10:13:36,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111693#true} {111693#true} #83#return; {111693#true} is VALID [2022-04-08 10:13:36,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {111693#true} call #t~ret15 := main(); {111693#true} is VALID [2022-04-08 10:13:36,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {111693#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {111698#(= main_~y~0 0)} is VALID [2022-04-08 10:13:36,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {111698#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111699#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:36,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {111699#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111700#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:36,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {111700#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111701#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:36,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {111701#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111702#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:36,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {111702#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111703#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:36,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {111703#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111704#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:13:36,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {111704#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111705#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:36,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {111705#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111706#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:13:36,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {111706#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {111706#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:13:36,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {111706#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:13:36,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111708#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:13:36,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {111708#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111709#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:13:36,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {111709#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111710#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:13:36,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {111710#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111711#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:13:36,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {111711#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111712#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:13:36,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {111712#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111713#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:13:36,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {111713#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111714#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:13:36,935 INFO L290 TraceCheckUtils]: 23: Hoare triple {111714#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111715#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:13:36,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {111715#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {111715#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:13:36,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {111715#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111714#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:13:36,937 INFO L290 TraceCheckUtils]: 26: Hoare triple {111714#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111713#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:13:36,938 INFO L290 TraceCheckUtils]: 27: Hoare triple {111713#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111712#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:13:36,938 INFO L290 TraceCheckUtils]: 28: Hoare triple {111712#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111711#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:13:36,939 INFO L290 TraceCheckUtils]: 29: Hoare triple {111711#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111710#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:13:36,939 INFO L290 TraceCheckUtils]: 30: Hoare triple {111710#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111709#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:13:36,940 INFO L290 TraceCheckUtils]: 31: Hoare triple {111709#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111708#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:13:36,941 INFO L290 TraceCheckUtils]: 32: Hoare triple {111708#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:13:36,941 INFO L290 TraceCheckUtils]: 33: Hoare triple {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~y~0 % 4294967296 > 0); {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:13:36,942 INFO L290 TraceCheckUtils]: 34: Hoare triple {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~x~0 % 4294967296 > 0); {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:13:36,942 INFO L290 TraceCheckUtils]: 35: Hoare triple {111707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {111708#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:13:36,943 INFO L290 TraceCheckUtils]: 36: Hoare triple {111708#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {111694#false} is VALID [2022-04-08 10:13:36,943 INFO L272 TraceCheckUtils]: 37: Hoare triple {111694#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {111694#false} is VALID [2022-04-08 10:13:36,943 INFO L290 TraceCheckUtils]: 38: Hoare triple {111694#false} ~cond := #in~cond; {111694#false} is VALID [2022-04-08 10:13:36,943 INFO L290 TraceCheckUtils]: 39: Hoare triple {111694#false} assume 0 == ~cond; {111694#false} is VALID [2022-04-08 10:13:36,943 INFO L290 TraceCheckUtils]: 40: Hoare triple {111694#false} assume !false; {111694#false} is VALID [2022-04-08 10:13:36,943 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:13:36,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:13:37,572 INFO L290 TraceCheckUtils]: 40: Hoare triple {111694#false} assume !false; {111694#false} is VALID [2022-04-08 10:13:37,573 INFO L290 TraceCheckUtils]: 39: Hoare triple {111694#false} assume 0 == ~cond; {111694#false} is VALID [2022-04-08 10:13:37,573 INFO L290 TraceCheckUtils]: 38: Hoare triple {111694#false} ~cond := #in~cond; {111694#false} is VALID [2022-04-08 10:13:37,573 INFO L272 TraceCheckUtils]: 37: Hoare triple {111694#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {111694#false} is VALID [2022-04-08 10:13:37,573 INFO L290 TraceCheckUtils]: 36: Hoare triple {111853#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {111694#false} is VALID [2022-04-08 10:13:37,576 INFO L290 TraceCheckUtils]: 35: Hoare triple {111857#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {111853#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:13:37,576 INFO L290 TraceCheckUtils]: 34: Hoare triple {111857#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {111857#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:13:37,576 INFO L290 TraceCheckUtils]: 33: Hoare triple {111857#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {111857#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:13:37,577 INFO L290 TraceCheckUtils]: 32: Hoare triple {111853#(< 0 (mod main_~z~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111857#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:13:37,578 INFO L290 TraceCheckUtils]: 31: Hoare triple {111870#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111853#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:13:37,578 INFO L290 TraceCheckUtils]: 30: Hoare triple {111874#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111870#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-08 10:13:37,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {111878#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111874#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-08 10:13:37,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {111882#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111878#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-08 10:13:37,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {111886#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111882#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-08 10:13:37,581 INFO L290 TraceCheckUtils]: 26: Hoare triple {111890#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111886#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-08 10:13:37,581 INFO L290 TraceCheckUtils]: 25: Hoare triple {111894#(< 0 (mod (+ 7 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111890#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-08 10:13:37,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {111894#(< 0 (mod (+ 7 main_~z~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {111894#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-08 10:13:37,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {111890#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111894#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-08 10:13:37,583 INFO L290 TraceCheckUtils]: 22: Hoare triple {111886#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111890#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-08 10:13:37,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {111882#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111886#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-08 10:13:37,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {111878#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111882#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-08 10:13:37,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {111874#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111878#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-08 10:13:37,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {111870#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111874#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-08 10:13:37,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {111853#(< 0 (mod main_~z~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111870#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-08 10:13:37,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {111857#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111853#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:13:37,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {111925#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {111857#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:13:37,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {111925#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {111925#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:13:37,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {111932#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111925#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:13:37,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {111936#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111932#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:13:37,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {111940#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111936#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:13:37,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {111944#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111940#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:13:37,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {111948#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111944#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:13:37,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {111952#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111948#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:13:37,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {111956#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111952#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:37,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {111960#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111956#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:13:37,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {111693#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {111960#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:37,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {111693#true} call #t~ret15 := main(); {111693#true} is VALID [2022-04-08 10:13:37,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111693#true} {111693#true} #83#return; {111693#true} is VALID [2022-04-08 10:13:37,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {111693#true} assume true; {111693#true} is VALID [2022-04-08 10:13:37,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {111693#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {111693#true} is VALID [2022-04-08 10:13:37,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {111693#true} call ULTIMATE.init(); {111693#true} is VALID [2022-04-08 10:13:37,593 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:13:37,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962851359] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:13:37,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:13:37,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 40 [2022-04-08 10:13:37,594 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:13:37,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [687282927] [2022-04-08 10:13:37,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [687282927] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:13:37,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:13:37,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 10:13:37,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721078065] [2022-04-08 10:13:37,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:13:37,594 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 2 states have call successors, (3), 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-08 10:13:37,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:13:37,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:37,624 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-08 10:13:37,624 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 10:13:37,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:37,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 10:13:37,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1321, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:13:37,625 INFO L87 Difference]: Start difference. First operand 399 states and 512 transitions. Second operand has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:50,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:50,476 INFO L93 Difference]: Finished difference Result 568 states and 762 transitions. [2022-04-08 10:13:50,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-04-08 10:13:50,476 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 2 states have call successors, (3), 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-08 10:13:50,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:13:50,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:50,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 312 transitions. [2022-04-08 10:13:50,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:50,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 312 transitions. [2022-04-08 10:13:50,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 312 transitions. [2022-04-08 10:13:50,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 312 edges. 312 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:50,773 INFO L225 Difference]: With dead ends: 568 [2022-04-08 10:13:50,773 INFO L226 Difference]: Without dead ends: 549 [2022-04-08 10:13:50,774 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4770 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2454, Invalid=16452, Unknown=0, NotChecked=0, Total=18906 [2022-04-08 10:13:50,774 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 137 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 3488 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 3804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 3488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:13:50,774 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 130 Invalid, 3804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 3488 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-08 10:13:50,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2022-04-08 10:13:52,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 410. [2022-04-08 10:13:52,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:13:52,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 549 states. Second operand has 410 states, 405 states have (on average 1.2814814814814814) internal successors, (519), 405 states have internal predecessors, (519), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:52,978 INFO L74 IsIncluded]: Start isIncluded. First operand 549 states. Second operand has 410 states, 405 states have (on average 1.2814814814814814) internal successors, (519), 405 states have internal predecessors, (519), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:52,978 INFO L87 Difference]: Start difference. First operand 549 states. Second operand has 410 states, 405 states have (on average 1.2814814814814814) internal successors, (519), 405 states have internal predecessors, (519), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:52,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:52,987 INFO L93 Difference]: Finished difference Result 549 states and 686 transitions. [2022-04-08 10:13:52,987 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 686 transitions. [2022-04-08 10:13:52,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:52,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:52,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 410 states, 405 states have (on average 1.2814814814814814) internal successors, (519), 405 states have internal predecessors, (519), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 549 states. [2022-04-08 10:13:52,988 INFO L87 Difference]: Start difference. First operand has 410 states, 405 states have (on average 1.2814814814814814) internal successors, (519), 405 states have internal predecessors, (519), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 549 states. [2022-04-08 10:13:52,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:52,996 INFO L93 Difference]: Finished difference Result 549 states and 686 transitions. [2022-04-08 10:13:52,996 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 686 transitions. [2022-04-08 10:13:52,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:52,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:52,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:13:52,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:13:52,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 405 states have (on average 1.2814814814814814) internal successors, (519), 405 states have internal predecessors, (519), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:53,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 523 transitions. [2022-04-08 10:13:53,008 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 523 transitions. Word has length 41 [2022-04-08 10:13:53,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:13:53,008 INFO L478 AbstractCegarLoop]: Abstraction has 410 states and 523 transitions. [2022-04-08 10:13:53,008 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:53,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 410 states and 523 transitions. [2022-04-08 10:13:56,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 523 edges. 523 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:56,595 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 523 transitions. [2022-04-08 10:13:56,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 10:13:56,596 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:13:56,596 INFO L499 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:13:56,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2022-04-08 10:13:56,796 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-04-08 10:13:56,796 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:13:56,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:13:56,797 INFO L85 PathProgramCache]: Analyzing trace with hash -270255777, now seen corresponding path program 67 times [2022-04-08 10:13:56,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:56,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2091523332] [2022-04-08 10:13:56,799 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:13:56,799 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:13:56,799 INFO L85 PathProgramCache]: Analyzing trace with hash -270255777, now seen corresponding path program 68 times [2022-04-08 10:13:56,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:13:56,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823517152] [2022-04-08 10:13:56,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:13:56,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:13:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:57,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:13:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:57,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {115261#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {115231#true} is VALID [2022-04-08 10:13:57,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {115231#true} assume true; {115231#true} is VALID [2022-04-08 10:13:57,256 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {115231#true} {115231#true} #83#return; {115231#true} is VALID [2022-04-08 10:13:57,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {115231#true} call ULTIMATE.init(); {115261#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:13:57,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {115261#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {115231#true} is VALID [2022-04-08 10:13:57,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {115231#true} assume true; {115231#true} is VALID [2022-04-08 10:13:57,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115231#true} {115231#true} #83#return; {115231#true} is VALID [2022-04-08 10:13:57,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {115231#true} call #t~ret15 := main(); {115231#true} is VALID [2022-04-08 10:13:57,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {115231#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {115236#(= main_~y~0 0)} is VALID [2022-04-08 10:13:57,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {115236#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115237#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:57,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {115237#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115238#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:57,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {115238#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115239#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:57,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {115239#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115240#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:57,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {115240#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115241#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:57,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {115241#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115242#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:13:57,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {115242#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115243#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:57,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {115243#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115244#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:13:57,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {115244#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115245#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:13:57,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {115245#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115246#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:13:57,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {115246#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115247#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:13:57,263 INFO L290 TraceCheckUtils]: 17: Hoare triple {115247#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115248#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:13:57,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {115248#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115249#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:57,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {115249#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115250#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:13:57,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {115250#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115251#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:13:57,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {115251#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115252#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:13:57,265 INFO L290 TraceCheckUtils]: 22: Hoare triple {115252#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115253#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:13:57,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {115253#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115254#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:13:57,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {115254#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115255#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:13:57,267 INFO L290 TraceCheckUtils]: 25: Hoare triple {115255#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115256#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:13:57,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {115256#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115257#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:13:57,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {115257#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115258#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:13:57,268 INFO L290 TraceCheckUtils]: 28: Hoare triple {115258#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {115258#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:13:57,269 INFO L290 TraceCheckUtils]: 29: Hoare triple {115258#(and (<= main_~y~0 22) (<= 22 main_~y~0))} ~z~0 := ~y~0; {115259#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-08 10:13:57,269 INFO L290 TraceCheckUtils]: 30: Hoare triple {115259#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {115260#(and (<= (div main_~z~0 4294967296) 0) (<= 21 main_~z~0))} is VALID [2022-04-08 10:13:57,270 INFO L290 TraceCheckUtils]: 31: Hoare triple {115260#(and (<= (div main_~z~0 4294967296) 0) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {115232#false} is VALID [2022-04-08 10:13:57,270 INFO L290 TraceCheckUtils]: 32: Hoare triple {115232#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115232#false} is VALID [2022-04-08 10:13:57,270 INFO L290 TraceCheckUtils]: 33: Hoare triple {115232#false} assume !(~y~0 % 4294967296 > 0); {115232#false} is VALID [2022-04-08 10:13:57,270 INFO L290 TraceCheckUtils]: 34: Hoare triple {115232#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {115232#false} is VALID [2022-04-08 10:13:57,270 INFO L290 TraceCheckUtils]: 35: Hoare triple {115232#false} assume !(~x~0 % 4294967296 > 0); {115232#false} is VALID [2022-04-08 10:13:57,270 INFO L290 TraceCheckUtils]: 36: Hoare triple {115232#false} assume !(~z~0 % 4294967296 > 0); {115232#false} is VALID [2022-04-08 10:13:57,270 INFO L272 TraceCheckUtils]: 37: Hoare triple {115232#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {115232#false} is VALID [2022-04-08 10:13:57,270 INFO L290 TraceCheckUtils]: 38: Hoare triple {115232#false} ~cond := #in~cond; {115232#false} is VALID [2022-04-08 10:13:57,270 INFO L290 TraceCheckUtils]: 39: Hoare triple {115232#false} assume 0 == ~cond; {115232#false} is VALID [2022-04-08 10:13:57,270 INFO L290 TraceCheckUtils]: 40: Hoare triple {115232#false} assume !false; {115232#false} is VALID [2022-04-08 10:13:57,270 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 254 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:13:57,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:13:57,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823517152] [2022-04-08 10:13:57,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823517152] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:13:57,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113587689] [2022-04-08 10:13:57,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:13:57,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:57,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:13:57,271 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:13:57,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-04-08 10:13:57,320 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:13:57,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:13:57,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-08 10:13:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:57,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:13:57,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {115231#true} call ULTIMATE.init(); {115231#true} is VALID [2022-04-08 10:13:57,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {115231#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {115231#true} is VALID [2022-04-08 10:13:57,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {115231#true} assume true; {115231#true} is VALID [2022-04-08 10:13:57,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115231#true} {115231#true} #83#return; {115231#true} is VALID [2022-04-08 10:13:57,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {115231#true} call #t~ret15 := main(); {115231#true} is VALID [2022-04-08 10:13:57,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {115231#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {115236#(= main_~y~0 0)} is VALID [2022-04-08 10:13:57,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {115236#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115237#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:57,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {115237#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115238#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:57,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {115238#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115239#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:57,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {115239#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115240#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:57,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {115240#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115241#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:57,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {115241#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115242#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:13:57,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {115242#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115243#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:57,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {115243#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115244#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:13:57,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {115244#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115245#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:13:57,667 INFO L290 TraceCheckUtils]: 15: Hoare triple {115245#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115246#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:13:57,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {115246#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115247#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:13:57,668 INFO L290 TraceCheckUtils]: 17: Hoare triple {115247#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115248#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:13:57,669 INFO L290 TraceCheckUtils]: 18: Hoare triple {115248#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115249#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:57,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {115249#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115250#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:13:57,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {115250#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115251#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:13:57,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {115251#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115252#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:13:57,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {115252#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115253#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:13:57,672 INFO L290 TraceCheckUtils]: 23: Hoare triple {115253#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115254#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:13:57,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {115254#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115255#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:13:57,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {115255#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115256#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:13:57,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {115256#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115257#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:13:57,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {115257#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115258#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:13:57,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {115258#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {115258#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:13:57,675 INFO L290 TraceCheckUtils]: 29: Hoare triple {115258#(and (<= main_~y~0 22) (<= 22 main_~y~0))} ~z~0 := ~y~0; {115258#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:13:57,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {115258#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {115258#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:13:57,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {115258#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {115258#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:13:57,676 INFO L290 TraceCheckUtils]: 32: Hoare triple {115258#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115257#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:13:57,676 INFO L290 TraceCheckUtils]: 33: Hoare triple {115257#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !(~y~0 % 4294967296 > 0); {115232#false} is VALID [2022-04-08 10:13:57,676 INFO L290 TraceCheckUtils]: 34: Hoare triple {115232#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {115232#false} is VALID [2022-04-08 10:13:57,676 INFO L290 TraceCheckUtils]: 35: Hoare triple {115232#false} assume !(~x~0 % 4294967296 > 0); {115232#false} is VALID [2022-04-08 10:13:57,676 INFO L290 TraceCheckUtils]: 36: Hoare triple {115232#false} assume !(~z~0 % 4294967296 > 0); {115232#false} is VALID [2022-04-08 10:13:57,676 INFO L272 TraceCheckUtils]: 37: Hoare triple {115232#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {115232#false} is VALID [2022-04-08 10:13:57,676 INFO L290 TraceCheckUtils]: 38: Hoare triple {115232#false} ~cond := #in~cond; {115232#false} is VALID [2022-04-08 10:13:57,676 INFO L290 TraceCheckUtils]: 39: Hoare triple {115232#false} assume 0 == ~cond; {115232#false} is VALID [2022-04-08 10:13:57,677 INFO L290 TraceCheckUtils]: 40: Hoare triple {115232#false} assume !false; {115232#false} is VALID [2022-04-08 10:13:57,677 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 254 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:13:57,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:13:58,598 INFO L290 TraceCheckUtils]: 40: Hoare triple {115232#false} assume !false; {115232#false} is VALID [2022-04-08 10:13:58,599 INFO L290 TraceCheckUtils]: 39: Hoare triple {115232#false} assume 0 == ~cond; {115232#false} is VALID [2022-04-08 10:13:58,599 INFO L290 TraceCheckUtils]: 38: Hoare triple {115232#false} ~cond := #in~cond; {115232#false} is VALID [2022-04-08 10:13:58,599 INFO L272 TraceCheckUtils]: 37: Hoare triple {115232#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {115232#false} is VALID [2022-04-08 10:13:58,599 INFO L290 TraceCheckUtils]: 36: Hoare triple {115232#false} assume !(~z~0 % 4294967296 > 0); {115232#false} is VALID [2022-04-08 10:13:58,599 INFO L290 TraceCheckUtils]: 35: Hoare triple {115232#false} assume !(~x~0 % 4294967296 > 0); {115232#false} is VALID [2022-04-08 10:13:58,599 INFO L290 TraceCheckUtils]: 34: Hoare triple {115232#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {115232#false} is VALID [2022-04-08 10:13:58,599 INFO L290 TraceCheckUtils]: 33: Hoare triple {115406#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {115232#false} is VALID [2022-04-08 10:13:58,600 INFO L290 TraceCheckUtils]: 32: Hoare triple {115410#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115406#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:13:58,601 INFO L290 TraceCheckUtils]: 31: Hoare triple {115410#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {115410#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:13:58,601 INFO L290 TraceCheckUtils]: 30: Hoare triple {115410#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {115410#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:13:58,601 INFO L290 TraceCheckUtils]: 29: Hoare triple {115410#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {115410#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:13:58,602 INFO L290 TraceCheckUtils]: 28: Hoare triple {115410#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {115410#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:13:58,602 INFO L290 TraceCheckUtils]: 27: Hoare triple {115406#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115410#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:13:58,603 INFO L290 TraceCheckUtils]: 26: Hoare triple {115429#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115406#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:13:58,604 INFO L290 TraceCheckUtils]: 25: Hoare triple {115433#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115429#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:13:58,604 INFO L290 TraceCheckUtils]: 24: Hoare triple {115437#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115433#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:13:58,605 INFO L290 TraceCheckUtils]: 23: Hoare triple {115441#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115437#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:13:58,605 INFO L290 TraceCheckUtils]: 22: Hoare triple {115445#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115441#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:13:58,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {115449#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115445#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:58,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {115453#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115449#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:13:58,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {115457#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115453#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:58,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {115461#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115457#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:13:58,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {115465#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115461#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:13:58,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {115469#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115465#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:13:58,610 INFO L290 TraceCheckUtils]: 15: Hoare triple {115473#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115469#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:13:58,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {115477#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115473#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:13:58,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {115481#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115477#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:13:58,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {115485#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115481#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:13:58,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {115489#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115485#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:13:58,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {115493#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115489#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:13:58,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {115497#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115493#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:13:58,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {115501#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115497#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:13:58,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {115505#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115501#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:58,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {115509#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115505#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:13:58,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {115231#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {115509#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-08 10:13:58,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {115231#true} call #t~ret15 := main(); {115231#true} is VALID [2022-04-08 10:13:58,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115231#true} {115231#true} #83#return; {115231#true} is VALID [2022-04-08 10:13:58,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {115231#true} assume true; {115231#true} is VALID [2022-04-08 10:13:58,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {115231#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {115231#true} is VALID [2022-04-08 10:13:58,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {115231#true} call ULTIMATE.init(); {115231#true} is VALID [2022-04-08 10:13:58,616 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 254 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:13:58,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113587689] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:13:58,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:13:58,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25, 25] total 51 [2022-04-08 10:13:58,617 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:13:58,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2091523332] [2022-04-08 10:13:58,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2091523332] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:13:58,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:13:58,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-08 10:13:58,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125572943] [2022-04-08 10:13:58,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:13:58,617 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 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-08 10:13:58,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:13:58,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 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-08 10:13:58,642 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-08 10:13:58,642 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-08 10:13:58,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:58,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-08 10:13:58,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=627, Invalid=1923, Unknown=0, NotChecked=0, Total=2550 [2022-04-08 10:13:58,643 INFO L87 Difference]: Start difference. First operand 410 states and 523 transitions. Second operand has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 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-08 10:14:19,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:19,502 INFO L93 Difference]: Finished difference Result 951 states and 1339 transitions. [2022-04-08 10:14:19,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 10:14:19,502 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 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-08 10:14:19,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:14:19,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 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-08 10:14:19,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 290 transitions. [2022-04-08 10:14:19,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 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-08 10:14:19,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 290 transitions. [2022-04-08 10:14:19,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 290 transitions. [2022-04-08 10:14:19,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 290 edges. 290 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:19,773 INFO L225 Difference]: With dead ends: 951 [2022-04-08 10:14:19,773 INFO L226 Difference]: Without dead ends: 923 [2022-04-08 10:14:19,774 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1335, Invalid=4517, Unknown=0, NotChecked=0, Total=5852 [2022-04-08 10:14:19,774 INFO L913 BasicCegarLoop]: 130 mSDtfsCounter, 219 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 5828 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 5988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 5828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:14:19,774 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 257 Invalid, 5988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 5828 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-08 10:14:19,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2022-04-08 10:14:22,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 426. [2022-04-08 10:14:22,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:14:22,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 923 states. Second operand has 426 states, 421 states have (on average 1.2874109263657958) internal successors, (542), 421 states have internal predecessors, (542), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:22,036 INFO L74 IsIncluded]: Start isIncluded. First operand 923 states. Second operand has 426 states, 421 states have (on average 1.2874109263657958) internal successors, (542), 421 states have internal predecessors, (542), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:22,036 INFO L87 Difference]: Start difference. First operand 923 states. Second operand has 426 states, 421 states have (on average 1.2874109263657958) internal successors, (542), 421 states have internal predecessors, (542), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:22,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:22,062 INFO L93 Difference]: Finished difference Result 923 states and 1169 transitions. [2022-04-08 10:14:22,062 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1169 transitions. [2022-04-08 10:14:22,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:14:22,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:14:22,062 INFO L74 IsIncluded]: Start isIncluded. First operand has 426 states, 421 states have (on average 1.2874109263657958) internal successors, (542), 421 states have internal predecessors, (542), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 923 states. [2022-04-08 10:14:22,063 INFO L87 Difference]: Start difference. First operand has 426 states, 421 states have (on average 1.2874109263657958) internal successors, (542), 421 states have internal predecessors, (542), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 923 states. [2022-04-08 10:14:22,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:22,088 INFO L93 Difference]: Finished difference Result 923 states and 1169 transitions. [2022-04-08 10:14:22,088 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1169 transitions. [2022-04-08 10:14:22,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:14:22,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:14:22,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:14:22,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:14:22,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 421 states have (on average 1.2874109263657958) internal successors, (542), 421 states have internal predecessors, (542), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:22,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 546 transitions. [2022-04-08 10:14:22,096 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 546 transitions. Word has length 41 [2022-04-08 10:14:22,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:14:22,097 INFO L478 AbstractCegarLoop]: Abstraction has 426 states and 546 transitions. [2022-04-08 10:14:22,097 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 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-08 10:14:22,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 426 states and 546 transitions. [2022-04-08 10:14:25,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 546 edges. 546 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:25,266 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 546 transitions. [2022-04-08 10:14:25,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 10:14:25,267 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:14:25,267 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:14:25,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-04-08 10:14:25,467 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:14:25,467 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:14:25,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:14:25,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1741037917, now seen corresponding path program 19 times [2022-04-08 10:14:25,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:25,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1866417878] [2022-04-08 10:14:25,470 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:14:25,470 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:14:25,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1741037917, now seen corresponding path program 20 times [2022-04-08 10:14:25,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:14:25,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835088666] [2022-04-08 10:14:25,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:14:25,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:14:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:25,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:14:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:25,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {120193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {120182#true} is VALID [2022-04-08 10:14:25,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {120182#true} assume true; {120182#true} is VALID [2022-04-08 10:14:25,582 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {120182#true} {120182#true} #83#return; {120182#true} is VALID [2022-04-08 10:14:25,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {120182#true} call ULTIMATE.init(); {120193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:14:25,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {120193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {120182#true} is VALID [2022-04-08 10:14:25,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {120182#true} assume true; {120182#true} is VALID [2022-04-08 10:14:25,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120182#true} {120182#true} #83#return; {120182#true} is VALID [2022-04-08 10:14:25,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {120182#true} call #t~ret15 := main(); {120182#true} is VALID [2022-04-08 10:14:25,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {120182#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {120182#true} is VALID [2022-04-08 10:14:25,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-08 10:14:25,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-08 10:14:25,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-08 10:14:25,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-08 10:14:25,582 INFO L290 TraceCheckUtils]: 10: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-08 10:14:25,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {120182#true} assume !(~x~0 % 4294967296 > 0); {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:14:25,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:14:25,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120188#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:14:25,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {120188#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120189#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:14:25,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {120189#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120190#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:14:25,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {120190#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120191#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:14:25,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {120191#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:14:25,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:14:25,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:14:25,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:14:25,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:14:25,589 INFO L290 TraceCheckUtils]: 22: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:14:25,589 INFO L290 TraceCheckUtils]: 23: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:14:25,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~y~0 % 4294967296 > 0); {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:14:25,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120191#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:14:25,591 INFO L290 TraceCheckUtils]: 26: Hoare triple {120191#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120190#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:14:25,592 INFO L290 TraceCheckUtils]: 27: Hoare triple {120190#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120189#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:14:25,593 INFO L290 TraceCheckUtils]: 28: Hoare triple {120189#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120188#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:14:25,594 INFO L290 TraceCheckUtils]: 29: Hoare triple {120188#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:14:25,595 INFO L290 TraceCheckUtils]: 30: Hoare triple {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120183#false} is VALID [2022-04-08 10:14:25,595 INFO L290 TraceCheckUtils]: 31: Hoare triple {120183#false} assume !(~x~0 % 4294967296 > 0); {120183#false} is VALID [2022-04-08 10:14:25,595 INFO L290 TraceCheckUtils]: 32: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-08 10:14:25,595 INFO L290 TraceCheckUtils]: 33: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-08 10:14:25,595 INFO L290 TraceCheckUtils]: 34: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-08 10:14:25,595 INFO L290 TraceCheckUtils]: 35: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-08 10:14:25,595 INFO L290 TraceCheckUtils]: 36: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-08 10:14:25,595 INFO L290 TraceCheckUtils]: 37: Hoare triple {120183#false} assume !(~z~0 % 4294967296 > 0); {120183#false} is VALID [2022-04-08 10:14:25,595 INFO L272 TraceCheckUtils]: 38: Hoare triple {120183#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {120183#false} is VALID [2022-04-08 10:14:25,595 INFO L290 TraceCheckUtils]: 39: Hoare triple {120183#false} ~cond := #in~cond; {120183#false} is VALID [2022-04-08 10:14:25,595 INFO L290 TraceCheckUtils]: 40: Hoare triple {120183#false} assume 0 == ~cond; {120183#false} is VALID [2022-04-08 10:14:25,595 INFO L290 TraceCheckUtils]: 41: Hoare triple {120183#false} assume !false; {120183#false} is VALID [2022-04-08 10:14:25,596 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:14:25,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:14:25,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835088666] [2022-04-08 10:14:25,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835088666] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:14:25,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671586964] [2022-04-08 10:14:25,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:14:25,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:14:25,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:14:25,597 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:14:25,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-04-08 10:14:25,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:14:25,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:14:25,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-08 10:14:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:25,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:14:25,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {120182#true} call ULTIMATE.init(); {120182#true} is VALID [2022-04-08 10:14:25,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {120182#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {120182#true} is VALID [2022-04-08 10:14:25,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {120182#true} assume true; {120182#true} is VALID [2022-04-08 10:14:25,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120182#true} {120182#true} #83#return; {120182#true} is VALID [2022-04-08 10:14:25,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {120182#true} call #t~ret15 := main(); {120182#true} is VALID [2022-04-08 10:14:25,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {120182#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {120182#true} is VALID [2022-04-08 10:14:25,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-08 10:14:25,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-08 10:14:25,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-08 10:14:25,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-08 10:14:25,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-08 10:14:25,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {120182#true} assume !(~x~0 % 4294967296 > 0); {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:14:25,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:14:25,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120188#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:14:25,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {120188#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120189#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:14:25,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {120189#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120190#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:14:25,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {120190#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120191#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:14:25,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {120191#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:14:25,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:14:25,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:14:25,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:14:25,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:14:25,922 INFO L290 TraceCheckUtils]: 22: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:14:25,922 INFO L290 TraceCheckUtils]: 23: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:14:25,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~y~0 % 4294967296 > 0); {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:14:25,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120191#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:14:25,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {120191#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120190#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:14:25,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {120190#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120189#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:14:25,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {120189#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120188#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:14:25,927 INFO L290 TraceCheckUtils]: 29: Hoare triple {120188#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:14:25,928 INFO L290 TraceCheckUtils]: 30: Hoare triple {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120183#false} is VALID [2022-04-08 10:14:25,928 INFO L290 TraceCheckUtils]: 31: Hoare triple {120183#false} assume !(~x~0 % 4294967296 > 0); {120183#false} is VALID [2022-04-08 10:14:25,928 INFO L290 TraceCheckUtils]: 32: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-08 10:14:25,928 INFO L290 TraceCheckUtils]: 33: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-08 10:14:25,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-08 10:14:25,928 INFO L290 TraceCheckUtils]: 35: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-08 10:14:25,928 INFO L290 TraceCheckUtils]: 36: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-08 10:14:25,928 INFO L290 TraceCheckUtils]: 37: Hoare triple {120183#false} assume !(~z~0 % 4294967296 > 0); {120183#false} is VALID [2022-04-08 10:14:25,928 INFO L272 TraceCheckUtils]: 38: Hoare triple {120183#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {120183#false} is VALID [2022-04-08 10:14:25,928 INFO L290 TraceCheckUtils]: 39: Hoare triple {120183#false} ~cond := #in~cond; {120183#false} is VALID [2022-04-08 10:14:25,928 INFO L290 TraceCheckUtils]: 40: Hoare triple {120183#false} assume 0 == ~cond; {120183#false} is VALID [2022-04-08 10:14:25,928 INFO L290 TraceCheckUtils]: 41: Hoare triple {120183#false} assume !false; {120183#false} is VALID [2022-04-08 10:14:25,928 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:14:25,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:14:26,206 INFO L290 TraceCheckUtils]: 41: Hoare triple {120183#false} assume !false; {120183#false} is VALID [2022-04-08 10:14:26,206 INFO L290 TraceCheckUtils]: 40: Hoare triple {120183#false} assume 0 == ~cond; {120183#false} is VALID [2022-04-08 10:14:26,206 INFO L290 TraceCheckUtils]: 39: Hoare triple {120183#false} ~cond := #in~cond; {120183#false} is VALID [2022-04-08 10:14:26,206 INFO L272 TraceCheckUtils]: 38: Hoare triple {120183#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {120183#false} is VALID [2022-04-08 10:14:26,206 INFO L290 TraceCheckUtils]: 37: Hoare triple {120183#false} assume !(~z~0 % 4294967296 > 0); {120183#false} is VALID [2022-04-08 10:14:26,206 INFO L290 TraceCheckUtils]: 36: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-08 10:14:26,206 INFO L290 TraceCheckUtils]: 35: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-08 10:14:26,207 INFO L290 TraceCheckUtils]: 34: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-08 10:14:26,207 INFO L290 TraceCheckUtils]: 33: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-08 10:14:26,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {120183#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {120183#false} is VALID [2022-04-08 10:14:26,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {120183#false} assume !(~x~0 % 4294967296 > 0); {120183#false} is VALID [2022-04-08 10:14:26,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120183#false} is VALID [2022-04-08 10:14:26,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {120188#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:14:26,210 INFO L290 TraceCheckUtils]: 28: Hoare triple {120189#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120188#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:14:26,211 INFO L290 TraceCheckUtils]: 27: Hoare triple {120190#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120189#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:14:26,212 INFO L290 TraceCheckUtils]: 26: Hoare triple {120191#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120190#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:14:26,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {120191#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:14:26,214 INFO L290 TraceCheckUtils]: 24: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~y~0 % 4294967296 > 0); {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:14:26,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:14:26,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:14:26,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:14:26,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:14:26,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:14:26,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:14:26,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {120191#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120192#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:14:26,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {120190#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120191#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:14:26,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {120189#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120190#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:14:26,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {120188#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120189#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:14:26,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120188#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:14:26,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:14:26,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {120182#true} assume !(~x~0 % 4294967296 > 0); {120187#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:14:26,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-08 10:14:26,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-08 10:14:26,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-08 10:14:26,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-08 10:14:26,223 INFO L290 TraceCheckUtils]: 6: Hoare triple {120182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120182#true} is VALID [2022-04-08 10:14:26,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {120182#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {120182#true} is VALID [2022-04-08 10:14:26,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {120182#true} call #t~ret15 := main(); {120182#true} is VALID [2022-04-08 10:14:26,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120182#true} {120182#true} #83#return; {120182#true} is VALID [2022-04-08 10:14:26,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {120182#true} assume true; {120182#true} is VALID [2022-04-08 10:14:26,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {120182#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {120182#true} is VALID [2022-04-08 10:14:26,223 INFO L272 TraceCheckUtils]: 0: Hoare triple {120182#true} call ULTIMATE.init(); {120182#true} is VALID [2022-04-08 10:14:26,223 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:14:26,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671586964] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:14:26,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:14:26,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 9 [2022-04-08 10:14:26,224 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:14:26,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1866417878] [2022-04-08 10:14:26,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1866417878] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:14:26,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:14:26,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:14:26,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427417982] [2022-04-08 10:14:26,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:14:26,224 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 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 42 [2022-04-08 10:14:26,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:14:26,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 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-08 10:14:26,254 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-08 10:14:26,254 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:14:26,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:26,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:14:26,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-04-08 10:14:26,255 INFO L87 Difference]: Start difference. First operand 426 states and 546 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 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-08 10:14:29,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:29,251 INFO L93 Difference]: Finished difference Result 445 states and 567 transitions. [2022-04-08 10:14:29,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:14:29,251 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 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 42 [2022-04-08 10:14:29,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:14:29,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 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-08 10:14:29,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-08 10:14:29,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 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-08 10:14:29,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-08 10:14:29,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 57 transitions. [2022-04-08 10:14:29,300 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-08 10:14:29,307 INFO L225 Difference]: With dead ends: 445 [2022-04-08 10:14:29,307 INFO L226 Difference]: Without dead ends: 412 [2022-04-08 10:14:29,307 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-08 10:14:29,307 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 32 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:14:29,307 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 63 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:14:29,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2022-04-08 10:14:31,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 407. [2022-04-08 10:14:31,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:14:31,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 412 states. Second operand has 407 states, 402 states have (on average 1.2960199004975124) internal successors, (521), 402 states have internal predecessors, (521), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:31,433 INFO L74 IsIncluded]: Start isIncluded. First operand 412 states. Second operand has 407 states, 402 states have (on average 1.2960199004975124) internal successors, (521), 402 states have internal predecessors, (521), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:31,433 INFO L87 Difference]: Start difference. First operand 412 states. Second operand has 407 states, 402 states have (on average 1.2960199004975124) internal successors, (521), 402 states have internal predecessors, (521), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:31,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:31,439 INFO L93 Difference]: Finished difference Result 412 states and 530 transitions. [2022-04-08 10:14:31,439 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 530 transitions. [2022-04-08 10:14:31,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:14:31,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:14:31,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 407 states, 402 states have (on average 1.2960199004975124) internal successors, (521), 402 states have internal predecessors, (521), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 412 states. [2022-04-08 10:14:31,440 INFO L87 Difference]: Start difference. First operand has 407 states, 402 states have (on average 1.2960199004975124) internal successors, (521), 402 states have internal predecessors, (521), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 412 states. [2022-04-08 10:14:31,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:31,445 INFO L93 Difference]: Finished difference Result 412 states and 530 transitions. [2022-04-08 10:14:31,445 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 530 transitions. [2022-04-08 10:14:31,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:14:31,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:14:31,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:14:31,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:14:31,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 402 states have (on average 1.2960199004975124) internal successors, (521), 402 states have internal predecessors, (521), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:31,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 525 transitions. [2022-04-08 10:14:31,453 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 525 transitions. Word has length 42 [2022-04-08 10:14:31,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:14:31,453 INFO L478 AbstractCegarLoop]: Abstraction has 407 states and 525 transitions. [2022-04-08 10:14:31,453 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 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-08 10:14:31,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 407 states and 525 transitions. [2022-04-08 10:14:34,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 525 edges. 525 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:34,828 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 525 transitions. [2022-04-08 10:14:34,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 10:14:34,829 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:14:34,829 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:14:34,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-04-08 10:14:35,029 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-04-08 10:14:35,030 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:14:35,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:14:35,030 INFO L85 PathProgramCache]: Analyzing trace with hash -2141964876, now seen corresponding path program 69 times [2022-04-08 10:14:35,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:35,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [84160667] [2022-04-08 10:14:35,032 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:14:35,032 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:14:35,032 INFO L85 PathProgramCache]: Analyzing trace with hash -2141964876, now seen corresponding path program 70 times [2022-04-08 10:14:35,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:14:35,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508902277] [2022-04-08 10:14:35,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:14:35,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:14:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:35,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:14:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:35,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {123005#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {122985#true} is VALID [2022-04-08 10:14:35,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {122985#true} assume true; {122985#true} is VALID [2022-04-08 10:14:35,274 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {122985#true} {122985#true} #83#return; {122985#true} is VALID [2022-04-08 10:14:35,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {122985#true} call ULTIMATE.init(); {123005#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:14:35,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {123005#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {122985#true} is VALID [2022-04-08 10:14:35,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {122985#true} assume true; {122985#true} is VALID [2022-04-08 10:14:35,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122985#true} {122985#true} #83#return; {122985#true} is VALID [2022-04-08 10:14:35,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {122985#true} call #t~ret15 := main(); {122985#true} is VALID [2022-04-08 10:14:35,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {122985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {122990#(= main_~y~0 0)} is VALID [2022-04-08 10:14:35,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {122990#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122991#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:14:35,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {122991#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122992#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:14:35,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {122992#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122993#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:14:35,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {122993#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:14:35,277 INFO L290 TraceCheckUtils]: 10: Hoare triple {122994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122995#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:14:35,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {122995#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122996#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:14:35,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {122996#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122997#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:14:35,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {122997#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122998#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:14:35,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {122998#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:35,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {122999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {122999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:35,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {122999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {123000#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:14:35,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {123000#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123001#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:14:35,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {123001#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123002#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:14:35,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {123002#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123003#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:14:35,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {123003#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123004#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:14:35,282 INFO L290 TraceCheckUtils]: 21: Hoare triple {123004#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {122986#false} is VALID [2022-04-08 10:14:35,282 INFO L290 TraceCheckUtils]: 22: Hoare triple {122986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122986#false} is VALID [2022-04-08 10:14:35,283 INFO L290 TraceCheckUtils]: 23: Hoare triple {122986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122986#false} is VALID [2022-04-08 10:14:35,283 INFO L290 TraceCheckUtils]: 24: Hoare triple {122986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122986#false} is VALID [2022-04-08 10:14:35,283 INFO L290 TraceCheckUtils]: 25: Hoare triple {122986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122986#false} is VALID [2022-04-08 10:14:35,283 INFO L290 TraceCheckUtils]: 26: Hoare triple {122986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122986#false} is VALID [2022-04-08 10:14:35,283 INFO L290 TraceCheckUtils]: 27: Hoare triple {122986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122986#false} is VALID [2022-04-08 10:14:35,283 INFO L290 TraceCheckUtils]: 28: Hoare triple {122986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122986#false} is VALID [2022-04-08 10:14:35,283 INFO L290 TraceCheckUtils]: 29: Hoare triple {122986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122986#false} is VALID [2022-04-08 10:14:35,283 INFO L290 TraceCheckUtils]: 30: Hoare triple {122986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122986#false} is VALID [2022-04-08 10:14:35,283 INFO L290 TraceCheckUtils]: 31: Hoare triple {122986#false} assume !(~y~0 % 4294967296 > 0); {122986#false} is VALID [2022-04-08 10:14:35,283 INFO L290 TraceCheckUtils]: 32: Hoare triple {122986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122986#false} is VALID [2022-04-08 10:14:35,283 INFO L290 TraceCheckUtils]: 33: Hoare triple {122986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122986#false} is VALID [2022-04-08 10:14:35,283 INFO L290 TraceCheckUtils]: 34: Hoare triple {122986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122986#false} is VALID [2022-04-08 10:14:35,283 INFO L290 TraceCheckUtils]: 35: Hoare triple {122986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122986#false} is VALID [2022-04-08 10:14:35,283 INFO L290 TraceCheckUtils]: 36: Hoare triple {122986#false} assume !(~x~0 % 4294967296 > 0); {122986#false} is VALID [2022-04-08 10:14:35,283 INFO L290 TraceCheckUtils]: 37: Hoare triple {122986#false} assume !(~z~0 % 4294967296 > 0); {122986#false} is VALID [2022-04-08 10:14:35,283 INFO L272 TraceCheckUtils]: 38: Hoare triple {122986#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {122986#false} is VALID [2022-04-08 10:14:35,283 INFO L290 TraceCheckUtils]: 39: Hoare triple {122986#false} ~cond := #in~cond; {122986#false} is VALID [2022-04-08 10:14:35,283 INFO L290 TraceCheckUtils]: 40: Hoare triple {122986#false} assume 0 == ~cond; {122986#false} is VALID [2022-04-08 10:14:35,283 INFO L290 TraceCheckUtils]: 41: Hoare triple {122986#false} assume !false; {122986#false} is VALID [2022-04-08 10:14:35,284 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:14:35,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:14:35,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508902277] [2022-04-08 10:14:35,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508902277] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:14:35,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785179184] [2022-04-08 10:14:35,284 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:14:35,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:14:35,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:14:35,285 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:14:35,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-04-08 10:14:35,334 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:14:35,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:14:35,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 10:14:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:35,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:14:35,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {122985#true} call ULTIMATE.init(); {122985#true} is VALID [2022-04-08 10:14:35,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {122985#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {122985#true} is VALID [2022-04-08 10:14:35,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {122985#true} assume true; {122985#true} is VALID [2022-04-08 10:14:35,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122985#true} {122985#true} #83#return; {122985#true} is VALID [2022-04-08 10:14:35,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {122985#true} call #t~ret15 := main(); {122985#true} is VALID [2022-04-08 10:14:35,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {122985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {122990#(= main_~y~0 0)} is VALID [2022-04-08 10:14:35,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {122990#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122991#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:14:35,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {122991#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122992#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:14:35,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {122992#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122993#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:14:35,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {122993#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:14:35,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {122994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122995#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:14:35,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {122995#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122996#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:14:35,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {122996#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122997#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:14:35,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {122997#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122998#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:14:35,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {122998#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:35,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {122999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {122999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:35,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {122999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {123000#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:14:35,617 INFO L290 TraceCheckUtils]: 17: Hoare triple {123000#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123001#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:14:35,618 INFO L290 TraceCheckUtils]: 18: Hoare triple {123001#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123002#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:14:35,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {123002#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123003#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:14:35,619 INFO L290 TraceCheckUtils]: 20: Hoare triple {123003#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123069#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:14:35,619 INFO L290 TraceCheckUtils]: 21: Hoare triple {123069#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {122986#false} is VALID [2022-04-08 10:14:35,619 INFO L290 TraceCheckUtils]: 22: Hoare triple {122986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122986#false} is VALID [2022-04-08 10:14:35,619 INFO L290 TraceCheckUtils]: 23: Hoare triple {122986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122986#false} is VALID [2022-04-08 10:14:35,619 INFO L290 TraceCheckUtils]: 24: Hoare triple {122986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122986#false} is VALID [2022-04-08 10:14:35,619 INFO L290 TraceCheckUtils]: 25: Hoare triple {122986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122986#false} is VALID [2022-04-08 10:14:35,619 INFO L290 TraceCheckUtils]: 26: Hoare triple {122986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122986#false} is VALID [2022-04-08 10:14:35,619 INFO L290 TraceCheckUtils]: 27: Hoare triple {122986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122986#false} is VALID [2022-04-08 10:14:35,619 INFO L290 TraceCheckUtils]: 28: Hoare triple {122986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122986#false} is VALID [2022-04-08 10:14:35,619 INFO L290 TraceCheckUtils]: 29: Hoare triple {122986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122986#false} is VALID [2022-04-08 10:14:35,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {122986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122986#false} is VALID [2022-04-08 10:14:35,620 INFO L290 TraceCheckUtils]: 31: Hoare triple {122986#false} assume !(~y~0 % 4294967296 > 0); {122986#false} is VALID [2022-04-08 10:14:35,620 INFO L290 TraceCheckUtils]: 32: Hoare triple {122986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122986#false} is VALID [2022-04-08 10:14:35,620 INFO L290 TraceCheckUtils]: 33: Hoare triple {122986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122986#false} is VALID [2022-04-08 10:14:35,620 INFO L290 TraceCheckUtils]: 34: Hoare triple {122986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122986#false} is VALID [2022-04-08 10:14:35,620 INFO L290 TraceCheckUtils]: 35: Hoare triple {122986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122986#false} is VALID [2022-04-08 10:14:35,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {122986#false} assume !(~x~0 % 4294967296 > 0); {122986#false} is VALID [2022-04-08 10:14:35,620 INFO L290 TraceCheckUtils]: 37: Hoare triple {122986#false} assume !(~z~0 % 4294967296 > 0); {122986#false} is VALID [2022-04-08 10:14:35,620 INFO L272 TraceCheckUtils]: 38: Hoare triple {122986#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {122986#false} is VALID [2022-04-08 10:14:35,620 INFO L290 TraceCheckUtils]: 39: Hoare triple {122986#false} ~cond := #in~cond; {122986#false} is VALID [2022-04-08 10:14:35,620 INFO L290 TraceCheckUtils]: 40: Hoare triple {122986#false} assume 0 == ~cond; {122986#false} is VALID [2022-04-08 10:14:35,620 INFO L290 TraceCheckUtils]: 41: Hoare triple {122986#false} assume !false; {122986#false} is VALID [2022-04-08 10:14:35,620 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:14:35,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:14:36,046 INFO L290 TraceCheckUtils]: 41: Hoare triple {122986#false} assume !false; {122986#false} is VALID [2022-04-08 10:14:36,046 INFO L290 TraceCheckUtils]: 40: Hoare triple {122986#false} assume 0 == ~cond; {122986#false} is VALID [2022-04-08 10:14:36,046 INFO L290 TraceCheckUtils]: 39: Hoare triple {122986#false} ~cond := #in~cond; {122986#false} is VALID [2022-04-08 10:14:36,046 INFO L272 TraceCheckUtils]: 38: Hoare triple {122986#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {122986#false} is VALID [2022-04-08 10:14:36,046 INFO L290 TraceCheckUtils]: 37: Hoare triple {122986#false} assume !(~z~0 % 4294967296 > 0); {122986#false} is VALID [2022-04-08 10:14:36,046 INFO L290 TraceCheckUtils]: 36: Hoare triple {122986#false} assume !(~x~0 % 4294967296 > 0); {122986#false} is VALID [2022-04-08 10:14:36,046 INFO L290 TraceCheckUtils]: 35: Hoare triple {122986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122986#false} is VALID [2022-04-08 10:14:36,046 INFO L290 TraceCheckUtils]: 34: Hoare triple {122986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122986#false} is VALID [2022-04-08 10:14:36,046 INFO L290 TraceCheckUtils]: 33: Hoare triple {122986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122986#false} is VALID [2022-04-08 10:14:36,046 INFO L290 TraceCheckUtils]: 32: Hoare triple {122986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122986#false} is VALID [2022-04-08 10:14:36,046 INFO L290 TraceCheckUtils]: 31: Hoare triple {122986#false} assume !(~y~0 % 4294967296 > 0); {122986#false} is VALID [2022-04-08 10:14:36,047 INFO L290 TraceCheckUtils]: 30: Hoare triple {122986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122986#false} is VALID [2022-04-08 10:14:36,047 INFO L290 TraceCheckUtils]: 29: Hoare triple {122986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122986#false} is VALID [2022-04-08 10:14:36,047 INFO L290 TraceCheckUtils]: 28: Hoare triple {122986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122986#false} is VALID [2022-04-08 10:14:36,047 INFO L290 TraceCheckUtils]: 27: Hoare triple {122986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122986#false} is VALID [2022-04-08 10:14:36,047 INFO L290 TraceCheckUtils]: 26: Hoare triple {122986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122986#false} is VALID [2022-04-08 10:14:36,047 INFO L290 TraceCheckUtils]: 25: Hoare triple {122986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122986#false} is VALID [2022-04-08 10:14:36,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {122986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122986#false} is VALID [2022-04-08 10:14:36,047 INFO L290 TraceCheckUtils]: 23: Hoare triple {122986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122986#false} is VALID [2022-04-08 10:14:36,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {122986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122986#false} is VALID [2022-04-08 10:14:36,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {123193#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {122986#false} is VALID [2022-04-08 10:14:36,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {123197#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123193#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:14:36,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {123201#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123197#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:14:36,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {123205#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123201#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:14:36,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {123209#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123205#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:14:36,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {123213#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {123209#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:14:36,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {123213#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {123213#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:36,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {123220#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123213#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:36,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {123224#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123220#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:14:36,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {123228#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123224#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:14:36,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {123232#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123228#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:14:36,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {123236#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123232#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:14:36,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {123240#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123236#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:14:36,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {123244#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123240#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:14:36,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {123248#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123244#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:14:36,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {123252#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123248#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:14:36,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {122985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {123252#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:36,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {122985#true} call #t~ret15 := main(); {122985#true} is VALID [2022-04-08 10:14:36,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122985#true} {122985#true} #83#return; {122985#true} is VALID [2022-04-08 10:14:36,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {122985#true} assume true; {122985#true} is VALID [2022-04-08 10:14:36,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {122985#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {122985#true} is VALID [2022-04-08 10:14:36,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {122985#true} call ULTIMATE.init(); {122985#true} is VALID [2022-04-08 10:14:36,058 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:14:36,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785179184] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:14:36,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:14:36,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-08 10:14:36,058 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:14:36,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [84160667] [2022-04-08 10:14:36,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [84160667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:14:36,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:14:36,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:14:36,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745312769] [2022-04-08 10:14:36,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:14:36,058 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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 42 [2022-04-08 10:14:36,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:14:36,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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-08 10:14:36,079 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-08 10:14:36,079 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:14:36,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:36,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:14:36,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=927, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:14:36,080 INFO L87 Difference]: Start difference. First operand 407 states and 525 transitions. Second operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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-08 10:14:44,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:44,407 INFO L93 Difference]: Finished difference Result 594 states and 756 transitions. [2022-04-08 10:14:44,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 10:14:44,407 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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 42 [2022-04-08 10:14:44,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:14:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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-08 10:14:44,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 132 transitions. [2022-04-08 10:14:44,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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-08 10:14:44,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 132 transitions. [2022-04-08 10:14:44,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 132 transitions. [2022-04-08 10:14:44,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:44,526 INFO L225 Difference]: With dead ends: 594 [2022-04-08 10:14:44,526 INFO L226 Difference]: Without dead ends: 573 [2022-04-08 10:14:44,526 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=644, Invalid=2662, Unknown=0, NotChecked=0, Total=3306 [2022-04-08 10:14:44,526 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 72 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1428 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:14:44,526 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 126 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1428 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-08 10:14:44,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2022-04-08 10:14:46,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 407. [2022-04-08 10:14:46,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:14:46,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 573 states. Second operand has 407 states, 402 states have (on average 1.2935323383084578) internal successors, (520), 402 states have internal predecessors, (520), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:46,663 INFO L74 IsIncluded]: Start isIncluded. First operand 573 states. Second operand has 407 states, 402 states have (on average 1.2935323383084578) internal successors, (520), 402 states have internal predecessors, (520), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:46,664 INFO L87 Difference]: Start difference. First operand 573 states. Second operand has 407 states, 402 states have (on average 1.2935323383084578) internal successors, (520), 402 states have internal predecessors, (520), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:46,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:46,673 INFO L93 Difference]: Finished difference Result 573 states and 734 transitions. [2022-04-08 10:14:46,673 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 734 transitions. [2022-04-08 10:14:46,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:14:46,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:14:46,674 INFO L74 IsIncluded]: Start isIncluded. First operand has 407 states, 402 states have (on average 1.2935323383084578) internal successors, (520), 402 states have internal predecessors, (520), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 573 states. [2022-04-08 10:14:46,674 INFO L87 Difference]: Start difference. First operand has 407 states, 402 states have (on average 1.2935323383084578) internal successors, (520), 402 states have internal predecessors, (520), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 573 states. [2022-04-08 10:14:46,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:46,683 INFO L93 Difference]: Finished difference Result 573 states and 734 transitions. [2022-04-08 10:14:46,683 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 734 transitions. [2022-04-08 10:14:46,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:14:46,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:14:46,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:14:46,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:14:46,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 402 states have (on average 1.2935323383084578) internal successors, (520), 402 states have internal predecessors, (520), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:46,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 524 transitions. [2022-04-08 10:14:46,691 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 524 transitions. Word has length 42 [2022-04-08 10:14:46,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:14:46,691 INFO L478 AbstractCegarLoop]: Abstraction has 407 states and 524 transitions. [2022-04-08 10:14:46,691 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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-08 10:14:46,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 407 states and 524 transitions. [2022-04-08 10:14:50,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 524 edges. 524 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:50,200 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 524 transitions. [2022-04-08 10:14:50,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 10:14:50,201 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:14:50,201 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:14:50,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-04-08 10:14:50,401 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:14:50,401 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:14:50,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:14:50,402 INFO L85 PathProgramCache]: Analyzing trace with hash -2055519709, now seen corresponding path program 37 times [2022-04-08 10:14:50,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:50,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [819525469] [2022-04-08 10:14:50,404 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:14:50,404 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:14:50,404 INFO L85 PathProgramCache]: Analyzing trace with hash -2055519709, now seen corresponding path program 38 times [2022-04-08 10:14:50,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:14:50,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453240073] [2022-04-08 10:14:50,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:14:50,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:14:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:50,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:14:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:50,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {126492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {126469#true} is VALID [2022-04-08 10:14:50,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {126469#true} assume true; {126469#true} is VALID [2022-04-08 10:14:50,700 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {126469#true} {126469#true} #83#return; {126469#true} is VALID [2022-04-08 10:14:50,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {126469#true} call ULTIMATE.init(); {126492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:14:50,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {126492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {126469#true} is VALID [2022-04-08 10:14:50,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {126469#true} assume true; {126469#true} is VALID [2022-04-08 10:14:50,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126469#true} {126469#true} #83#return; {126469#true} is VALID [2022-04-08 10:14:50,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {126469#true} call #t~ret15 := main(); {126469#true} is VALID [2022-04-08 10:14:50,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {126469#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {126474#(= main_~y~0 0)} is VALID [2022-04-08 10:14:50,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {126474#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126475#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:14:50,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {126475#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126476#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:14:50,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {126476#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126477#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:14:50,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {126477#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126478#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:14:50,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {126478#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126479#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:14:50,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {126479#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126480#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:14:50,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {126480#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126481#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:14:50,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {126481#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126482#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:14:50,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {126482#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126483#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:50,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {126483#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {126483#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:50,705 INFO L290 TraceCheckUtils]: 16: Hoare triple {126483#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {126484#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:14:50,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {126484#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126485#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:14:50,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {126485#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126486#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:14:50,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {126486#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126487#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:14:50,707 INFO L290 TraceCheckUtils]: 20: Hoare triple {126487#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126488#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:14:50,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {126488#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126489#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:14:50,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {126489#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126490#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:14:50,709 INFO L290 TraceCheckUtils]: 23: Hoare triple {126490#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126491#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:14:50,709 INFO L290 TraceCheckUtils]: 24: Hoare triple {126491#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {126470#false} is VALID [2022-04-08 10:14:50,710 INFO L290 TraceCheckUtils]: 25: Hoare triple {126470#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {126470#false} is VALID [2022-04-08 10:14:50,710 INFO L290 TraceCheckUtils]: 26: Hoare triple {126470#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {126470#false} is VALID [2022-04-08 10:14:50,710 INFO L290 TraceCheckUtils]: 27: Hoare triple {126470#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {126470#false} is VALID [2022-04-08 10:14:50,710 INFO L290 TraceCheckUtils]: 28: Hoare triple {126470#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {126470#false} is VALID [2022-04-08 10:14:50,710 INFO L290 TraceCheckUtils]: 29: Hoare triple {126470#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {126470#false} is VALID [2022-04-08 10:14:50,710 INFO L290 TraceCheckUtils]: 30: Hoare triple {126470#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {126470#false} is VALID [2022-04-08 10:14:50,710 INFO L290 TraceCheckUtils]: 31: Hoare triple {126470#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {126470#false} is VALID [2022-04-08 10:14:50,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {126470#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {126470#false} is VALID [2022-04-08 10:14:50,710 INFO L290 TraceCheckUtils]: 33: Hoare triple {126470#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {126470#false} is VALID [2022-04-08 10:14:50,710 INFO L290 TraceCheckUtils]: 34: Hoare triple {126470#false} assume !(~y~0 % 4294967296 > 0); {126470#false} is VALID [2022-04-08 10:14:50,710 INFO L290 TraceCheckUtils]: 35: Hoare triple {126470#false} assume !(~x~0 % 4294967296 > 0); {126470#false} is VALID [2022-04-08 10:14:50,710 INFO L290 TraceCheckUtils]: 36: Hoare triple {126470#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {126470#false} is VALID [2022-04-08 10:14:50,710 INFO L290 TraceCheckUtils]: 37: Hoare triple {126470#false} assume !(~z~0 % 4294967296 > 0); {126470#false} is VALID [2022-04-08 10:14:50,710 INFO L272 TraceCheckUtils]: 38: Hoare triple {126470#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {126470#false} is VALID [2022-04-08 10:14:50,710 INFO L290 TraceCheckUtils]: 39: Hoare triple {126470#false} ~cond := #in~cond; {126470#false} is VALID [2022-04-08 10:14:50,710 INFO L290 TraceCheckUtils]: 40: Hoare triple {126470#false} assume 0 == ~cond; {126470#false} is VALID [2022-04-08 10:14:50,710 INFO L290 TraceCheckUtils]: 41: Hoare triple {126470#false} assume !false; {126470#false} is VALID [2022-04-08 10:14:50,710 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-08 10:14:50,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:14:50,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453240073] [2022-04-08 10:14:50,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453240073] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:14:50,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705933890] [2022-04-08 10:14:50,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:14:50,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:14:50,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:14:50,712 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:14:50,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-04-08 10:14:50,761 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:14:50,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:14:50,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-08 10:14:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:50,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:14:51,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {126469#true} call ULTIMATE.init(); {126469#true} is VALID [2022-04-08 10:14:51,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {126469#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {126469#true} is VALID [2022-04-08 10:14:51,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {126469#true} assume true; {126469#true} is VALID [2022-04-08 10:14:51,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126469#true} {126469#true} #83#return; {126469#true} is VALID [2022-04-08 10:14:51,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {126469#true} call #t~ret15 := main(); {126469#true} is VALID [2022-04-08 10:14:51,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {126469#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {126469#true} is VALID [2022-04-08 10:14:51,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {126469#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126469#true} is VALID [2022-04-08 10:14:51,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {126469#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126469#true} is VALID [2022-04-08 10:14:51,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {126469#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126520#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:14:51,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {126520#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126524#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:14:51,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {126524#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126528#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:14:51,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {126528#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126532#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:14:51,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {126532#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126536#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:14:51,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {126536#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126540#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:14:51,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {126540#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126544#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:14:51,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {126544#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {126544#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:14:51,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {126544#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {126544#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:14:51,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {126544#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126540#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:14:51,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {126540#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126536#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:14:51,074 INFO L290 TraceCheckUtils]: 19: Hoare triple {126536#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126532#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:14:51,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {126532#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126528#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:14:51,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {126528#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126524#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:14:51,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {126524#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126520#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:14:51,077 INFO L290 TraceCheckUtils]: 23: Hoare triple {126520#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:51,077 INFO L290 TraceCheckUtils]: 24: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:51,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:51,077 INFO L290 TraceCheckUtils]: 26: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:51,078 INFO L290 TraceCheckUtils]: 27: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:51,078 INFO L290 TraceCheckUtils]: 28: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:51,078 INFO L290 TraceCheckUtils]: 29: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:51,078 INFO L290 TraceCheckUtils]: 30: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:51,079 INFO L290 TraceCheckUtils]: 31: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:51,079 INFO L290 TraceCheckUtils]: 32: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:51,079 INFO L290 TraceCheckUtils]: 33: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:51,079 INFO L290 TraceCheckUtils]: 34: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:51,080 INFO L290 TraceCheckUtils]: 35: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {126470#false} is VALID [2022-04-08 10:14:51,080 INFO L290 TraceCheckUtils]: 36: Hoare triple {126470#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {126470#false} is VALID [2022-04-08 10:14:51,080 INFO L290 TraceCheckUtils]: 37: Hoare triple {126470#false} assume !(~z~0 % 4294967296 > 0); {126470#false} is VALID [2022-04-08 10:14:51,080 INFO L272 TraceCheckUtils]: 38: Hoare triple {126470#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {126470#false} is VALID [2022-04-08 10:14:51,080 INFO L290 TraceCheckUtils]: 39: Hoare triple {126470#false} ~cond := #in~cond; {126470#false} is VALID [2022-04-08 10:14:51,080 INFO L290 TraceCheckUtils]: 40: Hoare triple {126470#false} assume 0 == ~cond; {126470#false} is VALID [2022-04-08 10:14:51,080 INFO L290 TraceCheckUtils]: 41: Hoare triple {126470#false} assume !false; {126470#false} is VALID [2022-04-08 10:14:51,080 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 21 proven. 49 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-08 10:14:51,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:14:51,217 INFO L290 TraceCheckUtils]: 41: Hoare triple {126470#false} assume !false; {126470#false} is VALID [2022-04-08 10:14:51,217 INFO L290 TraceCheckUtils]: 40: Hoare triple {126470#false} assume 0 == ~cond; {126470#false} is VALID [2022-04-08 10:14:51,217 INFO L290 TraceCheckUtils]: 39: Hoare triple {126470#false} ~cond := #in~cond; {126470#false} is VALID [2022-04-08 10:14:51,217 INFO L272 TraceCheckUtils]: 38: Hoare triple {126470#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {126470#false} is VALID [2022-04-08 10:14:51,217 INFO L290 TraceCheckUtils]: 37: Hoare triple {126470#false} assume !(~z~0 % 4294967296 > 0); {126470#false} is VALID [2022-04-08 10:14:51,217 INFO L290 TraceCheckUtils]: 36: Hoare triple {126470#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {126470#false} is VALID [2022-04-08 10:14:51,218 INFO L290 TraceCheckUtils]: 35: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {126470#false} is VALID [2022-04-08 10:14:51,218 INFO L290 TraceCheckUtils]: 34: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:51,218 INFO L290 TraceCheckUtils]: 33: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:51,218 INFO L290 TraceCheckUtils]: 32: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:51,219 INFO L290 TraceCheckUtils]: 31: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:51,219 INFO L290 TraceCheckUtils]: 30: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:51,219 INFO L290 TraceCheckUtils]: 29: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:51,219 INFO L290 TraceCheckUtils]: 28: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:51,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:51,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:51,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:51,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {126572#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:51,221 INFO L290 TraceCheckUtils]: 23: Hoare triple {126520#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126572#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:51,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {126524#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126520#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:14:51,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {126528#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126524#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:14:51,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {126532#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126528#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:14:51,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {126536#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126532#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:14:51,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {126540#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126536#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:14:51,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {126544#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126540#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:14:51,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {126544#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {126544#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:14:51,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {126544#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {126544#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:14:51,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {126540#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126544#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:14:51,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {126536#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126540#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:14:51,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {126532#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126536#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:14:51,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {126528#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126532#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:14:51,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {126524#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126528#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:14:51,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {126520#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126524#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:14:51,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {126469#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126520#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:14:51,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {126469#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126469#true} is VALID [2022-04-08 10:14:51,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {126469#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126469#true} is VALID [2022-04-08 10:14:51,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {126469#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {126469#true} is VALID [2022-04-08 10:14:51,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {126469#true} call #t~ret15 := main(); {126469#true} is VALID [2022-04-08 10:14:51,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126469#true} {126469#true} #83#return; {126469#true} is VALID [2022-04-08 10:14:51,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {126469#true} assume true; {126469#true} is VALID [2022-04-08 10:14:51,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {126469#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {126469#true} is VALID [2022-04-08 10:14:51,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {126469#true} call ULTIMATE.init(); {126469#true} is VALID [2022-04-08 10:14:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 21 proven. 49 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-08 10:14:51,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705933890] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:14:51,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:14:51,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10, 10] total 29 [2022-04-08 10:14:51,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:14:51,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [819525469] [2022-04-08 10:14:51,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [819525469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:14:51,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:14:51,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:14:51,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179328116] [2022-04-08 10:14:51,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:14:51,231 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 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 42 [2022-04-08 10:14:51,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:14:51,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 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-08 10:14:51,254 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-08 10:14:51,254 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:14:51,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:51,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:14:51,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=750, Unknown=0, NotChecked=0, Total=812 [2022-04-08 10:14:51,255 INFO L87 Difference]: Start difference. First operand 407 states and 524 transitions. Second operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 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-08 10:15:00,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:00,380 INFO L93 Difference]: Finished difference Result 593 states and 757 transitions. [2022-04-08 10:15:00,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-08 10:15:00,380 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 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 42 [2022-04-08 10:15:00,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:15:00,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 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-08 10:15:00,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 146 transitions. [2022-04-08 10:15:00,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 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-08 10:15:00,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 146 transitions. [2022-04-08 10:15:00,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 146 transitions. [2022-04-08 10:15:00,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:00,509 INFO L225 Difference]: With dead ends: 593 [2022-04-08 10:15:00,509 INFO L226 Difference]: Without dead ends: 542 [2022-04-08 10:15:00,510 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=302, Invalid=3858, Unknown=0, NotChecked=0, Total=4160 [2022-04-08 10:15:00,510 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 70 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1914 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 2024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:15:00,510 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 141 Invalid, 2024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1914 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-08 10:15:00,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-04-08 10:15:02,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 408. [2022-04-08 10:15:02,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:15:02,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 542 states. Second operand has 408 states, 403 states have (on average 1.2878411910669976) internal successors, (519), 403 states have internal predecessors, (519), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:02,659 INFO L74 IsIncluded]: Start isIncluded. First operand 542 states. Second operand has 408 states, 403 states have (on average 1.2878411910669976) internal successors, (519), 403 states have internal predecessors, (519), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:02,660 INFO L87 Difference]: Start difference. First operand 542 states. Second operand has 408 states, 403 states have (on average 1.2878411910669976) internal successors, (519), 403 states have internal predecessors, (519), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:02,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:02,668 INFO L93 Difference]: Finished difference Result 542 states and 701 transitions. [2022-04-08 10:15:02,668 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 701 transitions. [2022-04-08 10:15:02,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:15:02,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:15:02,668 INFO L74 IsIncluded]: Start isIncluded. First operand has 408 states, 403 states have (on average 1.2878411910669976) internal successors, (519), 403 states have internal predecessors, (519), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 542 states. [2022-04-08 10:15:02,669 INFO L87 Difference]: Start difference. First operand has 408 states, 403 states have (on average 1.2878411910669976) internal successors, (519), 403 states have internal predecessors, (519), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 542 states. [2022-04-08 10:15:02,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:02,677 INFO L93 Difference]: Finished difference Result 542 states and 701 transitions. [2022-04-08 10:15:02,677 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 701 transitions. [2022-04-08 10:15:02,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:15:02,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:15:02,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:15:02,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:15:02,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 403 states have (on average 1.2878411910669976) internal successors, (519), 403 states have internal predecessors, (519), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:02,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 523 transitions. [2022-04-08 10:15:02,685 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 523 transitions. Word has length 42 [2022-04-08 10:15:02,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:15:02,685 INFO L478 AbstractCegarLoop]: Abstraction has 408 states and 523 transitions. [2022-04-08 10:15:02,685 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 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-08 10:15:02,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 408 states and 523 transitions. [2022-04-08 10:15:05,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 523 edges. 523 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:05,749 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 523 transitions. [2022-04-08 10:15:05,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 10:15:05,749 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:15:05,749 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:15:05,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-04-08 10:15:05,951 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:15:05,951 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:15:05,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:15:05,952 INFO L85 PathProgramCache]: Analyzing trace with hash 70932066, now seen corresponding path program 71 times [2022-04-08 10:15:05,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:15:05,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1496305399] [2022-04-08 10:15:05,954 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:15:05,954 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:15:05,954 INFO L85 PathProgramCache]: Analyzing trace with hash 70932066, now seen corresponding path program 72 times [2022-04-08 10:15:05,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:15:05,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587343116] [2022-04-08 10:15:05,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:15:05,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:15:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:06,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:15:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:06,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {129930#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {129910#true} is VALID [2022-04-08 10:15:06,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {129910#true} assume true; {129910#true} is VALID [2022-04-08 10:15:06,232 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {129910#true} {129910#true} #83#return; {129910#true} is VALID [2022-04-08 10:15:06,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {129910#true} call ULTIMATE.init(); {129930#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:15:06,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {129930#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {129910#true} is VALID [2022-04-08 10:15:06,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {129910#true} assume true; {129910#true} is VALID [2022-04-08 10:15:06,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {129910#true} {129910#true} #83#return; {129910#true} is VALID [2022-04-08 10:15:06,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {129910#true} call #t~ret15 := main(); {129910#true} is VALID [2022-04-08 10:15:06,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {129910#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {129915#(= main_~y~0 0)} is VALID [2022-04-08 10:15:06,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {129915#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129916#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:15:06,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {129916#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129917#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:15:06,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {129917#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129918#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:15:06,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {129918#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129919#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:15:06,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {129919#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129920#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:15:06,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {129920#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129921#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:15:06,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {129921#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129922#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:15:06,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {129922#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129923#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:15:06,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {129923#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129924#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:15:06,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {129924#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129925#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:15:06,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {129925#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {129925#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:15:06,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {129925#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {129926#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:15:06,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {129926#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {129927#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:15:06,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {129927#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {129928#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:15:06,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {129928#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {129929#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:15:06,243 INFO L290 TraceCheckUtils]: 21: Hoare triple {129929#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {129911#false} is VALID [2022-04-08 10:15:06,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:06,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:06,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:06,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:06,243 INFO L290 TraceCheckUtils]: 26: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:06,243 INFO L290 TraceCheckUtils]: 27: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:06,243 INFO L290 TraceCheckUtils]: 28: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:06,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:06,243 INFO L290 TraceCheckUtils]: 30: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:06,243 INFO L290 TraceCheckUtils]: 31: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:06,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {129911#false} assume !(~y~0 % 4294967296 > 0); {129911#false} is VALID [2022-04-08 10:15:06,243 INFO L290 TraceCheckUtils]: 33: Hoare triple {129911#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {129911#false} is VALID [2022-04-08 10:15:06,244 INFO L290 TraceCheckUtils]: 34: Hoare triple {129911#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {129911#false} is VALID [2022-04-08 10:15:06,244 INFO L290 TraceCheckUtils]: 35: Hoare triple {129911#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {129911#false} is VALID [2022-04-08 10:15:06,244 INFO L290 TraceCheckUtils]: 36: Hoare triple {129911#false} assume !(~x~0 % 4294967296 > 0); {129911#false} is VALID [2022-04-08 10:15:06,244 INFO L290 TraceCheckUtils]: 37: Hoare triple {129911#false} assume !(~z~0 % 4294967296 > 0); {129911#false} is VALID [2022-04-08 10:15:06,244 INFO L272 TraceCheckUtils]: 38: Hoare triple {129911#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {129911#false} is VALID [2022-04-08 10:15:06,244 INFO L290 TraceCheckUtils]: 39: Hoare triple {129911#false} ~cond := #in~cond; {129911#false} is VALID [2022-04-08 10:15:06,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {129911#false} assume 0 == ~cond; {129911#false} is VALID [2022-04-08 10:15:06,244 INFO L290 TraceCheckUtils]: 41: Hoare triple {129911#false} assume !false; {129911#false} is VALID [2022-04-08 10:15:06,244 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-04-08 10:15:06,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:15:06,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587343116] [2022-04-08 10:15:06,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587343116] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:15:06,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872575057] [2022-04-08 10:15:06,245 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:15:06,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:15:06,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:15:06,247 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:15:06,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-04-08 10:15:06,535 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 10:15:06,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:15:06,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 10:15:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:06,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:15:06,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {129910#true} call ULTIMATE.init(); {129910#true} is VALID [2022-04-08 10:15:06,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {129910#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {129910#true} is VALID [2022-04-08 10:15:06,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {129910#true} assume true; {129910#true} is VALID [2022-04-08 10:15:06,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {129910#true} {129910#true} #83#return; {129910#true} is VALID [2022-04-08 10:15:06,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {129910#true} call #t~ret15 := main(); {129910#true} is VALID [2022-04-08 10:15:06,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {129910#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {129915#(= main_~y~0 0)} is VALID [2022-04-08 10:15:06,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {129915#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129916#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:15:06,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {129916#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129917#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:15:06,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {129917#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129918#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:15:06,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {129918#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129919#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:15:06,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {129919#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129920#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:15:06,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {129920#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129921#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:15:06,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {129921#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129922#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:15:06,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {129922#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129923#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:15:06,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {129923#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129924#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:15:06,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {129924#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129925#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:15:06,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {129925#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {129925#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:15:06,862 INFO L290 TraceCheckUtils]: 17: Hoare triple {129925#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {129926#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:15:06,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {129926#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {129927#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:15:06,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {129927#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {129928#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:15:06,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {129928#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {129994#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:15:06,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {129994#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {129911#false} is VALID [2022-04-08 10:15:06,864 INFO L290 TraceCheckUtils]: 22: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:06,864 INFO L290 TraceCheckUtils]: 23: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:06,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:06,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:06,864 INFO L290 TraceCheckUtils]: 26: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:06,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:06,864 INFO L290 TraceCheckUtils]: 28: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:06,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:06,864 INFO L290 TraceCheckUtils]: 30: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:06,864 INFO L290 TraceCheckUtils]: 31: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:06,864 INFO L290 TraceCheckUtils]: 32: Hoare triple {129911#false} assume !(~y~0 % 4294967296 > 0); {129911#false} is VALID [2022-04-08 10:15:06,865 INFO L290 TraceCheckUtils]: 33: Hoare triple {129911#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {129911#false} is VALID [2022-04-08 10:15:06,865 INFO L290 TraceCheckUtils]: 34: Hoare triple {129911#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {129911#false} is VALID [2022-04-08 10:15:06,865 INFO L290 TraceCheckUtils]: 35: Hoare triple {129911#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {129911#false} is VALID [2022-04-08 10:15:06,865 INFO L290 TraceCheckUtils]: 36: Hoare triple {129911#false} assume !(~x~0 % 4294967296 > 0); {129911#false} is VALID [2022-04-08 10:15:06,865 INFO L290 TraceCheckUtils]: 37: Hoare triple {129911#false} assume !(~z~0 % 4294967296 > 0); {129911#false} is VALID [2022-04-08 10:15:06,865 INFO L272 TraceCheckUtils]: 38: Hoare triple {129911#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {129911#false} is VALID [2022-04-08 10:15:06,865 INFO L290 TraceCheckUtils]: 39: Hoare triple {129911#false} ~cond := #in~cond; {129911#false} is VALID [2022-04-08 10:15:06,865 INFO L290 TraceCheckUtils]: 40: Hoare triple {129911#false} assume 0 == ~cond; {129911#false} is VALID [2022-04-08 10:15:06,865 INFO L290 TraceCheckUtils]: 41: Hoare triple {129911#false} assume !false; {129911#false} is VALID [2022-04-08 10:15:06,865 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-04-08 10:15:06,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:15:07,309 INFO L290 TraceCheckUtils]: 41: Hoare triple {129911#false} assume !false; {129911#false} is VALID [2022-04-08 10:15:07,309 INFO L290 TraceCheckUtils]: 40: Hoare triple {129911#false} assume 0 == ~cond; {129911#false} is VALID [2022-04-08 10:15:07,309 INFO L290 TraceCheckUtils]: 39: Hoare triple {129911#false} ~cond := #in~cond; {129911#false} is VALID [2022-04-08 10:15:07,309 INFO L272 TraceCheckUtils]: 38: Hoare triple {129911#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {129911#false} is VALID [2022-04-08 10:15:07,309 INFO L290 TraceCheckUtils]: 37: Hoare triple {129911#false} assume !(~z~0 % 4294967296 > 0); {129911#false} is VALID [2022-04-08 10:15:07,309 INFO L290 TraceCheckUtils]: 36: Hoare triple {129911#false} assume !(~x~0 % 4294967296 > 0); {129911#false} is VALID [2022-04-08 10:15:07,309 INFO L290 TraceCheckUtils]: 35: Hoare triple {129911#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {129911#false} is VALID [2022-04-08 10:15:07,309 INFO L290 TraceCheckUtils]: 34: Hoare triple {129911#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {129911#false} is VALID [2022-04-08 10:15:07,309 INFO L290 TraceCheckUtils]: 33: Hoare triple {129911#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {129911#false} is VALID [2022-04-08 10:15:07,310 INFO L290 TraceCheckUtils]: 32: Hoare triple {129911#false} assume !(~y~0 % 4294967296 > 0); {129911#false} is VALID [2022-04-08 10:15:07,310 INFO L290 TraceCheckUtils]: 31: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:07,310 INFO L290 TraceCheckUtils]: 30: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:07,310 INFO L290 TraceCheckUtils]: 29: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:07,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:07,310 INFO L290 TraceCheckUtils]: 27: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:07,310 INFO L290 TraceCheckUtils]: 26: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:07,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:07,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:07,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:07,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {129911#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129911#false} is VALID [2022-04-08 10:15:07,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {130118#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {129911#false} is VALID [2022-04-08 10:15:07,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {130122#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {130118#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:15:07,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {130126#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {130122#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:15:07,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {130130#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {130126#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:15:07,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {130134#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {130130#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:15:07,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {130134#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {130134#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:15:07,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {130141#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130134#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:15:07,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {130145#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130141#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:15:07,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {130149#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130145#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:15:07,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {130153#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130149#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:15:07,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {130157#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130153#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:15:07,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {130161#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130157#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:15:07,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {130165#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130161#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:15:07,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {130169#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130165#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:15:07,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {130173#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130169#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:15:07,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {130177#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130173#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:15:07,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {129910#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {130177#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:15:07,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {129910#true} call #t~ret15 := main(); {129910#true} is VALID [2022-04-08 10:15:07,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {129910#true} {129910#true} #83#return; {129910#true} is VALID [2022-04-08 10:15:07,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {129910#true} assume true; {129910#true} is VALID [2022-04-08 10:15:07,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {129910#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {129910#true} is VALID [2022-04-08 10:15:07,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {129910#true} call ULTIMATE.init(); {129910#true} is VALID [2022-04-08 10:15:07,321 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-04-08 10:15:07,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872575057] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:15:07,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:15:07,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-08 10:15:07,321 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:15:07,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1496305399] [2022-04-08 10:15:07,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1496305399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:15:07,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:15:07,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:15:07,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156090196] [2022-04-08 10:15:07,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:15:07,322 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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 42 [2022-04-08 10:15:07,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:15:07,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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-08 10:15:07,342 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-08 10:15:07,342 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:15:07,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:15:07,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:15:07,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:15:07,343 INFO L87 Difference]: Start difference. First operand 408 states and 523 transitions. Second operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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-08 10:15:16,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:16,346 INFO L93 Difference]: Finished difference Result 629 states and 793 transitions. [2022-04-08 10:15:16,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 10:15:16,346 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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 42 [2022-04-08 10:15:16,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:15:16,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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-08 10:15:16,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 139 transitions. [2022-04-08 10:15:16,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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-08 10:15:16,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 139 transitions. [2022-04-08 10:15:16,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 139 transitions. [2022-04-08 10:15:16,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:16,472 INFO L225 Difference]: With dead ends: 629 [2022-04-08 10:15:16,472 INFO L226 Difference]: Without dead ends: 608 [2022-04-08 10:15:16,472 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=589, Invalid=2381, Unknown=0, NotChecked=0, Total=2970 [2022-04-08 10:15:16,473 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 81 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:15:16,473 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 127 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-08 10:15:16,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-04-08 10:15:18,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 408. [2022-04-08 10:15:18,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:15:18,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 608 states. Second operand has 408 states, 403 states have (on average 1.2853598014888337) internal successors, (518), 403 states have internal predecessors, (518), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:18,626 INFO L74 IsIncluded]: Start isIncluded. First operand 608 states. Second operand has 408 states, 403 states have (on average 1.2853598014888337) internal successors, (518), 403 states have internal predecessors, (518), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:18,627 INFO L87 Difference]: Start difference. First operand 608 states. Second operand has 408 states, 403 states have (on average 1.2853598014888337) internal successors, (518), 403 states have internal predecessors, (518), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:18,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:18,637 INFO L93 Difference]: Finished difference Result 608 states and 771 transitions. [2022-04-08 10:15:18,637 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 771 transitions. [2022-04-08 10:15:18,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:15:18,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:15:18,637 INFO L74 IsIncluded]: Start isIncluded. First operand has 408 states, 403 states have (on average 1.2853598014888337) internal successors, (518), 403 states have internal predecessors, (518), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 608 states. [2022-04-08 10:15:18,637 INFO L87 Difference]: Start difference. First operand has 408 states, 403 states have (on average 1.2853598014888337) internal successors, (518), 403 states have internal predecessors, (518), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 608 states. [2022-04-08 10:15:18,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:18,647 INFO L93 Difference]: Finished difference Result 608 states and 771 transitions. [2022-04-08 10:15:18,647 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 771 transitions. [2022-04-08 10:15:18,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:15:18,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:15:18,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:15:18,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:15:18,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 403 states have (on average 1.2853598014888337) internal successors, (518), 403 states have internal predecessors, (518), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:18,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 522 transitions. [2022-04-08 10:15:18,659 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 522 transitions. Word has length 42 [2022-04-08 10:15:18,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:15:18,659 INFO L478 AbstractCegarLoop]: Abstraction has 408 states and 522 transitions. [2022-04-08 10:15:18,659 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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-08 10:15:18,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 408 states and 522 transitions. [2022-04-08 10:15:22,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 522 edges. 522 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:22,299 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 522 transitions. [2022-04-08 10:15:22,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 10:15:22,299 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:15:22,299 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:15:22,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2022-04-08 10:15:22,499 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable72 [2022-04-08 10:15:22,500 INFO L403 AbstractCegarLoop]: === Iteration 74 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:15:22,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:15:22,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1943431156, now seen corresponding path program 73 times [2022-04-08 10:15:22,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:15:22,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1080862587] [2022-04-08 10:15:22,502 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:15:22,502 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:15:22,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1943431156, now seen corresponding path program 74 times [2022-04-08 10:15:22,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:15:22,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043874041] [2022-04-08 10:15:22,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:15:22,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:15:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:22,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:15:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:22,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {133550#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {133530#true} is VALID [2022-04-08 10:15:22,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {133530#true} assume true; {133530#true} is VALID [2022-04-08 10:15:22,774 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {133530#true} {133530#true} #83#return; {133530#true} is VALID [2022-04-08 10:15:22,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {133530#true} call ULTIMATE.init(); {133550#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:15:22,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {133550#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {133530#true} is VALID [2022-04-08 10:15:22,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {133530#true} assume true; {133530#true} is VALID [2022-04-08 10:15:22,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {133530#true} {133530#true} #83#return; {133530#true} is VALID [2022-04-08 10:15:22,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {133530#true} call #t~ret15 := main(); {133530#true} is VALID [2022-04-08 10:15:22,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {133530#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {133535#(= main_~y~0 0)} is VALID [2022-04-08 10:15:22,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {133535#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133536#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:15:22,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {133536#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133537#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:15:22,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {133537#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133538#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:15:22,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {133538#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133539#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:15:22,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {133539#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133540#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:15:22,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {133540#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133541#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:15:22,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {133541#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133542#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:15:22,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {133542#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133543#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:15:22,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {133543#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133544#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:15:22,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {133544#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133545#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:15:22,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {133545#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133546#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:15:22,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {133546#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {133546#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:15:22,781 INFO L290 TraceCheckUtils]: 18: Hoare triple {133546#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {133547#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:15:22,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {133547#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {133548#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:15:22,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {133548#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {133549#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:15:22,783 INFO L290 TraceCheckUtils]: 21: Hoare triple {133549#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {133531#false} is VALID [2022-04-08 10:15:22,783 INFO L290 TraceCheckUtils]: 22: Hoare triple {133531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133531#false} is VALID [2022-04-08 10:15:22,783 INFO L290 TraceCheckUtils]: 23: Hoare triple {133531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133531#false} is VALID [2022-04-08 10:15:22,783 INFO L290 TraceCheckUtils]: 24: Hoare triple {133531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133531#false} is VALID [2022-04-08 10:15:22,783 INFO L290 TraceCheckUtils]: 25: Hoare triple {133531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133531#false} is VALID [2022-04-08 10:15:22,783 INFO L290 TraceCheckUtils]: 26: Hoare triple {133531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133531#false} is VALID [2022-04-08 10:15:22,783 INFO L290 TraceCheckUtils]: 27: Hoare triple {133531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133531#false} is VALID [2022-04-08 10:15:22,783 INFO L290 TraceCheckUtils]: 28: Hoare triple {133531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133531#false} is VALID [2022-04-08 10:15:22,783 INFO L290 TraceCheckUtils]: 29: Hoare triple {133531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133531#false} is VALID [2022-04-08 10:15:22,783 INFO L290 TraceCheckUtils]: 30: Hoare triple {133531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133531#false} is VALID [2022-04-08 10:15:22,783 INFO L290 TraceCheckUtils]: 31: Hoare triple {133531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133531#false} is VALID [2022-04-08 10:15:22,783 INFO L290 TraceCheckUtils]: 32: Hoare triple {133531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133531#false} is VALID [2022-04-08 10:15:22,783 INFO L290 TraceCheckUtils]: 33: Hoare triple {133531#false} assume !(~y~0 % 4294967296 > 0); {133531#false} is VALID [2022-04-08 10:15:22,783 INFO L290 TraceCheckUtils]: 34: Hoare triple {133531#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {133531#false} is VALID [2022-04-08 10:15:22,783 INFO L290 TraceCheckUtils]: 35: Hoare triple {133531#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {133531#false} is VALID [2022-04-08 10:15:22,784 INFO L290 TraceCheckUtils]: 36: Hoare triple {133531#false} assume !(~x~0 % 4294967296 > 0); {133531#false} is VALID [2022-04-08 10:15:22,784 INFO L290 TraceCheckUtils]: 37: Hoare triple {133531#false} assume !(~z~0 % 4294967296 > 0); {133531#false} is VALID [2022-04-08 10:15:22,784 INFO L272 TraceCheckUtils]: 38: Hoare triple {133531#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {133531#false} is VALID [2022-04-08 10:15:22,784 INFO L290 TraceCheckUtils]: 39: Hoare triple {133531#false} ~cond := #in~cond; {133531#false} is VALID [2022-04-08 10:15:22,784 INFO L290 TraceCheckUtils]: 40: Hoare triple {133531#false} assume 0 == ~cond; {133531#false} is VALID [2022-04-08 10:15:22,784 INFO L290 TraceCheckUtils]: 41: Hoare triple {133531#false} assume !false; {133531#false} is VALID [2022-04-08 10:15:22,784 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-08 10:15:22,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:15:22,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043874041] [2022-04-08 10:15:22,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043874041] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:15:22,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409251326] [2022-04-08 10:15:22,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:15:22,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:15:22,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:15:22,785 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:15:22,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-04-08 10:15:22,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:15:22,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:15:22,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-08 10:15:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:22,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:15:23,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {133530#true} call ULTIMATE.init(); {133530#true} is VALID [2022-04-08 10:15:23,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {133530#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {133530#true} is VALID [2022-04-08 10:15:23,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {133530#true} assume true; {133530#true} is VALID [2022-04-08 10:15:23,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {133530#true} {133530#true} #83#return; {133530#true} is VALID [2022-04-08 10:15:23,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {133530#true} call #t~ret15 := main(); {133530#true} is VALID [2022-04-08 10:15:23,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {133530#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {133535#(= main_~y~0 0)} is VALID [2022-04-08 10:15:23,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {133535#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133536#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:15:23,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {133536#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133537#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:15:23,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {133537#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133538#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:15:23,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {133538#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133539#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:15:23,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {133539#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133540#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:15:23,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {133540#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133541#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:15:23,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {133541#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133542#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:15:23,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {133542#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133543#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:15:23,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {133543#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133544#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:15:23,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {133544#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133545#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:15:23,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {133545#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133546#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:15:23,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {133546#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {133546#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:15:23,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {133546#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {133547#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:15:23,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {133547#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {133548#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:15:23,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {133548#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {133614#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:15:23,415 INFO L290 TraceCheckUtils]: 21: Hoare triple {133614#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {133614#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:15:23,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {133614#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133548#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:15:23,416 INFO L290 TraceCheckUtils]: 23: Hoare triple {133548#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133547#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:15:23,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {133547#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133627#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:15:23,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {133627#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133631#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:15:23,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {133631#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133635#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:15:23,418 INFO L290 TraceCheckUtils]: 27: Hoare triple {133635#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133639#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:15:23,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {133639#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133643#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:15:23,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {133643#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133647#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-08 10:15:23,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {133647#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133651#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-08 10:15:23,420 INFO L290 TraceCheckUtils]: 31: Hoare triple {133651#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133655#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-08 10:15:23,421 INFO L290 TraceCheckUtils]: 32: Hoare triple {133655#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133659#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-08 10:15:23,421 INFO L290 TraceCheckUtils]: 33: Hoare triple {133659#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {133659#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-08 10:15:23,421 INFO L290 TraceCheckUtils]: 34: Hoare triple {133659#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {133659#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-08 10:15:23,422 INFO L290 TraceCheckUtils]: 35: Hoare triple {133659#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {133659#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-08 10:15:23,422 INFO L290 TraceCheckUtils]: 36: Hoare triple {133659#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {133659#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-08 10:15:23,422 INFO L290 TraceCheckUtils]: 37: Hoare triple {133659#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {133531#false} is VALID [2022-04-08 10:15:23,423 INFO L272 TraceCheckUtils]: 38: Hoare triple {133531#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {133531#false} is VALID [2022-04-08 10:15:23,423 INFO L290 TraceCheckUtils]: 39: Hoare triple {133531#false} ~cond := #in~cond; {133531#false} is VALID [2022-04-08 10:15:23,423 INFO L290 TraceCheckUtils]: 40: Hoare triple {133531#false} assume 0 == ~cond; {133531#false} is VALID [2022-04-08 10:15:23,423 INFO L290 TraceCheckUtils]: 41: Hoare triple {133531#false} assume !false; {133531#false} is VALID [2022-04-08 10:15:23,423 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:15:23,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:15:24,223 INFO L290 TraceCheckUtils]: 41: Hoare triple {133531#false} assume !false; {133531#false} is VALID [2022-04-08 10:15:24,223 INFO L290 TraceCheckUtils]: 40: Hoare triple {133531#false} assume 0 == ~cond; {133531#false} is VALID [2022-04-08 10:15:24,223 INFO L290 TraceCheckUtils]: 39: Hoare triple {133531#false} ~cond := #in~cond; {133531#false} is VALID [2022-04-08 10:15:24,223 INFO L272 TraceCheckUtils]: 38: Hoare triple {133531#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {133531#false} is VALID [2022-04-08 10:15:24,224 INFO L290 TraceCheckUtils]: 37: Hoare triple {133699#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {133531#false} is VALID [2022-04-08 10:15:24,224 INFO L290 TraceCheckUtils]: 36: Hoare triple {133699#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {133699#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:15:24,224 INFO L290 TraceCheckUtils]: 35: Hoare triple {133699#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {133699#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:15:24,224 INFO L290 TraceCheckUtils]: 34: Hoare triple {133699#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {133699#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:15:24,225 INFO L290 TraceCheckUtils]: 33: Hoare triple {133699#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {133699#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:15:24,225 INFO L290 TraceCheckUtils]: 32: Hoare triple {133715#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133699#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:15:24,226 INFO L290 TraceCheckUtils]: 31: Hoare triple {133719#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133715#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-08 10:15:24,227 INFO L290 TraceCheckUtils]: 30: Hoare triple {133723#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133719#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-08 10:15:24,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {133727#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133723#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-08 10:15:24,228 INFO L290 TraceCheckUtils]: 28: Hoare triple {133731#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133727#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-08 10:15:24,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {133735#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133731#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-08 10:15:24,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {133739#(< 0 (mod (+ 7 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133735#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-08 10:15:24,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {133743#(< 0 (mod (+ main_~z~0 8) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133739#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-08 10:15:24,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {133747#(< 0 (mod (+ main_~z~0 9) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133743#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-08 10:15:24,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {133751#(< 0 (mod (+ main_~z~0 10) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133747#(< 0 (mod (+ main_~z~0 9) 4294967296))} is VALID [2022-04-08 10:15:24,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {133755#(< 0 (mod (+ main_~z~0 11) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {133751#(< 0 (mod (+ main_~z~0 10) 4294967296))} is VALID [2022-04-08 10:15:24,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {133755#(< 0 (mod (+ main_~z~0 11) 4294967296))} assume !(~z~0 % 4294967296 > 0); {133755#(< 0 (mod (+ main_~z~0 11) 4294967296))} is VALID [2022-04-08 10:15:24,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {133751#(< 0 (mod (+ main_~z~0 10) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {133755#(< 0 (mod (+ main_~z~0 11) 4294967296))} is VALID [2022-04-08 10:15:24,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {133747#(< 0 (mod (+ main_~z~0 9) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {133751#(< 0 (mod (+ main_~z~0 10) 4294967296))} is VALID [2022-04-08 10:15:24,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {133768#(< 0 (mod (+ main_~y~0 9) 4294967296))} ~z~0 := ~y~0; {133747#(< 0 (mod (+ main_~z~0 9) 4294967296))} is VALID [2022-04-08 10:15:24,234 INFO L290 TraceCheckUtils]: 17: Hoare triple {133768#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !(~x~0 % 4294967296 > 0); {133768#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:15:24,234 INFO L290 TraceCheckUtils]: 16: Hoare triple {133775#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133768#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:15:24,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {133779#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133775#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:15:24,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {133783#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133779#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:15:24,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {133787#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133783#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:15:24,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {133791#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133787#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:15:24,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {133795#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133791#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:15:24,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {133799#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133795#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:15:24,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {133803#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133799#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:15:24,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {133807#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133803#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:15:24,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {133811#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133807#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:15:24,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {133815#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {133811#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:15:24,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {133530#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {133815#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:15:24,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {133530#true} call #t~ret15 := main(); {133530#true} is VALID [2022-04-08 10:15:24,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {133530#true} {133530#true} #83#return; {133530#true} is VALID [2022-04-08 10:15:24,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {133530#true} assume true; {133530#true} is VALID [2022-04-08 10:15:24,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {133530#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {133530#true} is VALID [2022-04-08 10:15:24,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {133530#true} call ULTIMATE.init(); {133530#true} is VALID [2022-04-08 10:15:24,242 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:15:24,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409251326] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:15:24,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:15:24,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 26, 26] total 52 [2022-04-08 10:15:24,242 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:15:24,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1080862587] [2022-04-08 10:15:24,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1080862587] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:15:24,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:15:24,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:15:24,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32897759] [2022-04-08 10:15:24,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:15:24,242 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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 42 [2022-04-08 10:15:24,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:15:24,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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-08 10:15:24,262 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-08 10:15:24,262 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:15:24,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:15:24,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:15:24,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=2250, Unknown=0, NotChecked=0, Total=2652 [2022-04-08 10:15:24,263 INFO L87 Difference]: Start difference. First operand 408 states and 522 transitions. Second operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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-08 10:15:33,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:33,953 INFO L93 Difference]: Finished difference Result 664 states and 832 transitions. [2022-04-08 10:15:33,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 10:15:33,953 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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 42 [2022-04-08 10:15:33,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:15:33,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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-08 10:15:33,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 146 transitions. [2022-04-08 10:15:33,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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-08 10:15:33,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 146 transitions. [2022-04-08 10:15:33,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 146 transitions. [2022-04-08 10:15:34,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:34,087 INFO L225 Difference]: With dead ends: 664 [2022-04-08 10:15:34,087 INFO L226 Difference]: Without dead ends: 643 [2022-04-08 10:15:34,088 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=747, Invalid=4083, Unknown=0, NotChecked=0, Total=4830 [2022-04-08 10:15:34,088 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 94 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:15:34,088 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 129 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-08 10:15:34,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2022-04-08 10:15:36,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 408. [2022-04-08 10:15:36,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:15:36,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 643 states. Second operand has 408 states, 403 states have (on average 1.28287841191067) internal successors, (517), 403 states have internal predecessors, (517), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:36,258 INFO L74 IsIncluded]: Start isIncluded. First operand 643 states. Second operand has 408 states, 403 states have (on average 1.28287841191067) internal successors, (517), 403 states have internal predecessors, (517), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:36,258 INFO L87 Difference]: Start difference. First operand 643 states. Second operand has 408 states, 403 states have (on average 1.28287841191067) internal successors, (517), 403 states have internal predecessors, (517), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:36,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:36,269 INFO L93 Difference]: Finished difference Result 643 states and 810 transitions. [2022-04-08 10:15:36,269 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 810 transitions. [2022-04-08 10:15:36,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:15:36,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:15:36,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 408 states, 403 states have (on average 1.28287841191067) internal successors, (517), 403 states have internal predecessors, (517), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 643 states. [2022-04-08 10:15:36,270 INFO L87 Difference]: Start difference. First operand has 408 states, 403 states have (on average 1.28287841191067) internal successors, (517), 403 states have internal predecessors, (517), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 643 states. [2022-04-08 10:15:36,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:36,281 INFO L93 Difference]: Finished difference Result 643 states and 810 transitions. [2022-04-08 10:15:36,281 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 810 transitions. [2022-04-08 10:15:36,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:15:36,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:15:36,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:15:36,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:15:36,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 403 states have (on average 1.28287841191067) internal successors, (517), 403 states have internal predecessors, (517), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:36,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 521 transitions. [2022-04-08 10:15:36,289 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 521 transitions. Word has length 42 [2022-04-08 10:15:36,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:15:36,289 INFO L478 AbstractCegarLoop]: Abstraction has 408 states and 521 transitions. [2022-04-08 10:15:36,289 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 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-08 10:15:36,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 408 states and 521 transitions. [2022-04-08 10:15:39,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 521 edges. 521 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:39,245 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 521 transitions. [2022-04-08 10:15:39,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 10:15:39,245 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:15:39,245 INFO L499 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:15:39,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2022-04-08 10:15:39,446 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:15:39,446 INFO L403 AbstractCegarLoop]: === Iteration 75 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:15:39,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:15:39,446 INFO L85 PathProgramCache]: Analyzing trace with hash -303981326, now seen corresponding path program 75 times [2022-04-08 10:15:39,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:15:39,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2038148597] [2022-04-08 10:15:39,448 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:15:39,448 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:15:39,448 INFO L85 PathProgramCache]: Analyzing trace with hash -303981326, now seen corresponding path program 76 times [2022-04-08 10:15:39,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:15:39,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832168386] [2022-04-08 10:15:39,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:15:39,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:15:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:39,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:15:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:39,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {137333#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {137302#true} is VALID [2022-04-08 10:15:39,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {137302#true} assume true; {137302#true} is VALID [2022-04-08 10:15:39,982 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {137302#true} {137302#true} #83#return; {137302#true} is VALID [2022-04-08 10:15:39,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {137302#true} call ULTIMATE.init(); {137333#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:15:39,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {137333#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {137302#true} is VALID [2022-04-08 10:15:39,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {137302#true} assume true; {137302#true} is VALID [2022-04-08 10:15:39,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {137302#true} {137302#true} #83#return; {137302#true} is VALID [2022-04-08 10:15:39,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {137302#true} call #t~ret15 := main(); {137302#true} is VALID [2022-04-08 10:15:39,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {137302#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {137307#(= main_~y~0 0)} is VALID [2022-04-08 10:15:39,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {137307#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137308#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:15:39,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {137308#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137309#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:15:39,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {137309#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137310#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:15:39,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {137310#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137311#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:15:39,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {137311#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137312#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:15:39,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {137312#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137313#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:15:39,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {137313#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137314#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:15:39,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {137314#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137315#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:15:39,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {137315#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137316#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:15:39,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {137316#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137317#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:15:39,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {137317#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137318#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:15:39,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {137318#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137319#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:15:39,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {137319#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137320#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:15:39,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {137320#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137321#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:15:39,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {137321#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137322#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:15:39,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {137322#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137323#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:15:39,992 INFO L290 TraceCheckUtils]: 22: Hoare triple {137323#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137324#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:15:39,992 INFO L290 TraceCheckUtils]: 23: Hoare triple {137324#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137325#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:15:39,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {137325#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137326#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:15:39,993 INFO L290 TraceCheckUtils]: 25: Hoare triple {137326#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137327#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:15:39,994 INFO L290 TraceCheckUtils]: 26: Hoare triple {137327#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137328#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:15:39,994 INFO L290 TraceCheckUtils]: 27: Hoare triple {137328#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137329#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:15:39,995 INFO L290 TraceCheckUtils]: 28: Hoare triple {137329#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137330#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:15:39,995 INFO L290 TraceCheckUtils]: 29: Hoare triple {137330#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {137330#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:15:39,996 INFO L290 TraceCheckUtils]: 30: Hoare triple {137330#(and (<= main_~y~0 23) (<= 23 main_~y~0))} ~z~0 := ~y~0; {137331#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-08 10:15:39,996 INFO L290 TraceCheckUtils]: 31: Hoare triple {137331#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {137332#(and (<= 22 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:15:39,996 INFO L290 TraceCheckUtils]: 32: Hoare triple {137332#(and (<= 22 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {137303#false} is VALID [2022-04-08 10:15:39,997 INFO L290 TraceCheckUtils]: 33: Hoare triple {137303#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {137303#false} is VALID [2022-04-08 10:15:39,997 INFO L290 TraceCheckUtils]: 34: Hoare triple {137303#false} assume !(~y~0 % 4294967296 > 0); {137303#false} is VALID [2022-04-08 10:15:39,997 INFO L290 TraceCheckUtils]: 35: Hoare triple {137303#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {137303#false} is VALID [2022-04-08 10:15:39,997 INFO L290 TraceCheckUtils]: 36: Hoare triple {137303#false} assume !(~x~0 % 4294967296 > 0); {137303#false} is VALID [2022-04-08 10:15:39,997 INFO L290 TraceCheckUtils]: 37: Hoare triple {137303#false} assume !(~z~0 % 4294967296 > 0); {137303#false} is VALID [2022-04-08 10:15:39,997 INFO L272 TraceCheckUtils]: 38: Hoare triple {137303#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {137303#false} is VALID [2022-04-08 10:15:39,997 INFO L290 TraceCheckUtils]: 39: Hoare triple {137303#false} ~cond := #in~cond; {137303#false} is VALID [2022-04-08 10:15:39,997 INFO L290 TraceCheckUtils]: 40: Hoare triple {137303#false} assume 0 == ~cond; {137303#false} is VALID [2022-04-08 10:15:39,997 INFO L290 TraceCheckUtils]: 41: Hoare triple {137303#false} assume !false; {137303#false} is VALID [2022-04-08 10:15:39,997 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 277 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:15:39,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:15:39,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832168386] [2022-04-08 10:15:39,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832168386] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:15:39,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668911090] [2022-04-08 10:15:39,997 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:15:39,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:15:39,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:15:39,998 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:15:39,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-04-08 10:15:40,051 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:15:40,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:15:40,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-08 10:15:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:40,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:15:40,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {137302#true} call ULTIMATE.init(); {137302#true} is VALID [2022-04-08 10:15:40,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {137302#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {137302#true} is VALID [2022-04-08 10:15:40,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {137302#true} assume true; {137302#true} is VALID [2022-04-08 10:15:40,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {137302#true} {137302#true} #83#return; {137302#true} is VALID [2022-04-08 10:15:40,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {137302#true} call #t~ret15 := main(); {137302#true} is VALID [2022-04-08 10:15:40,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {137302#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {137307#(= main_~y~0 0)} is VALID [2022-04-08 10:15:40,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {137307#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137308#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:15:40,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {137308#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137309#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:15:40,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {137309#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137310#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:15:40,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {137310#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137311#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:15:40,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {137311#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137312#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:15:40,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {137312#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137313#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:15:40,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {137313#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137314#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:15:40,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {137314#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137315#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:15:40,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {137315#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137316#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:15:40,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {137316#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137317#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:15:40,464 INFO L290 TraceCheckUtils]: 16: Hoare triple {137317#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137318#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:15:40,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {137318#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137319#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:15:40,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {137319#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137320#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:15:40,466 INFO L290 TraceCheckUtils]: 19: Hoare triple {137320#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137321#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:15:40,466 INFO L290 TraceCheckUtils]: 20: Hoare triple {137321#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137322#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:15:40,467 INFO L290 TraceCheckUtils]: 21: Hoare triple {137322#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137323#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:15:40,467 INFO L290 TraceCheckUtils]: 22: Hoare triple {137323#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137324#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:15:40,468 INFO L290 TraceCheckUtils]: 23: Hoare triple {137324#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137325#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:15:40,468 INFO L290 TraceCheckUtils]: 24: Hoare triple {137325#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137326#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:15:40,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {137326#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137327#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:15:40,469 INFO L290 TraceCheckUtils]: 26: Hoare triple {137327#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137328#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:15:40,470 INFO L290 TraceCheckUtils]: 27: Hoare triple {137328#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137329#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:15:40,470 INFO L290 TraceCheckUtils]: 28: Hoare triple {137329#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137330#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:15:40,470 INFO L290 TraceCheckUtils]: 29: Hoare triple {137330#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {137330#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:15:40,471 INFO L290 TraceCheckUtils]: 30: Hoare triple {137330#(and (<= main_~y~0 23) (<= 23 main_~y~0))} ~z~0 := ~y~0; {137331#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-08 10:15:40,471 INFO L290 TraceCheckUtils]: 31: Hoare triple {137331#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {137430#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-08 10:15:40,472 INFO L290 TraceCheckUtils]: 32: Hoare triple {137430#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !(~z~0 % 4294967296 > 0); {137303#false} is VALID [2022-04-08 10:15:40,472 INFO L290 TraceCheckUtils]: 33: Hoare triple {137303#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {137303#false} is VALID [2022-04-08 10:15:40,472 INFO L290 TraceCheckUtils]: 34: Hoare triple {137303#false} assume !(~y~0 % 4294967296 > 0); {137303#false} is VALID [2022-04-08 10:15:40,472 INFO L290 TraceCheckUtils]: 35: Hoare triple {137303#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {137303#false} is VALID [2022-04-08 10:15:40,472 INFO L290 TraceCheckUtils]: 36: Hoare triple {137303#false} assume !(~x~0 % 4294967296 > 0); {137303#false} is VALID [2022-04-08 10:15:40,472 INFO L290 TraceCheckUtils]: 37: Hoare triple {137303#false} assume !(~z~0 % 4294967296 > 0); {137303#false} is VALID [2022-04-08 10:15:40,472 INFO L272 TraceCheckUtils]: 38: Hoare triple {137303#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {137303#false} is VALID [2022-04-08 10:15:40,472 INFO L290 TraceCheckUtils]: 39: Hoare triple {137303#false} ~cond := #in~cond; {137303#false} is VALID [2022-04-08 10:15:40,472 INFO L290 TraceCheckUtils]: 40: Hoare triple {137303#false} assume 0 == ~cond; {137303#false} is VALID [2022-04-08 10:15:40,472 INFO L290 TraceCheckUtils]: 41: Hoare triple {137303#false} assume !false; {137303#false} is VALID [2022-04-08 10:15:40,472 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 277 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:15:40,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:15:41,549 INFO L290 TraceCheckUtils]: 41: Hoare triple {137303#false} assume !false; {137303#false} is VALID [2022-04-08 10:15:41,549 INFO L290 TraceCheckUtils]: 40: Hoare triple {137303#false} assume 0 == ~cond; {137303#false} is VALID [2022-04-08 10:15:41,549 INFO L290 TraceCheckUtils]: 39: Hoare triple {137303#false} ~cond := #in~cond; {137303#false} is VALID [2022-04-08 10:15:41,549 INFO L272 TraceCheckUtils]: 38: Hoare triple {137303#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {137303#false} is VALID [2022-04-08 10:15:41,549 INFO L290 TraceCheckUtils]: 37: Hoare triple {137303#false} assume !(~z~0 % 4294967296 > 0); {137303#false} is VALID [2022-04-08 10:15:41,550 INFO L290 TraceCheckUtils]: 36: Hoare triple {137303#false} assume !(~x~0 % 4294967296 > 0); {137303#false} is VALID [2022-04-08 10:15:41,550 INFO L290 TraceCheckUtils]: 35: Hoare triple {137303#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {137303#false} is VALID [2022-04-08 10:15:41,550 INFO L290 TraceCheckUtils]: 34: Hoare triple {137303#false} assume !(~y~0 % 4294967296 > 0); {137303#false} is VALID [2022-04-08 10:15:41,550 INFO L290 TraceCheckUtils]: 33: Hoare triple {137303#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {137303#false} is VALID [2022-04-08 10:15:41,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {137488#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {137303#false} is VALID [2022-04-08 10:15:41,551 INFO L290 TraceCheckUtils]: 31: Hoare triple {137492#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {137488#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:15:41,551 INFO L290 TraceCheckUtils]: 30: Hoare triple {137496#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {137492#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:15:41,551 INFO L290 TraceCheckUtils]: 29: Hoare triple {137496#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {137496#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:15:41,552 INFO L290 TraceCheckUtils]: 28: Hoare triple {137503#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137496#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:15:41,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {137507#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137503#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:15:41,553 INFO L290 TraceCheckUtils]: 26: Hoare triple {137511#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137507#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:15:41,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {137515#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137511#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:15:41,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {137519#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137515#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:15:41,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {137523#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137519#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:15:41,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {137527#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137523#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:15:41,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {137531#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137527#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:15:41,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {137535#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137531#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:15:41,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {137539#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137535#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:15:41,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {137543#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137539#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:15:41,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {137547#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137543#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:15:41,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {137551#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137547#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:15:41,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {137555#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137551#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:15:41,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {137559#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137555#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:15:41,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {137563#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137559#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:15:41,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {137567#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137563#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:15:41,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {137571#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137567#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:15:41,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {137575#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137571#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:15:41,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {137579#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137575#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:15:41,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {137583#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137579#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:15:41,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {137587#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137583#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:15:41,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {137591#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {137587#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-08 10:15:41,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {137302#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {137591#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-08 10:15:41,566 INFO L272 TraceCheckUtils]: 4: Hoare triple {137302#true} call #t~ret15 := main(); {137302#true} is VALID [2022-04-08 10:15:41,566 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {137302#true} {137302#true} #83#return; {137302#true} is VALID [2022-04-08 10:15:41,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {137302#true} assume true; {137302#true} is VALID [2022-04-08 10:15:41,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {137302#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {137302#true} is VALID [2022-04-08 10:15:41,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {137302#true} call ULTIMATE.init(); {137302#true} is VALID [2022-04-08 10:15:41,567 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 277 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:15:41,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668911090] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:15:41,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:15:41,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-08 10:15:41,567 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:15:41,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2038148597] [2022-04-08 10:15:41,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2038148597] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:15:41,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:15:41,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-08 10:15:41,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688168700] [2022-04-08 10:15:41,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:15:41,568 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 28 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-08 10:15:41,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:15:41,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 28 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-08 10:15:41,593 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-08 10:15:41,593 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-08 10:15:41,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:15:41,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-08 10:15:41,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=691, Invalid=2389, Unknown=0, NotChecked=0, Total=3080 [2022-04-08 10:15:41,594 INFO L87 Difference]: Start difference. First operand 408 states and 521 transitions. Second operand has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 28 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-08 10:16:03,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:03,612 INFO L93 Difference]: Finished difference Result 949 states and 1331 transitions. [2022-04-08 10:16:03,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-08 10:16:03,612 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 28 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-08 10:16:03,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:16:03,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 28 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-08 10:16:03,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 298 transitions. [2022-04-08 10:16:03,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 28 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-08 10:16:03,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 298 transitions. [2022-04-08 10:16:03,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 298 transitions. [2022-04-08 10:16:03,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 298 edges. 298 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:03,892 INFO L225 Difference]: With dead ends: 949 [2022-04-08 10:16:03,892 INFO L226 Difference]: Without dead ends: 920 [2022-04-08 10:16:03,892 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1459, Invalid=5347, Unknown=0, NotChecked=0, Total=6806 [2022-04-08 10:16:03,893 INFO L913 BasicCegarLoop]: 135 mSDtfsCounter, 217 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 6297 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 6456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 6297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:16:03,893 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 267 Invalid, 6456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 6297 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-04-08 10:16:03,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2022-04-08 10:16:06,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 424. [2022-04-08 10:16:06,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:16:06,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 920 states. Second operand has 424 states, 419 states have (on average 1.2887828162291168) internal successors, (540), 419 states have internal predecessors, (540), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:06,113 INFO L74 IsIncluded]: Start isIncluded. First operand 920 states. Second operand has 424 states, 419 states have (on average 1.2887828162291168) internal successors, (540), 419 states have internal predecessors, (540), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:06,113 INFO L87 Difference]: Start difference. First operand 920 states. Second operand has 424 states, 419 states have (on average 1.2887828162291168) internal successors, (540), 419 states have internal predecessors, (540), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:06,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:06,136 INFO L93 Difference]: Finished difference Result 920 states and 1154 transitions. [2022-04-08 10:16:06,136 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1154 transitions. [2022-04-08 10:16:06,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:16:06,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:16:06,137 INFO L74 IsIncluded]: Start isIncluded. First operand has 424 states, 419 states have (on average 1.2887828162291168) internal successors, (540), 419 states have internal predecessors, (540), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 920 states. [2022-04-08 10:16:06,137 INFO L87 Difference]: Start difference. First operand has 424 states, 419 states have (on average 1.2887828162291168) internal successors, (540), 419 states have internal predecessors, (540), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 920 states. [2022-04-08 10:16:06,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:06,159 INFO L93 Difference]: Finished difference Result 920 states and 1154 transitions. [2022-04-08 10:16:06,159 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1154 transitions. [2022-04-08 10:16:06,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:16:06,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:16:06,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:16:06,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:16:06,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 419 states have (on average 1.2887828162291168) internal successors, (540), 419 states have internal predecessors, (540), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:06,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 544 transitions. [2022-04-08 10:16:06,167 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 544 transitions. Word has length 42 [2022-04-08 10:16:06,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:16:06,167 INFO L478 AbstractCegarLoop]: Abstraction has 424 states and 544 transitions. [2022-04-08 10:16:06,167 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 28 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-08 10:16:06,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 424 states and 544 transitions. [2022-04-08 10:16:09,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 544 edges. 544 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:09,272 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 544 transitions. [2022-04-08 10:16:09,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 10:16:09,273 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:16:09,273 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:16:09,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2022-04-08 10:16:09,473 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:16:09,473 INFO L403 AbstractCegarLoop]: === Iteration 76 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:16:09,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:16:09,473 INFO L85 PathProgramCache]: Analyzing trace with hash -837643569, now seen corresponding path program 39 times [2022-04-08 10:16:09,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:16:09,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1103671156] [2022-04-08 10:16:09,475 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:16:09,476 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:16:09,476 INFO L85 PathProgramCache]: Analyzing trace with hash -837643569, now seen corresponding path program 40 times [2022-04-08 10:16:09,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:16:09,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419926258] [2022-04-08 10:16:09,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:16:09,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:16:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:09,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:16:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:09,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {142276#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {142252#true} is VALID [2022-04-08 10:16:09,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {142252#true} assume true; {142252#true} is VALID [2022-04-08 10:16:09,797 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {142252#true} {142252#true} #83#return; {142252#true} is VALID [2022-04-08 10:16:09,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {142252#true} call ULTIMATE.init(); {142276#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:16:09,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {142276#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {142252#true} is VALID [2022-04-08 10:16:09,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {142252#true} assume true; {142252#true} is VALID [2022-04-08 10:16:09,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142252#true} {142252#true} #83#return; {142252#true} is VALID [2022-04-08 10:16:09,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {142252#true} call #t~ret15 := main(); {142252#true} is VALID [2022-04-08 10:16:09,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {142252#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {142257#(= main_~y~0 0)} is VALID [2022-04-08 10:16:09,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {142257#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142258#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:16:09,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {142258#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142259#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:16:09,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {142259#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142260#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:16:09,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {142260#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142261#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:16:09,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {142261#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142262#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:16:09,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {142262#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142263#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:16:09,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {142263#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142264#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:16:09,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {142264#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142265#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:16:09,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {142265#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142266#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:16:09,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {142266#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {142266#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:16:09,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {142266#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {142267#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:16:09,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {142267#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {142268#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:16:09,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {142268#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {142269#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:16:09,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {142269#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {142270#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:16:09,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {142270#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {142271#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:16:09,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {142271#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {142272#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:16:09,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {142272#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {142273#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:16:09,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {142273#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {142274#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:16:09,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {142274#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {142275#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:16:09,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {142275#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {142253#false} is VALID [2022-04-08 10:16:09,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {142253#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142253#false} is VALID [2022-04-08 10:16:09,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {142253#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142253#false} is VALID [2022-04-08 10:16:09,807 INFO L290 TraceCheckUtils]: 28: Hoare triple {142253#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142253#false} is VALID [2022-04-08 10:16:09,808 INFO L290 TraceCheckUtils]: 29: Hoare triple {142253#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142253#false} is VALID [2022-04-08 10:16:09,808 INFO L290 TraceCheckUtils]: 30: Hoare triple {142253#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142253#false} is VALID [2022-04-08 10:16:09,808 INFO L290 TraceCheckUtils]: 31: Hoare triple {142253#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142253#false} is VALID [2022-04-08 10:16:09,808 INFO L290 TraceCheckUtils]: 32: Hoare triple {142253#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142253#false} is VALID [2022-04-08 10:16:09,808 INFO L290 TraceCheckUtils]: 33: Hoare triple {142253#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142253#false} is VALID [2022-04-08 10:16:09,808 INFO L290 TraceCheckUtils]: 34: Hoare triple {142253#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142253#false} is VALID [2022-04-08 10:16:09,808 INFO L290 TraceCheckUtils]: 35: Hoare triple {142253#false} assume !(~y~0 % 4294967296 > 0); {142253#false} is VALID [2022-04-08 10:16:09,808 INFO L290 TraceCheckUtils]: 36: Hoare triple {142253#false} assume !(~x~0 % 4294967296 > 0); {142253#false} is VALID [2022-04-08 10:16:09,808 INFO L290 TraceCheckUtils]: 37: Hoare triple {142253#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {142253#false} is VALID [2022-04-08 10:16:09,808 INFO L290 TraceCheckUtils]: 38: Hoare triple {142253#false} assume !(~z~0 % 4294967296 > 0); {142253#false} is VALID [2022-04-08 10:16:09,808 INFO L272 TraceCheckUtils]: 39: Hoare triple {142253#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {142253#false} is VALID [2022-04-08 10:16:09,808 INFO L290 TraceCheckUtils]: 40: Hoare triple {142253#false} ~cond := #in~cond; {142253#false} is VALID [2022-04-08 10:16:09,808 INFO L290 TraceCheckUtils]: 41: Hoare triple {142253#false} assume 0 == ~cond; {142253#false} is VALID [2022-04-08 10:16:09,808 INFO L290 TraceCheckUtils]: 42: Hoare triple {142253#false} assume !false; {142253#false} is VALID [2022-04-08 10:16:09,808 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-08 10:16:09,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:16:09,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419926258] [2022-04-08 10:16:09,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419926258] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:16:09,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724920099] [2022-04-08 10:16:09,809 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:16:09,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:16:09,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:16:09,809 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:16:09,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-04-08 10:16:09,861 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:16:09,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:16:09,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 10:16:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:09,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:16:10,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {142252#true} call ULTIMATE.init(); {142252#true} is VALID [2022-04-08 10:16:10,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {142252#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {142252#true} is VALID [2022-04-08 10:16:10,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {142252#true} assume true; {142252#true} is VALID [2022-04-08 10:16:10,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142252#true} {142252#true} #83#return; {142252#true} is VALID [2022-04-08 10:16:10,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {142252#true} call #t~ret15 := main(); {142252#true} is VALID [2022-04-08 10:16:10,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {142252#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {142252#true} is VALID [2022-04-08 10:16:10,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {142252#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142252#true} is VALID [2022-04-08 10:16:10,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {142252#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142301#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:16:10,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {142301#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142305#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:16:10,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {142305#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142309#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:16:10,234 INFO L290 TraceCheckUtils]: 10: Hoare triple {142309#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142313#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:16:10,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {142313#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142317#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:16:10,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {142317#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142321#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:16:10,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {142321#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142325#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:16:10,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {142325#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142329#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-08 10:16:10,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {142329#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !(~x~0 % 4294967296 > 0); {142329#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-08 10:16:10,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {142329#(< 0 (mod (+ main_~x~0 8) 4294967296))} ~z~0 := ~y~0; {142329#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-08 10:16:10,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {142329#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {142325#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:16:10,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {142325#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {142321#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:16:10,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {142321#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {142317#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:16:10,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {142317#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {142313#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:16:10,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {142313#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {142309#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:16:10,241 INFO L290 TraceCheckUtils]: 22: Hoare triple {142309#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {142305#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:16:10,242 INFO L290 TraceCheckUtils]: 23: Hoare triple {142305#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {142301#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:16:10,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {142301#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:10,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:10,243 INFO L290 TraceCheckUtils]: 26: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:10,244 INFO L290 TraceCheckUtils]: 27: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:10,244 INFO L290 TraceCheckUtils]: 28: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:10,244 INFO L290 TraceCheckUtils]: 29: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:10,245 INFO L290 TraceCheckUtils]: 30: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:10,245 INFO L290 TraceCheckUtils]: 31: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:10,245 INFO L290 TraceCheckUtils]: 32: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:10,245 INFO L290 TraceCheckUtils]: 33: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:10,246 INFO L290 TraceCheckUtils]: 34: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:10,246 INFO L290 TraceCheckUtils]: 35: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:10,246 INFO L290 TraceCheckUtils]: 36: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {142253#false} is VALID [2022-04-08 10:16:10,246 INFO L290 TraceCheckUtils]: 37: Hoare triple {142253#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {142253#false} is VALID [2022-04-08 10:16:10,246 INFO L290 TraceCheckUtils]: 38: Hoare triple {142253#false} assume !(~z~0 % 4294967296 > 0); {142253#false} is VALID [2022-04-08 10:16:10,246 INFO L272 TraceCheckUtils]: 39: Hoare triple {142253#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {142253#false} is VALID [2022-04-08 10:16:10,246 INFO L290 TraceCheckUtils]: 40: Hoare triple {142253#false} ~cond := #in~cond; {142253#false} is VALID [2022-04-08 10:16:10,246 INFO L290 TraceCheckUtils]: 41: Hoare triple {142253#false} assume 0 == ~cond; {142253#false} is VALID [2022-04-08 10:16:10,246 INFO L290 TraceCheckUtils]: 42: Hoare triple {142253#false} assume !false; {142253#false} is VALID [2022-04-08 10:16:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 16 proven. 64 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-04-08 10:16:10,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:16:10,409 INFO L290 TraceCheckUtils]: 42: Hoare triple {142253#false} assume !false; {142253#false} is VALID [2022-04-08 10:16:10,409 INFO L290 TraceCheckUtils]: 41: Hoare triple {142253#false} assume 0 == ~cond; {142253#false} is VALID [2022-04-08 10:16:10,410 INFO L290 TraceCheckUtils]: 40: Hoare triple {142253#false} ~cond := #in~cond; {142253#false} is VALID [2022-04-08 10:16:10,410 INFO L272 TraceCheckUtils]: 39: Hoare triple {142253#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {142253#false} is VALID [2022-04-08 10:16:10,410 INFO L290 TraceCheckUtils]: 38: Hoare triple {142253#false} assume !(~z~0 % 4294967296 > 0); {142253#false} is VALID [2022-04-08 10:16:10,410 INFO L290 TraceCheckUtils]: 37: Hoare triple {142253#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {142253#false} is VALID [2022-04-08 10:16:10,410 INFO L290 TraceCheckUtils]: 36: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {142253#false} is VALID [2022-04-08 10:16:10,410 INFO L290 TraceCheckUtils]: 35: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:10,411 INFO L290 TraceCheckUtils]: 34: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:10,411 INFO L290 TraceCheckUtils]: 33: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:10,411 INFO L290 TraceCheckUtils]: 32: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:10,411 INFO L290 TraceCheckUtils]: 31: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:10,419 INFO L290 TraceCheckUtils]: 30: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:10,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:10,420 INFO L290 TraceCheckUtils]: 28: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:10,420 INFO L290 TraceCheckUtils]: 27: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:10,420 INFO L290 TraceCheckUtils]: 26: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:10,421 INFO L290 TraceCheckUtils]: 25: Hoare triple {142360#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:10,422 INFO L290 TraceCheckUtils]: 24: Hoare triple {142301#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {142360#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:10,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {142305#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {142301#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:16:10,423 INFO L290 TraceCheckUtils]: 22: Hoare triple {142309#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {142305#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:16:10,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {142313#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {142309#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:16:10,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {142317#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {142313#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:16:10,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {142321#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {142317#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:16:10,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {142325#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {142321#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:16:10,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {142329#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {142325#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:16:10,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {142329#(< 0 (mod (+ main_~x~0 8) 4294967296))} ~z~0 := ~y~0; {142329#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-08 10:16:10,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {142329#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !(~x~0 % 4294967296 > 0); {142329#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-08 10:16:10,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {142325#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142329#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-08 10:16:10,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {142321#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142325#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:16:10,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {142317#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142321#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:16:10,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {142313#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142317#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:16:10,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {142309#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142313#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:16:10,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {142305#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142309#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:16:10,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {142301#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142305#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:16:10,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {142252#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142301#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:16:10,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {142252#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142252#true} is VALID [2022-04-08 10:16:10,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {142252#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {142252#true} is VALID [2022-04-08 10:16:10,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {142252#true} call #t~ret15 := main(); {142252#true} is VALID [2022-04-08 10:16:10,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142252#true} {142252#true} #83#return; {142252#true} is VALID [2022-04-08 10:16:10,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {142252#true} assume true; {142252#true} is VALID [2022-04-08 10:16:10,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {142252#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {142252#true} is VALID [2022-04-08 10:16:10,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {142252#true} call ULTIMATE.init(); {142252#true} is VALID [2022-04-08 10:16:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 16 proven. 64 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-04-08 10:16:10,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724920099] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:16:10,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:16:10,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 11] total 31 [2022-04-08 10:16:10,433 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:16:10,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1103671156] [2022-04-08 10:16:10,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1103671156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:16:10,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:16:10,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 10:16:10,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329137780] [2022-04-08 10:16:10,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:16:10,434 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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 43 [2022-04-08 10:16:10,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:16:10,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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-08 10:16:10,458 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-08 10:16:10,458 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 10:16:10,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:16:10,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 10:16:10,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=863, Unknown=0, NotChecked=0, Total=930 [2022-04-08 10:16:10,458 INFO L87 Difference]: Start difference. First operand 424 states and 544 transitions. Second operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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-08 10:16:19,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:19,537 INFO L93 Difference]: Finished difference Result 578 states and 745 transitions. [2022-04-08 10:16:19,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-08 10:16:19,537 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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 43 [2022-04-08 10:16:19,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:16:19,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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-08 10:16:19,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 145 transitions. [2022-04-08 10:16:19,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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-08 10:16:19,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 145 transitions. [2022-04-08 10:16:19,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 145 transitions. [2022-04-08 10:16:19,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:19,667 INFO L225 Difference]: With dead ends: 578 [2022-04-08 10:16:19,667 INFO L226 Difference]: Without dead ends: 559 [2022-04-08 10:16:19,667 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=339, Invalid=4631, Unknown=0, NotChecked=0, Total=4970 [2022-04-08 10:16:19,667 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 69 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1588 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:16:19,667 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 116 Invalid, 1711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1588 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-08 10:16:19,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2022-04-08 10:16:21,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 425. [2022-04-08 10:16:21,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:16:21,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 559 states. Second operand has 425 states, 420 states have (on average 1.2880952380952382) internal successors, (541), 420 states have internal predecessors, (541), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:21,927 INFO L74 IsIncluded]: Start isIncluded. First operand 559 states. Second operand has 425 states, 420 states have (on average 1.2880952380952382) internal successors, (541), 420 states have internal predecessors, (541), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:21,927 INFO L87 Difference]: Start difference. First operand 559 states. Second operand has 425 states, 420 states have (on average 1.2880952380952382) internal successors, (541), 420 states have internal predecessors, (541), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:21,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:21,936 INFO L93 Difference]: Finished difference Result 559 states and 723 transitions. [2022-04-08 10:16:21,936 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 723 transitions. [2022-04-08 10:16:21,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:16:21,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:16:21,936 INFO L74 IsIncluded]: Start isIncluded. First operand has 425 states, 420 states have (on average 1.2880952380952382) internal successors, (541), 420 states have internal predecessors, (541), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 559 states. [2022-04-08 10:16:21,936 INFO L87 Difference]: Start difference. First operand has 425 states, 420 states have (on average 1.2880952380952382) internal successors, (541), 420 states have internal predecessors, (541), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 559 states. [2022-04-08 10:16:21,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:21,945 INFO L93 Difference]: Finished difference Result 559 states and 723 transitions. [2022-04-08 10:16:21,945 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 723 transitions. [2022-04-08 10:16:21,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:16:21,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:16:21,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:16:21,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:16:21,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 420 states have (on average 1.2880952380952382) internal successors, (541), 420 states have internal predecessors, (541), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:21,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 545 transitions. [2022-04-08 10:16:21,953 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 545 transitions. Word has length 43 [2022-04-08 10:16:21,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:16:21,953 INFO L478 AbstractCegarLoop]: Abstraction has 425 states and 545 transitions. [2022-04-08 10:16:21,953 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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-08 10:16:21,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 425 states and 545 transitions. [2022-04-08 10:16:25,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 545 edges. 545 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:25,277 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 545 transitions. [2022-04-08 10:16:25,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 10:16:25,277 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:16:25,277 INFO L499 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:16:25,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2022-04-08 10:16:25,479 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:16:25,479 INFO L403 AbstractCegarLoop]: === Iteration 77 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:16:25,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:16:25,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1349473345, now seen corresponding path program 77 times [2022-04-08 10:16:25,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:16:25,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1046626953] [2022-04-08 10:16:25,482 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:16:25,482 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:16:25,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1349473345, now seen corresponding path program 78 times [2022-04-08 10:16:25,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:16:25,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648603255] [2022-04-08 10:16:25,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:16:25,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:16:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:26,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:16:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:26,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {145779#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {145747#true} is VALID [2022-04-08 10:16:26,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {145747#true} assume true; {145747#true} is VALID [2022-04-08 10:16:26,083 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {145747#true} {145747#true} #83#return; {145747#true} is VALID [2022-04-08 10:16:26,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {145747#true} call ULTIMATE.init(); {145779#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:16:26,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {145779#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {145747#true} is VALID [2022-04-08 10:16:26,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {145747#true} assume true; {145747#true} is VALID [2022-04-08 10:16:26,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {145747#true} {145747#true} #83#return; {145747#true} is VALID [2022-04-08 10:16:26,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {145747#true} call #t~ret15 := main(); {145747#true} is VALID [2022-04-08 10:16:26,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {145747#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {145752#(= main_~y~0 0)} is VALID [2022-04-08 10:16:26,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {145752#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145753#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:16:26,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {145753#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145754#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:16:26,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {145754#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145755#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:16:26,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {145755#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145756#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:16:26,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {145756#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145757#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:16:26,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {145757#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145758#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:16:26,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {145758#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145759#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:16:26,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {145759#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145760#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:16:26,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {145760#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145761#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:16:26,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {145761#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145762#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:16:26,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {145762#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145763#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:16:26,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {145763#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145764#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:16:26,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {145764#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145765#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:16:26,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {145765#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145766#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:16:26,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {145766#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145767#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:16:26,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {145767#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145768#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:16:26,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {145768#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145769#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:16:26,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {145769#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145770#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:16:26,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {145770#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145771#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:16:26,094 INFO L290 TraceCheckUtils]: 25: Hoare triple {145771#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145772#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:16:26,094 INFO L290 TraceCheckUtils]: 26: Hoare triple {145772#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145773#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:16:26,095 INFO L290 TraceCheckUtils]: 27: Hoare triple {145773#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145774#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:16:26,095 INFO L290 TraceCheckUtils]: 28: Hoare triple {145774#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145775#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:16:26,096 INFO L290 TraceCheckUtils]: 29: Hoare triple {145775#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145776#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:16:26,096 INFO L290 TraceCheckUtils]: 30: Hoare triple {145776#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !(~x~0 % 4294967296 > 0); {145776#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:16:26,097 INFO L290 TraceCheckUtils]: 31: Hoare triple {145776#(and (<= 24 main_~y~0) (<= main_~y~0 24))} ~z~0 := ~y~0; {145777#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-08 10:16:26,097 INFO L290 TraceCheckUtils]: 32: Hoare triple {145777#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {145778#(and (<= (div main_~z~0 4294967296) 0) (<= 23 main_~z~0))} is VALID [2022-04-08 10:16:26,098 INFO L290 TraceCheckUtils]: 33: Hoare triple {145778#(and (<= (div main_~z~0 4294967296) 0) (<= 23 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {145748#false} is VALID [2022-04-08 10:16:26,098 INFO L290 TraceCheckUtils]: 34: Hoare triple {145748#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {145748#false} is VALID [2022-04-08 10:16:26,098 INFO L290 TraceCheckUtils]: 35: Hoare triple {145748#false} assume !(~y~0 % 4294967296 > 0); {145748#false} is VALID [2022-04-08 10:16:26,098 INFO L290 TraceCheckUtils]: 36: Hoare triple {145748#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {145748#false} is VALID [2022-04-08 10:16:26,098 INFO L290 TraceCheckUtils]: 37: Hoare triple {145748#false} assume !(~x~0 % 4294967296 > 0); {145748#false} is VALID [2022-04-08 10:16:26,098 INFO L290 TraceCheckUtils]: 38: Hoare triple {145748#false} assume !(~z~0 % 4294967296 > 0); {145748#false} is VALID [2022-04-08 10:16:26,098 INFO L272 TraceCheckUtils]: 39: Hoare triple {145748#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {145748#false} is VALID [2022-04-08 10:16:26,098 INFO L290 TraceCheckUtils]: 40: Hoare triple {145748#false} ~cond := #in~cond; {145748#false} is VALID [2022-04-08 10:16:26,098 INFO L290 TraceCheckUtils]: 41: Hoare triple {145748#false} assume 0 == ~cond; {145748#false} is VALID [2022-04-08 10:16:26,098 INFO L290 TraceCheckUtils]: 42: Hoare triple {145748#false} assume !false; {145748#false} is VALID [2022-04-08 10:16:26,098 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:16:26,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:16:26,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648603255] [2022-04-08 10:16:26,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648603255] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:16:26,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617551584] [2022-04-08 10:16:26,099 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:16:26,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:16:26,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:16:26,099 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:16:26,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-04-08 10:16:26,141 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:16:26,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:16:26,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 10:16:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:26,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:16:26,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {145747#true} call ULTIMATE.init(); {145747#true} is VALID [2022-04-08 10:16:26,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {145747#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {145747#true} is VALID [2022-04-08 10:16:26,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {145747#true} assume true; {145747#true} is VALID [2022-04-08 10:16:26,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {145747#true} {145747#true} #83#return; {145747#true} is VALID [2022-04-08 10:16:26,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {145747#true} call #t~ret15 := main(); {145747#true} is VALID [2022-04-08 10:16:26,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {145747#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {145747#true} is VALID [2022-04-08 10:16:26,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,496 INFO L290 TraceCheckUtils]: 10: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,497 INFO L290 TraceCheckUtils]: 16: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,497 INFO L290 TraceCheckUtils]: 25: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,497 INFO L290 TraceCheckUtils]: 26: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,497 INFO L290 TraceCheckUtils]: 27: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,497 INFO L290 TraceCheckUtils]: 28: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,497 INFO L290 TraceCheckUtils]: 29: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {145747#true} assume !(~x~0 % 4294967296 > 0); {145747#true} is VALID [2022-04-08 10:16:26,498 INFO L290 TraceCheckUtils]: 31: Hoare triple {145747#true} ~z~0 := ~y~0; {145876#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:16:26,498 INFO L290 TraceCheckUtils]: 32: Hoare triple {145876#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {145880#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:16:26,498 INFO L290 TraceCheckUtils]: 33: Hoare triple {145880#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {145880#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:16:26,499 INFO L290 TraceCheckUtils]: 34: Hoare triple {145880#(= main_~y~0 (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {145887#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-08 10:16:26,499 INFO L290 TraceCheckUtils]: 35: Hoare triple {145887#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {145887#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-08 10:16:26,500 INFO L290 TraceCheckUtils]: 36: Hoare triple {145887#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {145876#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:16:26,500 INFO L290 TraceCheckUtils]: 37: Hoare triple {145876#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {145876#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:16:26,500 INFO L290 TraceCheckUtils]: 38: Hoare triple {145876#(= main_~z~0 main_~y~0)} assume !(~z~0 % 4294967296 > 0); {145900#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:16:26,501 INFO L272 TraceCheckUtils]: 39: Hoare triple {145900#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {145904#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:16:26,501 INFO L290 TraceCheckUtils]: 40: Hoare triple {145904#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {145908#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:16:26,501 INFO L290 TraceCheckUtils]: 41: Hoare triple {145908#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {145748#false} is VALID [2022-04-08 10:16:26,502 INFO L290 TraceCheckUtils]: 42: Hoare triple {145748#false} assume !false; {145748#false} is VALID [2022-04-08 10:16:26,502 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-04-08 10:16:26,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:16:26,807 INFO L290 TraceCheckUtils]: 42: Hoare triple {145748#false} assume !false; {145748#false} is VALID [2022-04-08 10:16:26,807 INFO L290 TraceCheckUtils]: 41: Hoare triple {145908#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {145748#false} is VALID [2022-04-08 10:16:26,807 INFO L290 TraceCheckUtils]: 40: Hoare triple {145904#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {145908#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:16:26,808 INFO L272 TraceCheckUtils]: 39: Hoare triple {145900#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {145904#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:16:26,808 INFO L290 TraceCheckUtils]: 38: Hoare triple {145927#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {145900#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:16:26,809 INFO L290 TraceCheckUtils]: 37: Hoare triple {145927#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {145927#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:16:26,809 INFO L290 TraceCheckUtils]: 36: Hoare triple {145934#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {145927#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:16:26,810 INFO L290 TraceCheckUtils]: 35: Hoare triple {145934#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {145934#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-08 10:16:26,810 INFO L290 TraceCheckUtils]: 34: Hoare triple {145941#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {145934#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-08 10:16:26,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {145941#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {145941#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-08 10:16:26,812 INFO L290 TraceCheckUtils]: 32: Hoare triple {145927#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {145941#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-08 10:16:26,812 INFO L290 TraceCheckUtils]: 31: Hoare triple {145747#true} ~z~0 := ~y~0; {145927#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:16:26,812 INFO L290 TraceCheckUtils]: 30: Hoare triple {145747#true} assume !(~x~0 % 4294967296 > 0); {145747#true} is VALID [2022-04-08 10:16:26,812 INFO L290 TraceCheckUtils]: 29: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,812 INFO L290 TraceCheckUtils]: 22: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {145747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145747#true} is VALID [2022-04-08 10:16:26,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {145747#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {145747#true} is VALID [2022-04-08 10:16:26,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {145747#true} call #t~ret15 := main(); {145747#true} is VALID [2022-04-08 10:16:26,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {145747#true} {145747#true} #83#return; {145747#true} is VALID [2022-04-08 10:16:26,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {145747#true} assume true; {145747#true} is VALID [2022-04-08 10:16:26,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {145747#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {145747#true} is VALID [2022-04-08 10:16:26,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {145747#true} call ULTIMATE.init(); {145747#true} is VALID [2022-04-08 10:16:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-04-08 10:16:26,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617551584] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:16:26,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:16:26,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 8, 8] total 39 [2022-04-08 10:16:26,814 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:16:26,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1046626953] [2022-04-08 10:16:26,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1046626953] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:16:26,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:16:26,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-08 10:16:26,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230620720] [2022-04-08 10:16:26,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:16:26,814 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 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-08 10:16:26,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:16:26,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 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-08 10:16:26,846 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-08 10:16:26,846 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-08 10:16:26,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:16:26,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-08 10:16:26,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1393, Unknown=0, NotChecked=0, Total=1482 [2022-04-08 10:16:26,846 INFO L87 Difference]: Start difference. First operand 425 states and 545 transitions. Second operand has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 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-08 10:16:50,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:50,418 INFO L93 Difference]: Finished difference Result 987 states and 1387 transitions. [2022-04-08 10:16:50,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-08 10:16:50,418 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 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-08 10:16:50,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:16:50,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 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-08 10:16:50,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 310 transitions. [2022-04-08 10:16:50,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 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-08 10:16:50,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 310 transitions. [2022-04-08 10:16:50,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 310 transitions. [2022-04-08 10:16:50,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 310 edges. 310 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:50,706 INFO L225 Difference]: With dead ends: 987 [2022-04-08 10:16:50,707 INFO L226 Difference]: Without dead ends: 958 [2022-04-08 10:16:50,707 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=220, Invalid=4202, Unknown=0, NotChecked=0, Total=4422 [2022-04-08 10:16:50,707 INFO L913 BasicCegarLoop]: 141 mSDtfsCounter, 228 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 6835 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 7001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 6835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:16:50,707 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 278 Invalid, 7001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 6835 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-04-08 10:16:50,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2022-04-08 10:16:53,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 441. [2022-04-08 10:16:53,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:16:53,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 958 states. Second operand has 441 states, 436 states have (on average 1.2935779816513762) internal successors, (564), 436 states have internal predecessors, (564), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:53,028 INFO L74 IsIncluded]: Start isIncluded. First operand 958 states. Second operand has 441 states, 436 states have (on average 1.2935779816513762) internal successors, (564), 436 states have internal predecessors, (564), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:53,028 INFO L87 Difference]: Start difference. First operand 958 states. Second operand has 441 states, 436 states have (on average 1.2935779816513762) internal successors, (564), 436 states have internal predecessors, (564), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:53,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:53,052 INFO L93 Difference]: Finished difference Result 958 states and 1204 transitions. [2022-04-08 10:16:53,052 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1204 transitions. [2022-04-08 10:16:53,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:16:53,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:16:53,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 441 states, 436 states have (on average 1.2935779816513762) internal successors, (564), 436 states have internal predecessors, (564), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 958 states. [2022-04-08 10:16:53,053 INFO L87 Difference]: Start difference. First operand has 441 states, 436 states have (on average 1.2935779816513762) internal successors, (564), 436 states have internal predecessors, (564), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 958 states. [2022-04-08 10:16:53,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:53,077 INFO L93 Difference]: Finished difference Result 958 states and 1204 transitions. [2022-04-08 10:16:53,077 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1204 transitions. [2022-04-08 10:16:53,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:16:53,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:16:53,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:16:53,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:16:53,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 436 states have (on average 1.2935779816513762) internal successors, (564), 436 states have internal predecessors, (564), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:53,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 568 transitions. [2022-04-08 10:16:53,086 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 568 transitions. Word has length 43 [2022-04-08 10:16:53,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:16:53,086 INFO L478 AbstractCegarLoop]: Abstraction has 441 states and 568 transitions. [2022-04-08 10:16:53,086 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 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-08 10:16:53,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 441 states and 568 transitions. [2022-04-08 10:16:58,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 568 edges. 567 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:58,228 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 568 transitions. [2022-04-08 10:16:58,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 10:16:58,228 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:16:58,229 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:16:58,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Forceful destruction successful, exit code 0 [2022-04-08 10:16:58,429 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2022-04-08 10:16:58,429 INFO L403 AbstractCegarLoop]: === Iteration 78 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:16:58,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:16:58,429 INFO L85 PathProgramCache]: Analyzing trace with hash -733099069, now seen corresponding path program 41 times [2022-04-08 10:16:58,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:16:58,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [278735178] [2022-04-08 10:16:58,431 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:16:58,431 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:16:58,431 INFO L85 PathProgramCache]: Analyzing trace with hash -733099069, now seen corresponding path program 42 times [2022-04-08 10:16:58,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:16:58,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100122450] [2022-04-08 10:16:58,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:16:58,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:16:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:58,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:16:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:58,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {150893#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {150874#true} is VALID [2022-04-08 10:16:58,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {150874#true} assume true; {150874#true} is VALID [2022-04-08 10:16:58,659 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {150874#true} {150874#true} #83#return; {150874#true} is VALID [2022-04-08 10:16:58,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {150874#true} call ULTIMATE.init(); {150893#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:16:58,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {150893#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {150874#true} is VALID [2022-04-08 10:16:58,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {150874#true} assume true; {150874#true} is VALID [2022-04-08 10:16:58,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150874#true} {150874#true} #83#return; {150874#true} is VALID [2022-04-08 10:16:58,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {150874#true} call #t~ret15 := main(); {150874#true} is VALID [2022-04-08 10:16:58,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {150874#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {150874#true} is VALID [2022-04-08 10:16:58,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {150874#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150879#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:16:58,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {150879#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150880#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-08 10:16:58,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {150880#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150881#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:16:58,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {150881#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150882#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:16:58,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {150882#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150883#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:16:58,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {150883#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150884#(<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:16:58,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {150884#(<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150885#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:16:58,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {150885#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {150885#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:16:58,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {150885#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {150885#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:16:58,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {150885#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150886#(<= (+ (* 4294967296 (div (+ main_~x~0 6) 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:16:58,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {150886#(<= (+ (* 4294967296 (div (+ main_~x~0 6) 4294967296)) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150887#(<= (+ 2 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:16:58,669 INFO L290 TraceCheckUtils]: 17: Hoare triple {150887#(<= (+ 2 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150888#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 3) main_~x~0)} is VALID [2022-04-08 10:16:58,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {150888#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 3) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150889#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4) main_~x~0)} is VALID [2022-04-08 10:16:58,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {150889#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150890#(<= (+ 5 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:16:58,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {150890#(<= (+ 5 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150891#(<= (+ 6 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:16:58,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {150891#(<= (+ 6 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:16:58,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:16:58,672 INFO L290 TraceCheckUtils]: 23: Hoare triple {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:16:58,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:16:58,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:16:58,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:16:58,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:16:58,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:16:58,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:16:58,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:16:58,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {150892#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {150875#false} is VALID [2022-04-08 10:16:58,675 INFO L290 TraceCheckUtils]: 32: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-08 10:16:58,675 INFO L290 TraceCheckUtils]: 33: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-08 10:16:58,675 INFO L290 TraceCheckUtils]: 34: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-08 10:16:58,676 INFO L290 TraceCheckUtils]: 35: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-08 10:16:58,676 INFO L290 TraceCheckUtils]: 36: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-08 10:16:58,676 INFO L290 TraceCheckUtils]: 37: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-08 10:16:58,676 INFO L290 TraceCheckUtils]: 38: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-08 10:16:58,676 INFO L290 TraceCheckUtils]: 39: Hoare triple {150875#false} assume !(~z~0 % 4294967296 > 0); {150875#false} is VALID [2022-04-08 10:16:58,676 INFO L272 TraceCheckUtils]: 40: Hoare triple {150875#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {150875#false} is VALID [2022-04-08 10:16:58,676 INFO L290 TraceCheckUtils]: 41: Hoare triple {150875#false} ~cond := #in~cond; {150875#false} is VALID [2022-04-08 10:16:58,676 INFO L290 TraceCheckUtils]: 42: Hoare triple {150875#false} assume 0 == ~cond; {150875#false} is VALID [2022-04-08 10:16:58,676 INFO L290 TraceCheckUtils]: 43: Hoare triple {150875#false} assume !false; {150875#false} is VALID [2022-04-08 10:16:58,676 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-08 10:16:58,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:16:58,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100122450] [2022-04-08 10:16:58,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100122450] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:16:58,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775179244] [2022-04-08 10:16:58,676 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:16:58,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:16:58,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:16:58,677 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:16:58,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-04-08 10:16:58,796 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:16:58,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:16:58,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-08 10:16:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:58,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:16:59,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {150874#true} call ULTIMATE.init(); {150874#true} is VALID [2022-04-08 10:16:59,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {150874#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {150874#true} is VALID [2022-04-08 10:16:59,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {150874#true} assume true; {150874#true} is VALID [2022-04-08 10:16:59,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150874#true} {150874#true} #83#return; {150874#true} is VALID [2022-04-08 10:16:59,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {150874#true} call #t~ret15 := main(); {150874#true} is VALID [2022-04-08 10:16:59,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {150874#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {150874#true} is VALID [2022-04-08 10:16:59,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {150874#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150879#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:16:59,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {150879#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150918#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:16:59,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {150918#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150922#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:59,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {150922#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150926#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:16:59,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {150926#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150930#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:59,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {150930#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150934#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:16:59,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {150934#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150938#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-08 10:16:59,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {150938#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {150938#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-08 10:16:59,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {150938#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} ~z~0 := ~y~0; {150938#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-08 10:16:59,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {150938#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150934#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:16:59,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {150934#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150930#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:59,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {150930#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150926#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:16:59,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {150926#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150922#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:59,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {150922#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150918#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:16:59,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {150918#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150879#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:16:59,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {150879#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:59,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:59,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:59,233 INFO L290 TraceCheckUtils]: 24: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:59,233 INFO L290 TraceCheckUtils]: 25: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:59,233 INFO L290 TraceCheckUtils]: 26: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:59,234 INFO L290 TraceCheckUtils]: 27: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:59,234 INFO L290 TraceCheckUtils]: 28: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:59,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:59,235 INFO L290 TraceCheckUtils]: 30: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:59,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {150875#false} is VALID [2022-04-08 10:16:59,235 INFO L290 TraceCheckUtils]: 32: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-08 10:16:59,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-08 10:16:59,235 INFO L290 TraceCheckUtils]: 34: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-08 10:16:59,235 INFO L290 TraceCheckUtils]: 35: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-08 10:16:59,235 INFO L290 TraceCheckUtils]: 36: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-08 10:16:59,235 INFO L290 TraceCheckUtils]: 37: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-08 10:16:59,236 INFO L290 TraceCheckUtils]: 38: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-08 10:16:59,236 INFO L290 TraceCheckUtils]: 39: Hoare triple {150875#false} assume !(~z~0 % 4294967296 > 0); {150875#false} is VALID [2022-04-08 10:16:59,236 INFO L272 TraceCheckUtils]: 40: Hoare triple {150875#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {150875#false} is VALID [2022-04-08 10:16:59,236 INFO L290 TraceCheckUtils]: 41: Hoare triple {150875#false} ~cond := #in~cond; {150875#false} is VALID [2022-04-08 10:16:59,236 INFO L290 TraceCheckUtils]: 42: Hoare triple {150875#false} assume 0 == ~cond; {150875#false} is VALID [2022-04-08 10:16:59,236 INFO L290 TraceCheckUtils]: 43: Hoare triple {150875#false} assume !false; {150875#false} is VALID [2022-04-08 10:16:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-08 10:16:59,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:16:59,531 INFO L290 TraceCheckUtils]: 43: Hoare triple {150875#false} assume !false; {150875#false} is VALID [2022-04-08 10:16:59,531 INFO L290 TraceCheckUtils]: 42: Hoare triple {150875#false} assume 0 == ~cond; {150875#false} is VALID [2022-04-08 10:16:59,531 INFO L290 TraceCheckUtils]: 41: Hoare triple {150875#false} ~cond := #in~cond; {150875#false} is VALID [2022-04-08 10:16:59,531 INFO L272 TraceCheckUtils]: 40: Hoare triple {150875#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {150875#false} is VALID [2022-04-08 10:16:59,531 INFO L290 TraceCheckUtils]: 39: Hoare triple {150875#false} assume !(~z~0 % 4294967296 > 0); {150875#false} is VALID [2022-04-08 10:16:59,531 INFO L290 TraceCheckUtils]: 38: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-08 10:16:59,531 INFO L290 TraceCheckUtils]: 37: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-08 10:16:59,531 INFO L290 TraceCheckUtils]: 36: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-08 10:16:59,531 INFO L290 TraceCheckUtils]: 35: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-08 10:16:59,531 INFO L290 TraceCheckUtils]: 34: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-08 10:16:59,531 INFO L290 TraceCheckUtils]: 33: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-08 10:16:59,531 INFO L290 TraceCheckUtils]: 32: Hoare triple {150875#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {150875#false} is VALID [2022-04-08 10:16:59,532 INFO L290 TraceCheckUtils]: 31: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {150875#false} is VALID [2022-04-08 10:16:59,532 INFO L290 TraceCheckUtils]: 30: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:59,532 INFO L290 TraceCheckUtils]: 29: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:59,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:59,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:59,533 INFO L290 TraceCheckUtils]: 26: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:59,534 INFO L290 TraceCheckUtils]: 25: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:59,534 INFO L290 TraceCheckUtils]: 24: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:59,534 INFO L290 TraceCheckUtils]: 23: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:59,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:59,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {150879#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150966#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:59,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {150918#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150879#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:16:59,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {150922#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150918#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:16:59,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {150926#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150922#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:59,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {150930#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150926#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:16:59,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {150934#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150930#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:59,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {150938#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150934#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:16:59,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {150938#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} ~z~0 := ~y~0; {150938#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-08 10:16:59,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {150938#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {150938#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-08 10:16:59,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {150934#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150938#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-08 10:16:59,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {150930#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150934#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:16:59,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {150926#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150930#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:59,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {150922#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150926#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:16:59,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {150918#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150922#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:59,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {150879#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150918#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:16:59,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {150874#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150879#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:16:59,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {150874#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {150874#true} is VALID [2022-04-08 10:16:59,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {150874#true} call #t~ret15 := main(); {150874#true} is VALID [2022-04-08 10:16:59,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150874#true} {150874#true} #83#return; {150874#true} is VALID [2022-04-08 10:16:59,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {150874#true} assume true; {150874#true} is VALID [2022-04-08 10:16:59,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {150874#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {150874#true} is VALID [2022-04-08 10:16:59,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {150874#true} call ULTIMATE.init(); {150874#true} is VALID [2022-04-08 10:16:59,545 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-08 10:16:59,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775179244] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:16:59,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:16:59,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 10] total 24 [2022-04-08 10:16:59,546 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:16:59,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [278735178] [2022-04-08 10:16:59,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [278735178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:16:59,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:16:59,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:16:59,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918643291] [2022-04-08 10:16:59,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:16:59,546 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 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 44 [2022-04-08 10:16:59,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:16:59,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 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-08 10:16:59,571 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-08 10:16:59,571 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:16:59,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:16:59,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:16:59,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2022-04-08 10:16:59,571 INFO L87 Difference]: Start difference. First operand 441 states and 568 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 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-08 10:17:04,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:17:04,121 INFO L93 Difference]: Finished difference Result 526 states and 697 transitions. [2022-04-08 10:17:04,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:17:04,122 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 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 44 [2022-04-08 10:17:04,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:17:04,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 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-08 10:17:04,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 92 transitions. [2022-04-08 10:17:04,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 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-08 10:17:04,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 92 transitions. [2022-04-08 10:17:04,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 92 transitions. [2022-04-08 10:17:04,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:17:04,227 INFO L225 Difference]: With dead ends: 526 [2022-04-08 10:17:04,227 INFO L226 Difference]: Without dead ends: 511 [2022-04-08 10:17:04,227 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=313, Invalid=1093, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:17:04,227 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 74 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:17:04,227 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 62 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:17:04,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-04-08 10:17:07,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 492. [2022-04-08 10:17:07,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:17:07,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 511 states. Second operand has 492 states, 487 states have (on average 1.297741273100616) internal successors, (632), 487 states have internal predecessors, (632), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:07,152 INFO L74 IsIncluded]: Start isIncluded. First operand 511 states. Second operand has 492 states, 487 states have (on average 1.297741273100616) internal successors, (632), 487 states have internal predecessors, (632), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:07,153 INFO L87 Difference]: Start difference. First operand 511 states. Second operand has 492 states, 487 states have (on average 1.297741273100616) internal successors, (632), 487 states have internal predecessors, (632), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:07,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:17:07,160 INFO L93 Difference]: Finished difference Result 511 states and 668 transitions. [2022-04-08 10:17:07,161 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 668 transitions. [2022-04-08 10:17:07,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:17:07,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:17:07,161 INFO L74 IsIncluded]: Start isIncluded. First operand has 492 states, 487 states have (on average 1.297741273100616) internal successors, (632), 487 states have internal predecessors, (632), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 511 states. [2022-04-08 10:17:07,161 INFO L87 Difference]: Start difference. First operand has 492 states, 487 states have (on average 1.297741273100616) internal successors, (632), 487 states have internal predecessors, (632), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 511 states. [2022-04-08 10:17:07,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:17:07,169 INFO L93 Difference]: Finished difference Result 511 states and 668 transitions. [2022-04-08 10:17:07,169 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 668 transitions. [2022-04-08 10:17:07,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:17:07,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:17:07,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:17:07,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:17:07,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 487 states have (on average 1.297741273100616) internal successors, (632), 487 states have internal predecessors, (632), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:07,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 636 transitions. [2022-04-08 10:17:07,179 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 636 transitions. Word has length 44 [2022-04-08 10:17:07,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:17:07,179 INFO L478 AbstractCegarLoop]: Abstraction has 492 states and 636 transitions. [2022-04-08 10:17:07,179 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 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-08 10:17:07,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 492 states and 636 transitions. [2022-04-08 10:17:11,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 636 edges. 636 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:17:11,910 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 636 transitions. [2022-04-08 10:17:11,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 10:17:11,911 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:17:11,911 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:17:11,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Forceful destruction successful, exit code 0 [2022-04-08 10:17:12,111 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:17:12,111 INFO L403 AbstractCegarLoop]: === Iteration 79 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:17:12,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:17:12,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1738188893, now seen corresponding path program 43 times [2022-04-08 10:17:12,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:17:12,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1546140587] [2022-04-08 10:17:12,114 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:17:12,114 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:17:12,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1738188893, now seen corresponding path program 44 times [2022-04-08 10:17:12,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:17:12,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622976484] [2022-04-08 10:17:12,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:17:12,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:17:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:17:12,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:17:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:17:12,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {154276#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {154250#true} is VALID [2022-04-08 10:17:12,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {154250#true} assume true; {154250#true} is VALID [2022-04-08 10:17:12,510 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154250#true} {154250#true} #83#return; {154250#true} is VALID [2022-04-08 10:17:12,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {154250#true} call ULTIMATE.init(); {154276#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:17:12,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {154276#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {154250#true} is VALID [2022-04-08 10:17:12,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {154250#true} assume true; {154250#true} is VALID [2022-04-08 10:17:12,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154250#true} {154250#true} #83#return; {154250#true} is VALID [2022-04-08 10:17:12,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {154250#true} call #t~ret15 := main(); {154250#true} is VALID [2022-04-08 10:17:12,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {154250#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {154255#(= main_~y~0 0)} is VALID [2022-04-08 10:17:12,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {154255#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154256#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:17:12,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {154256#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154257#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:17:12,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {154257#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154258#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:17:12,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {154258#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154259#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:17:12,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {154259#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154260#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:17:12,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {154260#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154261#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:17:12,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {154261#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154262#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:17:12,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {154262#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154263#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:17:12,515 INFO L290 TraceCheckUtils]: 14: Hoare triple {154263#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154264#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:17:12,516 INFO L290 TraceCheckUtils]: 15: Hoare triple {154264#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {154264#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:17:12,516 INFO L290 TraceCheckUtils]: 16: Hoare triple {154264#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {154265#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:17:12,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {154265#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {154266#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:17:12,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {154266#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {154267#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:17:12,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {154267#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {154268#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:17:12,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {154268#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {154269#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:17:12,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {154269#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {154270#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:17:12,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {154270#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {154271#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:17:12,520 INFO L290 TraceCheckUtils]: 23: Hoare triple {154271#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {154272#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:17:12,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {154272#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {154273#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:17:12,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {154273#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {154274#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:17:12,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {154274#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {154274#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:17:12,522 INFO L290 TraceCheckUtils]: 27: Hoare triple {154274#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154273#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:17:12,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {154273#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154272#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:17:12,523 INFO L290 TraceCheckUtils]: 29: Hoare triple {154272#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154271#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:17:12,523 INFO L290 TraceCheckUtils]: 30: Hoare triple {154271#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154270#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:17:12,524 INFO L290 TraceCheckUtils]: 31: Hoare triple {154270#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154269#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:17:12,524 INFO L290 TraceCheckUtils]: 32: Hoare triple {154269#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154268#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:17:12,525 INFO L290 TraceCheckUtils]: 33: Hoare triple {154268#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154267#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:17:12,525 INFO L290 TraceCheckUtils]: 34: Hoare triple {154267#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154266#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:17:12,526 INFO L290 TraceCheckUtils]: 35: Hoare triple {154266#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154265#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:17:12,526 INFO L290 TraceCheckUtils]: 36: Hoare triple {154265#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~y~0 % 4294967296 > 0); {154265#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:17:12,526 INFO L290 TraceCheckUtils]: 37: Hoare triple {154265#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~x~0 % 4294967296 > 0); {154265#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:17:12,527 INFO L290 TraceCheckUtils]: 38: Hoare triple {154265#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {154275#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:17:12,527 INFO L290 TraceCheckUtils]: 39: Hoare triple {154275#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {154251#false} is VALID [2022-04-08 10:17:12,527 INFO L272 TraceCheckUtils]: 40: Hoare triple {154251#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {154251#false} is VALID [2022-04-08 10:17:12,528 INFO L290 TraceCheckUtils]: 41: Hoare triple {154251#false} ~cond := #in~cond; {154251#false} is VALID [2022-04-08 10:17:12,528 INFO L290 TraceCheckUtils]: 42: Hoare triple {154251#false} assume 0 == ~cond; {154251#false} is VALID [2022-04-08 10:17:12,528 INFO L290 TraceCheckUtils]: 43: Hoare triple {154251#false} assume !false; {154251#false} is VALID [2022-04-08 10:17:12,528 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-08 10:17:12,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:17:12,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622976484] [2022-04-08 10:17:12,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622976484] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:17:12,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62342521] [2022-04-08 10:17:12,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:17:12,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:17:12,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:17:12,529 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:17:12,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-04-08 10:17:12,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:17:12,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:17:12,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-08 10:17:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:17:12,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:17:12,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {154250#true} call ULTIMATE.init(); {154250#true} is VALID [2022-04-08 10:17:12,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {154250#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {154250#true} is VALID [2022-04-08 10:17:12,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {154250#true} assume true; {154250#true} is VALID [2022-04-08 10:17:12,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154250#true} {154250#true} #83#return; {154250#true} is VALID [2022-04-08 10:17:12,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {154250#true} call #t~ret15 := main(); {154250#true} is VALID [2022-04-08 10:17:12,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {154250#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {154250#true} is VALID [2022-04-08 10:17:13,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {154250#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154298#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:17:13,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {154298#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154302#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:17:13,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {154302#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154306#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:17:13,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {154306#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154310#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:17:13,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {154310#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:17:13,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {154314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154318#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:17:13,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {154318#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154322#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:17:13,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {154322#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154326#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-08 10:17:13,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {154326#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154330#(< 0 (mod (+ main_~x~0 9) 4294967296))} is VALID [2022-04-08 10:17:13,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {154330#(< 0 (mod (+ main_~x~0 9) 4294967296))} assume !(~x~0 % 4294967296 > 0); {154330#(< 0 (mod (+ main_~x~0 9) 4294967296))} is VALID [2022-04-08 10:17:13,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {154330#(< 0 (mod (+ main_~x~0 9) 4294967296))} ~z~0 := ~y~0; {154330#(< 0 (mod (+ main_~x~0 9) 4294967296))} is VALID [2022-04-08 10:17:13,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {154330#(< 0 (mod (+ main_~x~0 9) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {154326#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-08 10:17:13,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {154326#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {154322#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:17:13,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {154322#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {154318#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:17:13,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {154318#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {154314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:17:13,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {154314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {154310#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:17:13,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {154310#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {154306#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:17:13,012 INFO L290 TraceCheckUtils]: 23: Hoare triple {154306#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {154302#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:17:13,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {154302#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {154298#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:17:13,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {154298#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:13,013 INFO L290 TraceCheckUtils]: 26: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:13,014 INFO L290 TraceCheckUtils]: 27: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:13,014 INFO L290 TraceCheckUtils]: 28: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:13,014 INFO L290 TraceCheckUtils]: 29: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:13,014 INFO L290 TraceCheckUtils]: 30: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:13,015 INFO L290 TraceCheckUtils]: 31: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:13,015 INFO L290 TraceCheckUtils]: 32: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:13,015 INFO L290 TraceCheckUtils]: 33: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:13,016 INFO L290 TraceCheckUtils]: 34: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:13,016 INFO L290 TraceCheckUtils]: 35: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:13,017 INFO L290 TraceCheckUtils]: 36: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:13,017 INFO L290 TraceCheckUtils]: 37: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {154251#false} is VALID [2022-04-08 10:17:13,017 INFO L290 TraceCheckUtils]: 38: Hoare triple {154251#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {154251#false} is VALID [2022-04-08 10:17:13,017 INFO L290 TraceCheckUtils]: 39: Hoare triple {154251#false} assume !(~z~0 % 4294967296 > 0); {154251#false} is VALID [2022-04-08 10:17:13,017 INFO L272 TraceCheckUtils]: 40: Hoare triple {154251#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {154251#false} is VALID [2022-04-08 10:17:13,017 INFO L290 TraceCheckUtils]: 41: Hoare triple {154251#false} ~cond := #in~cond; {154251#false} is VALID [2022-04-08 10:17:13,017 INFO L290 TraceCheckUtils]: 42: Hoare triple {154251#false} assume 0 == ~cond; {154251#false} is VALID [2022-04-08 10:17:13,017 INFO L290 TraceCheckUtils]: 43: Hoare triple {154251#false} assume !false; {154251#false} is VALID [2022-04-08 10:17:13,017 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 9 proven. 81 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-08 10:17:13,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:17:13,176 INFO L290 TraceCheckUtils]: 43: Hoare triple {154251#false} assume !false; {154251#false} is VALID [2022-04-08 10:17:13,176 INFO L290 TraceCheckUtils]: 42: Hoare triple {154251#false} assume 0 == ~cond; {154251#false} is VALID [2022-04-08 10:17:13,176 INFO L290 TraceCheckUtils]: 41: Hoare triple {154251#false} ~cond := #in~cond; {154251#false} is VALID [2022-04-08 10:17:13,176 INFO L272 TraceCheckUtils]: 40: Hoare triple {154251#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {154251#false} is VALID [2022-04-08 10:17:13,177 INFO L290 TraceCheckUtils]: 39: Hoare triple {154251#false} assume !(~z~0 % 4294967296 > 0); {154251#false} is VALID [2022-04-08 10:17:13,177 INFO L290 TraceCheckUtils]: 38: Hoare triple {154251#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {154251#false} is VALID [2022-04-08 10:17:13,177 INFO L290 TraceCheckUtils]: 37: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {154251#false} is VALID [2022-04-08 10:17:13,177 INFO L290 TraceCheckUtils]: 36: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:13,177 INFO L290 TraceCheckUtils]: 35: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:13,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:13,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:13,178 INFO L290 TraceCheckUtils]: 32: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:13,178 INFO L290 TraceCheckUtils]: 31: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:13,179 INFO L290 TraceCheckUtils]: 30: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:13,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:13,179 INFO L290 TraceCheckUtils]: 28: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:13,179 INFO L290 TraceCheckUtils]: 27: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:13,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {154364#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:13,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {154298#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {154364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:13,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {154302#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {154298#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:17:13,182 INFO L290 TraceCheckUtils]: 23: Hoare triple {154306#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {154302#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:17:13,182 INFO L290 TraceCheckUtils]: 22: Hoare triple {154310#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {154306#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:17:13,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {154314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {154310#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:17:13,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {154318#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {154314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:17:13,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {154322#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {154318#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:17:13,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {154326#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {154322#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:17:13,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {154330#(< 0 (mod (+ main_~x~0 9) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {154326#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-08 10:17:13,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {154330#(< 0 (mod (+ main_~x~0 9) 4294967296))} ~z~0 := ~y~0; {154330#(< 0 (mod (+ main_~x~0 9) 4294967296))} is VALID [2022-04-08 10:17:13,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {154330#(< 0 (mod (+ main_~x~0 9) 4294967296))} assume !(~x~0 % 4294967296 > 0); {154330#(< 0 (mod (+ main_~x~0 9) 4294967296))} is VALID [2022-04-08 10:17:13,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {154326#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154330#(< 0 (mod (+ main_~x~0 9) 4294967296))} is VALID [2022-04-08 10:17:13,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {154322#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154326#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-08 10:17:13,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {154318#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154322#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:17:13,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {154314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154318#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:17:13,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {154310#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:17:13,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {154306#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154310#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:17:13,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {154302#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154306#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:17:13,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {154298#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154302#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:17:13,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {154250#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154298#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:17:13,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {154250#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {154250#true} is VALID [2022-04-08 10:17:13,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {154250#true} call #t~ret15 := main(); {154250#true} is VALID [2022-04-08 10:17:13,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154250#true} {154250#true} #83#return; {154250#true} is VALID [2022-04-08 10:17:13,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {154250#true} assume true; {154250#true} is VALID [2022-04-08 10:17:13,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {154250#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {154250#true} is VALID [2022-04-08 10:17:13,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {154250#true} call ULTIMATE.init(); {154250#true} is VALID [2022-04-08 10:17:13,192 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 9 proven. 81 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-08 10:17:13,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62342521] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:17:13,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:17:13,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 12, 12] total 34 [2022-04-08 10:17:13,193 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:17:13,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1546140587] [2022-04-08 10:17:13,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1546140587] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:17:13,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:17:13,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 10:17:13,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304871359] [2022-04-08 10:17:13,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:17:13,193 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 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-08 10:17:13,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:17:13,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 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-08 10:17:13,225 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-08 10:17:13,225 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 10:17:13,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:17:13,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 10:17:13,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:17:13,226 INFO L87 Difference]: Start difference. First operand 492 states and 636 transitions. Second operand has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 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-08 10:17:31,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:17:31,215 INFO L93 Difference]: Finished difference Result 689 states and 928 transitions. [2022-04-08 10:17:31,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-04-08 10:17:31,215 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 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-08 10:17:31,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:17:31,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 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-08 10:17:31,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 353 transitions. [2022-04-08 10:17:31,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 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-08 10:17:31,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 353 transitions. [2022-04-08 10:17:31,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 353 transitions. [2022-04-08 10:17:31,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 353 edges. 353 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:17:31,552 INFO L225 Difference]: With dead ends: 689 [2022-04-08 10:17:31,552 INFO L226 Difference]: Without dead ends: 669 [2022-04-08 10:17:31,553 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6802 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=855, Invalid=22097, Unknown=0, NotChecked=0, Total=22952 [2022-04-08 10:17:31,553 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 131 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4627 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 4964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 4627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:17:31,553 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 148 Invalid, 4964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 4627 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-08 10:17:31,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-04-08 10:17:34,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 504. [2022-04-08 10:17:34,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:17:34,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 669 states. Second operand has 504 states, 499 states have (on average 1.2905811623246493) internal successors, (644), 499 states have internal predecessors, (644), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:34,558 INFO L74 IsIncluded]: Start isIncluded. First operand 669 states. Second operand has 504 states, 499 states have (on average 1.2905811623246493) internal successors, (644), 499 states have internal predecessors, (644), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:34,558 INFO L87 Difference]: Start difference. First operand 669 states. Second operand has 504 states, 499 states have (on average 1.2905811623246493) internal successors, (644), 499 states have internal predecessors, (644), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:34,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:17:34,570 INFO L93 Difference]: Finished difference Result 669 states and 840 transitions. [2022-04-08 10:17:34,570 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 840 transitions. [2022-04-08 10:17:34,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:17:34,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:17:34,571 INFO L74 IsIncluded]: Start isIncluded. First operand has 504 states, 499 states have (on average 1.2905811623246493) internal successors, (644), 499 states have internal predecessors, (644), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 669 states. [2022-04-08 10:17:34,571 INFO L87 Difference]: Start difference. First operand has 504 states, 499 states have (on average 1.2905811623246493) internal successors, (644), 499 states have internal predecessors, (644), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 669 states. [2022-04-08 10:17:34,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:17:34,582 INFO L93 Difference]: Finished difference Result 669 states and 840 transitions. [2022-04-08 10:17:34,582 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 840 transitions. [2022-04-08 10:17:34,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:17:34,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:17:34,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:17:34,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:17:34,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 499 states have (on average 1.2905811623246493) internal successors, (644), 499 states have internal predecessors, (644), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:34,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 648 transitions. [2022-04-08 10:17:34,593 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 648 transitions. Word has length 44 [2022-04-08 10:17:34,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:17:34,593 INFO L478 AbstractCegarLoop]: Abstraction has 504 states and 648 transitions. [2022-04-08 10:17:34,593 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 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-08 10:17:34,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 504 states and 648 transitions. [2022-04-08 10:17:39,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 648 edges. 648 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:17:39,229 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 648 transitions. [2022-04-08 10:17:39,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 10:17:39,229 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:17:39,230 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:17:39,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forceful destruction successful, exit code 0 [2022-04-08 10:17:39,430 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:17:39,430 INFO L403 AbstractCegarLoop]: === Iteration 80 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:17:39,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:17:39,430 INFO L85 PathProgramCache]: Analyzing trace with hash -740863102, now seen corresponding path program 79 times [2022-04-08 10:17:39,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:17:39,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [416662189] [2022-04-08 10:17:39,433 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:17:39,433 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:17:39,433 INFO L85 PathProgramCache]: Analyzing trace with hash -740863102, now seen corresponding path program 80 times [2022-04-08 10:17:39,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:17:39,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105719476] [2022-04-08 10:17:39,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:17:39,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:17:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:17:39,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:17:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:17:39,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {158531#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {158510#true} is VALID [2022-04-08 10:17:39,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {158510#true} assume true; {158510#true} is VALID [2022-04-08 10:17:39,702 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {158510#true} {158510#true} #83#return; {158510#true} is VALID [2022-04-08 10:17:39,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {158510#true} call ULTIMATE.init(); {158531#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:17:39,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {158531#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {158510#true} is VALID [2022-04-08 10:17:39,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {158510#true} assume true; {158510#true} is VALID [2022-04-08 10:17:39,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158510#true} {158510#true} #83#return; {158510#true} is VALID [2022-04-08 10:17:39,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {158510#true} call #t~ret15 := main(); {158510#true} is VALID [2022-04-08 10:17:39,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {158510#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {158515#(= main_~y~0 0)} is VALID [2022-04-08 10:17:39,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {158515#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158516#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:17:39,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {158516#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158517#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:17:39,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {158517#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158518#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:17:39,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {158518#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158519#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:17:39,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {158519#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158520#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:17:39,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {158520#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158521#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:17:39,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {158521#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158522#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:17:39,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {158522#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158523#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:17:39,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {158523#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158524#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:17:39,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {158524#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158525#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:17:39,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {158525#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {158525#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:17:39,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {158525#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {158526#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:17:39,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {158526#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {158527#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:17:39,710 INFO L290 TraceCheckUtils]: 19: Hoare triple {158527#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {158528#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:17:39,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {158528#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {158529#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:17:39,711 INFO L290 TraceCheckUtils]: 21: Hoare triple {158529#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {158530#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:17:39,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {158530#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {158511#false} is VALID [2022-04-08 10:17:39,712 INFO L290 TraceCheckUtils]: 23: Hoare triple {158511#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158511#false} is VALID [2022-04-08 10:17:39,712 INFO L290 TraceCheckUtils]: 24: Hoare triple {158511#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158511#false} is VALID [2022-04-08 10:17:39,712 INFO L290 TraceCheckUtils]: 25: Hoare triple {158511#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158511#false} is VALID [2022-04-08 10:17:39,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {158511#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158511#false} is VALID [2022-04-08 10:17:39,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {158511#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158511#false} is VALID [2022-04-08 10:17:39,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {158511#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158511#false} is VALID [2022-04-08 10:17:39,712 INFO L290 TraceCheckUtils]: 29: Hoare triple {158511#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158511#false} is VALID [2022-04-08 10:17:39,712 INFO L290 TraceCheckUtils]: 30: Hoare triple {158511#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158511#false} is VALID [2022-04-08 10:17:39,712 INFO L290 TraceCheckUtils]: 31: Hoare triple {158511#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158511#false} is VALID [2022-04-08 10:17:39,712 INFO L290 TraceCheckUtils]: 32: Hoare triple {158511#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158511#false} is VALID [2022-04-08 10:17:39,712 INFO L290 TraceCheckUtils]: 33: Hoare triple {158511#false} assume !(~y~0 % 4294967296 > 0); {158511#false} is VALID [2022-04-08 10:17:39,712 INFO L290 TraceCheckUtils]: 34: Hoare triple {158511#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {158511#false} is VALID [2022-04-08 10:17:39,712 INFO L290 TraceCheckUtils]: 35: Hoare triple {158511#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {158511#false} is VALID [2022-04-08 10:17:39,712 INFO L290 TraceCheckUtils]: 36: Hoare triple {158511#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {158511#false} is VALID [2022-04-08 10:17:39,712 INFO L290 TraceCheckUtils]: 37: Hoare triple {158511#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {158511#false} is VALID [2022-04-08 10:17:39,712 INFO L290 TraceCheckUtils]: 38: Hoare triple {158511#false} assume !(~x~0 % 4294967296 > 0); {158511#false} is VALID [2022-04-08 10:17:39,712 INFO L290 TraceCheckUtils]: 39: Hoare triple {158511#false} assume !(~z~0 % 4294967296 > 0); {158511#false} is VALID [2022-04-08 10:17:39,712 INFO L272 TraceCheckUtils]: 40: Hoare triple {158511#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {158511#false} is VALID [2022-04-08 10:17:39,712 INFO L290 TraceCheckUtils]: 41: Hoare triple {158511#false} ~cond := #in~cond; {158511#false} is VALID [2022-04-08 10:17:39,713 INFO L290 TraceCheckUtils]: 42: Hoare triple {158511#false} assume 0 == ~cond; {158511#false} is VALID [2022-04-08 10:17:39,713 INFO L290 TraceCheckUtils]: 43: Hoare triple {158511#false} assume !false; {158511#false} is VALID [2022-04-08 10:17:39,713 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-04-08 10:17:39,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:17:39,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105719476] [2022-04-08 10:17:39,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105719476] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:17:39,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158879820] [2022-04-08 10:17:39,713 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:17:39,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:17:39,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:17:39,714 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:17:39,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-04-08 10:17:39,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:17:39,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:17:39,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-08 10:17:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:17:39,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:17:40,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {158510#true} call ULTIMATE.init(); {158510#true} is VALID [2022-04-08 10:17:40,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {158510#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {158510#true} is VALID [2022-04-08 10:17:40,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {158510#true} assume true; {158510#true} is VALID [2022-04-08 10:17:40,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158510#true} {158510#true} #83#return; {158510#true} is VALID [2022-04-08 10:17:40,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {158510#true} call #t~ret15 := main(); {158510#true} is VALID [2022-04-08 10:17:40,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {158510#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {158515#(= main_~y~0 0)} is VALID [2022-04-08 10:17:40,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {158515#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158516#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:17:40,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {158516#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158517#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:17:40,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {158517#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158518#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:17:40,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {158518#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158519#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:17:40,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {158519#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158520#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:17:40,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {158520#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158521#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:17:40,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {158521#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158522#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:17:40,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {158522#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158523#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:17:40,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {158523#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158524#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:17:40,281 INFO L290 TraceCheckUtils]: 15: Hoare triple {158524#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158525#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:17:40,281 INFO L290 TraceCheckUtils]: 16: Hoare triple {158525#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {158525#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:17:40,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {158525#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {158526#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:17:40,282 INFO L290 TraceCheckUtils]: 18: Hoare triple {158526#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {158527#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:17:40,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {158527#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {158528#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:17:40,283 INFO L290 TraceCheckUtils]: 20: Hoare triple {158528#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {158529#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:17:40,284 INFO L290 TraceCheckUtils]: 21: Hoare triple {158529#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {158598#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:17:40,284 INFO L290 TraceCheckUtils]: 22: Hoare triple {158598#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {158598#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:17:40,285 INFO L290 TraceCheckUtils]: 23: Hoare triple {158598#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158529#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:17:40,285 INFO L290 TraceCheckUtils]: 24: Hoare triple {158529#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158528#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:17:40,286 INFO L290 TraceCheckUtils]: 25: Hoare triple {158528#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158527#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:17:40,286 INFO L290 TraceCheckUtils]: 26: Hoare triple {158527#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158526#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:17:40,287 INFO L290 TraceCheckUtils]: 27: Hoare triple {158526#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158617#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:17:40,287 INFO L290 TraceCheckUtils]: 28: Hoare triple {158617#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158621#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:17:40,288 INFO L290 TraceCheckUtils]: 29: Hoare triple {158621#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158625#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:17:40,288 INFO L290 TraceCheckUtils]: 30: Hoare triple {158625#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158629#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:17:40,289 INFO L290 TraceCheckUtils]: 31: Hoare triple {158629#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158633#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:17:40,289 INFO L290 TraceCheckUtils]: 32: Hoare triple {158633#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158637#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:17:40,290 INFO L290 TraceCheckUtils]: 33: Hoare triple {158637#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~y~0 % 4294967296 > 0); {158637#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:17:40,290 INFO L290 TraceCheckUtils]: 34: Hoare triple {158637#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {158637#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:17:40,290 INFO L290 TraceCheckUtils]: 35: Hoare triple {158637#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {158637#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:17:40,291 INFO L290 TraceCheckUtils]: 36: Hoare triple {158637#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {158637#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:17:40,291 INFO L290 TraceCheckUtils]: 37: Hoare triple {158637#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {158637#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:17:40,291 INFO L290 TraceCheckUtils]: 38: Hoare triple {158637#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~x~0 % 4294967296 > 0); {158637#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:17:40,292 INFO L290 TraceCheckUtils]: 39: Hoare triple {158637#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~z~0 % 4294967296 > 0); {158511#false} is VALID [2022-04-08 10:17:40,292 INFO L272 TraceCheckUtils]: 40: Hoare triple {158511#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {158511#false} is VALID [2022-04-08 10:17:40,292 INFO L290 TraceCheckUtils]: 41: Hoare triple {158511#false} ~cond := #in~cond; {158511#false} is VALID [2022-04-08 10:17:40,292 INFO L290 TraceCheckUtils]: 42: Hoare triple {158511#false} assume 0 == ~cond; {158511#false} is VALID [2022-04-08 10:17:40,292 INFO L290 TraceCheckUtils]: 43: Hoare triple {158511#false} assume !false; {158511#false} is VALID [2022-04-08 10:17:40,292 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:17:40,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:17:41,050 INFO L290 TraceCheckUtils]: 43: Hoare triple {158511#false} assume !false; {158511#false} is VALID [2022-04-08 10:17:41,050 INFO L290 TraceCheckUtils]: 42: Hoare triple {158511#false} assume 0 == ~cond; {158511#false} is VALID [2022-04-08 10:17:41,050 INFO L290 TraceCheckUtils]: 41: Hoare triple {158511#false} ~cond := #in~cond; {158511#false} is VALID [2022-04-08 10:17:41,050 INFO L272 TraceCheckUtils]: 40: Hoare triple {158511#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {158511#false} is VALID [2022-04-08 10:17:41,050 INFO L290 TraceCheckUtils]: 39: Hoare triple {158683#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {158511#false} is VALID [2022-04-08 10:17:41,050 INFO L290 TraceCheckUtils]: 38: Hoare triple {158683#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {158683#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:17:41,051 INFO L290 TraceCheckUtils]: 37: Hoare triple {158683#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {158683#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:17:41,051 INFO L290 TraceCheckUtils]: 36: Hoare triple {158683#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {158683#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:17:41,051 INFO L290 TraceCheckUtils]: 35: Hoare triple {158683#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {158683#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:17:41,052 INFO L290 TraceCheckUtils]: 34: Hoare triple {158683#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {158683#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:17:41,052 INFO L290 TraceCheckUtils]: 33: Hoare triple {158683#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {158683#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:17:41,052 INFO L290 TraceCheckUtils]: 32: Hoare triple {158705#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158683#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:17:41,053 INFO L290 TraceCheckUtils]: 31: Hoare triple {158709#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158705#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-08 10:17:41,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {158713#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158709#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-08 10:17:41,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {158717#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158713#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-08 10:17:41,055 INFO L290 TraceCheckUtils]: 28: Hoare triple {158721#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158717#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-08 10:17:41,056 INFO L290 TraceCheckUtils]: 27: Hoare triple {158725#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158721#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-08 10:17:41,056 INFO L290 TraceCheckUtils]: 26: Hoare triple {158729#(< 0 (mod (+ 7 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158725#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-08 10:17:41,057 INFO L290 TraceCheckUtils]: 25: Hoare triple {158733#(< 0 (mod (+ main_~z~0 8) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158729#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-08 10:17:41,057 INFO L290 TraceCheckUtils]: 24: Hoare triple {158737#(< 0 (mod (+ main_~z~0 9) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158733#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-08 10:17:41,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {158741#(< 0 (mod (+ main_~z~0 10) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {158737#(< 0 (mod (+ main_~z~0 9) 4294967296))} is VALID [2022-04-08 10:17:41,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {158741#(< 0 (mod (+ main_~z~0 10) 4294967296))} assume !(~z~0 % 4294967296 > 0); {158741#(< 0 (mod (+ main_~z~0 10) 4294967296))} is VALID [2022-04-08 10:17:41,059 INFO L290 TraceCheckUtils]: 21: Hoare triple {158737#(< 0 (mod (+ main_~z~0 9) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {158741#(< 0 (mod (+ main_~z~0 10) 4294967296))} is VALID [2022-04-08 10:17:41,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {158733#(< 0 (mod (+ main_~z~0 8) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {158737#(< 0 (mod (+ main_~z~0 9) 4294967296))} is VALID [2022-04-08 10:17:41,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {158729#(< 0 (mod (+ 7 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {158733#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-08 10:17:41,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {158725#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {158729#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-08 10:17:41,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {158760#(< 0 (mod (+ main_~y~0 6) 4294967296))} ~z~0 := ~y~0; {158725#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-08 10:17:41,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {158760#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {158760#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:17:41,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {158767#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158760#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:17:41,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {158771#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158767#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:17:41,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {158775#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158771#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:17:41,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {158779#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158775#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:17:41,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {158783#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158779#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:17:41,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {158787#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158783#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:17:41,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {158791#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158787#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:17:41,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {158795#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158791#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:17:41,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {158799#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158795#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:17:41,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {158803#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158799#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:17:41,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {158510#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {158803#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:17:41,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {158510#true} call #t~ret15 := main(); {158510#true} is VALID [2022-04-08 10:17:41,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158510#true} {158510#true} #83#return; {158510#true} is VALID [2022-04-08 10:17:41,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {158510#true} assume true; {158510#true} is VALID [2022-04-08 10:17:41,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {158510#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {158510#true} is VALID [2022-04-08 10:17:41,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {158510#true} call ULTIMATE.init(); {158510#true} is VALID [2022-04-08 10:17:41,069 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:17:41,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158879820] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:17:41,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:17:41,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24, 24] total 48 [2022-04-08 10:17:41,069 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:17:41,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [416662189] [2022-04-08 10:17:41,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [416662189] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:17:41,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:17:41,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:17:41,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548535767] [2022-04-08 10:17:41,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:17:41,069 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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 44 [2022-04-08 10:17:41,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:17:41,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-08 10:17:41,091 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-08 10:17:41,091 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:17:41,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:17:41,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:17:41,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=1909, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:17:41,091 INFO L87 Difference]: Start difference. First operand 504 states and 648 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-08 10:17:52,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:17:52,439 INFO L93 Difference]: Finished difference Result 743 states and 940 transitions. [2022-04-08 10:17:52,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 10:17:52,439 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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 44 [2022-04-08 10:17:52,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:17:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-08 10:17:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 144 transitions. [2022-04-08 10:17:52,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-08 10:17:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 144 transitions. [2022-04-08 10:17:52,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 144 transitions. [2022-04-08 10:17:52,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:17:52,577 INFO L225 Difference]: With dead ends: 743 [2022-04-08 10:17:52,577 INFO L226 Difference]: Without dead ends: 721 [2022-04-08 10:17:52,578 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=902, Invalid=4500, Unknown=0, NotChecked=0, Total=5402 [2022-04-08 10:17:52,578 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 83 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1508 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:17:52,578 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 126 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1508 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-08 10:17:52,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2022-04-08 10:17:55,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 504. [2022-04-08 10:17:55,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:17:55,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 721 states. Second operand has 504 states, 499 states have (on average 1.2885771543086173) internal successors, (643), 499 states have internal predecessors, (643), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:55,572 INFO L74 IsIncluded]: Start isIncluded. First operand 721 states. Second operand has 504 states, 499 states have (on average 1.2885771543086173) internal successors, (643), 499 states have internal predecessors, (643), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:55,572 INFO L87 Difference]: Start difference. First operand 721 states. Second operand has 504 states, 499 states have (on average 1.2885771543086173) internal successors, (643), 499 states have internal predecessors, (643), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:55,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:17:55,585 INFO L93 Difference]: Finished difference Result 721 states and 917 transitions. [2022-04-08 10:17:55,585 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 917 transitions. [2022-04-08 10:17:55,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:17:55,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:17:55,586 INFO L74 IsIncluded]: Start isIncluded. First operand has 504 states, 499 states have (on average 1.2885771543086173) internal successors, (643), 499 states have internal predecessors, (643), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 721 states. [2022-04-08 10:17:55,586 INFO L87 Difference]: Start difference. First operand has 504 states, 499 states have (on average 1.2885771543086173) internal successors, (643), 499 states have internal predecessors, (643), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 721 states. [2022-04-08 10:17:55,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:17:55,600 INFO L93 Difference]: Finished difference Result 721 states and 917 transitions. [2022-04-08 10:17:55,600 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 917 transitions. [2022-04-08 10:17:55,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:17:55,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:17:55,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:17:55,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:17:55,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 499 states have (on average 1.2885771543086173) internal successors, (643), 499 states have internal predecessors, (643), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:55,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 647 transitions. [2022-04-08 10:17:55,611 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 647 transitions. Word has length 44 [2022-04-08 10:17:55,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:17:55,611 INFO L478 AbstractCegarLoop]: Abstraction has 504 states and 647 transitions. [2022-04-08 10:17:55,611 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-08 10:17:55,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 504 states and 647 transitions. [2022-04-08 10:17:59,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 647 edges. 647 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:17:59,851 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 647 transitions. [2022-04-08 10:17:59,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 10:17:59,852 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:17:59,852 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:17:59,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2022-04-08 10:18:00,052 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2022-04-08 10:18:00,052 INFO L403 AbstractCegarLoop]: === Iteration 81 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:18:00,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:18:00,052 INFO L85 PathProgramCache]: Analyzing trace with hash 251508882, now seen corresponding path program 81 times [2022-04-08 10:18:00,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:18:00,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [354107141] [2022-04-08 10:18:00,055 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:18:00,055 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:18:00,055 INFO L85 PathProgramCache]: Analyzing trace with hash 251508882, now seen corresponding path program 82 times [2022-04-08 10:18:00,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:18:00,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866729454] [2022-04-08 10:18:00,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:18:00,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:18:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:18:00,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:18:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:18:00,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {162833#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {162812#true} is VALID [2022-04-08 10:18:00,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {162812#true} assume true; {162812#true} is VALID [2022-04-08 10:18:00,331 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {162812#true} {162812#true} #83#return; {162812#true} is VALID [2022-04-08 10:18:00,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {162812#true} call ULTIMATE.init(); {162833#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:18:00,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {162833#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {162812#true} is VALID [2022-04-08 10:18:00,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {162812#true} assume true; {162812#true} is VALID [2022-04-08 10:18:00,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {162812#true} {162812#true} #83#return; {162812#true} is VALID [2022-04-08 10:18:00,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {162812#true} call #t~ret15 := main(); {162812#true} is VALID [2022-04-08 10:18:00,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {162812#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {162817#(= main_~y~0 0)} is VALID [2022-04-08 10:18:00,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {162817#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162818#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:18:00,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {162818#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162819#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:18:00,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {162819#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162820#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:18:00,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {162820#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162821#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:18:00,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {162821#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162822#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:18:00,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {162822#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162823#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:18:00,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {162823#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162824#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:18:00,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {162824#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162825#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:18:00,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {162825#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162826#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:18:00,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {162826#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162827#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:18:00,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {162827#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162828#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:18:00,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {162828#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {162828#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:18:00,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {162828#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {162829#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:18:00,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {162829#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {162830#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:18:00,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {162830#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {162831#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:18:00,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {162831#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {162832#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:18:00,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {162832#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {162813#false} is VALID [2022-04-08 10:18:00,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:00,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:00,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:00,340 INFO L290 TraceCheckUtils]: 26: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:00,340 INFO L290 TraceCheckUtils]: 27: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:00,340 INFO L290 TraceCheckUtils]: 28: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:00,340 INFO L290 TraceCheckUtils]: 29: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:00,340 INFO L290 TraceCheckUtils]: 30: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:00,340 INFO L290 TraceCheckUtils]: 31: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:00,340 INFO L290 TraceCheckUtils]: 32: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:00,340 INFO L290 TraceCheckUtils]: 33: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:00,340 INFO L290 TraceCheckUtils]: 34: Hoare triple {162813#false} assume !(~y~0 % 4294967296 > 0); {162813#false} is VALID [2022-04-08 10:18:00,341 INFO L290 TraceCheckUtils]: 35: Hoare triple {162813#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {162813#false} is VALID [2022-04-08 10:18:00,341 INFO L290 TraceCheckUtils]: 36: Hoare triple {162813#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {162813#false} is VALID [2022-04-08 10:18:00,341 INFO L290 TraceCheckUtils]: 37: Hoare triple {162813#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {162813#false} is VALID [2022-04-08 10:18:00,341 INFO L290 TraceCheckUtils]: 38: Hoare triple {162813#false} assume !(~x~0 % 4294967296 > 0); {162813#false} is VALID [2022-04-08 10:18:00,341 INFO L290 TraceCheckUtils]: 39: Hoare triple {162813#false} assume !(~z~0 % 4294967296 > 0); {162813#false} is VALID [2022-04-08 10:18:00,341 INFO L272 TraceCheckUtils]: 40: Hoare triple {162813#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {162813#false} is VALID [2022-04-08 10:18:00,341 INFO L290 TraceCheckUtils]: 41: Hoare triple {162813#false} ~cond := #in~cond; {162813#false} is VALID [2022-04-08 10:18:00,341 INFO L290 TraceCheckUtils]: 42: Hoare triple {162813#false} assume 0 == ~cond; {162813#false} is VALID [2022-04-08 10:18:00,341 INFO L290 TraceCheckUtils]: 43: Hoare triple {162813#false} assume !false; {162813#false} is VALID [2022-04-08 10:18:00,341 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-08 10:18:00,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:18:00,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866729454] [2022-04-08 10:18:00,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866729454] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:18:00,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443336007] [2022-04-08 10:18:00,341 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:18:00,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:18:00,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:18:00,342 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:18:00,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-04-08 10:18:00,397 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:18:00,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:18:00,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 10:18:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:18:00,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:18:00,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {162812#true} call ULTIMATE.init(); {162812#true} is VALID [2022-04-08 10:18:00,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {162812#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {162812#true} is VALID [2022-04-08 10:18:00,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {162812#true} assume true; {162812#true} is VALID [2022-04-08 10:18:00,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {162812#true} {162812#true} #83#return; {162812#true} is VALID [2022-04-08 10:18:00,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {162812#true} call #t~ret15 := main(); {162812#true} is VALID [2022-04-08 10:18:00,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {162812#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {162817#(= main_~y~0 0)} is VALID [2022-04-08 10:18:00,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {162817#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162818#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:18:00,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {162818#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162819#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:18:00,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {162819#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162820#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:18:00,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {162820#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162821#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:18:00,696 INFO L290 TraceCheckUtils]: 10: Hoare triple {162821#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162822#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:18:00,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {162822#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162823#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:18:00,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {162823#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162824#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:18:00,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {162824#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162825#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:18:00,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {162825#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162826#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:18:00,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {162826#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162827#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:18:00,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {162827#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {162828#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:18:00,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {162828#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {162828#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:18:00,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {162828#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {162829#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:18:00,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {162829#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {162830#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:18:00,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {162830#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {162831#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:18:00,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {162831#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {162900#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:18:00,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {162900#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {162813#false} is VALID [2022-04-08 10:18:00,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:00,702 INFO L290 TraceCheckUtils]: 24: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:00,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:00,702 INFO L290 TraceCheckUtils]: 26: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:00,702 INFO L290 TraceCheckUtils]: 27: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:00,702 INFO L290 TraceCheckUtils]: 28: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:00,702 INFO L290 TraceCheckUtils]: 29: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:00,702 INFO L290 TraceCheckUtils]: 30: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:00,702 INFO L290 TraceCheckUtils]: 31: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:00,703 INFO L290 TraceCheckUtils]: 32: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:00,703 INFO L290 TraceCheckUtils]: 33: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:00,703 INFO L290 TraceCheckUtils]: 34: Hoare triple {162813#false} assume !(~y~0 % 4294967296 > 0); {162813#false} is VALID [2022-04-08 10:18:00,703 INFO L290 TraceCheckUtils]: 35: Hoare triple {162813#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {162813#false} is VALID [2022-04-08 10:18:00,703 INFO L290 TraceCheckUtils]: 36: Hoare triple {162813#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {162813#false} is VALID [2022-04-08 10:18:00,703 INFO L290 TraceCheckUtils]: 37: Hoare triple {162813#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {162813#false} is VALID [2022-04-08 10:18:00,703 INFO L290 TraceCheckUtils]: 38: Hoare triple {162813#false} assume !(~x~0 % 4294967296 > 0); {162813#false} is VALID [2022-04-08 10:18:00,703 INFO L290 TraceCheckUtils]: 39: Hoare triple {162813#false} assume !(~z~0 % 4294967296 > 0); {162813#false} is VALID [2022-04-08 10:18:00,703 INFO L272 TraceCheckUtils]: 40: Hoare triple {162813#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {162813#false} is VALID [2022-04-08 10:18:00,703 INFO L290 TraceCheckUtils]: 41: Hoare triple {162813#false} ~cond := #in~cond; {162813#false} is VALID [2022-04-08 10:18:00,703 INFO L290 TraceCheckUtils]: 42: Hoare triple {162813#false} assume 0 == ~cond; {162813#false} is VALID [2022-04-08 10:18:00,703 INFO L290 TraceCheckUtils]: 43: Hoare triple {162813#false} assume !false; {162813#false} is VALID [2022-04-08 10:18:00,703 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-08 10:18:00,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:18:01,185 INFO L290 TraceCheckUtils]: 43: Hoare triple {162813#false} assume !false; {162813#false} is VALID [2022-04-08 10:18:01,185 INFO L290 TraceCheckUtils]: 42: Hoare triple {162813#false} assume 0 == ~cond; {162813#false} is VALID [2022-04-08 10:18:01,185 INFO L290 TraceCheckUtils]: 41: Hoare triple {162813#false} ~cond := #in~cond; {162813#false} is VALID [2022-04-08 10:18:01,185 INFO L272 TraceCheckUtils]: 40: Hoare triple {162813#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {162813#false} is VALID [2022-04-08 10:18:01,185 INFO L290 TraceCheckUtils]: 39: Hoare triple {162813#false} assume !(~z~0 % 4294967296 > 0); {162813#false} is VALID [2022-04-08 10:18:01,185 INFO L290 TraceCheckUtils]: 38: Hoare triple {162813#false} assume !(~x~0 % 4294967296 > 0); {162813#false} is VALID [2022-04-08 10:18:01,185 INFO L290 TraceCheckUtils]: 37: Hoare triple {162813#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {162813#false} is VALID [2022-04-08 10:18:01,185 INFO L290 TraceCheckUtils]: 36: Hoare triple {162813#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {162813#false} is VALID [2022-04-08 10:18:01,185 INFO L290 TraceCheckUtils]: 35: Hoare triple {162813#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {162813#false} is VALID [2022-04-08 10:18:01,185 INFO L290 TraceCheckUtils]: 34: Hoare triple {162813#false} assume !(~y~0 % 4294967296 > 0); {162813#false} is VALID [2022-04-08 10:18:01,185 INFO L290 TraceCheckUtils]: 33: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:01,185 INFO L290 TraceCheckUtils]: 32: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:01,185 INFO L290 TraceCheckUtils]: 31: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:01,185 INFO L290 TraceCheckUtils]: 30: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:01,185 INFO L290 TraceCheckUtils]: 29: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:01,185 INFO L290 TraceCheckUtils]: 28: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:01,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:01,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:01,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:01,186 INFO L290 TraceCheckUtils]: 24: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:01,186 INFO L290 TraceCheckUtils]: 23: Hoare triple {162813#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {162813#false} is VALID [2022-04-08 10:18:01,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {163030#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {162813#false} is VALID [2022-04-08 10:18:01,187 INFO L290 TraceCheckUtils]: 21: Hoare triple {163034#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {163030#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:18:01,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {163038#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {163034#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:18:01,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {163042#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {163038#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:18:01,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {163046#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {163042#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:18:01,189 INFO L290 TraceCheckUtils]: 17: Hoare triple {163046#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {163046#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:18:01,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {163053#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163046#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:18:01,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {163057#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163053#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:18:01,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {163061#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163057#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:18:01,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {163065#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163061#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:18:01,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {163069#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163065#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:18:01,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {163073#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163069#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:18:01,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {163077#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163073#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:18:01,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {163081#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163077#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:18:01,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {163085#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163081#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:18:01,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {163089#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163085#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:18:01,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {163093#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163089#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:18:01,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {162812#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {163093#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:18:01,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {162812#true} call #t~ret15 := main(); {162812#true} is VALID [2022-04-08 10:18:01,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {162812#true} {162812#true} #83#return; {162812#true} is VALID [2022-04-08 10:18:01,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {162812#true} assume true; {162812#true} is VALID [2022-04-08 10:18:01,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {162812#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {162812#true} is VALID [2022-04-08 10:18:01,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {162812#true} call ULTIMATE.init(); {162812#true} is VALID [2022-04-08 10:18:01,197 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-08 10:18:01,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443336007] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:18:01,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:18:01,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-08 10:18:01,197 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:18:01,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [354107141] [2022-04-08 10:18:01,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [354107141] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:18:01,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:18:01,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:18:01,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633095040] [2022-04-08 10:18:01,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:18:01,198 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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 44 [2022-04-08 10:18:01,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:18:01,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-08 10:18:01,218 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-08 10:18:01,218 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:18:01,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:18:01,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:18:01,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1027, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:18:01,218 INFO L87 Difference]: Start difference. First operand 504 states and 647 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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)