/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-de61.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:08:56,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:08:56,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:08:56,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:08:56,569 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:08:56,570 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:08:56,577 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:08:56,580 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:08:56,581 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:08:56,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:08:56,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:08:56,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:08:56,589 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:08:56,591 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:08:56,592 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:08:56,594 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:08:56,595 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:08:56,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:08:56,599 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:08:56,604 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:08:56,606 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:08:56,607 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:08:56,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:08:56,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:08:56,610 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:08:56,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:08:56,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:08:56,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:08:56,614 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:08:56,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:08:56,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:08:56,616 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:08:56,617 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:08:56,618 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:08:56,618 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:08:56,619 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:08:56,619 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:08:56,620 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:08:56,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:08:56,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:08:56,621 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:08:56,622 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:08:56,623 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:08:56,634 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:08:56,634 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:08:56,635 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:08:56,636 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:08:56,636 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:08:56,636 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:08:56,636 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:08:56,636 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:08:56,636 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:08:56,637 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:08:56,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:08:56,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:08:56,637 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:08:56,637 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:08:56,638 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:08:56,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:08:56,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:08:56,638 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:08:56,638 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:08:56,638 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:08:56,638 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:08:56,638 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:08:56,639 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-28 10:08:56,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:08:56,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:08:56,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:08:56,906 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:08:56,906 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:08:56,907 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de61.c [2022-04-28 10:08:56,967 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97a418b95/646f3a6aed9a454d9c70e26064c8d4d5/FLAGa767b291a [2022-04-28 10:08:57,390 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:08:57,391 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de61.c [2022-04-28 10:08:57,396 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97a418b95/646f3a6aed9a454d9c70e26064c8d4d5/FLAGa767b291a [2022-04-28 10:08:57,413 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97a418b95/646f3a6aed9a454d9c70e26064c8d4d5 [2022-04-28 10:08:57,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:08:57,422 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:08:57,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:08:57,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:08:57,427 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:08:57,428 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:08:57" (1/1) ... [2022-04-28 10:08:57,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ab4c1ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:57, skipping insertion in model container [2022-04-28 10:08:57,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:08:57" (1/1) ... [2022-04-28 10:08:57,436 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:08:57,449 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:08:57,637 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-de61.c[368,381] [2022-04-28 10:08:57,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:08:57,676 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:08:57,687 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-de61.c[368,381] [2022-04-28 10:08:57,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:08:57,714 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:08:57,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:57 WrapperNode [2022-04-28 10:08:57,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:08:57,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:08:57,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:08:57,717 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:08:57,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:57" (1/1) ... [2022-04-28 10:08:57,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:57" (1/1) ... [2022-04-28 10:08:57,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:57" (1/1) ... [2022-04-28 10:08:57,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:57" (1/1) ... [2022-04-28 10:08:57,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:57" (1/1) ... [2022-04-28 10:08:57,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:57" (1/1) ... [2022-04-28 10:08:57,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:57" (1/1) ... [2022-04-28 10:08:57,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:08:57,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:08:57,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:08:57,756 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:08:57,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:57" (1/1) ... [2022-04-28 10:08:57,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:08:57,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:57,784 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-28 10:08:57,786 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-28 10:08:57,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:08:57,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:08:57,815 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:08:57,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:08:57,816 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:08:57,816 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:08:57,816 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:08:57,816 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:08:57,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:08:57,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 10:08:57,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:08:57,817 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:08:57,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:08:57,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:08:57,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:08:57,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:08:57,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:08:57,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:08:57,877 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:08:57,878 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:08:58,035 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:08:58,041 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:08:58,041 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-04-28 10:08:58,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:08:58 BoogieIcfgContainer [2022-04-28 10:08:58,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:08:58,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:08:58,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:08:58,047 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:08:58,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:08:57" (1/3) ... [2022-04-28 10:08:58,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad63e60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:08:58, skipping insertion in model container [2022-04-28 10:08:58,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:57" (2/3) ... [2022-04-28 10:08:58,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad63e60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:08:58, skipping insertion in model container [2022-04-28 10:08:58,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:08:58" (3/3) ... [2022-04-28 10:08:58,050 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de61.c [2022-04-28 10:08:58,062 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:08:58,062 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:08:58,096 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:08:58,101 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@16fd10c8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5e1775b9 [2022-04-28 10:08:58,102 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:08:58,108 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:08:58,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:08:58,114 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:58,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:58,114 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:58,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:58,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1370249117, now seen corresponding path program 1 times [2022-04-28 10:08:58,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:58,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [7331508] [2022-04-28 10:08:58,140 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:08:58,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1370249117, now seen corresponding path program 2 times [2022-04-28 10:08:58,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:58,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441119366] [2022-04-28 10:08:58,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:58,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:58,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:58,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-04-28 10:08:58,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-28 10:08:58,389 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #94#return; {28#true} is VALID [2022-04-28 10:08:58,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:58,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-04-28 10:08:58,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-28 10:08:58,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #94#return; {28#true} is VALID [2022-04-28 10:08:58,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret17 := main(); {28#true} is VALID [2022-04-28 10:08:58,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28#true} is VALID [2022-04-28 10:08:58,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume !(~x~0 % 4294967296 > 0); {28#true} is VALID [2022-04-28 10:08:58,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#true} ~z~0 := ~y~0; {28#true} is VALID [2022-04-28 10:08:58,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#true} assume !(~z~0 % 4294967296 > 0); {28#true} is VALID [2022-04-28 10:08:58,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#true} assume !(~y~0 % 4294967296 > 0); {28#true} is VALID [2022-04-28 10:08:58,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-04-28 10:08:58,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume !(~z~0 % 4294967296 > 0); {29#false} is VALID [2022-04-28 10:08:58,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} assume !(~y~0 % 4294967296 > 0); {29#false} is VALID [2022-04-28 10:08:58,402 INFO L272 TraceCheckUtils]: 13: Hoare triple {29#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29#false} is VALID [2022-04-28 10:08:58,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-28 10:08:58,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-28 10:08:58,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-28 10:08:58,403 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-28 10:08:58,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:58,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441119366] [2022-04-28 10:08:58,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441119366] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:58,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:58,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:08:58,408 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:58,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [7331508] [2022-04-28 10:08:58,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [7331508] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:58,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:58,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:08:58,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536711839] [2022-04-28 10:08:58,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:58,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 10:08:58,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:58,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:58,450 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-28 10:08:58,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 10:08:58,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:58,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 10:08:58,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:08:58,476 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:58,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:58,591 INFO L93 Difference]: Finished difference Result 43 states and 66 transitions. [2022-04-28 10:08:58,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 10:08:58,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 10:08:58,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:58,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:58,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-28 10:08:58,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:58,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-28 10:08:58,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2022-04-28 10:08:58,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:58,673 INFO L225 Difference]: With dead ends: 43 [2022-04-28 10:08:58,673 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 10:08:58,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:08:58,679 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:58,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:08:58,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 10:08:58,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-28 10:08:58,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:58,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:58,704 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:58,704 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:58,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:58,706 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-04-28 10:08:58,706 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-28 10:08:58,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:58,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:58,707 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 10:08:58,707 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 10:08:58,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:58,709 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-04-28 10:08:58,709 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-28 10:08:58,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:58,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:58,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:58,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:58,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:58,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-04-28 10:08:58,713 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 17 [2022-04-28 10:08:58,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:58,713 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-04-28 10:08:58,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:58,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 23 transitions. [2022-04-28 10:08:58,738 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-28 10:08:58,738 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-28 10:08:58,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:08:58,739 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:58,739 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:58,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:08:58,739 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:58,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:58,740 INFO L85 PathProgramCache]: Analyzing trace with hash 2115201689, now seen corresponding path program 1 times [2022-04-28 10:08:58,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:58,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [885123662] [2022-04-28 10:08:58,741 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:08:58,741 INFO L85 PathProgramCache]: Analyzing trace with hash 2115201689, now seen corresponding path program 2 times [2022-04-28 10:08:58,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:58,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331869697] [2022-04-28 10:08:58,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:58,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:59,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:59,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {205#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {194#true} is VALID [2022-04-28 10:08:59,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#true} assume true; {194#true} is VALID [2022-04-28 10:08:59,074 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {194#true} {194#true} #94#return; {194#true} is VALID [2022-04-28 10:08:59,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {205#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:59,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {205#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {194#true} is VALID [2022-04-28 10:08:59,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {194#true} assume true; {194#true} is VALID [2022-04-28 10:08:59,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} #94#return; {194#true} is VALID [2022-04-28 10:08:59,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {194#true} call #t~ret17 := main(); {194#true} is VALID [2022-04-28 10:08:59,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {194#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {199#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:08:59,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {199#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {200#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-28 10:08:59,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {200#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {201#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:08:59,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {201#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {201#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:08:59,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {201#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {201#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:08:59,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {201#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~x~0 % 4294967296 > 0); {202#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:08:59,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {202#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {202#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:08:59,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {202#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {202#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:08:59,084 INFO L272 TraceCheckUtils]: 13: Hoare triple {202#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {203#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:08:59,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {203#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {204#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:08:59,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {204#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {195#false} is VALID [2022-04-28 10:08:59,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {195#false} assume !false; {195#false} is VALID [2022-04-28 10:08:59,086 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-28 10:08:59,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:59,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331869697] [2022-04-28 10:08:59,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331869697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:59,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:59,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:08:59,087 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:59,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [885123662] [2022-04-28 10:08:59,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [885123662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:59,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:59,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:08:59,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12613813] [2022-04-28 10:08:59,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:59,089 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 10:08:59,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:59,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:59,108 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-28 10:08:59,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:08:59,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:59,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:08:59,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:08:59,110 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:59,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:59,541 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2022-04-28 10:08:59,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:08:59,542 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 10:08:59,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:59,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:59,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-28 10:08:59,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:59,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-28 10:08:59,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 53 transitions. [2022-04-28 10:08:59,613 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-28 10:08:59,616 INFO L225 Difference]: With dead ends: 38 [2022-04-28 10:08:59,616 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 10:08:59,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:08:59,619 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 38 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:59,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 46 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:08:59,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 10:08:59,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 10:08:59,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:59,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:59,625 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:59,625 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:59,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:59,626 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-28 10:08:59,627 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-28 10:08:59,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:59,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:59,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 10:08:59,628 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 10:08:59,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:59,629 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-28 10:08:59,629 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-28 10:08:59,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:59,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:59,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:59,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:59,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:59,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-04-28 10:08:59,631 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 17 [2022-04-28 10:08:59,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:59,632 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-04-28 10:08:59,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:59,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 24 transitions. [2022-04-28 10:08:59,656 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-28 10:08:59,656 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-28 10:08:59,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 10:08:59,657 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:59,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:59,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 10:08:59,657 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:59,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:59,658 INFO L85 PathProgramCache]: Analyzing trace with hash -121895178, now seen corresponding path program 1 times [2022-04-28 10:08:59,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:59,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [994955331] [2022-04-28 10:08:59,673 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:59,673 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:59,673 INFO L85 PathProgramCache]: Analyzing trace with hash -121895178, now seen corresponding path program 2 times [2022-04-28 10:08:59,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:59,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121055542] [2022-04-28 10:08:59,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:59,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:59,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:59,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {370#true} is VALID [2022-04-28 10:08:59,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {370#true} assume true; {370#true} is VALID [2022-04-28 10:08:59,760 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {370#true} {370#true} #94#return; {370#true} is VALID [2022-04-28 10:08:59,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {370#true} call ULTIMATE.init(); {378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:59,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {370#true} is VALID [2022-04-28 10:08:59,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {370#true} assume true; {370#true} is VALID [2022-04-28 10:08:59,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {370#true} {370#true} #94#return; {370#true} is VALID [2022-04-28 10:08:59,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {370#true} call #t~ret17 := main(); {370#true} is VALID [2022-04-28 10:08:59,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {370#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {375#(= main_~y~0 0)} is VALID [2022-04-28 10:08:59,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {375#(= 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; {376#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:59,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {376#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {376#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:59,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {376#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {377#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:59,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {377#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {371#false} is VALID [2022-04-28 10:08:59,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {371#false} assume !(~y~0 % 4294967296 > 0); {371#false} is VALID [2022-04-28 10:08:59,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {371#false} assume !(~x~0 % 4294967296 > 0); {371#false} is VALID [2022-04-28 10:08:59,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {371#false} assume !(~z~0 % 4294967296 > 0); {371#false} is VALID [2022-04-28 10:08:59,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {371#false} assume !(~y~0 % 4294967296 > 0); {371#false} is VALID [2022-04-28 10:08:59,766 INFO L272 TraceCheckUtils]: 14: Hoare triple {371#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {371#false} is VALID [2022-04-28 10:08:59,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {371#false} ~cond := #in~cond; {371#false} is VALID [2022-04-28 10:08:59,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {371#false} assume 0 == ~cond; {371#false} is VALID [2022-04-28 10:08:59,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {371#false} assume !false; {371#false} is VALID [2022-04-28 10:08:59,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:59,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:59,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121055542] [2022-04-28 10:08:59,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121055542] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:59,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608486304] [2022-04-28 10:08:59,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:59,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:59,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:59,779 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-28 10:08:59,783 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-28 10:08:59,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:59,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:59,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 10:08:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:59,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:00,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {370#true} call ULTIMATE.init(); {370#true} is VALID [2022-04-28 10:09:00,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {370#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {370#true} is VALID [2022-04-28 10:09:00,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {370#true} assume true; {370#true} is VALID [2022-04-28 10:09:00,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {370#true} {370#true} #94#return; {370#true} is VALID [2022-04-28 10:09:00,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {370#true} call #t~ret17 := main(); {370#true} is VALID [2022-04-28 10:09:00,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {370#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {375#(= main_~y~0 0)} is VALID [2022-04-28 10:09:00,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {375#(= 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; {376#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:00,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {376#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {376#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:00,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {376#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {406#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:00,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {406#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {371#false} is VALID [2022-04-28 10:09:00,138 INFO L290 TraceCheckUtils]: 10: Hoare triple {371#false} assume !(~y~0 % 4294967296 > 0); {371#false} is VALID [2022-04-28 10:09:00,138 INFO L290 TraceCheckUtils]: 11: Hoare triple {371#false} assume !(~x~0 % 4294967296 > 0); {371#false} is VALID [2022-04-28 10:09:00,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {371#false} assume !(~z~0 % 4294967296 > 0); {371#false} is VALID [2022-04-28 10:09:00,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {371#false} assume !(~y~0 % 4294967296 > 0); {371#false} is VALID [2022-04-28 10:09:00,142 INFO L272 TraceCheckUtils]: 14: Hoare triple {371#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {371#false} is VALID [2022-04-28 10:09:00,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {371#false} ~cond := #in~cond; {371#false} is VALID [2022-04-28 10:09:00,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {371#false} assume 0 == ~cond; {371#false} is VALID [2022-04-28 10:09:00,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {371#false} assume !false; {371#false} is VALID [2022-04-28 10:09:00,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:00,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:00,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {371#false} assume !false; {371#false} is VALID [2022-04-28 10:09:00,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {371#false} assume 0 == ~cond; {371#false} is VALID [2022-04-28 10:09:00,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {371#false} ~cond := #in~cond; {371#false} is VALID [2022-04-28 10:09:00,233 INFO L272 TraceCheckUtils]: 14: Hoare triple {371#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {371#false} is VALID [2022-04-28 10:09:00,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {371#false} assume !(~y~0 % 4294967296 > 0); {371#false} is VALID [2022-04-28 10:09:00,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {371#false} assume !(~z~0 % 4294967296 > 0); {371#false} is VALID [2022-04-28 10:09:00,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {371#false} assume !(~x~0 % 4294967296 > 0); {371#false} is VALID [2022-04-28 10:09:00,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {371#false} assume !(~y~0 % 4294967296 > 0); {371#false} is VALID [2022-04-28 10:09:00,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {371#false} is VALID [2022-04-28 10:09:00,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {462#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {458#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:00,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {462#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {462#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:00,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {469#(< 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; {462#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:00,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {370#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {469#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:00,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {370#true} call #t~ret17 := main(); {370#true} is VALID [2022-04-28 10:09:00,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {370#true} {370#true} #94#return; {370#true} is VALID [2022-04-28 10:09:00,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {370#true} assume true; {370#true} is VALID [2022-04-28 10:09:00,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {370#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {370#true} is VALID [2022-04-28 10:09:00,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {370#true} call ULTIMATE.init(); {370#true} is VALID [2022-04-28 10:09:00,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:00,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608486304] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:00,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:00,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-28 10:09:00,241 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:00,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [994955331] [2022-04-28 10:09:00,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [994955331] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:00,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:00,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:09:00,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275094664] [2022-04-28 10:09:00,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:00,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-28 10:09:00,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:00,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-28 10:09:00,257 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-28 10:09:00,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:09:00,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:00,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:09:00,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:09:00,259 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-28 10:09:00,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:00,544 INFO L93 Difference]: Finished difference Result 41 states and 60 transitions. [2022-04-28 10:09:00,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:09:00,545 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-28 10:09:00,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:00,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-28 10:09:00,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-04-28 10:09:00,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-28 10:09:00,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-04-28 10:09:00,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 60 transitions. [2022-04-28 10:09:00,608 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-28 10:09:00,610 INFO L225 Difference]: With dead ends: 41 [2022-04-28 10:09:00,610 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 10:09:00,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:09:00,611 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 32 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:00,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 43 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:09:00,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 10:09:00,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-04-28 10:09:00,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:00,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:00,629 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:00,629 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:00,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:00,631 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-04-28 10:09:00,631 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-28 10:09:00,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:00,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:00,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 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-28 10:09:00,632 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 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-28 10:09:00,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:00,634 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-04-28 10:09:00,634 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-28 10:09:00,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:00,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:00,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:00,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:00,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:00,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2022-04-28 10:09:00,636 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 18 [2022-04-28 10:09:00,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:00,636 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2022-04-28 10:09:00,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-28 10:09:00,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 42 transitions. [2022-04-28 10:09:00,685 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-28 10:09:00,685 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-04-28 10:09:00,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 10:09:00,687 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:00,688 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:00,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 10:09:00,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:00,911 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:00,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:00,911 INFO L85 PathProgramCache]: Analyzing trace with hash -752421319, now seen corresponding path program 3 times [2022-04-28 10:09:00,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:00,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1105685998] [2022-04-28 10:09:00,916 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:00,916 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:00,916 INFO L85 PathProgramCache]: Analyzing trace with hash -752421319, now seen corresponding path program 4 times [2022-04-28 10:09:00,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:00,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263489514] [2022-04-28 10:09:00,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:00,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:00,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:01,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {713#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {704#true} is VALID [2022-04-28 10:09:01,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {704#true} assume true; {704#true} is VALID [2022-04-28 10:09:01,006 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {704#true} {704#true} #94#return; {704#true} is VALID [2022-04-28 10:09:01,007 INFO L272 TraceCheckUtils]: 0: Hoare triple {704#true} call ULTIMATE.init(); {713#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:01,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {713#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {704#true} is VALID [2022-04-28 10:09:01,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {704#true} assume true; {704#true} is VALID [2022-04-28 10:09:01,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {704#true} {704#true} #94#return; {704#true} is VALID [2022-04-28 10:09:01,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {704#true} call #t~ret17 := main(); {704#true} is VALID [2022-04-28 10:09:01,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {704#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {709#(= main_~y~0 0)} is VALID [2022-04-28 10:09:01,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {709#(= 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; {710#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:01,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {710#(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; {711#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:01,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {711#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {711#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:01,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {711#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {712#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:01,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {712#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {705#false} is VALID [2022-04-28 10:09:01,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {705#false} assume !(~y~0 % 4294967296 > 0); {705#false} is VALID [2022-04-28 10:09:01,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {705#false} assume !(~x~0 % 4294967296 > 0); {705#false} is VALID [2022-04-28 10:09:01,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {705#false} assume !(~z~0 % 4294967296 > 0); {705#false} is VALID [2022-04-28 10:09:01,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {705#false} assume !(~y~0 % 4294967296 > 0); {705#false} is VALID [2022-04-28 10:09:01,040 INFO L272 TraceCheckUtils]: 15: Hoare triple {705#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {705#false} is VALID [2022-04-28 10:09:01,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {705#false} ~cond := #in~cond; {705#false} is VALID [2022-04-28 10:09:01,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {705#false} assume 0 == ~cond; {705#false} is VALID [2022-04-28 10:09:01,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {705#false} assume !false; {705#false} is VALID [2022-04-28 10:09:01,040 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-28 10:09:01,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:01,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263489514] [2022-04-28 10:09:01,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263489514] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:01,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363772987] [2022-04-28 10:09:01,041 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:01,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:01,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:01,042 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-28 10:09:01,051 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-28 10:09:01,091 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:01,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:01,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 10:09:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:01,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:01,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {704#true} call ULTIMATE.init(); {704#true} is VALID [2022-04-28 10:09:01,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {704#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {704#true} is VALID [2022-04-28 10:09:01,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {704#true} assume true; {704#true} is VALID [2022-04-28 10:09:01,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {704#true} {704#true} #94#return; {704#true} is VALID [2022-04-28 10:09:01,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {704#true} call #t~ret17 := main(); {704#true} is VALID [2022-04-28 10:09:01,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {704#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {709#(= main_~y~0 0)} is VALID [2022-04-28 10:09:01,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {709#(= 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; {710#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:01,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {710#(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; {711#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:01,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {711#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {711#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:01,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {711#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {744#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:01,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {744#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {705#false} is VALID [2022-04-28 10:09:01,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {705#false} assume !(~y~0 % 4294967296 > 0); {705#false} is VALID [2022-04-28 10:09:01,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {705#false} assume !(~x~0 % 4294967296 > 0); {705#false} is VALID [2022-04-28 10:09:01,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {705#false} assume !(~z~0 % 4294967296 > 0); {705#false} is VALID [2022-04-28 10:09:01,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {705#false} assume !(~y~0 % 4294967296 > 0); {705#false} is VALID [2022-04-28 10:09:01,312 INFO L272 TraceCheckUtils]: 15: Hoare triple {705#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {705#false} is VALID [2022-04-28 10:09:01,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {705#false} ~cond := #in~cond; {705#false} is VALID [2022-04-28 10:09:01,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {705#false} assume 0 == ~cond; {705#false} is VALID [2022-04-28 10:09:01,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {705#false} assume !false; {705#false} is VALID [2022-04-28 10:09:01,313 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-28 10:09:01,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:01,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {705#false} assume !false; {705#false} is VALID [2022-04-28 10:09:01,420 INFO L290 TraceCheckUtils]: 17: Hoare triple {705#false} assume 0 == ~cond; {705#false} is VALID [2022-04-28 10:09:01,420 INFO L290 TraceCheckUtils]: 16: Hoare triple {705#false} ~cond := #in~cond; {705#false} is VALID [2022-04-28 10:09:01,421 INFO L272 TraceCheckUtils]: 15: Hoare triple {705#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {705#false} is VALID [2022-04-28 10:09:01,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {705#false} assume !(~y~0 % 4294967296 > 0); {705#false} is VALID [2022-04-28 10:09:01,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {705#false} assume !(~z~0 % 4294967296 > 0); {705#false} is VALID [2022-04-28 10:09:01,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {705#false} assume !(~x~0 % 4294967296 > 0); {705#false} is VALID [2022-04-28 10:09:01,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {705#false} assume !(~y~0 % 4294967296 > 0); {705#false} is VALID [2022-04-28 10:09:01,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {796#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {705#false} is VALID [2022-04-28 10:09:01,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {800#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {796#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:01,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {800#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {800#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:01,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {807#(< 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; {800#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:01,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {811#(< 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; {807#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:01,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {704#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {811#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:01,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {704#true} call #t~ret17 := main(); {704#true} is VALID [2022-04-28 10:09:01,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {704#true} {704#true} #94#return; {704#true} is VALID [2022-04-28 10:09:01,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {704#true} assume true; {704#true} is VALID [2022-04-28 10:09:01,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {704#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {704#true} is VALID [2022-04-28 10:09:01,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {704#true} call ULTIMATE.init(); {704#true} is VALID [2022-04-28 10:09:01,426 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-28 10:09:01,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363772987] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:01,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:01,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-28 10:09:01,427 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:01,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1105685998] [2022-04-28 10:09:01,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1105685998] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:01,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:01,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:09:01,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398895301] [2022-04-28 10:09:01,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:01,428 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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-28 10:09:01,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:01,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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-28 10:09:01,448 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-28 10:09:01,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:09:01,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:01,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:09:01,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:09:01,449 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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-28 10:09:01,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:01,886 INFO L93 Difference]: Finished difference Result 57 states and 86 transitions. [2022-04-28 10:09:01,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:09:01,887 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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-28 10:09:01,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:01,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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-28 10:09:01,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-28 10:09:01,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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-28 10:09:01,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-28 10:09:01,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 73 transitions. [2022-04-28 10:09:01,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:01,961 INFO L225 Difference]: With dead ends: 57 [2022-04-28 10:09:01,961 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 10:09:01,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:09:01,963 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 48 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:01,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 47 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:09:01,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 10:09:01,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2022-04-28 10:09:01,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:01,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 39 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 34 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:01,988 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 39 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 34 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:01,988 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 39 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 34 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:01,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:01,990 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2022-04-28 10:09:01,990 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2022-04-28 10:09:01,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:01,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:01,991 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 34 states have internal predecessors, (50), 3 states have call successors, (3), 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 48 states. [2022-04-28 10:09:01,991 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 34 states have internal predecessors, (50), 3 states have call successors, (3), 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 48 states. [2022-04-28 10:09:01,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:01,993 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2022-04-28 10:09:01,993 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2022-04-28 10:09:01,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:01,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:01,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:01,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:01,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 34 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:01,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2022-04-28 10:09:01,996 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 19 [2022-04-28 10:09:01,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:01,996 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2022-04-28 10:09:01,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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-28 10:09:01,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 54 transitions. [2022-04-28 10:09:02,049 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-28 10:09:02,049 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-28 10:09:02,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:09:02,049 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:02,050 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:02,067 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-28 10:09:02,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 10:09:02,255 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:02,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:02,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1992076293, now seen corresponding path program 1 times [2022-04-28 10:09:02,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:02,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1576229972] [2022-04-28 10:09:02,260 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:02,260 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:02,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1992076293, now seen corresponding path program 2 times [2022-04-28 10:09:02,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:02,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539300841] [2022-04-28 10:09:02,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:02,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:02,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:02,366 INFO L290 TraceCheckUtils]: 0: Hoare triple {1138#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1128#true} is VALID [2022-04-28 10:09:02,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-28 10:09:02,367 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1128#true} {1128#true} #94#return; {1128#true} is VALID [2022-04-28 10:09:02,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {1128#true} call ULTIMATE.init(); {1138#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:02,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {1138#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1128#true} is VALID [2022-04-28 10:09:02,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-28 10:09:02,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1128#true} #94#return; {1128#true} is VALID [2022-04-28 10:09:02,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {1128#true} call #t~ret17 := main(); {1128#true} is VALID [2022-04-28 10:09:02,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {1128#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1133#(= main_~y~0 0)} is VALID [2022-04-28 10:09:02,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {1133#(= 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; {1134#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:02,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {1134#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1134#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:02,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {1134#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1135#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:02,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {1135#(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; {1136#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:09:02,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {1136#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1136#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:09:02,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {1136#(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; {1137#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:02,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {1137#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {1137#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:02,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {1137#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {1137#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:02,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {1137#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1129#false} is VALID [2022-04-28 10:09:02,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {1129#false} assume !(~y~0 % 4294967296 > 0); {1129#false} is VALID [2022-04-28 10:09:02,374 INFO L272 TraceCheckUtils]: 16: Hoare triple {1129#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1129#false} is VALID [2022-04-28 10:09:02,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {1129#false} ~cond := #in~cond; {1129#false} is VALID [2022-04-28 10:09:02,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {1129#false} assume 0 == ~cond; {1129#false} is VALID [2022-04-28 10:09:02,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {1129#false} assume !false; {1129#false} is VALID [2022-04-28 10:09:02,374 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-28 10:09:02,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:02,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539300841] [2022-04-28 10:09:02,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539300841] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:02,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652630082] [2022-04-28 10:09:02,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:02,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:02,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:02,376 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-28 10:09:02,402 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-28 10:09:02,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:02,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:02,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:09:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:02,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:02,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {1128#true} call ULTIMATE.init(); {1128#true} is VALID [2022-04-28 10:09:02,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {1128#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1128#true} is VALID [2022-04-28 10:09:02,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-28 10:09:02,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1128#true} #94#return; {1128#true} is VALID [2022-04-28 10:09:02,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {1128#true} call #t~ret17 := main(); {1128#true} is VALID [2022-04-28 10:09:02,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {1128#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1128#true} is VALID [2022-04-28 10:09:02,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {1128#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1160#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:02,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {1160#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !(~x~0 % 4294967296 > 0); {1160#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:02,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {1160#(< 0 (mod (+ main_~x~0 1) 4294967296))} ~z~0 := ~y~0; {1160#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:02,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {1160#(< 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; {1170#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:02,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {1170#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1170#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:02,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {1170#(< 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; {1170#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:02,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {1170#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1170#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:02,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {1170#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1129#false} is VALID [2022-04-28 10:09:02,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {1129#false} assume !(~z~0 % 4294967296 > 0); {1129#false} is VALID [2022-04-28 10:09:02,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {1129#false} assume !(~y~0 % 4294967296 > 0); {1129#false} is VALID [2022-04-28 10:09:02,514 INFO L272 TraceCheckUtils]: 16: Hoare triple {1129#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1129#false} is VALID [2022-04-28 10:09:02,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {1129#false} ~cond := #in~cond; {1129#false} is VALID [2022-04-28 10:09:02,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {1129#false} assume 0 == ~cond; {1129#false} is VALID [2022-04-28 10:09:02,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {1129#false} assume !false; {1129#false} is VALID [2022-04-28 10:09:02,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:09:02,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:02,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {1129#false} assume !false; {1129#false} is VALID [2022-04-28 10:09:02,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {1129#false} assume 0 == ~cond; {1129#false} is VALID [2022-04-28 10:09:02,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {1129#false} ~cond := #in~cond; {1129#false} is VALID [2022-04-28 10:09:02,583 INFO L272 TraceCheckUtils]: 16: Hoare triple {1129#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1129#false} is VALID [2022-04-28 10:09:02,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {1129#false} assume !(~y~0 % 4294967296 > 0); {1129#false} is VALID [2022-04-28 10:09:02,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {1129#false} assume !(~z~0 % 4294967296 > 0); {1129#false} is VALID [2022-04-28 10:09:02,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {1170#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1129#false} is VALID [2022-04-28 10:09:02,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {1170#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1170#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:02,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {1170#(< 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; {1170#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:02,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {1170#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1170#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:02,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {1160#(< 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; {1170#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:02,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {1160#(< 0 (mod (+ main_~x~0 1) 4294967296))} ~z~0 := ~y~0; {1160#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:02,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {1160#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !(~x~0 % 4294967296 > 0); {1160#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:02,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {1128#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1160#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:02,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {1128#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1128#true} is VALID [2022-04-28 10:09:02,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {1128#true} call #t~ret17 := main(); {1128#true} is VALID [2022-04-28 10:09:02,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1128#true} #94#return; {1128#true} is VALID [2022-04-28 10:09:02,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-28 10:09:02,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {1128#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1128#true} is VALID [2022-04-28 10:09:02,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {1128#true} call ULTIMATE.init(); {1128#true} is VALID [2022-04-28 10:09:02,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:09:02,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652630082] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:02,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:02,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 10 [2022-04-28 10:09:02,591 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:02,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1576229972] [2022-04-28 10:09:02,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1576229972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:02,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:02,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:09:02,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95853270] [2022-04-28 10:09:02,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:02,591 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-28 10:09:02,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:02,592 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-28 10:09:02,606 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-28 10:09:02,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:09:02,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:02,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:09:02,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:09:02,609 INFO L87 Difference]: Start difference. First operand 39 states and 54 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-28 10:09:03,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:03,146 INFO L93 Difference]: Finished difference Result 87 states and 126 transitions. [2022-04-28 10:09:03,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:09:03,147 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-28 10:09:03,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:03,147 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-28 10:09:03,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 78 transitions. [2022-04-28 10:09:03,149 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-28 10:09:03,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 78 transitions. [2022-04-28 10:09:03,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 78 transitions. [2022-04-28 10:09:03,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:03,232 INFO L225 Difference]: With dead ends: 87 [2022-04-28 10:09:03,233 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 10:09:03,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:09:03,234 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 46 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:03,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 40 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:09:03,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 10:09:03,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2022-04-28 10:09:03,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:03,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 53 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 48 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:03,309 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 53 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 48 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:03,310 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 53 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 48 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:03,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:03,312 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2022-04-28 10:09:03,312 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 88 transitions. [2022-04-28 10:09:03,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:03,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:03,313 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 48 states have internal predecessors, (67), 3 states have call successors, (3), 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 67 states. [2022-04-28 10:09:03,313 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 48 states have internal predecessors, (67), 3 states have call successors, (3), 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 67 states. [2022-04-28 10:09:03,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:03,316 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2022-04-28 10:09:03,316 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 88 transitions. [2022-04-28 10:09:03,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:03,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:03,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:03,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:03,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 48 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:03,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2022-04-28 10:09:03,319 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 20 [2022-04-28 10:09:03,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:03,319 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2022-04-28 10:09:03,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:03,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 71 transitions. [2022-04-28 10:09:03,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:03,390 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2022-04-28 10:09:03,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:09:03,391 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:03,391 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:03,416 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-28 10:09:03,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:03,612 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:03,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:03,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1176104790, now seen corresponding path program 5 times [2022-04-28 10:09:03,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:03,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [359407280] [2022-04-28 10:09:03,615 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:03,615 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:03,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1176104790, now seen corresponding path program 6 times [2022-04-28 10:09:03,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:03,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647083504] [2022-04-28 10:09:03,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:03,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:03,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:03,707 INFO L290 TraceCheckUtils]: 0: Hoare triple {1702#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1692#true} is VALID [2022-04-28 10:09:03,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {1692#true} assume true; {1692#true} is VALID [2022-04-28 10:09:03,707 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1692#true} {1692#true} #94#return; {1692#true} is VALID [2022-04-28 10:09:03,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {1692#true} call ULTIMATE.init(); {1702#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:03,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {1702#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1692#true} is VALID [2022-04-28 10:09:03,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {1692#true} assume true; {1692#true} is VALID [2022-04-28 10:09:03,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1692#true} {1692#true} #94#return; {1692#true} is VALID [2022-04-28 10:09:03,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {1692#true} call #t~ret17 := main(); {1692#true} is VALID [2022-04-28 10:09:03,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {1692#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1697#(= main_~y~0 0)} is VALID [2022-04-28 10:09:03,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {1697#(= 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; {1698#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:03,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {1698#(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; {1699#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:03,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {1699#(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; {1700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:03,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {1700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:03,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {1700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {1701#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:03,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {1701#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-28 10:09:03,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {1693#false} assume !(~y~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-28 10:09:03,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {1693#false} assume !(~x~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-28 10:09:03,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {1693#false} assume !(~z~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-28 10:09:03,713 INFO L290 TraceCheckUtils]: 15: Hoare triple {1693#false} assume !(~y~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-28 10:09:03,713 INFO L272 TraceCheckUtils]: 16: Hoare triple {1693#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1693#false} is VALID [2022-04-28 10:09:03,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {1693#false} ~cond := #in~cond; {1693#false} is VALID [2022-04-28 10:09:03,713 INFO L290 TraceCheckUtils]: 18: Hoare triple {1693#false} assume 0 == ~cond; {1693#false} is VALID [2022-04-28 10:09:03,713 INFO L290 TraceCheckUtils]: 19: Hoare triple {1693#false} assume !false; {1693#false} is VALID [2022-04-28 10:09:03,713 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:03,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:03,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647083504] [2022-04-28 10:09:03,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647083504] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:03,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206939967] [2022-04-28 10:09:03,714 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:03,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:03,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:03,715 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-28 10:09:03,726 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-28 10:09:03,767 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:09:03,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:03,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 10:09:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:03,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:03,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {1692#true} call ULTIMATE.init(); {1692#true} is VALID [2022-04-28 10:09:03,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {1692#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1692#true} is VALID [2022-04-28 10:09:03,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {1692#true} assume true; {1692#true} is VALID [2022-04-28 10:09:03,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1692#true} {1692#true} #94#return; {1692#true} is VALID [2022-04-28 10:09:03,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {1692#true} call #t~ret17 := main(); {1692#true} is VALID [2022-04-28 10:09:03,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {1692#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1697#(= main_~y~0 0)} is VALID [2022-04-28 10:09:03,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {1697#(= 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; {1698#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:03,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {1698#(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; {1699#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:03,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {1699#(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; {1700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:03,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {1700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:03,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {1700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {1736#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:03,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {1736#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-28 10:09:03,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {1693#false} assume !(~y~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-28 10:09:03,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {1693#false} assume !(~x~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-28 10:09:04,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {1693#false} assume !(~z~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-28 10:09:04,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {1693#false} assume !(~y~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-28 10:09:04,000 INFO L272 TraceCheckUtils]: 16: Hoare triple {1693#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1693#false} is VALID [2022-04-28 10:09:04,000 INFO L290 TraceCheckUtils]: 17: Hoare triple {1693#false} ~cond := #in~cond; {1693#false} is VALID [2022-04-28 10:09:04,000 INFO L290 TraceCheckUtils]: 18: Hoare triple {1693#false} assume 0 == ~cond; {1693#false} is VALID [2022-04-28 10:09:04,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {1693#false} assume !false; {1693#false} is VALID [2022-04-28 10:09:04,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:04,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:04,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {1693#false} assume !false; {1693#false} is VALID [2022-04-28 10:09:04,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {1693#false} assume 0 == ~cond; {1693#false} is VALID [2022-04-28 10:09:04,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {1693#false} ~cond := #in~cond; {1693#false} is VALID [2022-04-28 10:09:04,127 INFO L272 TraceCheckUtils]: 16: Hoare triple {1693#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1693#false} is VALID [2022-04-28 10:09:04,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {1693#false} assume !(~y~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-28 10:09:04,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {1693#false} assume !(~z~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-28 10:09:04,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {1693#false} assume !(~x~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-28 10:09:04,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {1693#false} assume !(~y~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-28 10:09:04,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {1788#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-28 10:09:04,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {1792#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {1788#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:04,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {1792#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1792#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:04,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {1799#(< 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; {1792#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:04,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {1803#(< 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; {1799#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:04,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {1807#(< 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; {1803#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:04,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {1692#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1807#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:04,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {1692#true} call #t~ret17 := main(); {1692#true} is VALID [2022-04-28 10:09:04,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1692#true} {1692#true} #94#return; {1692#true} is VALID [2022-04-28 10:09:04,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {1692#true} assume true; {1692#true} is VALID [2022-04-28 10:09:04,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {1692#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1692#true} is VALID [2022-04-28 10:09:04,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {1692#true} call ULTIMATE.init(); {1692#true} is VALID [2022-04-28 10:09:04,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:04,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206939967] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:04,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:04,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 10:09:04,132 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:04,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [359407280] [2022-04-28 10:09:04,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [359407280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:04,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:04,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:09:04,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853324802] [2022-04-28 10:09:04,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:04,133 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-28 10:09:04,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:04,133 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-28 10:09:04,147 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-28 10:09:04,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:09:04,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:04,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:09:04,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:09:04,149 INFO L87 Difference]: Start difference. First operand 53 states and 71 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-28 10:09:04,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:04,787 INFO L93 Difference]: Finished difference Result 86 states and 127 transitions. [2022-04-28 10:09:04,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:09:04,787 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-28 10:09:04,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:04,787 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-28 10:09:04,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2022-04-28 10:09:04,792 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-28 10:09:04,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2022-04-28 10:09:04,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 86 transitions. [2022-04-28 10:09:04,865 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-28 10:09:04,866 INFO L225 Difference]: With dead ends: 86 [2022-04-28 10:09:04,866 INFO L226 Difference]: Without dead ends: 77 [2022-04-28 10:09:04,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:09:04,867 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 61 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:04,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 58 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:09:04,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-28 10:09:04,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 64. [2022-04-28 10:09:04,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:04,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 64 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:04,949 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 64 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:04,949 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 64 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:04,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:04,951 INFO L93 Difference]: Finished difference Result 77 states and 106 transitions. [2022-04-28 10:09:04,952 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 106 transitions. [2022-04-28 10:09:04,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:04,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:04,952 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 3 states have call successors, (3), 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 77 states. [2022-04-28 10:09:04,953 INFO L87 Difference]: Start difference. First operand has 64 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 3 states have call successors, (3), 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 77 states. [2022-04-28 10:09:04,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:04,955 INFO L93 Difference]: Finished difference Result 77 states and 106 transitions. [2022-04-28 10:09:04,955 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 106 transitions. [2022-04-28 10:09:04,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:04,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:04,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:04,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:04,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:04,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 87 transitions. [2022-04-28 10:09:04,958 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 87 transitions. Word has length 20 [2022-04-28 10:09:04,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:04,958 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 87 transitions. [2022-04-28 10:09:04,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:04,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 87 transitions. [2022-04-28 10:09:05,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:05,065 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 87 transitions. [2022-04-28 10:09:05,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:09:05,075 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:05,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:05,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 10:09:05,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:05,275 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:05,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:05,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1232820840, now seen corresponding path program 1 times [2022-04-28 10:09:05,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:05,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [931187990] [2022-04-28 10:09:05,279 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:05,279 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:05,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1232820840, now seen corresponding path program 2 times [2022-04-28 10:09:05,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:05,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118079129] [2022-04-28 10:09:05,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:05,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:05,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:05,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {2299#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2292#true} is VALID [2022-04-28 10:09:05,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {2292#true} assume true; {2292#true} is VALID [2022-04-28 10:09:05,360 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2292#true} {2292#true} #94#return; {2292#true} is VALID [2022-04-28 10:09:05,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {2292#true} call ULTIMATE.init(); {2299#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:05,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {2299#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2292#true} is VALID [2022-04-28 10:09:05,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {2292#true} assume true; {2292#true} is VALID [2022-04-28 10:09:05,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2292#true} {2292#true} #94#return; {2292#true} is VALID [2022-04-28 10:09:05,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {2292#true} call #t~ret17 := main(); {2292#true} is VALID [2022-04-28 10:09:05,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {2292#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2292#true} is VALID [2022-04-28 10:09:05,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {2292#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:05,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:05,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:05,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {2297#(<= 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; {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:09:05,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:09:05,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {2298#(<= (+ (* 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; {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:09:05,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:09:05,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {2293#false} is VALID [2022-04-28 10:09:05,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {2293#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2293#false} is VALID [2022-04-28 10:09:05,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {2293#false} assume !(~z~0 % 4294967296 > 0); {2293#false} is VALID [2022-04-28 10:09:05,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {2293#false} assume !(~y~0 % 4294967296 > 0); {2293#false} is VALID [2022-04-28 10:09:05,367 INFO L272 TraceCheckUtils]: 17: Hoare triple {2293#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2293#false} is VALID [2022-04-28 10:09:05,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {2293#false} ~cond := #in~cond; {2293#false} is VALID [2022-04-28 10:09:05,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {2293#false} assume 0 == ~cond; {2293#false} is VALID [2022-04-28 10:09:05,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {2293#false} assume !false; {2293#false} is VALID [2022-04-28 10:09:05,367 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-28 10:09:05,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:05,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118079129] [2022-04-28 10:09:05,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118079129] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:05,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275408873] [2022-04-28 10:09:05,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:05,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:05,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:05,369 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-28 10:09:05,377 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-28 10:09:05,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:05,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:05,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 10:09:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:05,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:05,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {2292#true} call ULTIMATE.init(); {2292#true} is VALID [2022-04-28 10:09:05,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {2292#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2292#true} is VALID [2022-04-28 10:09:05,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {2292#true} assume true; {2292#true} is VALID [2022-04-28 10:09:05,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2292#true} {2292#true} #94#return; {2292#true} is VALID [2022-04-28 10:09:05,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {2292#true} call #t~ret17 := main(); {2292#true} is VALID [2022-04-28 10:09:05,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {2292#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2292#true} is VALID [2022-04-28 10:09:05,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {2292#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:05,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:05,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:05,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {2297#(<= 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; {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:09:05,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:09:05,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {2298#(<= (+ (* 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; {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:09:05,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:09:05,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {2293#false} is VALID [2022-04-28 10:09:05,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {2293#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2293#false} is VALID [2022-04-28 10:09:05,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {2293#false} assume !(~z~0 % 4294967296 > 0); {2293#false} is VALID [2022-04-28 10:09:05,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {2293#false} assume !(~y~0 % 4294967296 > 0); {2293#false} is VALID [2022-04-28 10:09:05,680 INFO L272 TraceCheckUtils]: 17: Hoare triple {2293#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2293#false} is VALID [2022-04-28 10:09:05,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {2293#false} ~cond := #in~cond; {2293#false} is VALID [2022-04-28 10:09:05,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {2293#false} assume 0 == ~cond; {2293#false} is VALID [2022-04-28 10:09:05,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {2293#false} assume !false; {2293#false} is VALID [2022-04-28 10:09:05,681 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-28 10:09:05,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:05,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {2293#false} assume !false; {2293#false} is VALID [2022-04-28 10:09:05,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {2293#false} assume 0 == ~cond; {2293#false} is VALID [2022-04-28 10:09:05,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {2293#false} ~cond := #in~cond; {2293#false} is VALID [2022-04-28 10:09:05,928 INFO L272 TraceCheckUtils]: 17: Hoare triple {2293#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2293#false} is VALID [2022-04-28 10:09:05,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {2293#false} assume !(~y~0 % 4294967296 > 0); {2293#false} is VALID [2022-04-28 10:09:05,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {2293#false} assume !(~z~0 % 4294967296 > 0); {2293#false} is VALID [2022-04-28 10:09:05,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {2293#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2293#false} is VALID [2022-04-28 10:09:05,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {2293#false} is VALID [2022-04-28 10:09:05,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:09:05,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {2298#(<= (+ (* 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; {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:09:05,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:09:05,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {2297#(<= 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; {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:09:05,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:05,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:05,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {2292#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:05,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {2292#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2292#true} is VALID [2022-04-28 10:09:05,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {2292#true} call #t~ret17 := main(); {2292#true} is VALID [2022-04-28 10:09:05,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2292#true} {2292#true} #94#return; {2292#true} is VALID [2022-04-28 10:09:05,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {2292#true} assume true; {2292#true} is VALID [2022-04-28 10:09:05,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {2292#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2292#true} is VALID [2022-04-28 10:09:05,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {2292#true} call ULTIMATE.init(); {2292#true} is VALID [2022-04-28 10:09:05,934 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-28 10:09:05,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275408873] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:05,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:05,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-28 10:09:05,935 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:05,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [931187990] [2022-04-28 10:09:05,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [931187990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:05,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:05,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:09:05,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900493330] [2022-04-28 10:09:05,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:05,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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-28 10:09:05,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:05,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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-28 10:09:05,951 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-28 10:09:05,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:09:05,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:05,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:09:05,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:09:05,952 INFO L87 Difference]: Start difference. First operand 64 states and 87 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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-28 10:09:06,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:06,289 INFO L93 Difference]: Finished difference Result 108 states and 154 transitions. [2022-04-28 10:09:06,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:09:06,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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-28 10:09:06,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:06,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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-28 10:09:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-04-28 10:09:06,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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-28 10:09:06,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-04-28 10:09:06,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2022-04-28 10:09:06,341 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-28 10:09:06,343 INFO L225 Difference]: With dead ends: 108 [2022-04-28 10:09:06,343 INFO L226 Difference]: Without dead ends: 97 [2022-04-28 10:09:06,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-28 10:09:06,344 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 38 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:06,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 37 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:09:06,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-28 10:09:06,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 73. [2022-04-28 10:09:06,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:06,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 73 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:06,468 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 73 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:06,468 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 73 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:06,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:06,471 INFO L93 Difference]: Finished difference Result 97 states and 138 transitions. [2022-04-28 10:09:06,471 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 138 transitions. [2022-04-28 10:09:06,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:06,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:06,472 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states. [2022-04-28 10:09:06,472 INFO L87 Difference]: Start difference. First operand has 73 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states. [2022-04-28 10:09:06,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:06,475 INFO L93 Difference]: Finished difference Result 97 states and 138 transitions. [2022-04-28 10:09:06,476 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 138 transitions. [2022-04-28 10:09:06,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:06,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:06,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:06,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:06,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:06,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 100 transitions. [2022-04-28 10:09:06,478 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 100 transitions. Word has length 21 [2022-04-28 10:09:06,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:06,479 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 100 transitions. [2022-04-28 10:09:06,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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-28 10:09:06,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 100 transitions. [2022-04-28 10:09:06,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:06,600 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 100 transitions. [2022-04-28 10:09:06,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:09:06,600 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:06,601 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:06,625 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-28 10:09:06,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:06,801 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:06,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:06,802 INFO L85 PathProgramCache]: Analyzing trace with hash 830872025, now seen corresponding path program 7 times [2022-04-28 10:09:06,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:06,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1064227194] [2022-04-28 10:09:06,804 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:06,805 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:06,805 INFO L85 PathProgramCache]: Analyzing trace with hash 830872025, now seen corresponding path program 8 times [2022-04-28 10:09:06,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:06,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958370448] [2022-04-28 10:09:06,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:06,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:06,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:06,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {2996#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2985#true} is VALID [2022-04-28 10:09:06,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {2985#true} assume true; {2985#true} is VALID [2022-04-28 10:09:06,910 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2985#true} {2985#true} #94#return; {2985#true} is VALID [2022-04-28 10:09:06,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {2985#true} call ULTIMATE.init(); {2996#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:06,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {2996#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2985#true} is VALID [2022-04-28 10:09:06,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {2985#true} assume true; {2985#true} is VALID [2022-04-28 10:09:06,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2985#true} {2985#true} #94#return; {2985#true} is VALID [2022-04-28 10:09:06,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {2985#true} call #t~ret17 := main(); {2985#true} is VALID [2022-04-28 10:09:06,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {2985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2990#(= main_~y~0 0)} is VALID [2022-04-28 10:09:06,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {2990#(= 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; {2991#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:06,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {2991#(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; {2992#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:06,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {2992#(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; {2993#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:06,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {2993#(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; {2994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:06,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {2994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:06,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {2994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {2995#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:06,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {2995#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-28 10:09:06,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {2986#false} assume !(~y~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-28 10:09:06,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {2986#false} assume !(~x~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-28 10:09:06,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {2986#false} assume !(~z~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-28 10:09:06,916 INFO L290 TraceCheckUtils]: 16: Hoare triple {2986#false} assume !(~y~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-28 10:09:06,916 INFO L272 TraceCheckUtils]: 17: Hoare triple {2986#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2986#false} is VALID [2022-04-28 10:09:06,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {2986#false} ~cond := #in~cond; {2986#false} is VALID [2022-04-28 10:09:06,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {2986#false} assume 0 == ~cond; {2986#false} is VALID [2022-04-28 10:09:06,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {2986#false} assume !false; {2986#false} is VALID [2022-04-28 10:09:06,917 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-28 10:09:06,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:06,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958370448] [2022-04-28 10:09:06,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958370448] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:06,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80991511] [2022-04-28 10:09:06,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:06,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:06,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:06,919 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-28 10:09:06,920 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-28 10:09:06,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:06,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:06,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 10:09:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:06,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:07,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {2985#true} call ULTIMATE.init(); {2985#true} is VALID [2022-04-28 10:09:07,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {2985#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2985#true} is VALID [2022-04-28 10:09:07,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {2985#true} assume true; {2985#true} is VALID [2022-04-28 10:09:07,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2985#true} {2985#true} #94#return; {2985#true} is VALID [2022-04-28 10:09:07,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {2985#true} call #t~ret17 := main(); {2985#true} is VALID [2022-04-28 10:09:07,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {2985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2990#(= main_~y~0 0)} is VALID [2022-04-28 10:09:07,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {2990#(= 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; {2991#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:07,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {2991#(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; {2992#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:07,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {2992#(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; {2993#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:07,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {2993#(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; {2994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:07,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {2994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:07,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {2994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {3033#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:07,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {3033#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-28 10:09:07,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {2986#false} assume !(~y~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-28 10:09:07,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {2986#false} assume !(~x~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-28 10:09:07,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {2986#false} assume !(~z~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-28 10:09:07,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {2986#false} assume !(~y~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-28 10:09:07,208 INFO L272 TraceCheckUtils]: 17: Hoare triple {2986#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2986#false} is VALID [2022-04-28 10:09:07,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {2986#false} ~cond := #in~cond; {2986#false} is VALID [2022-04-28 10:09:07,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {2986#false} assume 0 == ~cond; {2986#false} is VALID [2022-04-28 10:09:07,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {2986#false} assume !false; {2986#false} is VALID [2022-04-28 10:09:07,209 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-28 10:09:07,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:07,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {2986#false} assume !false; {2986#false} is VALID [2022-04-28 10:09:07,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {2986#false} assume 0 == ~cond; {2986#false} is VALID [2022-04-28 10:09:07,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {2986#false} ~cond := #in~cond; {2986#false} is VALID [2022-04-28 10:09:07,366 INFO L272 TraceCheckUtils]: 17: Hoare triple {2986#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2986#false} is VALID [2022-04-28 10:09:07,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {2986#false} assume !(~y~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-28 10:09:07,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {2986#false} assume !(~z~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-28 10:09:07,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {2986#false} assume !(~x~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-28 10:09:07,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {2986#false} assume !(~y~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-28 10:09:07,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {3085#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-28 10:09:07,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {3089#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {3085#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:07,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {3089#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {3089#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:07,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {3096#(< 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; {3089#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:07,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {3100#(< 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; {3096#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:07,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {3104#(< 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; {3100#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:07,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {3108#(< 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; {3104#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:07,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {2985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3108#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:07,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {2985#true} call #t~ret17 := main(); {2985#true} is VALID [2022-04-28 10:09:07,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2985#true} {2985#true} #94#return; {2985#true} is VALID [2022-04-28 10:09:07,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {2985#true} assume true; {2985#true} is VALID [2022-04-28 10:09:07,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {2985#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2985#true} is VALID [2022-04-28 10:09:07,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {2985#true} call ULTIMATE.init(); {2985#true} is VALID [2022-04-28 10:09:07,374 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-28 10:09:07,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80991511] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:07,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:07,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-28 10:09:07,375 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:07,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1064227194] [2022-04-28 10:09:07,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1064227194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:07,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:07,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:09:07,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709201693] [2022-04-28 10:09:07,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:07,376 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 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-28 10:09:07,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:07,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:07,391 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-28 10:09:07,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:09:07,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:07,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:09:07,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:09:07,392 INFO L87 Difference]: Start difference. First operand 73 states and 100 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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-28 10:09:08,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:08,292 INFO L93 Difference]: Finished difference Result 119 states and 180 transitions. [2022-04-28 10:09:08,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:09:08,292 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 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-28 10:09:08,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:08,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:08,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2022-04-28 10:09:08,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:08,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2022-04-28 10:09:08,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 99 transitions. [2022-04-28 10:09:08,394 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-28 10:09:08,396 INFO L225 Difference]: With dead ends: 119 [2022-04-28 10:09:08,396 INFO L226 Difference]: Without dead ends: 108 [2022-04-28 10:09:08,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:09:08,397 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 71 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:08,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 70 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:09:08,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-28 10:09:08,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 86. [2022-04-28 10:09:08,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:08,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 86 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 81 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:08,570 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 86 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 81 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:08,572 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 86 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 81 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:08,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:08,575 INFO L93 Difference]: Finished difference Result 108 states and 149 transitions. [2022-04-28 10:09:08,575 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 149 transitions. [2022-04-28 10:09:08,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:08,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:08,576 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 81 states have internal predecessors, (115), 3 states have call successors, (3), 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 108 states. [2022-04-28 10:09:08,576 INFO L87 Difference]: Start difference. First operand has 86 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 81 states have internal predecessors, (115), 3 states have call successors, (3), 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 108 states. [2022-04-28 10:09:08,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:08,580 INFO L93 Difference]: Finished difference Result 108 states and 149 transitions. [2022-04-28 10:09:08,580 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 149 transitions. [2022-04-28 10:09:08,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:08,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:08,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:08,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:08,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 81 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:08,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 119 transitions. [2022-04-28 10:09:08,583 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 119 transitions. Word has length 21 [2022-04-28 10:09:08,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:08,583 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 119 transitions. [2022-04-28 10:09:08,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:08,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 119 transitions. [2022-04-28 10:09:08,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:08,735 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 119 transitions. [2022-04-28 10:09:08,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:09:08,736 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:08,736 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:08,752 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-28 10:09:08,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:08,940 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:08,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:08,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1281409098, now seen corresponding path program 9 times [2022-04-28 10:09:08,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:08,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [189091672] [2022-04-28 10:09:08,942 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:08,942 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:08,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1281409098, now seen corresponding path program 10 times [2022-04-28 10:09:08,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:08,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443592866] [2022-04-28 10:09:08,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:08,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:09,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:09,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {3779#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3767#true} is VALID [2022-04-28 10:09:09,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {3767#true} assume true; {3767#true} is VALID [2022-04-28 10:09:09,098 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3767#true} {3767#true} #94#return; {3767#true} is VALID [2022-04-28 10:09:09,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {3767#true} call ULTIMATE.init(); {3779#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:09,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {3779#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3767#true} is VALID [2022-04-28 10:09:09,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {3767#true} assume true; {3767#true} is VALID [2022-04-28 10:09:09,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3767#true} {3767#true} #94#return; {3767#true} is VALID [2022-04-28 10:09:09,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {3767#true} call #t~ret17 := main(); {3767#true} is VALID [2022-04-28 10:09:09,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {3767#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3772#(= main_~y~0 0)} is VALID [2022-04-28 10:09:09,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {3772#(= 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; {3773#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:09,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {3773#(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; {3774#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:09,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {3774#(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; {3775#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:09,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {3775#(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; {3776#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:09,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {3776#(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; {3777#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:09,103 INFO L290 TraceCheckUtils]: 11: Hoare triple {3777#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {3777#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:09,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {3777#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {3778#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:09,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {3778#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-28 10:09:09,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {3768#false} assume !(~y~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-28 10:09:09,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {3768#false} assume !(~x~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-28 10:09:09,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {3768#false} assume !(~z~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-28 10:09:09,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {3768#false} assume !(~y~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-28 10:09:09,105 INFO L272 TraceCheckUtils]: 18: Hoare triple {3768#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3768#false} is VALID [2022-04-28 10:09:09,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {3768#false} ~cond := #in~cond; {3768#false} is VALID [2022-04-28 10:09:09,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {3768#false} assume 0 == ~cond; {3768#false} is VALID [2022-04-28 10:09:09,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {3768#false} assume !false; {3768#false} is VALID [2022-04-28 10:09:09,106 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:09,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:09,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443592866] [2022-04-28 10:09:09,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443592866] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:09,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386051709] [2022-04-28 10:09:09,106 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:09,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:09,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:09,108 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-28 10:09:09,117 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-28 10:09:09,151 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:09,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:09,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 10:09:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:09,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:09,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {3767#true} call ULTIMATE.init(); {3767#true} is VALID [2022-04-28 10:09:09,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {3767#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3767#true} is VALID [2022-04-28 10:09:09,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {3767#true} assume true; {3767#true} is VALID [2022-04-28 10:09:09,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3767#true} {3767#true} #94#return; {3767#true} is VALID [2022-04-28 10:09:09,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {3767#true} call #t~ret17 := main(); {3767#true} is VALID [2022-04-28 10:09:09,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {3767#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3772#(= main_~y~0 0)} is VALID [2022-04-28 10:09:09,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {3772#(= 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; {3773#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:09,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {3773#(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; {3774#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:09,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {3774#(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; {3775#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:09,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {3775#(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; {3776#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:09,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {3776#(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; {3777#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:09,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {3777#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {3777#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:09,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {3777#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {3819#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:09,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {3819#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-28 10:09:09,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {3768#false} assume !(~y~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-28 10:09:09,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {3768#false} assume !(~x~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-28 10:09:09,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {3768#false} assume !(~z~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-28 10:09:09,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {3768#false} assume !(~y~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-28 10:09:09,386 INFO L272 TraceCheckUtils]: 18: Hoare triple {3768#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3768#false} is VALID [2022-04-28 10:09:09,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {3768#false} ~cond := #in~cond; {3768#false} is VALID [2022-04-28 10:09:09,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {3768#false} assume 0 == ~cond; {3768#false} is VALID [2022-04-28 10:09:09,386 INFO L290 TraceCheckUtils]: 21: Hoare triple {3768#false} assume !false; {3768#false} is VALID [2022-04-28 10:09:09,386 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:09,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:09,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {3768#false} assume !false; {3768#false} is VALID [2022-04-28 10:09:09,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {3768#false} assume 0 == ~cond; {3768#false} is VALID [2022-04-28 10:09:09,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {3768#false} ~cond := #in~cond; {3768#false} is VALID [2022-04-28 10:09:09,559 INFO L272 TraceCheckUtils]: 18: Hoare triple {3768#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3768#false} is VALID [2022-04-28 10:09:09,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {3768#false} assume !(~y~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-28 10:09:09,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {3768#false} assume !(~z~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-28 10:09:09,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {3768#false} assume !(~x~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-28 10:09:09,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {3768#false} assume !(~y~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-28 10:09:09,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {3871#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-28 10:09:09,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {3875#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {3871#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:09,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {3875#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {3875#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:09,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {3882#(< 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; {3875#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:09,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {3886#(< 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; {3882#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:09,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {3890#(< 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; {3886#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:09,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {3894#(< 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; {3890#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:09,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {3898#(< 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; {3894#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:09,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {3767#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3898#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:09,566 INFO L272 TraceCheckUtils]: 4: Hoare triple {3767#true} call #t~ret17 := main(); {3767#true} is VALID [2022-04-28 10:09:09,566 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3767#true} {3767#true} #94#return; {3767#true} is VALID [2022-04-28 10:09:09,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {3767#true} assume true; {3767#true} is VALID [2022-04-28 10:09:09,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {3767#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3767#true} is VALID [2022-04-28 10:09:09,566 INFO L272 TraceCheckUtils]: 0: Hoare triple {3767#true} call ULTIMATE.init(); {3767#true} is VALID [2022-04-28 10:09:09,566 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:09,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386051709] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:09,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:09,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-28 10:09:09,567 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:09,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [189091672] [2022-04-28 10:09:09,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [189091672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:09,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:09,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:09:09,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757550491] [2022-04-28 10:09:09,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:09,568 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 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-28 10:09:09,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:09,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 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-28 10:09:09,587 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-28 10:09:09,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:09:09,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:09,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:09:09,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:09:09,589 INFO L87 Difference]: Start difference. First operand 86 states and 119 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 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-28 10:09:10,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:10,762 INFO L93 Difference]: Finished difference Result 137 states and 209 transitions. [2022-04-28 10:09:10,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:09:10,787 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 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-28 10:09:10,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:10,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 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-28 10:09:10,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2022-04-28 10:09:10,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 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-28 10:09:10,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2022-04-28 10:09:10,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 112 transitions. [2022-04-28 10:09:10,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:10,894 INFO L225 Difference]: With dead ends: 137 [2022-04-28 10:09:10,894 INFO L226 Difference]: Without dead ends: 126 [2022-04-28 10:09:10,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2022-04-28 10:09:10,895 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 89 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:10,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 79 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:09:10,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-04-28 10:09:11,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 99. [2022-04-28 10:09:11,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:11,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 99 states, 94 states have (on average 1.425531914893617) internal successors, (134), 94 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:11,076 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 99 states, 94 states have (on average 1.425531914893617) internal successors, (134), 94 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:11,076 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 99 states, 94 states have (on average 1.425531914893617) internal successors, (134), 94 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:11,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:11,080 INFO L93 Difference]: Finished difference Result 126 states and 175 transitions. [2022-04-28 10:09:11,080 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 175 transitions. [2022-04-28 10:09:11,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:11,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:11,080 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 94 states have (on average 1.425531914893617) internal successors, (134), 94 states have internal predecessors, (134), 3 states have call successors, (3), 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 126 states. [2022-04-28 10:09:11,081 INFO L87 Difference]: Start difference. First operand has 99 states, 94 states have (on average 1.425531914893617) internal successors, (134), 94 states have internal predecessors, (134), 3 states have call successors, (3), 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 126 states. [2022-04-28 10:09:11,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:11,083 INFO L93 Difference]: Finished difference Result 126 states and 175 transitions. [2022-04-28 10:09:11,083 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 175 transitions. [2022-04-28 10:09:11,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:11,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:11,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:11,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:11,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.425531914893617) internal successors, (134), 94 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:11,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2022-04-28 10:09:11,086 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 22 [2022-04-28 10:09:11,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:11,086 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2022-04-28 10:09:11,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 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-28 10:09:11,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 138 transitions. [2022-04-28 10:09:11,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:11,261 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2022-04-28 10:09:11,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:09:11,261 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:11,262 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:11,286 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-28 10:09:11,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:11,462 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:11,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:11,463 INFO L85 PathProgramCache]: Analyzing trace with hash -353925126, now seen corresponding path program 1 times [2022-04-28 10:09:11,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:11,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1892406241] [2022-04-28 10:09:11,466 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:11,466 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:11,466 INFO L85 PathProgramCache]: Analyzing trace with hash -353925126, now seen corresponding path program 2 times [2022-04-28 10:09:11,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:11,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778994014] [2022-04-28 10:09:11,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:11,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:11,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:11,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {4670#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4657#true} is VALID [2022-04-28 10:09:11,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {4657#true} assume true; {4657#true} is VALID [2022-04-28 10:09:11,748 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4657#true} {4657#true} #94#return; {4657#true} is VALID [2022-04-28 10:09:11,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {4657#true} call ULTIMATE.init(); {4670#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:11,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {4670#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4657#true} is VALID [2022-04-28 10:09:11,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {4657#true} assume true; {4657#true} is VALID [2022-04-28 10:09:11,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4657#true} {4657#true} #94#return; {4657#true} is VALID [2022-04-28 10:09:11,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {4657#true} call #t~ret17 := main(); {4657#true} is VALID [2022-04-28 10:09:11,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {4657#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4662#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:09:11,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {4662#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= 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; {4663#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) main_~y~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-28 10:09:11,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {4663#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) main_~y~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} assume !(~x~0 % 4294967296 > 0); {4664#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} is VALID [2022-04-28 10:09:11,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {4664#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} ~z~0 := ~y~0; {4665#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:11,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {4665#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~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; {4666#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:11,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {4666#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {4666#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:11,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {4666#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~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; {4665#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:11,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {4665#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {4665#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:11,768 INFO L290 TraceCheckUtils]: 13: Hoare triple {4665#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~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; {4665#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:11,769 INFO L290 TraceCheckUtils]: 14: Hoare triple {4665#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {4665#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:11,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {4665#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4666#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:11,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {4666#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {4666#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:11,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {4666#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:11,786 INFO L290 TraceCheckUtils]: 18: Hoare triple {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:11,787 INFO L272 TraceCheckUtils]: 19: Hoare triple {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:09:11,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {4668#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4669#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:09:11,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {4669#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4658#false} is VALID [2022-04-28 10:09:11,788 INFO L290 TraceCheckUtils]: 22: Hoare triple {4658#false} assume !false; {4658#false} is VALID [2022-04-28 10:09:11,788 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-28 10:09:11,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:11,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778994014] [2022-04-28 10:09:11,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778994014] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:11,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090231284] [2022-04-28 10:09:11,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:11,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:11,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:11,790 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-28 10:09:11,798 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-28 10:09:11,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:11,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:11,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 10:09:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:11,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:12,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {4657#true} call ULTIMATE.init(); {4657#true} is VALID [2022-04-28 10:09:12,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {4657#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4657#true} is VALID [2022-04-28 10:09:12,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {4657#true} assume true; {4657#true} is VALID [2022-04-28 10:09:12,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4657#true} {4657#true} #94#return; {4657#true} is VALID [2022-04-28 10:09:12,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {4657#true} call #t~ret17 := main(); {4657#true} is VALID [2022-04-28 10:09:12,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {4657#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4662#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:09:12,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {4662#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= 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; {4692#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= (+ (- 1) main_~y~0) 0) (< 0 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-28 10:09:12,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {4692#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= (+ (- 1) main_~y~0) 0) (< 0 (mod (+ main_~x~0 1) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {4696#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-28 10:09:12,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {4696#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} ~z~0 := ~y~0; {4700#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-28 10:09:12,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {4700#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 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; {4704#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} is VALID [2022-04-28 10:09:12,304 INFO L290 TraceCheckUtils]: 10: Hoare triple {4704#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} assume !(~z~0 % 4294967296 > 0); {4704#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} is VALID [2022-04-28 10:09:12,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {4704#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 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; {4700#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-28 10:09:12,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {4700#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {4700#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-28 10:09:12,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {4700#(and (= main_~z~0 1) (<= (mod (+ main_~n~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; {4700#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-28 10:09:12,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {4700#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {4700#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-28 10:09:12,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {4700#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4704#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} is VALID [2022-04-28 10:09:12,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {4704#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} assume !(~z~0 % 4294967296 > 0); {4704#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} is VALID [2022-04-28 10:09:12,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {4704#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {4700#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-28 10:09:12,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {4700#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {4700#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-28 10:09:12,309 INFO L272 TraceCheckUtils]: 19: Hoare triple {4700#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4735#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:09:12,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {4735#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4739#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:09:12,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {4739#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4658#false} is VALID [2022-04-28 10:09:12,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {4658#false} assume !false; {4658#false} is VALID [2022-04-28 10:09:12,310 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-28 10:09:12,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:12,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {4658#false} assume !false; {4658#false} is VALID [2022-04-28 10:09:12,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {4739#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4658#false} is VALID [2022-04-28 10:09:12,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {4735#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4739#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:09:12,970 INFO L272 TraceCheckUtils]: 19: Hoare triple {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4735#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:09:12,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:12,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {4761#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:12,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {4761#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {4761#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:12,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4761#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:12,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:12,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~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; {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:12,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:12,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {4761#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~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; {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:12,977 INFO L290 TraceCheckUtils]: 10: Hoare triple {4761#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {4761#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:12,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {4786#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (not (< 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; {4761#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:12,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {4790#(or (not (< 0 (mod main_~y~0 4294967296))) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} ~z~0 := ~y~0; {4786#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 10:09:12,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {4794#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {4790#(or (not (< 0 (mod main_~y~0 4294967296))) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 10:09:12,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {4798#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 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; {4794#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 10:09:12,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {4657#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4798#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-28 10:09:12,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {4657#true} call #t~ret17 := main(); {4657#true} is VALID [2022-04-28 10:09:12,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4657#true} {4657#true} #94#return; {4657#true} is VALID [2022-04-28 10:09:12,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {4657#true} assume true; {4657#true} is VALID [2022-04-28 10:09:12,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {4657#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4657#true} is VALID [2022-04-28 10:09:12,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {4657#true} call ULTIMATE.init(); {4657#true} is VALID [2022-04-28 10:09:12,986 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-28 10:09:12,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090231284] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:12,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:12,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 22 [2022-04-28 10:09:12,986 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:12,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1892406241] [2022-04-28 10:09:12,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1892406241] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:12,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:12,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:09:12,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733059511] [2022-04-28 10:09:12,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:12,988 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) 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-28 10:09:12,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:12,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.7272727272727273) 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-28 10:09:13,026 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-28 10:09:13,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:09:13,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:13,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:09:13,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:09:13,027 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) 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-28 10:09:14,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:14,051 INFO L93 Difference]: Finished difference Result 117 states and 157 transitions. [2022-04-28 10:09:14,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:09:14,052 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) 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-28 10:09:14,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:14,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) 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-28 10:09:14,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2022-04-28 10:09:14,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) 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-28 10:09:14,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2022-04-28 10:09:14,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 44 transitions. [2022-04-28 10:09:14,106 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-28 10:09:14,107 INFO L225 Difference]: With dead ends: 117 [2022-04-28 10:09:14,107 INFO L226 Difference]: Without dead ends: 108 [2022-04-28 10:09:14,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=796, Unknown=0, NotChecked=0, Total=930 [2022-04-28 10:09:14,109 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 37 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:14,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 47 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:09:14,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-28 10:09:14,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 99. [2022-04-28 10:09:14,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:14,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 99 states, 94 states have (on average 1.425531914893617) internal successors, (134), 94 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:14,383 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 99 states, 94 states have (on average 1.425531914893617) internal successors, (134), 94 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:14,385 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 99 states, 94 states have (on average 1.425531914893617) internal successors, (134), 94 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:14,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:14,387 INFO L93 Difference]: Finished difference Result 108 states and 147 transitions. [2022-04-28 10:09:14,387 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 147 transitions. [2022-04-28 10:09:14,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:14,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:14,388 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 94 states have (on average 1.425531914893617) internal successors, (134), 94 states have internal predecessors, (134), 3 states have call successors, (3), 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 108 states. [2022-04-28 10:09:14,388 INFO L87 Difference]: Start difference. First operand has 99 states, 94 states have (on average 1.425531914893617) internal successors, (134), 94 states have internal predecessors, (134), 3 states have call successors, (3), 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 108 states. [2022-04-28 10:09:14,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:14,390 INFO L93 Difference]: Finished difference Result 108 states and 147 transitions. [2022-04-28 10:09:14,390 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 147 transitions. [2022-04-28 10:09:14,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:14,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:14,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:14,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:14,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.425531914893617) internal successors, (134), 94 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:14,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2022-04-28 10:09:14,396 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 23 [2022-04-28 10:09:14,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:14,397 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2022-04-28 10:09:14,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) 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-28 10:09:14,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 138 transitions. [2022-04-28 10:09:14,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:14,624 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2022-04-28 10:09:14,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:09:14,624 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:14,624 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:14,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:14,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 10:09:14,832 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:14,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:14,832 INFO L85 PathProgramCache]: Analyzing trace with hash -169119975, now seen corresponding path program 3 times [2022-04-28 10:09:14,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:14,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [620333250] [2022-04-28 10:09:14,834 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:14,835 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:14,835 INFO L85 PathProgramCache]: Analyzing trace with hash -169119975, now seen corresponding path program 4 times [2022-04-28 10:09:14,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:14,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553916389] [2022-04-28 10:09:14,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:14,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:14,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:14,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {5497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5485#true} is VALID [2022-04-28 10:09:14,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {5485#true} assume true; {5485#true} is VALID [2022-04-28 10:09:14,970 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5485#true} {5485#true} #94#return; {5485#true} is VALID [2022-04-28 10:09:14,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {5485#true} call ULTIMATE.init(); {5497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:14,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {5497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5485#true} is VALID [2022-04-28 10:09:14,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {5485#true} assume true; {5485#true} is VALID [2022-04-28 10:09:14,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5485#true} {5485#true} #94#return; {5485#true} is VALID [2022-04-28 10:09:14,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {5485#true} call #t~ret17 := main(); {5485#true} is VALID [2022-04-28 10:09:14,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {5485#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5490#(= main_~y~0 0)} is VALID [2022-04-28 10:09:14,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {5490#(= 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; {5491#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:14,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {5491#(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; {5492#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:14,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {5492#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {5492#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:14,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {5492#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {5493#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:14,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {5493#(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; {5494#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:14,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {5494#(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; {5495#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:09:14,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {5495#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5495#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:09:14,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {5495#(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; {5494#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:14,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {5494#(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; {5496#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:14,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {5496#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {5496#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:14,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {5496#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {5496#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:14,979 INFO L290 TraceCheckUtils]: 17: Hoare triple {5496#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5486#false} is VALID [2022-04-28 10:09:14,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {5486#false} assume !(~y~0 % 4294967296 > 0); {5486#false} is VALID [2022-04-28 10:09:14,979 INFO L272 TraceCheckUtils]: 19: Hoare triple {5486#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5486#false} is VALID [2022-04-28 10:09:14,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {5486#false} ~cond := #in~cond; {5486#false} is VALID [2022-04-28 10:09:14,979 INFO L290 TraceCheckUtils]: 21: Hoare triple {5486#false} assume 0 == ~cond; {5486#false} is VALID [2022-04-28 10:09:14,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {5486#false} assume !false; {5486#false} is VALID [2022-04-28 10:09:14,979 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-28 10:09:14,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:14,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553916389] [2022-04-28 10:09:14,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553916389] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:14,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783157196] [2022-04-28 10:09:14,981 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:14,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:14,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:14,982 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-28 10:09:14,983 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-28 10:09:15,022 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:15,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:15,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 10:09:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:15,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:15,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {5485#true} call ULTIMATE.init(); {5485#true} is VALID [2022-04-28 10:09:15,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {5485#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5485#true} is VALID [2022-04-28 10:09:15,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {5485#true} assume true; {5485#true} is VALID [2022-04-28 10:09:15,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5485#true} {5485#true} #94#return; {5485#true} is VALID [2022-04-28 10:09:15,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {5485#true} call #t~ret17 := main(); {5485#true} is VALID [2022-04-28 10:09:15,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {5485#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5485#true} is VALID [2022-04-28 10:09:15,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {5485#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5519#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:15,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {5519#(< 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; {5523#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:15,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {5523#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {5523#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:15,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {5523#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {5523#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:15,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {5523#(< 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; {5519#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:15,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {5519#(< 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; {5536#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:15,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {5536#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5536#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:15,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {5536#(< 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; {5536#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:15,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {5536#(< 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; {5536#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:15,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {5536#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5536#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:15,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {5536#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {5486#false} is VALID [2022-04-28 10:09:15,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {5486#false} assume !(~z~0 % 4294967296 > 0); {5486#false} is VALID [2022-04-28 10:09:15,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {5486#false} assume !(~y~0 % 4294967296 > 0); {5486#false} is VALID [2022-04-28 10:09:15,137 INFO L272 TraceCheckUtils]: 19: Hoare triple {5486#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5486#false} is VALID [2022-04-28 10:09:15,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {5486#false} ~cond := #in~cond; {5486#false} is VALID [2022-04-28 10:09:15,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {5486#false} assume 0 == ~cond; {5486#false} is VALID [2022-04-28 10:09:15,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {5486#false} assume !false; {5486#false} is VALID [2022-04-28 10:09:15,137 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:09:15,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:15,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {5486#false} assume !false; {5486#false} is VALID [2022-04-28 10:09:15,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {5486#false} assume 0 == ~cond; {5486#false} is VALID [2022-04-28 10:09:15,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {5486#false} ~cond := #in~cond; {5486#false} is VALID [2022-04-28 10:09:15,226 INFO L272 TraceCheckUtils]: 19: Hoare triple {5486#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5486#false} is VALID [2022-04-28 10:09:15,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {5486#false} assume !(~y~0 % 4294967296 > 0); {5486#false} is VALID [2022-04-28 10:09:15,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {5486#false} assume !(~z~0 % 4294967296 > 0); {5486#false} is VALID [2022-04-28 10:09:15,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {5536#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {5486#false} is VALID [2022-04-28 10:09:15,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {5536#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5536#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:15,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {5536#(< 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; {5536#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:15,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {5536#(< 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; {5536#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:15,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {5536#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5536#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:15,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {5519#(< 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; {5536#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:15,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {5523#(< 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; {5519#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:15,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {5523#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {5523#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:15,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {5523#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {5523#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:15,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {5519#(< 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; {5523#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:15,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {5485#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5519#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:15,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {5485#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5485#true} is VALID [2022-04-28 10:09:15,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {5485#true} call #t~ret17 := main(); {5485#true} is VALID [2022-04-28 10:09:15,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5485#true} {5485#true} #94#return; {5485#true} is VALID [2022-04-28 10:09:15,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {5485#true} assume true; {5485#true} is VALID [2022-04-28 10:09:15,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {5485#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5485#true} is VALID [2022-04-28 10:09:15,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {5485#true} call ULTIMATE.init(); {5485#true} is VALID [2022-04-28 10:09:15,232 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:09:15,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783157196] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:15,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:15,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 13 [2022-04-28 10:09:15,233 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:15,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [620333250] [2022-04-28 10:09:15,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [620333250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:15,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:15,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:09:15,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972762324] [2022-04-28 10:09:15,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:15,233 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-28 10:09:15,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:15,234 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-28 10:09:15,250 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-28 10:09:15,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:09:15,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:15,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:09:15,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:09:15,250 INFO L87 Difference]: Start difference. First operand 99 states and 138 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-28 10:09:16,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:16,544 INFO L93 Difference]: Finished difference Result 193 states and 279 transitions. [2022-04-28 10:09:16,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:09:16,544 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-28 10:09:16,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:16,545 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-28 10:09:16,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 115 transitions. [2022-04-28 10:09:16,548 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-28 10:09:16,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 115 transitions. [2022-04-28 10:09:16,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 115 transitions. [2022-04-28 10:09:16,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:16,650 INFO L225 Difference]: With dead ends: 193 [2022-04-28 10:09:16,650 INFO L226 Difference]: Without dead ends: 159 [2022-04-28 10:09:16,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2022-04-28 10:09:16,651 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 66 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:16,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 57 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:09:16,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-04-28 10:09:16,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 122. [2022-04-28 10:09:16,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:16,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:16,954 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:16,954 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:16,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:16,957 INFO L93 Difference]: Finished difference Result 159 states and 207 transitions. [2022-04-28 10:09:16,957 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 207 transitions. [2022-04-28 10:09:16,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:16,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:16,958 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 3 states have call successors, (3), 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 159 states. [2022-04-28 10:09:16,959 INFO L87 Difference]: Start difference. First operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 3 states have call successors, (3), 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 159 states. [2022-04-28 10:09:16,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:16,962 INFO L93 Difference]: Finished difference Result 159 states and 207 transitions. [2022-04-28 10:09:16,962 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 207 transitions. [2022-04-28 10:09:16,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:16,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:16,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:16,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:16,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 166 transitions. [2022-04-28 10:09:16,965 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 166 transitions. Word has length 23 [2022-04-28 10:09:16,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:16,965 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 166 transitions. [2022-04-28 10:09:16,965 INFO L496 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-28 10:09:16,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 122 states and 166 transitions. [2022-04-28 10:09:17,197 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-28 10:09:17,197 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 166 transitions. [2022-04-28 10:09:17,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:09:17,198 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:17,198 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:17,214 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-28 10:09:17,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:17,399 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:17,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:17,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1957352825, now seen corresponding path program 11 times [2022-04-28 10:09:17,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:17,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [696750509] [2022-04-28 10:09:17,411 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:17,411 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:17,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1957352825, now seen corresponding path program 12 times [2022-04-28 10:09:17,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:17,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575255039] [2022-04-28 10:09:17,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:17,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:17,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:17,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {6631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6618#true} is VALID [2022-04-28 10:09:17,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {6618#true} assume true; {6618#true} is VALID [2022-04-28 10:09:17,540 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6618#true} {6618#true} #94#return; {6618#true} is VALID [2022-04-28 10:09:17,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {6618#true} call ULTIMATE.init(); {6631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:17,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {6631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6618#true} is VALID [2022-04-28 10:09:17,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {6618#true} assume true; {6618#true} is VALID [2022-04-28 10:09:17,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6618#true} {6618#true} #94#return; {6618#true} is VALID [2022-04-28 10:09:17,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {6618#true} call #t~ret17 := main(); {6618#true} is VALID [2022-04-28 10:09:17,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {6618#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6623#(= main_~y~0 0)} is VALID [2022-04-28 10:09:17,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {6623#(= 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; {6624#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:17,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {6624#(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; {6625#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:17,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {6625#(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; {6626#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:17,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {6626#(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; {6627#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:17,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {6627#(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; {6628#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:17,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {6628#(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; {6629#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:17,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {6629#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {6629#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:17,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {6629#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {6630#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:09:17,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {6630#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-28 10:09:17,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {6619#false} assume !(~y~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-28 10:09:17,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {6619#false} assume !(~x~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-28 10:09:17,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {6619#false} assume !(~z~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-28 10:09:17,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {6619#false} assume !(~y~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-28 10:09:17,546 INFO L272 TraceCheckUtils]: 19: Hoare triple {6619#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6619#false} is VALID [2022-04-28 10:09:17,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {6619#false} ~cond := #in~cond; {6619#false} is VALID [2022-04-28 10:09:17,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {6619#false} assume 0 == ~cond; {6619#false} is VALID [2022-04-28 10:09:17,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {6619#false} assume !false; {6619#false} is VALID [2022-04-28 10:09:17,547 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:17,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:17,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575255039] [2022-04-28 10:09:17,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575255039] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:17,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17134643] [2022-04-28 10:09:17,547 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:17,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:17,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:17,548 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-28 10:09:17,550 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-28 10:09:17,587 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:09:17,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:17,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 10:09:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:17,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:17,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {6618#true} call ULTIMATE.init(); {6618#true} is VALID [2022-04-28 10:09:17,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {6618#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6618#true} is VALID [2022-04-28 10:09:17,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {6618#true} assume true; {6618#true} is VALID [2022-04-28 10:09:17,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6618#true} {6618#true} #94#return; {6618#true} is VALID [2022-04-28 10:09:17,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {6618#true} call #t~ret17 := main(); {6618#true} is VALID [2022-04-28 10:09:17,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {6618#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6623#(= main_~y~0 0)} is VALID [2022-04-28 10:09:17,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {6623#(= 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; {6624#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:17,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {6624#(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; {6625#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:17,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {6625#(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; {6626#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:17,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {6626#(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; {6627#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:17,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {6627#(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; {6628#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:17,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {6628#(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; {6629#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:17,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {6629#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {6629#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:17,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {6629#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {6674#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:09:17,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {6674#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-28 10:09:17,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {6619#false} assume !(~y~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-28 10:09:17,822 INFO L290 TraceCheckUtils]: 16: Hoare triple {6619#false} assume !(~x~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-28 10:09:17,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {6619#false} assume !(~z~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-28 10:09:17,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {6619#false} assume !(~y~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-28 10:09:17,823 INFO L272 TraceCheckUtils]: 19: Hoare triple {6619#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6619#false} is VALID [2022-04-28 10:09:17,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {6619#false} ~cond := #in~cond; {6619#false} is VALID [2022-04-28 10:09:17,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {6619#false} assume 0 == ~cond; {6619#false} is VALID [2022-04-28 10:09:17,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {6619#false} assume !false; {6619#false} is VALID [2022-04-28 10:09:17,823 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:17,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:17,995 INFO L290 TraceCheckUtils]: 22: Hoare triple {6619#false} assume !false; {6619#false} is VALID [2022-04-28 10:09:17,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {6619#false} assume 0 == ~cond; {6619#false} is VALID [2022-04-28 10:09:17,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {6619#false} ~cond := #in~cond; {6619#false} is VALID [2022-04-28 10:09:17,996 INFO L272 TraceCheckUtils]: 19: Hoare triple {6619#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6619#false} is VALID [2022-04-28 10:09:17,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {6619#false} assume !(~y~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-28 10:09:17,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {6619#false} assume !(~z~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-28 10:09:17,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {6619#false} assume !(~x~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-28 10:09:17,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {6619#false} assume !(~y~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-28 10:09:17,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {6726#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-28 10:09:17,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {6730#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {6726#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:17,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {6730#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {6730#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:17,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {6737#(< 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; {6730#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:17,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {6741#(< 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; {6737#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:18,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {6745#(< 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; {6741#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:18,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {6749#(< 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; {6745#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:18,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {6753#(< 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; {6749#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:18,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {6757#(< 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; {6753#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:18,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {6618#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6757#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:18,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {6618#true} call #t~ret17 := main(); {6618#true} is VALID [2022-04-28 10:09:18,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6618#true} {6618#true} #94#return; {6618#true} is VALID [2022-04-28 10:09:18,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {6618#true} assume true; {6618#true} is VALID [2022-04-28 10:09:18,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {6618#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6618#true} is VALID [2022-04-28 10:09:18,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {6618#true} call ULTIMATE.init(); {6618#true} is VALID [2022-04-28 10:09:18,002 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:18,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17134643] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:18,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:18,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-28 10:09:18,003 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:18,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [696750509] [2022-04-28 10:09:18,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [696750509] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:18,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:18,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:09:18,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997918244] [2022-04-28 10:09:18,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:18,004 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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-28 10:09:18,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:18,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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-28 10:09:18,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-28 10:09:18,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:09:18,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:18,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:09:18,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:09:18,019 INFO L87 Difference]: Start difference. First operand 122 states and 166 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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-28 10:09:19,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:19,458 INFO L93 Difference]: Finished difference Result 184 states and 274 transitions. [2022-04-28 10:09:19,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:09:19,458 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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-28 10:09:19,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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-28 10:09:19,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2022-04-28 10:09:19,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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-28 10:09:19,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2022-04-28 10:09:19,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 125 transitions. [2022-04-28 10:09:19,589 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-28 10:09:19,592 INFO L225 Difference]: With dead ends: 184 [2022-04-28 10:09:19,592 INFO L226 Difference]: Without dead ends: 173 [2022-04-28 10:09:19,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:09:19,593 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 100 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:19,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 92 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:09:19,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-28 10:09:19,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 137. [2022-04-28 10:09:19,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:19,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 137 states, 132 states have (on average 1.393939393939394) internal successors, (184), 132 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:19,899 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 137 states, 132 states have (on average 1.393939393939394) internal successors, (184), 132 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:19,900 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 137 states, 132 states have (on average 1.393939393939394) internal successors, (184), 132 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:19,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:19,903 INFO L93 Difference]: Finished difference Result 173 states and 236 transitions. [2022-04-28 10:09:19,903 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 236 transitions. [2022-04-28 10:09:19,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:19,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:19,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 132 states have (on average 1.393939393939394) internal successors, (184), 132 states have internal predecessors, (184), 3 states have call successors, (3), 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-28 10:09:19,904 INFO L87 Difference]: Start difference. First operand has 137 states, 132 states have (on average 1.393939393939394) internal successors, (184), 132 states have internal predecessors, (184), 3 states have call successors, (3), 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-28 10:09:19,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:19,908 INFO L93 Difference]: Finished difference Result 173 states and 236 transitions. [2022-04-28 10:09:19,908 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 236 transitions. [2022-04-28 10:09:19,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:19,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:19,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:19,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:19,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.393939393939394) internal successors, (184), 132 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:19,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 188 transitions. [2022-04-28 10:09:19,911 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 188 transitions. Word has length 23 [2022-04-28 10:09:19,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:19,911 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 188 transitions. [2022-04-28 10:09:19,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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-28 10:09:19,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 188 transitions. [2022-04-28 10:09:20,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:20,175 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 188 transitions. [2022-04-28 10:09:20,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:09:20,175 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:20,175 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:20,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-28 10:09:20,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 10:09:20,376 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:20,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:20,376 INFO L85 PathProgramCache]: Analyzing trace with hash -720242666, now seen corresponding path program 13 times [2022-04-28 10:09:20,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:20,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1241243040] [2022-04-28 10:09:20,379 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:20,379 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:20,379 INFO L85 PathProgramCache]: Analyzing trace with hash -720242666, now seen corresponding path program 14 times [2022-04-28 10:09:20,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:20,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897500977] [2022-04-28 10:09:20,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:20,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:20,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:20,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {7796#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7782#true} is VALID [2022-04-28 10:09:20,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {7782#true} assume true; {7782#true} is VALID [2022-04-28 10:09:20,528 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7782#true} {7782#true} #94#return; {7782#true} is VALID [2022-04-28 10:09:20,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {7782#true} call ULTIMATE.init(); {7796#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:20,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {7796#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7782#true} is VALID [2022-04-28 10:09:20,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {7782#true} assume true; {7782#true} is VALID [2022-04-28 10:09:20,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7782#true} {7782#true} #94#return; {7782#true} is VALID [2022-04-28 10:09:20,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {7782#true} call #t~ret17 := main(); {7782#true} is VALID [2022-04-28 10:09:20,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {7782#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7787#(= main_~y~0 0)} is VALID [2022-04-28 10:09:20,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {7787#(= 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; {7788#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:20,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {7788#(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; {7789#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:20,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {7789#(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; {7790#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:20,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {7790#(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; {7791#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:20,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {7791#(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; {7792#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:20,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {7792#(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; {7793#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:20,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {7793#(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; {7794#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:20,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {7794#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {7794#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:20,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {7794#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {7795#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:20,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {7795#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-28 10:09:20,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {7783#false} assume !(~y~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-28 10:09:20,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {7783#false} assume !(~x~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-28 10:09:20,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {7783#false} assume !(~z~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-28 10:09:20,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {7783#false} assume !(~y~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-28 10:09:20,542 INFO L272 TraceCheckUtils]: 20: Hoare triple {7783#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7783#false} is VALID [2022-04-28 10:09:20,542 INFO L290 TraceCheckUtils]: 21: Hoare triple {7783#false} ~cond := #in~cond; {7783#false} is VALID [2022-04-28 10:09:20,543 INFO L290 TraceCheckUtils]: 22: Hoare triple {7783#false} assume 0 == ~cond; {7783#false} is VALID [2022-04-28 10:09:20,543 INFO L290 TraceCheckUtils]: 23: Hoare triple {7783#false} assume !false; {7783#false} is VALID [2022-04-28 10:09:20,543 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:20,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:20,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897500977] [2022-04-28 10:09:20,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897500977] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:20,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325725030] [2022-04-28 10:09:20,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:20,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:20,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:20,544 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-28 10:09:20,545 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-28 10:09:20,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:20,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:20,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 10:09:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:20,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:20,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {7782#true} call ULTIMATE.init(); {7782#true} is VALID [2022-04-28 10:09:20,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {7782#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7782#true} is VALID [2022-04-28 10:09:20,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {7782#true} assume true; {7782#true} is VALID [2022-04-28 10:09:20,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7782#true} {7782#true} #94#return; {7782#true} is VALID [2022-04-28 10:09:20,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {7782#true} call #t~ret17 := main(); {7782#true} is VALID [2022-04-28 10:09:20,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {7782#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7787#(= main_~y~0 0)} is VALID [2022-04-28 10:09:20,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {7787#(= 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; {7788#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:20,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {7788#(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; {7789#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:20,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {7789#(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; {7790#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:20,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {7790#(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; {7791#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:20,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {7791#(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; {7792#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:20,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {7792#(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; {7793#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:20,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {7793#(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; {7794#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:20,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {7794#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {7794#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:20,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {7794#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {7842#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:09:20,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {7842#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-28 10:09:20,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {7783#false} assume !(~y~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-28 10:09:20,814 INFO L290 TraceCheckUtils]: 17: Hoare triple {7783#false} assume !(~x~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-28 10:09:20,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {7783#false} assume !(~z~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-28 10:09:20,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {7783#false} assume !(~y~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-28 10:09:20,814 INFO L272 TraceCheckUtils]: 20: Hoare triple {7783#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7783#false} is VALID [2022-04-28 10:09:20,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {7783#false} ~cond := #in~cond; {7783#false} is VALID [2022-04-28 10:09:20,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {7783#false} assume 0 == ~cond; {7783#false} is VALID [2022-04-28 10:09:20,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {7783#false} assume !false; {7783#false} is VALID [2022-04-28 10:09:20,815 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:20,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:21,027 INFO L290 TraceCheckUtils]: 23: Hoare triple {7783#false} assume !false; {7783#false} is VALID [2022-04-28 10:09:21,027 INFO L290 TraceCheckUtils]: 22: Hoare triple {7783#false} assume 0 == ~cond; {7783#false} is VALID [2022-04-28 10:09:21,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {7783#false} ~cond := #in~cond; {7783#false} is VALID [2022-04-28 10:09:21,027 INFO L272 TraceCheckUtils]: 20: Hoare triple {7783#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7783#false} is VALID [2022-04-28 10:09:21,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {7783#false} assume !(~y~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-28 10:09:21,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {7783#false} assume !(~z~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-28 10:09:21,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {7783#false} assume !(~x~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-28 10:09:21,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {7783#false} assume !(~y~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-28 10:09:21,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {7894#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-28 10:09:21,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {7898#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {7894#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:21,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {7898#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {7898#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:21,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {7905#(< 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; {7898#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:21,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {7909#(< 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; {7905#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:21,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {7913#(< 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; {7909#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:21,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {7917#(< 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; {7913#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:21,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {7921#(< 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; {7917#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:21,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {7925#(< 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; {7921#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:21,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {7929#(< 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; {7925#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:21,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {7782#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7929#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:21,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {7782#true} call #t~ret17 := main(); {7782#true} is VALID [2022-04-28 10:09:21,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7782#true} {7782#true} #94#return; {7782#true} is VALID [2022-04-28 10:09:21,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {7782#true} assume true; {7782#true} is VALID [2022-04-28 10:09:21,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {7782#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7782#true} is VALID [2022-04-28 10:09:21,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {7782#true} call ULTIMATE.init(); {7782#true} is VALID [2022-04-28 10:09:21,034 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:21,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325725030] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:21,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:21,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-28 10:09:21,034 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:21,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1241243040] [2022-04-28 10:09:21,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1241243040] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:21,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:21,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:09:21,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463328304] [2022-04-28 10:09:21,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:21,035 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 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-28 10:09:21,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:21,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 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-28 10:09:21,053 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-28 10:09:21,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:09:21,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:21,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:09:21,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:09:21,054 INFO L87 Difference]: Start difference. First operand 137 states and 188 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 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-28 10:09:22,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:22,813 INFO L93 Difference]: Finished difference Result 204 states and 306 transitions. [2022-04-28 10:09:22,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:09:22,813 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 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-28 10:09:22,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:22,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 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-28 10:09:22,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2022-04-28 10:09:22,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 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-28 10:09:22,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2022-04-28 10:09:22,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 138 transitions. [2022-04-28 10:09:22,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:22,959 INFO L225 Difference]: With dead ends: 204 [2022-04-28 10:09:22,959 INFO L226 Difference]: Without dead ends: 193 [2022-04-28 10:09:22,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2022-04-28 10:09:22,960 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 117 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:22,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 101 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:09:22,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-04-28 10:09:23,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 152. [2022-04-28 10:09:23,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:23,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand has 152 states, 147 states have (on average 1.401360544217687) internal successors, (206), 147 states have internal predecessors, (206), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:23,385 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand has 152 states, 147 states have (on average 1.401360544217687) internal successors, (206), 147 states have internal predecessors, (206), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:23,386 INFO L87 Difference]: Start difference. First operand 193 states. Second operand has 152 states, 147 states have (on average 1.401360544217687) internal successors, (206), 147 states have internal predecessors, (206), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:23,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:23,390 INFO L93 Difference]: Finished difference Result 193 states and 265 transitions. [2022-04-28 10:09:23,390 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 265 transitions. [2022-04-28 10:09:23,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:23,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:23,391 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 147 states have (on average 1.401360544217687) internal successors, (206), 147 states have internal predecessors, (206), 3 states have call successors, (3), 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 193 states. [2022-04-28 10:09:23,392 INFO L87 Difference]: Start difference. First operand has 152 states, 147 states have (on average 1.401360544217687) internal successors, (206), 147 states have internal predecessors, (206), 3 states have call successors, (3), 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 193 states. [2022-04-28 10:09:23,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:23,395 INFO L93 Difference]: Finished difference Result 193 states and 265 transitions. [2022-04-28 10:09:23,395 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 265 transitions. [2022-04-28 10:09:23,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:23,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:23,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:23,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:23,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 147 states have (on average 1.401360544217687) internal successors, (206), 147 states have internal predecessors, (206), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:23,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 210 transitions. [2022-04-28 10:09:23,399 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 210 transitions. Word has length 24 [2022-04-28 10:09:23,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:23,399 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 210 transitions. [2022-04-28 10:09:23,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 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-28 10:09:23,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 152 states and 210 transitions. [2022-04-28 10:09:23,674 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-28 10:09:23,675 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 210 transitions. [2022-04-28 10:09:23,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:09:23,675 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:23,675 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:23,691 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-28 10:09:23,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 10:09:23,876 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:23,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:23,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1256652584, now seen corresponding path program 3 times [2022-04-28 10:09:23,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:23,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1927757856] [2022-04-28 10:09:23,878 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:23,878 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:23,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1256652584, now seen corresponding path program 4 times [2022-04-28 10:09:23,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:23,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726377784] [2022-04-28 10:09:23,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:23,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:23,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:23,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {9073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9066#true} is VALID [2022-04-28 10:09:23,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {9066#true} assume true; {9066#true} is VALID [2022-04-28 10:09:23,948 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9066#true} {9066#true} #94#return; {9066#true} is VALID [2022-04-28 10:09:23,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {9066#true} call ULTIMATE.init(); {9073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:23,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {9073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9066#true} is VALID [2022-04-28 10:09:23,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {9066#true} assume true; {9066#true} is VALID [2022-04-28 10:09:23,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9066#true} {9066#true} #94#return; {9066#true} is VALID [2022-04-28 10:09:23,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {9066#true} call #t~ret17 := main(); {9066#true} is VALID [2022-04-28 10:09:23,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {9066#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9066#true} is VALID [2022-04-28 10:09:23,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {9066#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9066#true} is VALID [2022-04-28 10:09:23,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {9066#true} assume !(~x~0 % 4294967296 > 0); {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:23,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:23,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {9071#(<= 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; {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:23,951 INFO L290 TraceCheckUtils]: 10: Hoare triple {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:23,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {9072#(<= 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; {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:23,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:23,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {9072#(<= 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; {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:23,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {9071#(<= 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; {9067#false} is VALID [2022-04-28 10:09:23,954 INFO L290 TraceCheckUtils]: 15: Hoare triple {9067#false} assume !(~x~0 % 4294967296 > 0); {9067#false} is VALID [2022-04-28 10:09:23,954 INFO L290 TraceCheckUtils]: 16: Hoare triple {9067#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9067#false} is VALID [2022-04-28 10:09:23,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {9067#false} assume !(~z~0 % 4294967296 > 0); {9067#false} is VALID [2022-04-28 10:09:23,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {9067#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {9067#false} is VALID [2022-04-28 10:09:23,954 INFO L290 TraceCheckUtils]: 19: Hoare triple {9067#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {9067#false} is VALID [2022-04-28 10:09:23,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {9067#false} assume !(~y~0 % 4294967296 > 0); {9067#false} is VALID [2022-04-28 10:09:23,954 INFO L272 TraceCheckUtils]: 21: Hoare triple {9067#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9067#false} is VALID [2022-04-28 10:09:23,954 INFO L290 TraceCheckUtils]: 22: Hoare triple {9067#false} ~cond := #in~cond; {9067#false} is VALID [2022-04-28 10:09:23,954 INFO L290 TraceCheckUtils]: 23: Hoare triple {9067#false} assume 0 == ~cond; {9067#false} is VALID [2022-04-28 10:09:23,954 INFO L290 TraceCheckUtils]: 24: Hoare triple {9067#false} assume !false; {9067#false} is VALID [2022-04-28 10:09:23,955 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:09:23,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:23,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726377784] [2022-04-28 10:09:23,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726377784] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:23,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32420406] [2022-04-28 10:09:23,956 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:23,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:23,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:23,959 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-28 10:09:23,961 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-28 10:09:24,002 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:24,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:24,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:09:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:24,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:24,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {9066#true} call ULTIMATE.init(); {9066#true} is VALID [2022-04-28 10:09:24,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {9066#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9066#true} is VALID [2022-04-28 10:09:24,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {9066#true} assume true; {9066#true} is VALID [2022-04-28 10:09:24,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9066#true} {9066#true} #94#return; {9066#true} is VALID [2022-04-28 10:09:24,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {9066#true} call #t~ret17 := main(); {9066#true} is VALID [2022-04-28 10:09:24,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {9066#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9066#true} is VALID [2022-04-28 10:09:24,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {9066#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9066#true} is VALID [2022-04-28 10:09:24,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {9066#true} assume !(~x~0 % 4294967296 > 0); {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:24,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:24,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {9071#(<= 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; {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:24,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:24,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {9072#(<= 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; {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:24,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:24,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {9072#(<= 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; {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:24,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {9071#(<= 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; {9067#false} is VALID [2022-04-28 10:09:24,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {9067#false} assume !(~x~0 % 4294967296 > 0); {9067#false} is VALID [2022-04-28 10:09:24,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {9067#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9067#false} is VALID [2022-04-28 10:09:24,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {9067#false} assume !(~z~0 % 4294967296 > 0); {9067#false} is VALID [2022-04-28 10:09:24,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {9067#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {9067#false} is VALID [2022-04-28 10:09:24,289 INFO L290 TraceCheckUtils]: 19: Hoare triple {9067#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {9067#false} is VALID [2022-04-28 10:09:24,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {9067#false} assume !(~y~0 % 4294967296 > 0); {9067#false} is VALID [2022-04-28 10:09:24,289 INFO L272 TraceCheckUtils]: 21: Hoare triple {9067#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9067#false} is VALID [2022-04-28 10:09:24,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {9067#false} ~cond := #in~cond; {9067#false} is VALID [2022-04-28 10:09:24,290 INFO L290 TraceCheckUtils]: 23: Hoare triple {9067#false} assume 0 == ~cond; {9067#false} is VALID [2022-04-28 10:09:24,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {9067#false} assume !false; {9067#false} is VALID [2022-04-28 10:09:24,290 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:09:24,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:24,378 INFO L290 TraceCheckUtils]: 24: Hoare triple {9067#false} assume !false; {9067#false} is VALID [2022-04-28 10:09:24,378 INFO L290 TraceCheckUtils]: 23: Hoare triple {9067#false} assume 0 == ~cond; {9067#false} is VALID [2022-04-28 10:09:24,378 INFO L290 TraceCheckUtils]: 22: Hoare triple {9067#false} ~cond := #in~cond; {9067#false} is VALID [2022-04-28 10:09:24,379 INFO L272 TraceCheckUtils]: 21: Hoare triple {9067#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9067#false} is VALID [2022-04-28 10:09:24,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {9067#false} assume !(~y~0 % 4294967296 > 0); {9067#false} is VALID [2022-04-28 10:09:24,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {9067#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {9067#false} is VALID [2022-04-28 10:09:24,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {9067#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {9067#false} is VALID [2022-04-28 10:09:24,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {9067#false} assume !(~z~0 % 4294967296 > 0); {9067#false} is VALID [2022-04-28 10:09:24,379 INFO L290 TraceCheckUtils]: 16: Hoare triple {9067#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9067#false} is VALID [2022-04-28 10:09:24,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {9067#false} assume !(~x~0 % 4294967296 > 0); {9067#false} is VALID [2022-04-28 10:09:24,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {9071#(<= 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; {9067#false} is VALID [2022-04-28 10:09:24,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {9072#(<= 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; {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:24,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:24,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {9072#(<= 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; {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:24,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:24,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {9071#(<= 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; {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:24,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:24,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {9066#true} assume !(~x~0 % 4294967296 > 0); {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:24,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {9066#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9066#true} is VALID [2022-04-28 10:09:24,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {9066#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9066#true} is VALID [2022-04-28 10:09:24,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {9066#true} call #t~ret17 := main(); {9066#true} is VALID [2022-04-28 10:09:24,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9066#true} {9066#true} #94#return; {9066#true} is VALID [2022-04-28 10:09:24,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {9066#true} assume true; {9066#true} is VALID [2022-04-28 10:09:24,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {9066#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9066#true} is VALID [2022-04-28 10:09:24,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {9066#true} call ULTIMATE.init(); {9066#true} is VALID [2022-04-28 10:09:24,385 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:09:24,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32420406] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:24,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:24,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-28 10:09:24,385 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:24,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1927757856] [2022-04-28 10:09:24,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1927757856] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:24,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:24,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:09:24,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966816076] [2022-04-28 10:09:24,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:24,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 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 25 [2022-04-28 10:09:24,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:24,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 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-28 10:09:24,407 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-28 10:09:24,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:09:24,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:24,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:09:24,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:09:24,408 INFO L87 Difference]: Start difference. First operand 152 states and 210 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 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-28 10:09:25,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:25,128 INFO L93 Difference]: Finished difference Result 233 states and 328 transitions. [2022-04-28 10:09:25,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:09:25,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 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 25 [2022-04-28 10:09:25,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:25,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 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-28 10:09:25,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-04-28 10:09:25,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 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-28 10:09:25,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-04-28 10:09:25,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2022-04-28 10:09:25,181 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-28 10:09:25,183 INFO L225 Difference]: With dead ends: 233 [2022-04-28 10:09:25,184 INFO L226 Difference]: Without dead ends: 175 [2022-04-28 10:09:25,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 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-28 10:09:25,185 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 30 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:25,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 42 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:09:25,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-04-28 10:09:25,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 137. [2022-04-28 10:09:25,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:25,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand has 137 states, 132 states have (on average 1.3863636363636365) internal successors, (183), 132 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:25,521 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand has 137 states, 132 states have (on average 1.3863636363636365) internal successors, (183), 132 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:25,521 INFO L87 Difference]: Start difference. First operand 175 states. Second operand has 137 states, 132 states have (on average 1.3863636363636365) internal successors, (183), 132 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:25,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:25,524 INFO L93 Difference]: Finished difference Result 175 states and 245 transitions. [2022-04-28 10:09:25,524 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 245 transitions. [2022-04-28 10:09:25,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:25,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:25,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 132 states have (on average 1.3863636363636365) internal successors, (183), 132 states have internal predecessors, (183), 3 states have call successors, (3), 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 175 states. [2022-04-28 10:09:25,525 INFO L87 Difference]: Start difference. First operand has 137 states, 132 states have (on average 1.3863636363636365) internal successors, (183), 132 states have internal predecessors, (183), 3 states have call successors, (3), 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 175 states. [2022-04-28 10:09:25,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:25,528 INFO L93 Difference]: Finished difference Result 175 states and 245 transitions. [2022-04-28 10:09:25,528 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 245 transitions. [2022-04-28 10:09:25,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:25,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:25,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:25,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:25,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.3863636363636365) internal successors, (183), 132 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:25,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 187 transitions. [2022-04-28 10:09:25,532 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 187 transitions. Word has length 25 [2022-04-28 10:09:25,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:25,532 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 187 transitions. [2022-04-28 10:09:25,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 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-28 10:09:25,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 187 transitions. [2022-04-28 10:09:25,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:25,768 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 187 transitions. [2022-04-28 10:09:25,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:09:25,768 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:25,768 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:25,786 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-28 10:09:25,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 10:09:25,971 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:25,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:25,972 INFO L85 PathProgramCache]: Analyzing trace with hash -565826439, now seen corresponding path program 3 times [2022-04-28 10:09:25,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:25,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [189586587] [2022-04-28 10:09:25,974 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:25,974 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:25,974 INFO L85 PathProgramCache]: Analyzing trace with hash -565826439, now seen corresponding path program 4 times [2022-04-28 10:09:25,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:25,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668018384] [2022-04-28 10:09:25,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:25,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:26,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:26,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {10326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10317#true} is VALID [2022-04-28 10:09:26,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {10317#true} assume true; {10317#true} is VALID [2022-04-28 10:09:26,048 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10317#true} {10317#true} #94#return; {10317#true} is VALID [2022-04-28 10:09:26,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {10317#true} call ULTIMATE.init(); {10326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:26,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {10326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10317#true} is VALID [2022-04-28 10:09:26,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {10317#true} assume true; {10317#true} is VALID [2022-04-28 10:09:26,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10317#true} {10317#true} #94#return; {10317#true} is VALID [2022-04-28 10:09:26,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {10317#true} call #t~ret17 := main(); {10317#true} is VALID [2022-04-28 10:09:26,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {10317#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10317#true} is VALID [2022-04-28 10:09:26,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {10317#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10322#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:26,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {10322#(<= 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; {10323#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:26,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {10323#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {10323#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:26,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {10323#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {10323#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:26,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {10323#(<= (* (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; {10324#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:09:26,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {10324#(<= (+ (* (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; {10325#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:26,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {10325#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {10325#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:26,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {10325#(<= (+ 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; {10325#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:26,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {10325#(<= (+ 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; {10325#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:26,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {10325#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {10325#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:26,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {10325#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {10318#false} is VALID [2022-04-28 10:09:26,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {10318#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10318#false} is VALID [2022-04-28 10:09:26,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {10318#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10318#false} is VALID [2022-04-28 10:09:26,056 INFO L290 TraceCheckUtils]: 19: Hoare triple {10318#false} assume !(~z~0 % 4294967296 > 0); {10318#false} is VALID [2022-04-28 10:09:26,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {10318#false} assume !(~y~0 % 4294967296 > 0); {10318#false} is VALID [2022-04-28 10:09:26,056 INFO L272 TraceCheckUtils]: 21: Hoare triple {10318#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10318#false} is VALID [2022-04-28 10:09:26,056 INFO L290 TraceCheckUtils]: 22: Hoare triple {10318#false} ~cond := #in~cond; {10318#false} is VALID [2022-04-28 10:09:26,056 INFO L290 TraceCheckUtils]: 23: Hoare triple {10318#false} assume 0 == ~cond; {10318#false} is VALID [2022-04-28 10:09:26,056 INFO L290 TraceCheckUtils]: 24: Hoare triple {10318#false} assume !false; {10318#false} is VALID [2022-04-28 10:09:26,057 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-28 10:09:26,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:26,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668018384] [2022-04-28 10:09:26,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668018384] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:26,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234251253] [2022-04-28 10:09:26,057 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:26,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:26,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:26,058 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-28 10:09:26,059 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-28 10:09:26,090 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:26,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:26,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 10:09:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:26,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:26,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {10317#true} call ULTIMATE.init(); {10317#true} is VALID [2022-04-28 10:09:26,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {10317#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10317#true} is VALID [2022-04-28 10:09:26,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {10317#true} assume true; {10317#true} is VALID [2022-04-28 10:09:26,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10317#true} {10317#true} #94#return; {10317#true} is VALID [2022-04-28 10:09:26,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {10317#true} call #t~ret17 := main(); {10317#true} is VALID [2022-04-28 10:09:26,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {10317#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10317#true} is VALID [2022-04-28 10:09:26,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {10317#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10322#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:26,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {10322#(<= 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; {10351#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:26,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {10351#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !(~x~0 % 4294967296 > 0); {10351#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:26,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {10351#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} ~z~0 := ~y~0; {10351#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:26,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {10351#(<= 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; {10322#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:26,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {10322#(<= 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; {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:26,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:26,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {10364#(<= 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; {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:26,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {10364#(<= 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; {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:26,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:26,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {10318#false} is VALID [2022-04-28 10:09:26,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {10318#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10318#false} is VALID [2022-04-28 10:09:26,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {10318#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10318#false} is VALID [2022-04-28 10:09:26,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {10318#false} assume !(~z~0 % 4294967296 > 0); {10318#false} is VALID [2022-04-28 10:09:26,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {10318#false} assume !(~y~0 % 4294967296 > 0); {10318#false} is VALID [2022-04-28 10:09:26,340 INFO L272 TraceCheckUtils]: 21: Hoare triple {10318#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10318#false} is VALID [2022-04-28 10:09:26,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {10318#false} ~cond := #in~cond; {10318#false} is VALID [2022-04-28 10:09:26,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {10318#false} assume 0 == ~cond; {10318#false} is VALID [2022-04-28 10:09:26,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {10318#false} assume !false; {10318#false} is VALID [2022-04-28 10:09:26,340 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-28 10:09:26,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:26,427 INFO L290 TraceCheckUtils]: 24: Hoare triple {10318#false} assume !false; {10318#false} is VALID [2022-04-28 10:09:26,427 INFO L290 TraceCheckUtils]: 23: Hoare triple {10318#false} assume 0 == ~cond; {10318#false} is VALID [2022-04-28 10:09:26,427 INFO L290 TraceCheckUtils]: 22: Hoare triple {10318#false} ~cond := #in~cond; {10318#false} is VALID [2022-04-28 10:09:26,428 INFO L272 TraceCheckUtils]: 21: Hoare triple {10318#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10318#false} is VALID [2022-04-28 10:09:26,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {10318#false} assume !(~y~0 % 4294967296 > 0); {10318#false} is VALID [2022-04-28 10:09:26,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {10318#false} assume !(~z~0 % 4294967296 > 0); {10318#false} is VALID [2022-04-28 10:09:26,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {10318#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10318#false} is VALID [2022-04-28 10:09:26,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {10318#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10318#false} is VALID [2022-04-28 10:09:26,429 INFO L290 TraceCheckUtils]: 16: Hoare triple {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {10318#false} is VALID [2022-04-28 10:09:26,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:26,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {10364#(<= 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; {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:26,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {10364#(<= 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; {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:26,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:26,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {10322#(<= 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; {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:26,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {10351#(<= 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; {10322#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:26,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {10351#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} ~z~0 := ~y~0; {10351#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:26,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {10351#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !(~x~0 % 4294967296 > 0); {10351#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:26,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {10322#(<= 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; {10351#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:26,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {10317#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10322#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:26,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {10317#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10317#true} is VALID [2022-04-28 10:09:26,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {10317#true} call #t~ret17 := main(); {10317#true} is VALID [2022-04-28 10:09:26,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10317#true} {10317#true} #94#return; {10317#true} is VALID [2022-04-28 10:09:26,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {10317#true} assume true; {10317#true} is VALID [2022-04-28 10:09:26,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {10317#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10317#true} is VALID [2022-04-28 10:09:26,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {10317#true} call ULTIMATE.init(); {10317#true} is VALID [2022-04-28 10:09:26,434 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-28 10:09:26,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234251253] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:26,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:26,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 9 [2022-04-28 10:09:26,434 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:26,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [189586587] [2022-04-28 10:09:26,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [189586587] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:26,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:26,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:09:26,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482230490] [2022-04-28 10:09:26,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:26,435 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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 25 [2022-04-28 10:09:26,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:26,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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-28 10:09:26,452 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-28 10:09:26,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:09:26,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:26,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:09:26,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:09:26,453 INFO L87 Difference]: Start difference. First operand 137 states and 187 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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-28 10:09:27,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:27,515 INFO L93 Difference]: Finished difference Result 226 states and 322 transitions. [2022-04-28 10:09:27,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:09:27,516 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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 25 [2022-04-28 10:09:27,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:27,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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-28 10:09:27,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-28 10:09:27,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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-28 10:09:27,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-28 10:09:27,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-28 10:09:27,599 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-28 10:09:27,603 INFO L225 Difference]: With dead ends: 226 [2022-04-28 10:09:27,603 INFO L226 Difference]: Without dead ends: 209 [2022-04-28 10:09:27,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 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-28 10:09:27,604 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 58 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:27,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 49 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:09:27,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-04-28 10:09:28,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 150. [2022-04-28 10:09:28,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:28,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand has 150 states, 145 states have (on average 1.3862068965517242) internal successors, (201), 145 states have internal predecessors, (201), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:28,142 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand has 150 states, 145 states have (on average 1.3862068965517242) internal successors, (201), 145 states have internal predecessors, (201), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:28,143 INFO L87 Difference]: Start difference. First operand 209 states. Second operand has 150 states, 145 states have (on average 1.3862068965517242) internal successors, (201), 145 states have internal predecessors, (201), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:28,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:28,147 INFO L93 Difference]: Finished difference Result 209 states and 296 transitions. [2022-04-28 10:09:28,147 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 296 transitions. [2022-04-28 10:09:28,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:28,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:28,147 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.3862068965517242) internal successors, (201), 145 states have internal predecessors, (201), 3 states have call successors, (3), 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 209 states. [2022-04-28 10:09:28,148 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.3862068965517242) internal successors, (201), 145 states have internal predecessors, (201), 3 states have call successors, (3), 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 209 states. [2022-04-28 10:09:28,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:28,152 INFO L93 Difference]: Finished difference Result 209 states and 296 transitions. [2022-04-28 10:09:28,152 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 296 transitions. [2022-04-28 10:09:28,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:28,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:28,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:28,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:28,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.3862068965517242) internal successors, (201), 145 states have internal predecessors, (201), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:28,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 205 transitions. [2022-04-28 10:09:28,155 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 205 transitions. Word has length 25 [2022-04-28 10:09:28,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:28,155 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 205 transitions. [2022-04-28 10:09:28,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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-28 10:09:28,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 205 transitions. [2022-04-28 10:09:28,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:28,508 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 205 transitions. [2022-04-28 10:09:28,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:09:28,509 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:28,509 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:28,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-28 10:09:28,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 10:09:28,709 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:28,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:28,710 INFO L85 PathProgramCache]: Analyzing trace with hash -2121324263, now seen corresponding path program 15 times [2022-04-28 10:09:28,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:28,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1221273185] [2022-04-28 10:09:28,712 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:28,712 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:28,712 INFO L85 PathProgramCache]: Analyzing trace with hash -2121324263, now seen corresponding path program 16 times [2022-04-28 10:09:28,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:28,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421733755] [2022-04-28 10:09:28,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:28,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:28,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:28,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {11671#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11656#true} is VALID [2022-04-28 10:09:28,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {11656#true} assume true; {11656#true} is VALID [2022-04-28 10:09:28,873 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11656#true} {11656#true} #94#return; {11656#true} is VALID [2022-04-28 10:09:28,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {11656#true} call ULTIMATE.init(); {11671#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:28,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {11671#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11656#true} is VALID [2022-04-28 10:09:28,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {11656#true} assume true; {11656#true} is VALID [2022-04-28 10:09:28,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11656#true} {11656#true} #94#return; {11656#true} is VALID [2022-04-28 10:09:28,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {11656#true} call #t~ret17 := main(); {11656#true} is VALID [2022-04-28 10:09:28,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {11656#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11661#(= main_~y~0 0)} is VALID [2022-04-28 10:09:28,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {11661#(= 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; {11662#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:28,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {11662#(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; {11663#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:28,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {11663#(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; {11664#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:28,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {11664#(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; {11665#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:28,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {11665#(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; {11666#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:28,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {11666#(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; {11667#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:28,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {11667#(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; {11668#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:28,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {11668#(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; {11669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:28,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {11669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {11669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:28,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {11669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {11670#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:28,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {11670#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-28 10:09:28,881 INFO L290 TraceCheckUtils]: 17: Hoare triple {11657#false} assume !(~y~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-28 10:09:28,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {11657#false} assume !(~x~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-28 10:09:28,882 INFO L290 TraceCheckUtils]: 19: Hoare triple {11657#false} assume !(~z~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-28 10:09:28,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {11657#false} assume !(~y~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-28 10:09:28,882 INFO L272 TraceCheckUtils]: 21: Hoare triple {11657#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11657#false} is VALID [2022-04-28 10:09:28,882 INFO L290 TraceCheckUtils]: 22: Hoare triple {11657#false} ~cond := #in~cond; {11657#false} is VALID [2022-04-28 10:09:28,882 INFO L290 TraceCheckUtils]: 23: Hoare triple {11657#false} assume 0 == ~cond; {11657#false} is VALID [2022-04-28 10:09:28,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {11657#false} assume !false; {11657#false} is VALID [2022-04-28 10:09:28,882 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:28,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:28,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421733755] [2022-04-28 10:09:28,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421733755] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:28,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045731592] [2022-04-28 10:09:28,883 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:28,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:28,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:28,888 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-28 10:09:28,889 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-28 10:09:28,920 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:28,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:28,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:09:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:28,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:29,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {11656#true} call ULTIMATE.init(); {11656#true} is VALID [2022-04-28 10:09:29,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {11656#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11656#true} is VALID [2022-04-28 10:09:29,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {11656#true} assume true; {11656#true} is VALID [2022-04-28 10:09:29,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11656#true} {11656#true} #94#return; {11656#true} is VALID [2022-04-28 10:09:29,149 INFO L272 TraceCheckUtils]: 4: Hoare triple {11656#true} call #t~ret17 := main(); {11656#true} is VALID [2022-04-28 10:09:29,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {11656#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11661#(= main_~y~0 0)} is VALID [2022-04-28 10:09:29,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {11661#(= 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; {11662#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:29,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {11662#(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; {11663#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:29,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {11663#(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; {11664#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:29,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {11664#(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; {11665#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:29,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {11665#(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; {11666#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:29,153 INFO L290 TraceCheckUtils]: 11: Hoare triple {11666#(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; {11667#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:29,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {11667#(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; {11668#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:29,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {11668#(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; {11669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:29,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {11669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {11669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:29,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {11669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {11720#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:09:29,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {11720#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-28 10:09:29,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {11657#false} assume !(~y~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-28 10:09:29,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {11657#false} assume !(~x~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-28 10:09:29,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {11657#false} assume !(~z~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-28 10:09:29,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {11657#false} assume !(~y~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-28 10:09:29,155 INFO L272 TraceCheckUtils]: 21: Hoare triple {11657#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11657#false} is VALID [2022-04-28 10:09:29,155 INFO L290 TraceCheckUtils]: 22: Hoare triple {11657#false} ~cond := #in~cond; {11657#false} is VALID [2022-04-28 10:09:29,155 INFO L290 TraceCheckUtils]: 23: Hoare triple {11657#false} assume 0 == ~cond; {11657#false} is VALID [2022-04-28 10:09:29,155 INFO L290 TraceCheckUtils]: 24: Hoare triple {11657#false} assume !false; {11657#false} is VALID [2022-04-28 10:09:29,156 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:29,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:29,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {11657#false} assume !false; {11657#false} is VALID [2022-04-28 10:09:29,381 INFO L290 TraceCheckUtils]: 23: Hoare triple {11657#false} assume 0 == ~cond; {11657#false} is VALID [2022-04-28 10:09:29,381 INFO L290 TraceCheckUtils]: 22: Hoare triple {11657#false} ~cond := #in~cond; {11657#false} is VALID [2022-04-28 10:09:29,381 INFO L272 TraceCheckUtils]: 21: Hoare triple {11657#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11657#false} is VALID [2022-04-28 10:09:29,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {11657#false} assume !(~y~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-28 10:09:29,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {11657#false} assume !(~z~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-28 10:09:29,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {11657#false} assume !(~x~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-28 10:09:29,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {11657#false} assume !(~y~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-28 10:09:29,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {11772#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-28 10:09:29,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {11776#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {11772#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:29,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {11776#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {11776#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:29,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {11783#(< 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; {11776#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:29,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {11787#(< 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; {11783#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:29,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {11791#(< 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; {11787#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:29,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {11795#(< 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; {11791#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:29,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {11799#(< 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; {11795#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:29,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {11803#(< 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; {11799#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:29,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {11807#(< 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; {11803#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:29,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {11811#(< 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; {11807#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:29,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {11656#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11811#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:09:29,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {11656#true} call #t~ret17 := main(); {11656#true} is VALID [2022-04-28 10:09:29,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11656#true} {11656#true} #94#return; {11656#true} is VALID [2022-04-28 10:09:29,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {11656#true} assume true; {11656#true} is VALID [2022-04-28 10:09:29,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {11656#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11656#true} is VALID [2022-04-28 10:09:29,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {11656#true} call ULTIMATE.init(); {11656#true} is VALID [2022-04-28 10:09:29,389 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:29,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045731592] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:29,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:29,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 10:09:29,389 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:29,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1221273185] [2022-04-28 10:09:29,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1221273185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:29,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:29,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:09:29,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484885514] [2022-04-28 10:09:29,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:29,390 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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-28 10:09:29,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:29,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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-28 10:09:29,412 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-28 10:09:29,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:09:29,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:29,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:09:29,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:09:29,413 INFO L87 Difference]: Start difference. First operand 150 states and 205 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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-28 10:09:31,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:31,489 INFO L93 Difference]: Finished difference Result 235 states and 356 transitions. [2022-04-28 10:09:31,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:09:31,490 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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-28 10:09:31,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:31,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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-28 10:09:31,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 147 transitions. [2022-04-28 10:09:31,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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-28 10:09:31,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 147 transitions. [2022-04-28 10:09:31,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 147 transitions. [2022-04-28 10:09:31,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:31,618 INFO L225 Difference]: With dead ends: 235 [2022-04-28 10:09:31,618 INFO L226 Difference]: Without dead ends: 219 [2022-04-28 10:09:31,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:09:31,619 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 113 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:31,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 109 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:09:31,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-28 10:09:32,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 166. [2022-04-28 10:09:32,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:32,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 166 states, 161 states have (on average 1.391304347826087) internal successors, (224), 161 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:32,085 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 166 states, 161 states have (on average 1.391304347826087) internal successors, (224), 161 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:32,085 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 166 states, 161 states have (on average 1.391304347826087) internal successors, (224), 161 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:32,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:32,094 INFO L93 Difference]: Finished difference Result 219 states and 297 transitions. [2022-04-28 10:09:32,094 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 297 transitions. [2022-04-28 10:09:32,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:32,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:32,095 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 161 states have (on average 1.391304347826087) internal successors, (224), 161 states have internal predecessors, (224), 3 states have call successors, (3), 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 219 states. [2022-04-28 10:09:32,096 INFO L87 Difference]: Start difference. First operand has 166 states, 161 states have (on average 1.391304347826087) internal successors, (224), 161 states have internal predecessors, (224), 3 states have call successors, (3), 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 219 states. [2022-04-28 10:09:32,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:32,100 INFO L93 Difference]: Finished difference Result 219 states and 297 transitions. [2022-04-28 10:09:32,100 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 297 transitions. [2022-04-28 10:09:32,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:32,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:32,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:32,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:32,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.391304347826087) internal successors, (224), 161 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:32,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 228 transitions. [2022-04-28 10:09:32,104 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 228 transitions. Word has length 25 [2022-04-28 10:09:32,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:32,105 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 228 transitions. [2022-04-28 10:09:32,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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-28 10:09:32,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 228 transitions. [2022-04-28 10:09:32,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:32,559 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 228 transitions. [2022-04-28 10:09:32,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:09:32,560 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:32,560 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:32,584 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-28 10:09:32,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:32,761 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:32,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:32,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1462305435, now seen corresponding path program 1 times [2022-04-28 10:09:32,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:32,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [395292574] [2022-04-28 10:09:32,764 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:32,764 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:32,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1462305435, now seen corresponding path program 2 times [2022-04-28 10:09:32,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:32,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48101259] [2022-04-28 10:09:32,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:32,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:32,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:32,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {13103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13092#true} is VALID [2022-04-28 10:09:32,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {13092#true} assume true; {13092#true} is VALID [2022-04-28 10:09:32,858 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13092#true} {13092#true} #94#return; {13092#true} is VALID [2022-04-28 10:09:32,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {13092#true} call ULTIMATE.init(); {13103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:32,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {13103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13092#true} is VALID [2022-04-28 10:09:32,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {13092#true} assume true; {13092#true} is VALID [2022-04-28 10:09:32,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13092#true} {13092#true} #94#return; {13092#true} is VALID [2022-04-28 10:09:32,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {13092#true} call #t~ret17 := main(); {13092#true} is VALID [2022-04-28 10:09:32,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {13092#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13097#(= main_~y~0 0)} is VALID [2022-04-28 10:09:32,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {13097#(= 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; {13098#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:32,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {13098#(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; {13099#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:32,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {13099#(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; {13100#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:32,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {13100#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13100#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:32,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {13100#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {13101#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:32,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {13101#(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; {13102#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:32,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {13102#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {13093#false} is VALID [2022-04-28 10:09:32,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {13093#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13093#false} is VALID [2022-04-28 10:09:32,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {13093#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13093#false} is VALID [2022-04-28 10:09:32,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {13093#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13093#false} is VALID [2022-04-28 10:09:32,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {13093#false} assume !(~y~0 % 4294967296 > 0); {13093#false} is VALID [2022-04-28 10:09:32,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {13093#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; {13093#false} is VALID [2022-04-28 10:09:32,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {13093#false} assume !(~x~0 % 4294967296 > 0); {13093#false} is VALID [2022-04-28 10:09:32,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {13093#false} assume !(~z~0 % 4294967296 > 0); {13093#false} is VALID [2022-04-28 10:09:32,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {13093#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {13093#false} is VALID [2022-04-28 10:09:32,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {13093#false} assume !(~y~0 % 4294967296 > 0); {13093#false} is VALID [2022-04-28 10:09:32,874 INFO L272 TraceCheckUtils]: 22: Hoare triple {13093#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13093#false} is VALID [2022-04-28 10:09:32,874 INFO L290 TraceCheckUtils]: 23: Hoare triple {13093#false} ~cond := #in~cond; {13093#false} is VALID [2022-04-28 10:09:32,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {13093#false} assume 0 == ~cond; {13093#false} is VALID [2022-04-28 10:09:32,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {13093#false} assume !false; {13093#false} is VALID [2022-04-28 10:09:32,874 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 10:09:32,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:32,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48101259] [2022-04-28 10:09:32,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48101259] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:32,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479040438] [2022-04-28 10:09:32,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:32,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:32,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:32,878 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-28 10:09:32,879 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-28 10:09:32,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:32,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:32,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 10:09:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:32,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:33,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {13092#true} call ULTIMATE.init(); {13092#true} is VALID [2022-04-28 10:09:33,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {13092#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13092#true} is VALID [2022-04-28 10:09:33,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {13092#true} assume true; {13092#true} is VALID [2022-04-28 10:09:33,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13092#true} {13092#true} #94#return; {13092#true} is VALID [2022-04-28 10:09:33,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {13092#true} call #t~ret17 := main(); {13092#true} is VALID [2022-04-28 10:09:33,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {13092#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13097#(= main_~y~0 0)} is VALID [2022-04-28 10:09:33,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {13097#(= 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; {13098#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:33,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {13098#(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; {13099#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:33,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {13099#(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; {13100#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:33,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {13100#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13100#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:33,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {13100#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {13137#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:33,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {13137#(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; {13141#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:09:33,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {13141#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {13093#false} is VALID [2022-04-28 10:09:33,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {13093#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13093#false} is VALID [2022-04-28 10:09:33,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {13093#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13093#false} is VALID [2022-04-28 10:09:33,037 INFO L290 TraceCheckUtils]: 15: Hoare triple {13093#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13093#false} is VALID [2022-04-28 10:09:33,037 INFO L290 TraceCheckUtils]: 16: Hoare triple {13093#false} assume !(~y~0 % 4294967296 > 0); {13093#false} is VALID [2022-04-28 10:09:33,037 INFO L290 TraceCheckUtils]: 17: Hoare triple {13093#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; {13093#false} is VALID [2022-04-28 10:09:33,037 INFO L290 TraceCheckUtils]: 18: Hoare triple {13093#false} assume !(~x~0 % 4294967296 > 0); {13093#false} is VALID [2022-04-28 10:09:33,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {13093#false} assume !(~z~0 % 4294967296 > 0); {13093#false} is VALID [2022-04-28 10:09:33,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {13093#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {13093#false} is VALID [2022-04-28 10:09:33,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {13093#false} assume !(~y~0 % 4294967296 > 0); {13093#false} is VALID [2022-04-28 10:09:33,037 INFO L272 TraceCheckUtils]: 22: Hoare triple {13093#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13093#false} is VALID [2022-04-28 10:09:33,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {13093#false} ~cond := #in~cond; {13093#false} is VALID [2022-04-28 10:09:33,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {13093#false} assume 0 == ~cond; {13093#false} is VALID [2022-04-28 10:09:33,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {13093#false} assume !false; {13093#false} is VALID [2022-04-28 10:09:33,037 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 10:09:33,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:33,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {13093#false} assume !false; {13093#false} is VALID [2022-04-28 10:09:33,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {13093#false} assume 0 == ~cond; {13093#false} is VALID [2022-04-28 10:09:33,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {13093#false} ~cond := #in~cond; {13093#false} is VALID [2022-04-28 10:09:33,153 INFO L272 TraceCheckUtils]: 22: Hoare triple {13093#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13093#false} is VALID [2022-04-28 10:09:33,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {13093#false} assume !(~y~0 % 4294967296 > 0); {13093#false} is VALID [2022-04-28 10:09:33,153 INFO L290 TraceCheckUtils]: 20: Hoare triple {13093#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {13093#false} is VALID [2022-04-28 10:09:33,153 INFO L290 TraceCheckUtils]: 19: Hoare triple {13093#false} assume !(~z~0 % 4294967296 > 0); {13093#false} is VALID [2022-04-28 10:09:33,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {13093#false} assume !(~x~0 % 4294967296 > 0); {13093#false} is VALID [2022-04-28 10:09:33,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {13093#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; {13093#false} is VALID [2022-04-28 10:09:33,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {13093#false} assume !(~y~0 % 4294967296 > 0); {13093#false} is VALID [2022-04-28 10:09:33,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {13093#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13093#false} is VALID [2022-04-28 10:09:33,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {13217#(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; {13093#false} is VALID [2022-04-28 10:09:33,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {13221#(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; {13217#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:09:33,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {13225#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {13221#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:09:33,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {13229#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13225#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:09:33,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {13092#true} ~z~0 := ~y~0; {13229#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:09:33,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {13092#true} assume !(~x~0 % 4294967296 > 0); {13092#true} is VALID [2022-04-28 10:09:33,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {13092#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13092#true} is VALID [2022-04-28 10:09:33,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {13092#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13092#true} is VALID [2022-04-28 10:09:33,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {13092#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13092#true} is VALID [2022-04-28 10:09:33,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {13092#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13092#true} is VALID [2022-04-28 10:09:33,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {13092#true} call #t~ret17 := main(); {13092#true} is VALID [2022-04-28 10:09:33,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13092#true} {13092#true} #94#return; {13092#true} is VALID [2022-04-28 10:09:33,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {13092#true} assume true; {13092#true} is VALID [2022-04-28 10:09:33,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {13092#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13092#true} is VALID [2022-04-28 10:09:33,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {13092#true} call ULTIMATE.init(); {13092#true} is VALID [2022-04-28 10:09:33,158 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 10:09:33,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479040438] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:33,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:33,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 15 [2022-04-28 10:09:33,158 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:33,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [395292574] [2022-04-28 10:09:33,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [395292574] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:33,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:33,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:09:33,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302139506] [2022-04-28 10:09:33,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:33,159 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 26 [2022-04-28 10:09:33,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:33,159 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-28 10:09:33,174 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-28 10:09:33,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:09:33,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:33,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:09:33,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:09:33,175 INFO L87 Difference]: Start difference. First operand 166 states and 228 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-28 10:09:34,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:34,255 INFO L93 Difference]: Finished difference Result 203 states and 273 transitions. [2022-04-28 10:09:34,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:09:34,255 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 26 [2022-04-28 10:09:34,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:34,256 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-28 10:09:34,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 76 transitions. [2022-04-28 10:09:34,257 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-28 10:09:34,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 76 transitions. [2022-04-28 10:09:34,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 76 transitions. [2022-04-28 10:09:34,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:34,328 INFO L225 Difference]: With dead ends: 203 [2022-04-28 10:09:34,328 INFO L226 Difference]: Without dead ends: 189 [2022-04-28 10:09:34,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:09:34,329 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 54 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:34,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 54 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:09:34,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-28 10:09:34,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 166. [2022-04-28 10:09:34,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:34,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 166 states, 161 states have (on average 1.3850931677018634) internal successors, (223), 161 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:34,783 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 166 states, 161 states have (on average 1.3850931677018634) internal successors, (223), 161 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:34,783 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 166 states, 161 states have (on average 1.3850931677018634) internal successors, (223), 161 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:34,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:34,786 INFO L93 Difference]: Finished difference Result 189 states and 258 transitions. [2022-04-28 10:09:34,786 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 258 transitions. [2022-04-28 10:09:34,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:34,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:34,787 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 161 states have (on average 1.3850931677018634) internal successors, (223), 161 states have internal predecessors, (223), 3 states have call successors, (3), 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 189 states. [2022-04-28 10:09:34,787 INFO L87 Difference]: Start difference. First operand has 166 states, 161 states have (on average 1.3850931677018634) internal successors, (223), 161 states have internal predecessors, (223), 3 states have call successors, (3), 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 189 states. [2022-04-28 10:09:34,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:34,790 INFO L93 Difference]: Finished difference Result 189 states and 258 transitions. [2022-04-28 10:09:34,790 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 258 transitions. [2022-04-28 10:09:34,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:34,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:34,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:34,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:34,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.3850931677018634) internal successors, (223), 161 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:34,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 227 transitions. [2022-04-28 10:09:34,794 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 227 transitions. Word has length 26 [2022-04-28 10:09:34,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:34,794 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 227 transitions. [2022-04-28 10:09:34,794 INFO L496 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-28 10:09:34,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 227 transitions. [2022-04-28 10:09:35,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:35,167 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 227 transitions. [2022-04-28 10:09:35,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:09:35,171 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:35,171 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:35,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:35,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 10:09:35,390 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:35,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:35,391 INFO L85 PathProgramCache]: Analyzing trace with hash 2144175877, now seen corresponding path program 5 times [2022-04-28 10:09:35,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:35,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [192008052] [2022-04-28 10:09:35,393 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:35,393 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:35,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2144175877, now seen corresponding path program 6 times [2022-04-28 10:09:35,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:35,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16072342] [2022-04-28 10:09:35,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:35,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:35,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:35,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {14409#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14395#true} is VALID [2022-04-28 10:09:35,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {14395#true} assume true; {14395#true} is VALID [2022-04-28 10:09:35,568 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14395#true} {14395#true} #94#return; {14395#true} is VALID [2022-04-28 10:09:35,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {14395#true} call ULTIMATE.init(); {14409#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:35,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {14409#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14395#true} is VALID [2022-04-28 10:09:35,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {14395#true} assume true; {14395#true} is VALID [2022-04-28 10:09:35,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14395#true} {14395#true} #94#return; {14395#true} is VALID [2022-04-28 10:09:35,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {14395#true} call #t~ret17 := main(); {14395#true} is VALID [2022-04-28 10:09:35,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {14395#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14400#(= main_~y~0 0)} is VALID [2022-04-28 10:09:35,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {14400#(= 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; {14401#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:35,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {14401#(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; {14402#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:35,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {14402#(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; {14403#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:35,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {14403#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {14403#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:35,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {14403#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {14404#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:35,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {14404#(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; {14405#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:35,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {14405#(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; {14406#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:35,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {14406#(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; {14407#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:09:35,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {14407#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {14407#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:09:35,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {14407#(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; {14406#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:35,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {14406#(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; {14405#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:35,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {14405#(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; {14408#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:35,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {14408#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {14408#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:35,575 INFO L290 TraceCheckUtils]: 19: Hoare triple {14408#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {14408#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:35,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {14408#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {14396#false} is VALID [2022-04-28 10:09:35,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {14396#false} assume !(~y~0 % 4294967296 > 0); {14396#false} is VALID [2022-04-28 10:09:35,576 INFO L272 TraceCheckUtils]: 22: Hoare triple {14396#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14396#false} is VALID [2022-04-28 10:09:35,576 INFO L290 TraceCheckUtils]: 23: Hoare triple {14396#false} ~cond := #in~cond; {14396#false} is VALID [2022-04-28 10:09:35,576 INFO L290 TraceCheckUtils]: 24: Hoare triple {14396#false} assume 0 == ~cond; {14396#false} is VALID [2022-04-28 10:09:35,576 INFO L290 TraceCheckUtils]: 25: Hoare triple {14396#false} assume !false; {14396#false} is VALID [2022-04-28 10:09:35,576 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:35,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:35,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16072342] [2022-04-28 10:09:35,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16072342] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:35,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456016161] [2022-04-28 10:09:35,576 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:35,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:35,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:35,578 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-28 10:09:35,578 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-28 10:09:35,618 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:09:35,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:35,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 10:09:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:35,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:35,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {14395#true} call ULTIMATE.init(); {14395#true} is VALID [2022-04-28 10:09:35,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {14395#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14395#true} is VALID [2022-04-28 10:09:35,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {14395#true} assume true; {14395#true} is VALID [2022-04-28 10:09:35,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14395#true} {14395#true} #94#return; {14395#true} is VALID [2022-04-28 10:09:35,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {14395#true} call #t~ret17 := main(); {14395#true} is VALID [2022-04-28 10:09:35,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {14395#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14395#true} is VALID [2022-04-28 10:09:35,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {14395#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14431#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:35,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {14431#(< 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; {14435#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:35,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {14435#(< 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; {14439#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:35,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {14439#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {14439#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:35,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {14439#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {14439#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:35,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {14439#(< 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; {14435#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:35,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {14435#(< 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; {14431#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:35,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {14431#(< 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; {14455#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:35,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {14455#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {14455#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:35,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {14455#(< 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; {14455#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:35,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {14455#(< 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; {14455#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:35,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {14455#(< 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; {14455#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:35,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {14455#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {14455#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:35,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {14455#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {14396#false} is VALID [2022-04-28 10:09:35,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {14396#false} assume !(~z~0 % 4294967296 > 0); {14396#false} is VALID [2022-04-28 10:09:35,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {14396#false} assume !(~y~0 % 4294967296 > 0); {14396#false} is VALID [2022-04-28 10:09:35,744 INFO L272 TraceCheckUtils]: 22: Hoare triple {14396#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14396#false} is VALID [2022-04-28 10:09:35,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {14396#false} ~cond := #in~cond; {14396#false} is VALID [2022-04-28 10:09:35,744 INFO L290 TraceCheckUtils]: 24: Hoare triple {14396#false} assume 0 == ~cond; {14396#false} is VALID [2022-04-28 10:09:35,744 INFO L290 TraceCheckUtils]: 25: Hoare triple {14396#false} assume !false; {14396#false} is VALID [2022-04-28 10:09:35,744 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:09:35,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:35,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {14396#false} assume !false; {14396#false} is VALID [2022-04-28 10:09:35,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {14396#false} assume 0 == ~cond; {14396#false} is VALID [2022-04-28 10:09:35,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {14396#false} ~cond := #in~cond; {14396#false} is VALID [2022-04-28 10:09:35,825 INFO L272 TraceCheckUtils]: 22: Hoare triple {14396#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14396#false} is VALID [2022-04-28 10:09:35,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {14396#false} assume !(~y~0 % 4294967296 > 0); {14396#false} is VALID [2022-04-28 10:09:35,825 INFO L290 TraceCheckUtils]: 20: Hoare triple {14396#false} assume !(~z~0 % 4294967296 > 0); {14396#false} is VALID [2022-04-28 10:09:35,826 INFO L290 TraceCheckUtils]: 19: Hoare triple {14455#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {14396#false} is VALID [2022-04-28 10:09:35,826 INFO L290 TraceCheckUtils]: 18: Hoare triple {14455#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {14455#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:35,826 INFO L290 TraceCheckUtils]: 17: Hoare triple {14455#(< 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; {14455#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:35,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {14455#(< 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; {14455#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:35,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {14455#(< 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; {14455#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:35,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {14455#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {14455#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:35,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {14431#(< 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; {14455#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:35,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {14435#(< 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; {14431#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:35,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {14439#(< 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; {14435#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:35,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {14439#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {14439#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:35,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {14439#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {14439#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:35,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {14435#(< 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; {14439#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:35,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {14431#(< 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; {14435#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:35,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {14395#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14431#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:35,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {14395#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14395#true} is VALID [2022-04-28 10:09:35,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {14395#true} call #t~ret17 := main(); {14395#true} is VALID [2022-04-28 10:09:35,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14395#true} {14395#true} #94#return; {14395#true} is VALID [2022-04-28 10:09:35,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {14395#true} assume true; {14395#true} is VALID [2022-04-28 10:09:35,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {14395#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14395#true} is VALID [2022-04-28 10:09:35,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {14395#true} call ULTIMATE.init(); {14395#true} is VALID [2022-04-28 10:09:35,832 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:09:35,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456016161] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:35,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:35,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 16 [2022-04-28 10:09:35,833 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:35,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [192008052] [2022-04-28 10:09:35,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [192008052] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:35,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:35,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:09:35,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766258258] [2022-04-28 10:09:35,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:35,833 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-28 10:09:35,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:35,834 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-28 10:09:35,851 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-28 10:09:35,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:09:35,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:35,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:09:35,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:09:35,852 INFO L87 Difference]: Start difference. First operand 166 states and 227 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-28 10:09:38,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:38,315 INFO L93 Difference]: Finished difference Result 315 states and 452 transitions. [2022-04-28 10:09:38,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 10:09:38,315 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-28 10:09:38,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:38,315 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-28 10:09:38,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 148 transitions. [2022-04-28 10:09:38,317 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-28 10:09:38,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 148 transitions. [2022-04-28 10:09:38,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 148 transitions. [2022-04-28 10:09:38,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:38,475 INFO L225 Difference]: With dead ends: 315 [2022-04-28 10:09:38,475 INFO L226 Difference]: Without dead ends: 269 [2022-04-28 10:09:38,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=1452, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 10:09:38,476 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 74 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:38,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 67 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:09:38,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-04-28 10:09:39,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 196. [2022-04-28 10:09:39,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:39,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 269 states. Second operand has 196 states, 191 states have (on average 1.3664921465968587) internal successors, (261), 191 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:39,118 INFO L74 IsIncluded]: Start isIncluded. First operand 269 states. Second operand has 196 states, 191 states have (on average 1.3664921465968587) internal successors, (261), 191 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:39,118 INFO L87 Difference]: Start difference. First operand 269 states. Second operand has 196 states, 191 states have (on average 1.3664921465968587) internal successors, (261), 191 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:39,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:39,123 INFO L93 Difference]: Finished difference Result 269 states and 343 transitions. [2022-04-28 10:09:39,123 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 343 transitions. [2022-04-28 10:09:39,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:39,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:39,124 INFO L74 IsIncluded]: Start isIncluded. First operand has 196 states, 191 states have (on average 1.3664921465968587) internal successors, (261), 191 states have internal predecessors, (261), 3 states have call successors, (3), 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 269 states. [2022-04-28 10:09:39,124 INFO L87 Difference]: Start difference. First operand has 196 states, 191 states have (on average 1.3664921465968587) internal successors, (261), 191 states have internal predecessors, (261), 3 states have call successors, (3), 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 269 states. [2022-04-28 10:09:39,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:39,129 INFO L93 Difference]: Finished difference Result 269 states and 343 transitions. [2022-04-28 10:09:39,129 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 343 transitions. [2022-04-28 10:09:39,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:39,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:39,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:39,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:39,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 191 states have (on average 1.3664921465968587) internal successors, (261), 191 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:39,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 265 transitions. [2022-04-28 10:09:39,133 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 265 transitions. Word has length 26 [2022-04-28 10:09:39,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:39,133 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 265 transitions. [2022-04-28 10:09:39,134 INFO L496 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-28 10:09:39,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 196 states and 265 transitions. [2022-04-28 10:09:39,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:39,629 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 265 transitions. [2022-04-28 10:09:39,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:09:39,630 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:39,630 INFO L195 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:39,650 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-28 10:09:39,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 10:09:39,839 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:39,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:39,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1689786486, now seen corresponding path program 17 times [2022-04-28 10:09:39,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:39,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [875664594] [2022-04-28 10:09:39,842 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:39,842 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:39,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1689786486, now seen corresponding path program 18 times [2022-04-28 10:09:39,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:39,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536054083] [2022-04-28 10:09:39,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:39,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:39,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:40,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {16195#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16179#true} is VALID [2022-04-28 10:09:40,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {16179#true} assume true; {16179#true} is VALID [2022-04-28 10:09:40,000 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16179#true} {16179#true} #94#return; {16179#true} is VALID [2022-04-28 10:09:40,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {16179#true} call ULTIMATE.init(); {16195#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:40,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {16195#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16179#true} is VALID [2022-04-28 10:09:40,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {16179#true} assume true; {16179#true} is VALID [2022-04-28 10:09:40,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16179#true} {16179#true} #94#return; {16179#true} is VALID [2022-04-28 10:09:40,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {16179#true} call #t~ret17 := main(); {16179#true} is VALID [2022-04-28 10:09:40,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {16179#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16184#(= main_~y~0 0)} is VALID [2022-04-28 10:09:40,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {16184#(= 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; {16185#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:40,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {16185#(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; {16186#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:40,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {16186#(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; {16187#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:40,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {16187#(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; {16188#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:40,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {16188#(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; {16189#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:40,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {16189#(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; {16190#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:40,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {16190#(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; {16191#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:40,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {16191#(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; {16192#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:40,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {16192#(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; {16193#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:40,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {16193#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {16193#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:40,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {16193#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {16194#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:40,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {16194#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-28 10:09:40,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {16180#false} assume !(~y~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-28 10:09:40,007 INFO L290 TraceCheckUtils]: 19: Hoare triple {16180#false} assume !(~x~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-28 10:09:40,007 INFO L290 TraceCheckUtils]: 20: Hoare triple {16180#false} assume !(~z~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-28 10:09:40,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {16180#false} assume !(~y~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-28 10:09:40,007 INFO L272 TraceCheckUtils]: 22: Hoare triple {16180#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16180#false} is VALID [2022-04-28 10:09:40,008 INFO L290 TraceCheckUtils]: 23: Hoare triple {16180#false} ~cond := #in~cond; {16180#false} is VALID [2022-04-28 10:09:40,008 INFO L290 TraceCheckUtils]: 24: Hoare triple {16180#false} assume 0 == ~cond; {16180#false} is VALID [2022-04-28 10:09:40,008 INFO L290 TraceCheckUtils]: 25: Hoare triple {16180#false} assume !false; {16180#false} is VALID [2022-04-28 10:09:40,008 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:40,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:40,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536054083] [2022-04-28 10:09:40,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536054083] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:40,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401869843] [2022-04-28 10:09:40,008 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:40,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:40,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:40,012 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-28 10:09:40,013 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-28 10:09:40,056 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:09:40,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:40,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:09:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:40,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:40,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {16179#true} call ULTIMATE.init(); {16179#true} is VALID [2022-04-28 10:09:40,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {16179#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16179#true} is VALID [2022-04-28 10:09:40,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {16179#true} assume true; {16179#true} is VALID [2022-04-28 10:09:40,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16179#true} {16179#true} #94#return; {16179#true} is VALID [2022-04-28 10:09:40,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {16179#true} call #t~ret17 := main(); {16179#true} is VALID [2022-04-28 10:09:40,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {16179#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16184#(= main_~y~0 0)} is VALID [2022-04-28 10:09:40,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {16184#(= 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; {16185#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:40,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {16185#(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; {16186#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:40,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {16186#(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; {16187#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:40,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {16187#(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; {16188#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:40,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {16188#(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; {16189#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:40,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {16189#(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; {16190#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:40,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {16190#(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; {16191#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:40,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {16191#(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; {16192#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:40,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {16192#(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; {16193#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:40,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {16193#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {16193#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:40,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {16193#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {16247#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:09:40,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {16247#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-28 10:09:40,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {16180#false} assume !(~y~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-28 10:09:40,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {16180#false} assume !(~x~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-28 10:09:40,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {16180#false} assume !(~z~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-28 10:09:40,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {16180#false} assume !(~y~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-28 10:09:40,337 INFO L272 TraceCheckUtils]: 22: Hoare triple {16180#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16180#false} is VALID [2022-04-28 10:09:40,338 INFO L290 TraceCheckUtils]: 23: Hoare triple {16180#false} ~cond := #in~cond; {16180#false} is VALID [2022-04-28 10:09:40,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {16180#false} assume 0 == ~cond; {16180#false} is VALID [2022-04-28 10:09:40,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {16180#false} assume !false; {16180#false} is VALID [2022-04-28 10:09:40,338 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:40,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:40,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {16180#false} assume !false; {16180#false} is VALID [2022-04-28 10:09:40,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {16180#false} assume 0 == ~cond; {16180#false} is VALID [2022-04-28 10:09:40,594 INFO L290 TraceCheckUtils]: 23: Hoare triple {16180#false} ~cond := #in~cond; {16180#false} is VALID [2022-04-28 10:09:40,594 INFO L272 TraceCheckUtils]: 22: Hoare triple {16180#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16180#false} is VALID [2022-04-28 10:09:40,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {16180#false} assume !(~y~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-28 10:09:40,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {16180#false} assume !(~z~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-28 10:09:40,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {16180#false} assume !(~x~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-28 10:09:40,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {16180#false} assume !(~y~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-28 10:09:40,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {16299#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-28 10:09:40,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {16303#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {16299#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:40,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {16303#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {16303#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:40,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {16310#(< 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; {16303#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:40,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {16314#(< 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; {16310#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:40,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {16318#(< 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; {16314#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:40,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {16322#(< 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; {16318#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:40,598 INFO L290 TraceCheckUtils]: 10: Hoare triple {16326#(< 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; {16322#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:40,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {16330#(< 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; {16326#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:40,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {16334#(< 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; {16330#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:40,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {16338#(< 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; {16334#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:40,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {16342#(< 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; {16338#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:09:40,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {16179#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16342#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:09:40,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {16179#true} call #t~ret17 := main(); {16179#true} is VALID [2022-04-28 10:09:40,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16179#true} {16179#true} #94#return; {16179#true} is VALID [2022-04-28 10:09:40,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {16179#true} assume true; {16179#true} is VALID [2022-04-28 10:09:40,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {16179#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16179#true} is VALID [2022-04-28 10:09:40,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {16179#true} call ULTIMATE.init(); {16179#true} is VALID [2022-04-28 10:09:40,601 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:40,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401869843] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:40,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:40,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 10:09:40,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:40,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [875664594] [2022-04-28 10:09:40,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [875664594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:40,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:40,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:09:40,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989416666] [2022-04-28 10:09:40,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:40,602 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 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-28 10:09:40,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:40,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:40,619 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-28 10:09:40,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:09:40,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:40,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:09:40,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:09:40,620 INFO L87 Difference]: Start difference. First operand 196 states and 265 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 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-28 10:09:43,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:43,297 INFO L93 Difference]: Finished difference Result 289 states and 431 transitions. [2022-04-28 10:09:43,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:09:43,297 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 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-28 10:09:43,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:43,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:43,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 160 transitions. [2022-04-28 10:09:43,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:43,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 160 transitions. [2022-04-28 10:09:43,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 160 transitions. [2022-04-28 10:09:43,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:43,434 INFO L225 Difference]: With dead ends: 289 [2022-04-28 10:09:43,434 INFO L226 Difference]: Without dead ends: 273 [2022-04-28 10:09:43,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=307, Invalid=1025, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 10:09:43,435 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 125 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:43,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 122 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:09:43,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-04-28 10:09:44,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 214. [2022-04-28 10:09:44,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:44,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 273 states. Second operand has 214 states, 209 states have (on average 1.3732057416267942) internal successors, (287), 209 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-28 10:09:44,110 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand has 214 states, 209 states have (on average 1.3732057416267942) internal successors, (287), 209 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-28 10:09:44,110 INFO L87 Difference]: Start difference. First operand 273 states. Second operand has 214 states, 209 states have (on average 1.3732057416267942) internal successors, (287), 209 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-28 10:09:44,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:44,114 INFO L93 Difference]: Finished difference Result 273 states and 368 transitions. [2022-04-28 10:09:44,115 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 368 transitions. [2022-04-28 10:09:44,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:44,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:44,115 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 209 states have (on average 1.3732057416267942) internal successors, (287), 209 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 273 states. [2022-04-28 10:09:44,116 INFO L87 Difference]: Start difference. First operand has 214 states, 209 states have (on average 1.3732057416267942) internal successors, (287), 209 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 273 states. [2022-04-28 10:09:44,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:44,120 INFO L93 Difference]: Finished difference Result 273 states and 368 transitions. [2022-04-28 10:09:44,120 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 368 transitions. [2022-04-28 10:09:44,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:44,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:44,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:44,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:44,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 209 states have (on average 1.3732057416267942) internal successors, (287), 209 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-28 10:09:44,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 291 transitions. [2022-04-28 10:09:44,125 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 291 transitions. Word has length 26 [2022-04-28 10:09:44,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:44,125 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 291 transitions. [2022-04-28 10:09:44,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:44,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 214 states and 291 transitions. [2022-04-28 10:09:44,562 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-28 10:09:44,562 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 291 transitions. [2022-04-28 10:09:44,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:09:44,563 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:44,563 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:44,580 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-28 10:09:44,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:44,767 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:44,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:44,768 INFO L85 PathProgramCache]: Analyzing trace with hash -424864583, now seen corresponding path program 19 times [2022-04-28 10:09:44,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:44,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1008368398] [2022-04-28 10:09:44,771 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:44,771 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:44,771 INFO L85 PathProgramCache]: Analyzing trace with hash -424864583, now seen corresponding path program 20 times [2022-04-28 10:09:44,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:44,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029761308] [2022-04-28 10:09:44,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:44,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:44,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:44,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {17954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17937#true} is VALID [2022-04-28 10:09:44,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {17937#true} assume true; {17937#true} is VALID [2022-04-28 10:09:44,967 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17937#true} {17937#true} #94#return; {17937#true} is VALID [2022-04-28 10:09:44,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {17937#true} call ULTIMATE.init(); {17954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:44,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {17954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17937#true} is VALID [2022-04-28 10:09:44,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {17937#true} assume true; {17937#true} is VALID [2022-04-28 10:09:44,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17937#true} {17937#true} #94#return; {17937#true} is VALID [2022-04-28 10:09:44,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {17937#true} call #t~ret17 := main(); {17937#true} is VALID [2022-04-28 10:09:44,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {17937#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17942#(= main_~y~0 0)} is VALID [2022-04-28 10:09:44,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {17942#(= 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; {17943#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:44,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {17943#(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; {17944#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:44,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {17944#(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; {17945#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:44,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {17945#(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; {17946#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:44,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {17946#(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; {17947#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:44,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {17947#(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; {17948#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:44,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {17948#(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; {17949#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:44,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {17949#(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; {17950#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:44,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {17950#(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; {17951#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:44,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {17951#(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; {17952#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:44,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {17952#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {17952#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:44,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {17952#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {17953#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:44,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {17953#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-28 10:09:44,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {17938#false} assume !(~y~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-28 10:09:44,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {17938#false} assume !(~x~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-28 10:09:44,975 INFO L290 TraceCheckUtils]: 21: Hoare triple {17938#false} assume !(~z~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-28 10:09:44,975 INFO L290 TraceCheckUtils]: 22: Hoare triple {17938#false} assume !(~y~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-28 10:09:44,975 INFO L272 TraceCheckUtils]: 23: Hoare triple {17938#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17938#false} is VALID [2022-04-28 10:09:44,975 INFO L290 TraceCheckUtils]: 24: Hoare triple {17938#false} ~cond := #in~cond; {17938#false} is VALID [2022-04-28 10:09:44,975 INFO L290 TraceCheckUtils]: 25: Hoare triple {17938#false} assume 0 == ~cond; {17938#false} is VALID [2022-04-28 10:09:44,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {17938#false} assume !false; {17938#false} is VALID [2022-04-28 10:09:44,976 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:44,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:44,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029761308] [2022-04-28 10:09:44,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029761308] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:44,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585724059] [2022-04-28 10:09:44,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:44,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:44,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:44,977 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-28 10:09:44,978 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-28 10:09:45,022 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:45,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:45,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:09:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:45,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:45,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {17937#true} call ULTIMATE.init(); {17937#true} is VALID [2022-04-28 10:09:45,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {17937#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17937#true} is VALID [2022-04-28 10:09:45,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {17937#true} assume true; {17937#true} is VALID [2022-04-28 10:09:45,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17937#true} {17937#true} #94#return; {17937#true} is VALID [2022-04-28 10:09:45,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {17937#true} call #t~ret17 := main(); {17937#true} is VALID [2022-04-28 10:09:45,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {17937#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17942#(= main_~y~0 0)} is VALID [2022-04-28 10:09:45,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {17942#(= 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; {17943#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:45,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {17943#(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; {17944#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:45,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {17944#(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; {17945#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:45,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {17945#(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; {17946#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:45,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {17946#(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; {17947#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:45,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {17947#(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; {17948#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:45,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {17948#(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; {17949#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:45,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {17949#(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; {17950#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:45,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {17950#(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; {17951#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:45,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {17951#(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; {17952#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:45,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {17952#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {17952#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:45,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {17952#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {18009#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:09:45,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {18009#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-28 10:09:45,286 INFO L290 TraceCheckUtils]: 19: Hoare triple {17938#false} assume !(~y~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-28 10:09:45,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {17938#false} assume !(~x~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-28 10:09:45,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {17938#false} assume !(~z~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-28 10:09:45,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {17938#false} assume !(~y~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-28 10:09:45,286 INFO L272 TraceCheckUtils]: 23: Hoare triple {17938#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17938#false} is VALID [2022-04-28 10:09:45,286 INFO L290 TraceCheckUtils]: 24: Hoare triple {17938#false} ~cond := #in~cond; {17938#false} is VALID [2022-04-28 10:09:45,286 INFO L290 TraceCheckUtils]: 25: Hoare triple {17938#false} assume 0 == ~cond; {17938#false} is VALID [2022-04-28 10:09:45,286 INFO L290 TraceCheckUtils]: 26: Hoare triple {17938#false} assume !false; {17938#false} is VALID [2022-04-28 10:09:45,286 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:45,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:45,573 INFO L290 TraceCheckUtils]: 26: Hoare triple {17938#false} assume !false; {17938#false} is VALID [2022-04-28 10:09:45,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {17938#false} assume 0 == ~cond; {17938#false} is VALID [2022-04-28 10:09:45,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {17938#false} ~cond := #in~cond; {17938#false} is VALID [2022-04-28 10:09:45,574 INFO L272 TraceCheckUtils]: 23: Hoare triple {17938#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17938#false} is VALID [2022-04-28 10:09:45,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {17938#false} assume !(~y~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-28 10:09:45,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {17938#false} assume !(~z~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-28 10:09:45,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {17938#false} assume !(~x~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-28 10:09:45,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {17938#false} assume !(~y~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-28 10:09:45,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {18061#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-28 10:09:45,575 INFO L290 TraceCheckUtils]: 17: Hoare triple {18065#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {18061#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:45,575 INFO L290 TraceCheckUtils]: 16: Hoare triple {18065#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {18065#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:45,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {18072#(< 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; {18065#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:45,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {18076#(< 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; {18072#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:45,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {18080#(< 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; {18076#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:45,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {18084#(< 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; {18080#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:45,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {18088#(< 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; {18084#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:45,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {18092#(< 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; {18088#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:45,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {18096#(< 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; {18092#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:45,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {18100#(< 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; {18096#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:45,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {18104#(< 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; {18100#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:09:45,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {18108#(< 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; {18104#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:09:45,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {17937#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18108#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:09:45,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {17937#true} call #t~ret17 := main(); {17937#true} is VALID [2022-04-28 10:09:45,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17937#true} {17937#true} #94#return; {17937#true} is VALID [2022-04-28 10:09:45,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {17937#true} assume true; {17937#true} is VALID [2022-04-28 10:09:45,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {17937#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17937#true} is VALID [2022-04-28 10:09:45,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {17937#true} call ULTIMATE.init(); {17937#true} is VALID [2022-04-28 10:09:45,582 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:45,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585724059] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:45,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:45,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:09:45,582 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:45,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1008368398] [2022-04-28 10:09:45,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1008368398] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:45,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:45,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:09:45,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056059437] [2022-04-28 10:09:45,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:45,583 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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-28 10:09:45,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:45,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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-28 10:09:45,599 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-28 10:09:45,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:09:45,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:45,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:09:45,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:09:45,600 INFO L87 Difference]: Start difference. First operand 214 states and 291 transitions. Second operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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-28 10:09:48,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:48,616 INFO L93 Difference]: Finished difference Result 313 states and 469 transitions. [2022-04-28 10:09:48,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:09:48,616 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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-28 10:09:48,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:48,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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-28 10:09:48,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 173 transitions. [2022-04-28 10:09:48,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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-28 10:09:48,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 173 transitions. [2022-04-28 10:09:48,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 173 transitions. [2022-04-28 10:09:48,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:48,765 INFO L225 Difference]: With dead ends: 313 [2022-04-28 10:09:48,765 INFO L226 Difference]: Without dead ends: 297 [2022-04-28 10:09:48,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=358, Invalid=1202, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:09:48,766 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 141 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:48,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 131 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1360 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:09:48,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-28 10:09:49,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 232. [2022-04-28 10:09:49,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:49,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 232 states, 227 states have (on average 1.3788546255506609) internal successors, (313), 227 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-28 10:09:49,500 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 232 states, 227 states have (on average 1.3788546255506609) internal successors, (313), 227 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-28 10:09:49,501 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 232 states, 227 states have (on average 1.3788546255506609) internal successors, (313), 227 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-28 10:09:49,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:49,506 INFO L93 Difference]: Finished difference Result 297 states and 402 transitions. [2022-04-28 10:09:49,506 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 402 transitions. [2022-04-28 10:09:49,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:49,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:49,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 232 states, 227 states have (on average 1.3788546255506609) internal successors, (313), 227 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 297 states. [2022-04-28 10:09:49,511 INFO L87 Difference]: Start difference. First operand has 232 states, 227 states have (on average 1.3788546255506609) internal successors, (313), 227 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 297 states. [2022-04-28 10:09:49,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:49,516 INFO L93 Difference]: Finished difference Result 297 states and 402 transitions. [2022-04-28 10:09:49,517 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 402 transitions. [2022-04-28 10:09:49,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:49,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:49,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:49,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:49,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 227 states have (on average 1.3788546255506609) internal successors, (313), 227 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-28 10:09:49,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 317 transitions. [2022-04-28 10:09:49,522 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 317 transitions. Word has length 27 [2022-04-28 10:09:49,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:49,522 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 317 transitions. [2022-04-28 10:09:49,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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-28 10:09:49,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 232 states and 317 transitions. [2022-04-28 10:09:50,013 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-28 10:09:50,013 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 317 transitions. [2022-04-28 10:09:50,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:09:50,013 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:50,013 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:50,030 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-28 10:09:50,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:50,214 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:50,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:50,214 INFO L85 PathProgramCache]: Analyzing trace with hash -184866059, now seen corresponding path program 3 times [2022-04-28 10:09:50,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:50,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1662625746] [2022-04-28 10:09:50,217 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:50,217 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:50,218 INFO L85 PathProgramCache]: Analyzing trace with hash -184866059, now seen corresponding path program 4 times [2022-04-28 10:09:50,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:50,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42251634] [2022-04-28 10:09:50,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:50,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:50,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:50,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {19849#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19837#true} is VALID [2022-04-28 10:09:50,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {19837#true} assume true; {19837#true} is VALID [2022-04-28 10:09:50,320 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19837#true} {19837#true} #94#return; {19837#true} is VALID [2022-04-28 10:09:50,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {19837#true} call ULTIMATE.init(); {19849#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:50,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {19849#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19837#true} is VALID [2022-04-28 10:09:50,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {19837#true} assume true; {19837#true} is VALID [2022-04-28 10:09:50,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19837#true} {19837#true} #94#return; {19837#true} is VALID [2022-04-28 10:09:50,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {19837#true} call #t~ret17 := main(); {19837#true} is VALID [2022-04-28 10:09:50,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {19837#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19842#(= main_~y~0 0)} is VALID [2022-04-28 10:09:50,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {19842#(= 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; {19843#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:50,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {19843#(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; {19844#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:50,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {19844#(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; {19845#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:50,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {19845#(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; {19846#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:50,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {19846#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {19846#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:50,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {19846#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {19847#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:50,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {19847#(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; {19848#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:50,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {19848#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {19838#false} is VALID [2022-04-28 10:09:50,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {19838#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19838#false} is VALID [2022-04-28 10:09:50,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {19838#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19838#false} is VALID [2022-04-28 10:09:50,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {19838#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19838#false} is VALID [2022-04-28 10:09:50,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {19838#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19838#false} is VALID [2022-04-28 10:09:50,334 INFO L290 TraceCheckUtils]: 18: Hoare triple {19838#false} assume !(~y~0 % 4294967296 > 0); {19838#false} is VALID [2022-04-28 10:09:50,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {19838#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; {19838#false} is VALID [2022-04-28 10:09:50,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {19838#false} assume !(~x~0 % 4294967296 > 0); {19838#false} is VALID [2022-04-28 10:09:50,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {19838#false} assume !(~z~0 % 4294967296 > 0); {19838#false} is VALID [2022-04-28 10:09:50,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {19838#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {19838#false} is VALID [2022-04-28 10:09:50,334 INFO L290 TraceCheckUtils]: 23: Hoare triple {19838#false} assume !(~y~0 % 4294967296 > 0); {19838#false} is VALID [2022-04-28 10:09:50,334 INFO L272 TraceCheckUtils]: 24: Hoare triple {19838#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19838#false} is VALID [2022-04-28 10:09:50,334 INFO L290 TraceCheckUtils]: 25: Hoare triple {19838#false} ~cond := #in~cond; {19838#false} is VALID [2022-04-28 10:09:50,334 INFO L290 TraceCheckUtils]: 26: Hoare triple {19838#false} assume 0 == ~cond; {19838#false} is VALID [2022-04-28 10:09:50,335 INFO L290 TraceCheckUtils]: 27: Hoare triple {19838#false} assume !false; {19838#false} is VALID [2022-04-28 10:09:50,335 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:09:50,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:50,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42251634] [2022-04-28 10:09:50,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42251634] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:50,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581777900] [2022-04-28 10:09:50,336 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:50,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:50,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:50,338 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-28 10:09:50,354 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-28 10:09:50,379 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:50,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:50,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 10:09:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:50,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:50,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {19837#true} call ULTIMATE.init(); {19837#true} is VALID [2022-04-28 10:09:50,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {19837#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19837#true} is VALID [2022-04-28 10:09:50,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {19837#true} assume true; {19837#true} is VALID [2022-04-28 10:09:50,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19837#true} {19837#true} #94#return; {19837#true} is VALID [2022-04-28 10:09:50,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {19837#true} call #t~ret17 := main(); {19837#true} is VALID [2022-04-28 10:09:50,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {19837#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19842#(= main_~y~0 0)} is VALID [2022-04-28 10:09:50,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {19842#(= 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; {19843#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:50,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {19843#(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; {19844#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:50,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {19844#(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; {19845#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:50,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {19845#(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; {19846#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:50,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {19846#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {19846#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:50,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {19846#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {19886#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:50,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {19886#(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; {19890#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:09:50,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {19890#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {19838#false} is VALID [2022-04-28 10:09:50,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {19838#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19838#false} is VALID [2022-04-28 10:09:50,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {19838#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19838#false} is VALID [2022-04-28 10:09:50,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {19838#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19838#false} is VALID [2022-04-28 10:09:50,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {19838#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19838#false} is VALID [2022-04-28 10:09:50,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {19838#false} assume !(~y~0 % 4294967296 > 0); {19838#false} is VALID [2022-04-28 10:09:50,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {19838#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; {19838#false} is VALID [2022-04-28 10:09:50,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {19838#false} assume !(~x~0 % 4294967296 > 0); {19838#false} is VALID [2022-04-28 10:09:50,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {19838#false} assume !(~z~0 % 4294967296 > 0); {19838#false} is VALID [2022-04-28 10:09:50,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {19838#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {19838#false} is VALID [2022-04-28 10:09:50,511 INFO L290 TraceCheckUtils]: 23: Hoare triple {19838#false} assume !(~y~0 % 4294967296 > 0); {19838#false} is VALID [2022-04-28 10:09:50,511 INFO L272 TraceCheckUtils]: 24: Hoare triple {19838#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19838#false} is VALID [2022-04-28 10:09:50,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {19838#false} ~cond := #in~cond; {19838#false} is VALID [2022-04-28 10:09:50,511 INFO L290 TraceCheckUtils]: 26: Hoare triple {19838#false} assume 0 == ~cond; {19838#false} is VALID [2022-04-28 10:09:50,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {19838#false} assume !false; {19838#false} is VALID [2022-04-28 10:09:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:09:50,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:50,633 INFO L290 TraceCheckUtils]: 27: Hoare triple {19838#false} assume !false; {19838#false} is VALID [2022-04-28 10:09:50,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {19838#false} assume 0 == ~cond; {19838#false} is VALID [2022-04-28 10:09:50,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {19838#false} ~cond := #in~cond; {19838#false} is VALID [2022-04-28 10:09:50,633 INFO L272 TraceCheckUtils]: 24: Hoare triple {19838#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19838#false} is VALID [2022-04-28 10:09:50,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {19838#false} assume !(~y~0 % 4294967296 > 0); {19838#false} is VALID [2022-04-28 10:09:50,633 INFO L290 TraceCheckUtils]: 22: Hoare triple {19838#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {19838#false} is VALID [2022-04-28 10:09:50,633 INFO L290 TraceCheckUtils]: 21: Hoare triple {19838#false} assume !(~z~0 % 4294967296 > 0); {19838#false} is VALID [2022-04-28 10:09:50,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {19838#false} assume !(~x~0 % 4294967296 > 0); {19838#false} is VALID [2022-04-28 10:09:50,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {19838#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; {19838#false} is VALID [2022-04-28 10:09:50,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {19838#false} assume !(~y~0 % 4294967296 > 0); {19838#false} is VALID [2022-04-28 10:09:50,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {19838#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19838#false} is VALID [2022-04-28 10:09:50,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {19838#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19838#false} is VALID [2022-04-28 10:09:50,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {19972#(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; {19838#false} is VALID [2022-04-28 10:09:50,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {19976#(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; {19972#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:09:50,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {19980#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {19976#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:09:50,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {19984#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19980#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:09:50,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {19837#true} ~z~0 := ~y~0; {19984#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:09:50,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {19837#true} assume !(~x~0 % 4294967296 > 0); {19837#true} is VALID [2022-04-28 10:09:50,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {19837#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19837#true} is VALID [2022-04-28 10:09:50,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {19837#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19837#true} is VALID [2022-04-28 10:09:50,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {19837#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19837#true} is VALID [2022-04-28 10:09:50,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {19837#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19837#true} is VALID [2022-04-28 10:09:50,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {19837#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19837#true} is VALID [2022-04-28 10:09:50,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {19837#true} call #t~ret17 := main(); {19837#true} is VALID [2022-04-28 10:09:50,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19837#true} {19837#true} #94#return; {19837#true} is VALID [2022-04-28 10:09:50,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {19837#true} assume true; {19837#true} is VALID [2022-04-28 10:09:50,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {19837#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19837#true} is VALID [2022-04-28 10:09:50,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {19837#true} call ULTIMATE.init(); {19837#true} is VALID [2022-04-28 10:09:50,638 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:09:50,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581777900] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:50,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:50,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 6] total 16 [2022-04-28 10:09:50,639 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:50,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1662625746] [2022-04-28 10:09:50,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1662625746] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:50,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:50,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:09:50,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97264394] [2022-04-28 10:09:50,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:50,639 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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 28 [2022-04-28 10:09:50,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:50,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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-28 10:09:50,662 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-28 10:09:50,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:09:50,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:50,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:09:50,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:09:50,663 INFO L87 Difference]: Start difference. First operand 232 states and 317 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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-28 10:09:52,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:52,121 INFO L93 Difference]: Finished difference Result 275 states and 370 transitions. [2022-04-28 10:09:52,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:09:52,121 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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 28 [2022-04-28 10:09:52,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:52,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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-28 10:09:52,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 87 transitions. [2022-04-28 10:09:52,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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-28 10:09:52,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 87 transitions. [2022-04-28 10:09:52,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 87 transitions. [2022-04-28 10:09:52,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:52,191 INFO L225 Difference]: With dead ends: 275 [2022-04-28 10:09:52,191 INFO L226 Difference]: Without dead ends: 260 [2022-04-28 10:09:52,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:09:52,192 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 71 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:52,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 69 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:09:52,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-04-28 10:09:52,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 232. [2022-04-28 10:09:52,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:52,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 260 states. Second operand has 232 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 227 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:52,926 INFO L74 IsIncluded]: Start isIncluded. First operand 260 states. Second operand has 232 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 227 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:52,926 INFO L87 Difference]: Start difference. First operand 260 states. Second operand has 232 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 227 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:52,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:52,930 INFO L93 Difference]: Finished difference Result 260 states and 354 transitions. [2022-04-28 10:09:52,931 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 354 transitions. [2022-04-28 10:09:52,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:52,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:52,931 INFO L74 IsIncluded]: Start isIncluded. First operand has 232 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 227 states have internal predecessors, (312), 3 states have call successors, (3), 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 260 states. [2022-04-28 10:09:52,932 INFO L87 Difference]: Start difference. First operand has 232 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 227 states have internal predecessors, (312), 3 states have call successors, (3), 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 260 states. [2022-04-28 10:09:52,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:52,936 INFO L93 Difference]: Finished difference Result 260 states and 354 transitions. [2022-04-28 10:09:52,936 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 354 transitions. [2022-04-28 10:09:52,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:52,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:52,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:52,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:52,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 227 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:52,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 316 transitions. [2022-04-28 10:09:52,941 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 316 transitions. Word has length 28 [2022-04-28 10:09:52,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:52,941 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 316 transitions. [2022-04-28 10:09:52,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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-28 10:09:52,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 232 states and 316 transitions. [2022-04-28 10:09:53,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 316 edges. 316 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:53,432 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 316 transitions. [2022-04-28 10:09:53,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:09:53,432 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:53,432 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:53,454 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-28 10:09:53,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:53,654 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:53,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:53,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1906006827, now seen corresponding path program 7 times [2022-04-28 10:09:53,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:53,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [47727057] [2022-04-28 10:09:53,657 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:53,657 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:53,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1906006827, now seen corresponding path program 8 times [2022-04-28 10:09:53,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:53,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461501810] [2022-04-28 10:09:53,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:53,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:53,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:53,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {21587#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21573#true} is VALID [2022-04-28 10:09:53,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {21573#true} assume true; {21573#true} is VALID [2022-04-28 10:09:53,789 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21573#true} {21573#true} #94#return; {21573#true} is VALID [2022-04-28 10:09:53,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {21573#true} call ULTIMATE.init(); {21587#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:53,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {21587#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21573#true} is VALID [2022-04-28 10:09:53,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {21573#true} assume true; {21573#true} is VALID [2022-04-28 10:09:53,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21573#true} {21573#true} #94#return; {21573#true} is VALID [2022-04-28 10:09:53,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {21573#true} call #t~ret17 := main(); {21573#true} is VALID [2022-04-28 10:09:53,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {21573#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21578#(= main_~y~0 0)} is VALID [2022-04-28 10:09:53,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {21578#(= 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; {21579#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:53,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {21579#(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; {21580#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:53,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {21580#(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; {21581#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:53,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {21581#(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; {21582#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:53,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {21582#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {21582#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:53,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {21582#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {21583#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:53,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {21583#(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; {21584#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:53,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {21584#(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; {21585#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:53,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {21585#(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; {21586#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:53,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {21586#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {21574#false} is VALID [2022-04-28 10:09:53,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {21574#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21574#false} is VALID [2022-04-28 10:09:53,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {21574#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21574#false} is VALID [2022-04-28 10:09:53,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {21574#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21574#false} is VALID [2022-04-28 10:09:53,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {21574#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21574#false} is VALID [2022-04-28 10:09:53,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {21574#false} assume !(~y~0 % 4294967296 > 0); {21574#false} is VALID [2022-04-28 10:09:53,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {21574#false} assume !(~x~0 % 4294967296 > 0); {21574#false} is VALID [2022-04-28 10:09:53,797 INFO L290 TraceCheckUtils]: 22: Hoare triple {21574#false} assume !(~z~0 % 4294967296 > 0); {21574#false} is VALID [2022-04-28 10:09:53,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {21574#false} assume !(~y~0 % 4294967296 > 0); {21574#false} is VALID [2022-04-28 10:09:53,798 INFO L272 TraceCheckUtils]: 24: Hoare triple {21574#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21574#false} is VALID [2022-04-28 10:09:53,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {21574#false} ~cond := #in~cond; {21574#false} is VALID [2022-04-28 10:09:53,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {21574#false} assume 0 == ~cond; {21574#false} is VALID [2022-04-28 10:09:53,798 INFO L290 TraceCheckUtils]: 27: Hoare triple {21574#false} assume !false; {21574#false} is VALID [2022-04-28 10:09:53,798 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-28 10:09:53,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:53,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461501810] [2022-04-28 10:09:53,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461501810] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:53,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593256744] [2022-04-28 10:09:53,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:53,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:53,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:53,799 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-28 10:09:53,800 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-28 10:09:53,843 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:53,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:53,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:09:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:53,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:53,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {21573#true} call ULTIMATE.init(); {21573#true} is VALID [2022-04-28 10:09:53,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {21573#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21573#true} is VALID [2022-04-28 10:09:53,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {21573#true} assume true; {21573#true} is VALID [2022-04-28 10:09:53,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21573#true} {21573#true} #94#return; {21573#true} is VALID [2022-04-28 10:09:53,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {21573#true} call #t~ret17 := main(); {21573#true} is VALID [2022-04-28 10:09:53,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {21573#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21573#true} is VALID [2022-04-28 10:09:53,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {21573#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21573#true} is VALID [2022-04-28 10:09:53,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {21573#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21612#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:53,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {21612#(< 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; {21616#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:53,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {21616#(< 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; {21620#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:53,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {21620#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {21620#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:53,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {21620#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {21620#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:53,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {21620#(< 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; {21616#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:53,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {21616#(< 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; {21612#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:53,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {21612#(< 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; {21636#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:53,987 INFO L290 TraceCheckUtils]: 15: Hoare triple {21636#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {21636#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:53,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {21636#(< 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; {21636#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:53,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {21636#(< 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; {21636#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:53,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {21636#(< 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; {21636#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:53,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {21636#(< 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; {21636#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:53,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {21636#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {21636#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:53,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {21636#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {21574#false} is VALID [2022-04-28 10:09:53,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {21574#false} assume !(~z~0 % 4294967296 > 0); {21574#false} is VALID [2022-04-28 10:09:53,989 INFO L290 TraceCheckUtils]: 23: Hoare triple {21574#false} assume !(~y~0 % 4294967296 > 0); {21574#false} is VALID [2022-04-28 10:09:53,989 INFO L272 TraceCheckUtils]: 24: Hoare triple {21574#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21574#false} is VALID [2022-04-28 10:09:53,989 INFO L290 TraceCheckUtils]: 25: Hoare triple {21574#false} ~cond := #in~cond; {21574#false} is VALID [2022-04-28 10:09:53,989 INFO L290 TraceCheckUtils]: 26: Hoare triple {21574#false} assume 0 == ~cond; {21574#false} is VALID [2022-04-28 10:09:53,989 INFO L290 TraceCheckUtils]: 27: Hoare triple {21574#false} assume !false; {21574#false} is VALID [2022-04-28 10:09:53,990 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 10:09:53,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:54,081 INFO L290 TraceCheckUtils]: 27: Hoare triple {21574#false} assume !false; {21574#false} is VALID [2022-04-28 10:09:54,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {21574#false} assume 0 == ~cond; {21574#false} is VALID [2022-04-28 10:09:54,081 INFO L290 TraceCheckUtils]: 25: Hoare triple {21574#false} ~cond := #in~cond; {21574#false} is VALID [2022-04-28 10:09:54,081 INFO L272 TraceCheckUtils]: 24: Hoare triple {21574#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21574#false} is VALID [2022-04-28 10:09:54,081 INFO L290 TraceCheckUtils]: 23: Hoare triple {21574#false} assume !(~y~0 % 4294967296 > 0); {21574#false} is VALID [2022-04-28 10:09:54,081 INFO L290 TraceCheckUtils]: 22: Hoare triple {21574#false} assume !(~z~0 % 4294967296 > 0); {21574#false} is VALID [2022-04-28 10:09:54,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {21636#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {21574#false} is VALID [2022-04-28 10:09:54,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {21636#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {21636#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:54,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {21636#(< 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; {21636#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:54,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {21636#(< 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; {21636#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:54,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {21636#(< 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; {21636#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:54,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {21636#(< 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; {21636#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:54,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {21636#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {21636#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:54,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {21612#(< 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; {21636#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:54,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {21616#(< 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; {21612#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:54,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {21620#(< 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; {21616#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:54,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {21620#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {21620#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:54,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {21620#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {21620#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:54,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {21616#(< 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; {21620#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:54,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {21612#(< 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; {21616#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:54,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {21573#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21612#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:54,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {21573#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21573#true} is VALID [2022-04-28 10:09:54,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {21573#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21573#true} is VALID [2022-04-28 10:09:54,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {21573#true} call #t~ret17 := main(); {21573#true} is VALID [2022-04-28 10:09:54,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21573#true} {21573#true} #94#return; {21573#true} is VALID [2022-04-28 10:09:54,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {21573#true} assume true; {21573#true} is VALID [2022-04-28 10:09:54,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {21573#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21573#true} is VALID [2022-04-28 10:09:54,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {21573#true} call ULTIMATE.init(); {21573#true} is VALID [2022-04-28 10:09:54,090 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 10:09:54,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593256744] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:54,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:54,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 16 [2022-04-28 10:09:54,090 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:54,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [47727057] [2022-04-28 10:09:54,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [47727057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:54,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:54,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:09:54,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103246551] [2022-04-28 10:09:54,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:54,091 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 28 [2022-04-28 10:09:54,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:54,091 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-28 10:09:54,109 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-28 10:09:54,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:09:54,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:54,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:09:54,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:09:54,110 INFO L87 Difference]: Start difference. First operand 232 states and 316 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-28 10:09:55,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:55,836 INFO L93 Difference]: Finished difference Result 307 states and 426 transitions. [2022-04-28 10:09:55,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:09:55,836 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 28 [2022-04-28 10:09:55,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:55,837 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-28 10:09:55,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 92 transitions. [2022-04-28 10:09:55,838 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-28 10:09:55,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 92 transitions. [2022-04-28 10:09:55,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 92 transitions. [2022-04-28 10:09:55,928 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-28 10:09:55,932 INFO L225 Difference]: With dead ends: 307 [2022-04-28 10:09:55,933 INFO L226 Difference]: Without dead ends: 254 [2022-04-28 10:09:55,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:09:55,934 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 64 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:55,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 75 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:09:55,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-04-28 10:09:56,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 233. [2022-04-28 10:09:56,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:56,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 254 states. Second operand has 233 states, 228 states have (on average 1.368421052631579) internal successors, (312), 228 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:56,773 INFO L74 IsIncluded]: Start isIncluded. First operand 254 states. Second operand has 233 states, 228 states have (on average 1.368421052631579) internal successors, (312), 228 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:56,773 INFO L87 Difference]: Start difference. First operand 254 states. Second operand has 233 states, 228 states have (on average 1.368421052631579) internal successors, (312), 228 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:56,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:56,777 INFO L93 Difference]: Finished difference Result 254 states and 347 transitions. [2022-04-28 10:09:56,777 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 347 transitions. [2022-04-28 10:09:56,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:56,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:56,778 INFO L74 IsIncluded]: Start isIncluded. First operand has 233 states, 228 states have (on average 1.368421052631579) internal successors, (312), 228 states have internal predecessors, (312), 3 states have call successors, (3), 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 254 states. [2022-04-28 10:09:56,778 INFO L87 Difference]: Start difference. First operand has 233 states, 228 states have (on average 1.368421052631579) internal successors, (312), 228 states have internal predecessors, (312), 3 states have call successors, (3), 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 254 states. [2022-04-28 10:09:56,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:56,782 INFO L93 Difference]: Finished difference Result 254 states and 347 transitions. [2022-04-28 10:09:56,782 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 347 transitions. [2022-04-28 10:09:56,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:56,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:56,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:56,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:56,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 228 states have (on average 1.368421052631579) internal successors, (312), 228 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:56,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 316 transitions. [2022-04-28 10:09:56,787 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 316 transitions. Word has length 28 [2022-04-28 10:09:56,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:56,788 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 316 transitions. [2022-04-28 10:09:56,788 INFO L496 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-28 10:09:56,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 233 states and 316 transitions. [2022-04-28 10:09:57,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 316 edges. 316 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:57,276 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 316 transitions. [2022-04-28 10:09:57,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:09:57,277 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:57,277 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:57,294 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-28 10:09:57,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-28 10:09:57,483 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:57,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:57,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1554538282, now seen corresponding path program 21 times [2022-04-28 10:09:57,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:57,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [996171029] [2022-04-28 10:09:57,486 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:57,486 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:57,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1554538282, now seen corresponding path program 22 times [2022-04-28 10:09:57,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:57,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109261136] [2022-04-28 10:09:57,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:57,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:57,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:57,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {23393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23375#true} is VALID [2022-04-28 10:09:57,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {23375#true} assume true; {23375#true} is VALID [2022-04-28 10:09:57,704 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23375#true} {23375#true} #94#return; {23375#true} is VALID [2022-04-28 10:09:57,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {23375#true} call ULTIMATE.init(); {23393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:57,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {23393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23375#true} is VALID [2022-04-28 10:09:57,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {23375#true} assume true; {23375#true} is VALID [2022-04-28 10:09:57,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23375#true} {23375#true} #94#return; {23375#true} is VALID [2022-04-28 10:09:57,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {23375#true} call #t~ret17 := main(); {23375#true} is VALID [2022-04-28 10:09:57,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {23375#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23380#(= main_~y~0 0)} is VALID [2022-04-28 10:09:57,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {23380#(= 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; {23381#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:57,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {23381#(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; {23382#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:57,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {23382#(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; {23383#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:57,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {23383#(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; {23384#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:57,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {23384#(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; {23385#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:57,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {23385#(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; {23386#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:57,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {23386#(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; {23387#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:57,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {23387#(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; {23388#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:57,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {23388#(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; {23389#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:57,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {23389#(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; {23390#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:57,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {23390#(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; {23391#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:57,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {23391#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {23391#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:57,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {23391#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {23392#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-28 10:09:57,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {23392#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-28 10:09:57,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {23376#false} assume !(~y~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-28 10:09:57,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {23376#false} assume !(~x~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-28 10:09:57,713 INFO L290 TraceCheckUtils]: 22: Hoare triple {23376#false} assume !(~z~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-28 10:09:57,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {23376#false} assume !(~y~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-28 10:09:57,713 INFO L272 TraceCheckUtils]: 24: Hoare triple {23376#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23376#false} is VALID [2022-04-28 10:09:57,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {23376#false} ~cond := #in~cond; {23376#false} is VALID [2022-04-28 10:09:57,713 INFO L290 TraceCheckUtils]: 26: Hoare triple {23376#false} assume 0 == ~cond; {23376#false} is VALID [2022-04-28 10:09:57,713 INFO L290 TraceCheckUtils]: 27: Hoare triple {23376#false} assume !false; {23376#false} is VALID [2022-04-28 10:09:57,713 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:57,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:57,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109261136] [2022-04-28 10:09:57,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109261136] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:57,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754769036] [2022-04-28 10:09:57,713 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:57,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:57,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:57,714 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-28 10:09:57,715 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-28 10:09:57,748 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:57,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:57,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:09:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:57,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:57,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {23375#true} call ULTIMATE.init(); {23375#true} is VALID [2022-04-28 10:09:57,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {23375#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23375#true} is VALID [2022-04-28 10:09:57,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {23375#true} assume true; {23375#true} is VALID [2022-04-28 10:09:57,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23375#true} {23375#true} #94#return; {23375#true} is VALID [2022-04-28 10:09:57,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {23375#true} call #t~ret17 := main(); {23375#true} is VALID [2022-04-28 10:09:57,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {23375#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23380#(= main_~y~0 0)} is VALID [2022-04-28 10:09:57,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {23380#(= 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; {23381#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:57,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {23381#(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; {23382#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:57,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {23382#(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; {23383#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:57,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {23383#(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; {23384#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:57,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {23384#(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; {23385#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:57,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {23385#(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; {23386#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:57,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {23386#(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; {23387#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:57,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {23387#(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; {23388#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:57,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {23388#(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; {23389#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:57,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {23389#(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; {23390#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:57,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {23390#(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; {23391#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:57,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {23391#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {23391#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:57,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {23391#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {23451#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:09:57,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {23451#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-28 10:09:57,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {23376#false} assume !(~y~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-28 10:09:57,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {23376#false} assume !(~x~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-28 10:09:57,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {23376#false} assume !(~z~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-28 10:09:57,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {23376#false} assume !(~y~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-28 10:09:57,997 INFO L272 TraceCheckUtils]: 24: Hoare triple {23376#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23376#false} is VALID [2022-04-28 10:09:57,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {23376#false} ~cond := #in~cond; {23376#false} is VALID [2022-04-28 10:09:57,997 INFO L290 TraceCheckUtils]: 26: Hoare triple {23376#false} assume 0 == ~cond; {23376#false} is VALID [2022-04-28 10:09:57,997 INFO L290 TraceCheckUtils]: 27: Hoare triple {23376#false} assume !false; {23376#false} is VALID [2022-04-28 10:09:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:57,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:58,359 INFO L290 TraceCheckUtils]: 27: Hoare triple {23376#false} assume !false; {23376#false} is VALID [2022-04-28 10:09:58,359 INFO L290 TraceCheckUtils]: 26: Hoare triple {23376#false} assume 0 == ~cond; {23376#false} is VALID [2022-04-28 10:09:58,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {23376#false} ~cond := #in~cond; {23376#false} is VALID [2022-04-28 10:09:58,359 INFO L272 TraceCheckUtils]: 24: Hoare triple {23376#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23376#false} is VALID [2022-04-28 10:09:58,359 INFO L290 TraceCheckUtils]: 23: Hoare triple {23376#false} assume !(~y~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-28 10:09:58,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {23376#false} assume !(~z~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-28 10:09:58,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {23376#false} assume !(~x~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-28 10:09:58,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {23376#false} assume !(~y~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-28 10:09:58,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {23503#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-28 10:09:58,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {23507#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {23503#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:58,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {23507#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {23507#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:58,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {23514#(< 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; {23507#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:58,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {23518#(< 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; {23514#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:58,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {23522#(< 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; {23518#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:58,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {23526#(< 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; {23522#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:58,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {23530#(< 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; {23526#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:58,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {23534#(< 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; {23530#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:58,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {23538#(< 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; {23534#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:58,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {23542#(< 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; {23538#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:58,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {23546#(< 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; {23542#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:09:58,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {23550#(< 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; {23546#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:09:58,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {23554#(< 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; {23550#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:09:58,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {23375#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23554#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:09:58,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {23375#true} call #t~ret17 := main(); {23375#true} is VALID [2022-04-28 10:09:58,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23375#true} {23375#true} #94#return; {23375#true} is VALID [2022-04-28 10:09:58,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {23375#true} assume true; {23375#true} is VALID [2022-04-28 10:09:58,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {23375#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23375#true} is VALID [2022-04-28 10:09:58,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {23375#true} call ULTIMATE.init(); {23375#true} is VALID [2022-04-28 10:09:58,368 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:58,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754769036] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:58,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:58,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 10:09:58,369 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:58,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [996171029] [2022-04-28 10:09:58,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [996171029] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:58,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:58,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:09:58,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911036287] [2022-04-28 10:09:58,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:58,369 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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-28 10:09:58,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:58,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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-28 10:09:58,388 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-28 10:09:58,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:09:58,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:58,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:09:58,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:09:58,389 INFO L87 Difference]: Start difference. First operand 233 states and 316 transitions. Second operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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-28 10:10:01,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:01,813 INFO L93 Difference]: Finished difference Result 338 states and 506 transitions. [2022-04-28 10:10:01,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:10:01,813 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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-28 10:10:01,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:01,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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-28 10:10:01,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 186 transitions. [2022-04-28 10:10:01,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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-28 10:10:01,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 186 transitions. [2022-04-28 10:10:01,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 186 transitions. [2022-04-28 10:10:01,976 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-28 10:10:01,981 INFO L225 Difference]: With dead ends: 338 [2022-04-28 10:10:01,981 INFO L226 Difference]: Without dead ends: 322 [2022-04-28 10:10:01,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=413, Invalid=1393, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 10:10:01,982 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 155 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:01,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 142 Invalid, 1712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1615 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 10:10:01,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-04-28 10:10:02,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 251. [2022-04-28 10:10:02,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:02,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 322 states. Second operand has 251 states, 246 states have (on average 1.3739837398373984) internal successors, (338), 246 states have internal predecessors, (338), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:02,776 INFO L74 IsIncluded]: Start isIncluded. First operand 322 states. Second operand has 251 states, 246 states have (on average 1.3739837398373984) internal successors, (338), 246 states have internal predecessors, (338), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:02,776 INFO L87 Difference]: Start difference. First operand 322 states. Second operand has 251 states, 246 states have (on average 1.3739837398373984) internal successors, (338), 246 states have internal predecessors, (338), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:02,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:02,780 INFO L93 Difference]: Finished difference Result 322 states and 435 transitions. [2022-04-28 10:10:02,780 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 435 transitions. [2022-04-28 10:10:02,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:02,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:02,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 251 states, 246 states have (on average 1.3739837398373984) internal successors, (338), 246 states have internal predecessors, (338), 3 states have call successors, (3), 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 322 states. [2022-04-28 10:10:02,781 INFO L87 Difference]: Start difference. First operand has 251 states, 246 states have (on average 1.3739837398373984) internal successors, (338), 246 states have internal predecessors, (338), 3 states have call successors, (3), 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 322 states. [2022-04-28 10:10:02,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:02,786 INFO L93 Difference]: Finished difference Result 322 states and 435 transitions. [2022-04-28 10:10:02,786 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 435 transitions. [2022-04-28 10:10:02,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:02,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:02,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:02,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:02,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 246 states have (on average 1.3739837398373984) internal successors, (338), 246 states have internal predecessors, (338), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:02,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 342 transitions. [2022-04-28 10:10:02,792 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 342 transitions. Word has length 28 [2022-04-28 10:10:02,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:02,792 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 342 transitions. [2022-04-28 10:10:02,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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-28 10:10:02,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 251 states and 342 transitions. [2022-04-28 10:10:03,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 342 edges. 342 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:03,299 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 342 transitions. [2022-04-28 10:10:03,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:10:03,299 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:03,299 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:03,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-28 10:10:03,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-28 10:10:03,503 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:03,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:03,504 INFO L85 PathProgramCache]: Analyzing trace with hash 939274105, now seen corresponding path program 5 times [2022-04-28 10:10:03,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:03,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [847636328] [2022-04-28 10:10:03,507 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:03,507 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:03,507 INFO L85 PathProgramCache]: Analyzing trace with hash 939274105, now seen corresponding path program 6 times [2022-04-28 10:10:03,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:03,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152168523] [2022-04-28 10:10:03,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:03,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:03,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:03,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {25438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25423#true} is VALID [2022-04-28 10:10:03,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {25423#true} assume true; {25423#true} is VALID [2022-04-28 10:10:03,848 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25423#true} {25423#true} #94#return; {25423#true} is VALID [2022-04-28 10:10:03,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {25423#true} call ULTIMATE.init(); {25438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:03,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {25438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25423#true} is VALID [2022-04-28 10:10:03,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {25423#true} assume true; {25423#true} is VALID [2022-04-28 10:10:03,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25423#true} {25423#true} #94#return; {25423#true} is VALID [2022-04-28 10:10:03,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {25423#true} call #t~ret17 := main(); {25423#true} is VALID [2022-04-28 10:10:03,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {25423#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25428#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:10:03,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {25428#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= 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; {25429#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:03,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {25429#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 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; {25430#(and (<= 2 main_~y~0) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)))} is VALID [2022-04-28 10:10:03,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {25430#(and (<= 2 main_~y~0) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)))} assume !(~x~0 % 4294967296 > 0); {25431#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:03,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {25431#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-28 10:10:03,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~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; {25433#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-28 10:10:03,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {25433#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25434#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-28 10:10:03,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {25434#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {25434#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-28 10:10:03,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {25434#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~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; {25433#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-28 10:10:03,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {25433#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~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; {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-28 10:10:03,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} assume !(~y~0 % 4294967296 > 0); {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-28 10:10:03,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~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; {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-28 10:10:03,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~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; {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-28 10:10:03,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} assume !(~x~0 % 4294967296 > 0); {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-28 10:10:03,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {25433#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-28 10:10:03,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {25433#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {25434#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-28 10:10:03,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {25434#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {25434#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-28 10:10:03,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {25434#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {25433#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-28 10:10:03,886 INFO L290 TraceCheckUtils]: 23: Hoare triple {25433#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {25435#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:10:03,886 INFO L290 TraceCheckUtils]: 24: Hoare triple {25435#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {25435#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:10:03,887 INFO L272 TraceCheckUtils]: 25: Hoare triple {25435#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25436#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:10:03,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {25436#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {25437#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:10:03,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {25437#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25424#false} is VALID [2022-04-28 10:10:03,888 INFO L290 TraceCheckUtils]: 28: Hoare triple {25424#false} assume !false; {25424#false} is VALID [2022-04-28 10:10:03,888 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:10:03,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:03,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152168523] [2022-04-28 10:10:03,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152168523] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:03,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939902089] [2022-04-28 10:10:03,889 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:10:03,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:03,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:03,892 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-28 10:10:03,893 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-28 10:10:03,996 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-04-28 10:10:03,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:03,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 46 conjunts are in the unsatisfiable core [2022-04-28 10:10:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:04,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:29,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {25423#true} call ULTIMATE.init(); {25423#true} is VALID [2022-04-28 10:10:29,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {25423#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25423#true} is VALID [2022-04-28 10:10:29,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {25423#true} assume true; {25423#true} is VALID [2022-04-28 10:10:29,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25423#true} {25423#true} #94#return; {25423#true} is VALID [2022-04-28 10:10:29,822 INFO L272 TraceCheckUtils]: 4: Hoare triple {25423#true} call #t~ret17 := main(); {25423#true} is VALID [2022-04-28 10:10:29,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {25423#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25428#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:10:29,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {25428#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= 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; {25460#(and (= (+ main_~x~0 1) main_~n~0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-28 10:10:29,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {25460#(and (= (+ main_~x~0 1) main_~n~0) (= (+ (- 1) 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; {25464#(and (= (+ (- 2) main_~y~0) 0) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} is VALID [2022-04-28 10:10:29,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {25464#(and (= (+ (- 2) main_~y~0) 0) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {25468#(and (= (+ (- 2) main_~y~0) 0) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-28 10:10:29,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {25468#(and (= (+ (- 2) main_~y~0) 0) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)) (not (< 0 (mod main_~x~0 4294967296))))} ~z~0 := ~y~0; {25472#(and (= (+ (- 2) main_~z~0) 0) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-28 10:10:29,825 INFO L290 TraceCheckUtils]: 10: Hoare triple {25472#(and (= (+ (- 2) main_~z~0) 0) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)) (not (< 0 (mod main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25476#(and (= 2 (+ main_~z~0 1)) (= main_~x~0 (+ (- 1) main_~n~0)) (not (< 0 (mod (+ main_~n~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:10:29,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {25476#(and (= 2 (+ main_~z~0 1)) (= main_~x~0 (+ (- 1) main_~n~0)) (not (< 0 (mod (+ main_~n~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; {25480#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ main_~n~0 4294967294) 4294967296))) (= 2 (+ main_~z~0 2)))} is VALID [2022-04-28 10:10:29,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {25480#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ main_~n~0 4294967294) 4294967296))) (= 2 (+ main_~z~0 2)))} assume !(~z~0 % 4294967296 > 0); {25480#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ main_~n~0 4294967294) 4294967296))) (= 2 (+ main_~z~0 2)))} is VALID [2022-04-28 10:10:29,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {25480#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ main_~n~0 4294967294) 4294967296))) (= 2 (+ main_~z~0 2)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25487#(and (= 2 (+ main_~z~0 1)) (= main_~n~0 main_~x~0) (not (< 0 (mod (+ main_~n~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:10:29,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {25487#(and (= 2 (+ main_~z~0 1)) (= main_~n~0 main_~x~0) (not (< 0 (mod (+ main_~n~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; {25491#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ main_~n~0 4294967294) 4294967296))) (= main_~z~0 2))} is VALID [2022-04-28 10:10:29,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {25491#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ main_~n~0 4294967294) 4294967296))) (= main_~z~0 2))} assume !(~y~0 % 4294967296 > 0); {25491#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ main_~n~0 4294967294) 4294967296))) (= main_~z~0 2))} is VALID [2022-04-28 10:10:29,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {25491#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ main_~n~0 4294967294) 4294967296))) (= main_~z~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; {25498#(and (= (+ main_~x~0 1) main_~n~0) (<= (mod (+ main_~n~0 4294967294) 4294967296) 0) (= main_~z~0 2))} is VALID [2022-04-28 10:10:29,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {25498#(and (= (+ main_~x~0 1) main_~n~0) (<= (mod (+ main_~n~0 4294967294) 4294967296) 0) (= main_~z~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; {25472#(and (= (+ (- 2) main_~z~0) 0) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-28 10:10:29,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {25472#(and (= (+ (- 2) main_~z~0) 0) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)) (not (< 0 (mod main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-28 10:10:29,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {25433#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-28 10:10:29,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {25433#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {25434#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-28 10:10:29,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {25434#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {25434#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-28 10:10:29,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {25434#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {25433#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-28 10:10:29,834 INFO L290 TraceCheckUtils]: 23: Hoare triple {25433#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-28 10:10:29,834 INFO L290 TraceCheckUtils]: 24: Hoare triple {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} assume !(~y~0 % 4294967296 > 0); {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-28 10:10:29,836 INFO L272 TraceCheckUtils]: 25: Hoare triple {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25526#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:10:29,836 INFO L290 TraceCheckUtils]: 26: Hoare triple {25526#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25530#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:10:29,837 INFO L290 TraceCheckUtils]: 27: Hoare triple {25530#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25424#false} is VALID [2022-04-28 10:10:29,837 INFO L290 TraceCheckUtils]: 28: Hoare triple {25424#false} assume !false; {25424#false} is VALID [2022-04-28 10:10:29,837 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:10:29,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:30,943 INFO L290 TraceCheckUtils]: 28: Hoare triple {25424#false} assume !false; {25424#false} is VALID [2022-04-28 10:10:30,943 INFO L290 TraceCheckUtils]: 27: Hoare triple {25530#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25424#false} is VALID [2022-04-28 10:10:30,944 INFO L290 TraceCheckUtils]: 26: Hoare triple {25526#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25530#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:10:30,945 INFO L272 TraceCheckUtils]: 25: Hoare triple {25435#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25526#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:10:30,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {25435#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {25435#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:10:30,956 INFO L290 TraceCheckUtils]: 23: Hoare triple {25552#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {25435#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:10:30,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {25556#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {25552#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:10:30,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {25556#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {25556#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:10:30,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {25552#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {25556#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:10:30,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {25566#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {25552#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:10:30,962 INFO L290 TraceCheckUtils]: 18: Hoare triple {25570#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {25566#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 10:10:30,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {25574#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (<= (mod main_~z~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; {25570#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:30,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {25578#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (<= (mod main_~z~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; {25574#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:30,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {25578#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (<= (mod main_~z~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {25578#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:30,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {25585#(or (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (<= (mod (+ main_~z~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25578#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:30,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {25589#(or (<= (mod (+ main_~z~0 2) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~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; {25585#(or (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (<= (mod (+ main_~z~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:10:30,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {25589#(or (<= (mod (+ main_~z~0 2) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0))))} assume !(~z~0 % 4294967296 > 0); {25589#(or (<= (mod (+ main_~z~0 2) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 10:10:30,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {25596#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (<= (mod (+ main_~z~0 1) 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; {25589#(or (<= (mod (+ main_~z~0 2) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 10:10:30,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {25570#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25596#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (<= (mod (+ main_~z~0 1) 4294967296) 0))} is VALID [2022-04-28 10:10:30,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {25603#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} ~z~0 := ~y~0; {25570#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:30,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {25603#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {25603#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 10:10:30,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {25610#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (not (< 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; {25603#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 10:10:30,980 INFO L290 TraceCheckUtils]: 6: Hoare triple {25614#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (not (< 0 (mod (+ main_~y~0 2) 4294967296))) (< 0 (mod (+ main_~x~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; {25610#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-28 10:10:30,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {25423#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25614#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (not (< 0 (mod (+ main_~y~0 2) 4294967296))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:10:30,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {25423#true} call #t~ret17 := main(); {25423#true} is VALID [2022-04-28 10:10:30,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25423#true} {25423#true} #94#return; {25423#true} is VALID [2022-04-28 10:10:30,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {25423#true} assume true; {25423#true} is VALID [2022-04-28 10:10:30,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {25423#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25423#true} is VALID [2022-04-28 10:10:30,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {25423#true} call ULTIMATE.init(); {25423#true} is VALID [2022-04-28 10:10:30,982 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:10:30,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939902089] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:30,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:30,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 17] total 36 [2022-04-28 10:10:30,982 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:30,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [847636328] [2022-04-28 10:10:30,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [847636328] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:30,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:30,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:10:30,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94214856] [2022-04-28 10:10:30,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:30,983 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 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 29 [2022-04-28 10:10:30,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:30,983 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), 11 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-28 10:10:31,067 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-28 10:10:31,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:10:31,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:31,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:10:31,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1081, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:10:31,069 INFO L87 Difference]: Start difference. First operand 251 states and 342 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 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-28 10:10:33,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:33,534 INFO L93 Difference]: Finished difference Result 324 states and 417 transitions. [2022-04-28 10:10:33,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:10:33,534 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 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 29 [2022-04-28 10:10:33,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:33,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 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-28 10:10:33,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 51 transitions. [2022-04-28 10:10:33,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 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-28 10:10:33,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 51 transitions. [2022-04-28 10:10:33,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 51 transitions. [2022-04-28 10:10:33,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:33,597 INFO L225 Difference]: With dead ends: 324 [2022-04-28 10:10:33,597 INFO L226 Difference]: Without dead ends: 313 [2022-04-28 10:10:33,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=286, Invalid=1970, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:10:33,598 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 36 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:33,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 69 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:10:33,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-04-28 10:10:34,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 257. [2022-04-28 10:10:34,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:34,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 313 states. Second operand has 257 states, 252 states have (on average 1.369047619047619) internal successors, (345), 252 states have internal predecessors, (345), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:34,487 INFO L74 IsIncluded]: Start isIncluded. First operand 313 states. Second operand has 257 states, 252 states have (on average 1.369047619047619) internal successors, (345), 252 states have internal predecessors, (345), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:34,488 INFO L87 Difference]: Start difference. First operand 313 states. Second operand has 257 states, 252 states have (on average 1.369047619047619) internal successors, (345), 252 states have internal predecessors, (345), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:34,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:34,493 INFO L93 Difference]: Finished difference Result 313 states and 405 transitions. [2022-04-28 10:10:34,493 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 405 transitions. [2022-04-28 10:10:34,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:34,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:34,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 252 states have (on average 1.369047619047619) internal successors, (345), 252 states have internal predecessors, (345), 3 states have call successors, (3), 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 313 states. [2022-04-28 10:10:34,494 INFO L87 Difference]: Start difference. First operand has 257 states, 252 states have (on average 1.369047619047619) internal successors, (345), 252 states have internal predecessors, (345), 3 states have call successors, (3), 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 313 states. [2022-04-28 10:10:34,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:34,499 INFO L93 Difference]: Finished difference Result 313 states and 405 transitions. [2022-04-28 10:10:34,499 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 405 transitions. [2022-04-28 10:10:34,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:34,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:34,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:34,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:34,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 252 states have (on average 1.369047619047619) internal successors, (345), 252 states have internal predecessors, (345), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:34,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 349 transitions. [2022-04-28 10:10:34,503 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 349 transitions. Word has length 29 [2022-04-28 10:10:34,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:34,503 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 349 transitions. [2022-04-28 10:10:34,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 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-28 10:10:34,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 257 states and 349 transitions. [2022-04-28 10:10:35,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 349 edges. 349 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:35,181 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 349 transitions. [2022-04-28 10:10:35,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:10:35,182 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:35,182 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:35,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:35,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:35,382 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:35,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:35,383 INFO L85 PathProgramCache]: Analyzing trace with hash -571931592, now seen corresponding path program 5 times [2022-04-28 10:10:35,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:35,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1655001771] [2022-04-28 10:10:35,385 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:35,385 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:35,385 INFO L85 PathProgramCache]: Analyzing trace with hash -571931592, now seen corresponding path program 6 times [2022-04-28 10:10:35,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:35,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864071378] [2022-04-28 10:10:35,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:35,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:35,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:35,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {27458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27447#true} is VALID [2022-04-28 10:10:35,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {27447#true} assume true; {27447#true} is VALID [2022-04-28 10:10:35,516 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27447#true} {27447#true} #94#return; {27447#true} is VALID [2022-04-28 10:10:35,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {27447#true} call ULTIMATE.init(); {27458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:35,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {27458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27447#true} is VALID [2022-04-28 10:10:35,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {27447#true} assume true; {27447#true} is VALID [2022-04-28 10:10:35,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27447#true} {27447#true} #94#return; {27447#true} is VALID [2022-04-28 10:10:35,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {27447#true} call #t~ret17 := main(); {27447#true} is VALID [2022-04-28 10:10:35,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {27447#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27447#true} is VALID [2022-04-28 10:10:35,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {27447#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27452#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:10:35,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {27452#(<= 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; {27453#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:10:35,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {27453#(<= 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; {27454#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:10:35,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {27454#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {27454#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:10:35,523 INFO L290 TraceCheckUtils]: 10: Hoare triple {27454#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {27454#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:10:35,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {27454#(<= (* 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; {27455#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:10:35,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {27455#(<= (+ (* (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; {27456#(<= (+ 2 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:10:35,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {27456#(<= (+ 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; {27457#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:10:35,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {27457#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {27457#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:10:35,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {27457#(<= (+ 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; {27457#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:10:35,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {27457#(<= (+ 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; {27457#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:10:35,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {27457#(<= (+ 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; {27457#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:10:35,527 INFO L290 TraceCheckUtils]: 18: Hoare triple {27457#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {27457#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:10:35,527 INFO L290 TraceCheckUtils]: 19: Hoare triple {27457#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {27448#false} is VALID [2022-04-28 10:10:35,527 INFO L290 TraceCheckUtils]: 20: Hoare triple {27448#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {27448#false} is VALID [2022-04-28 10:10:35,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {27448#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {27448#false} is VALID [2022-04-28 10:10:35,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {27448#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {27448#false} is VALID [2022-04-28 10:10:35,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {27448#false} assume !(~z~0 % 4294967296 > 0); {27448#false} is VALID [2022-04-28 10:10:35,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {27448#false} assume !(~y~0 % 4294967296 > 0); {27448#false} is VALID [2022-04-28 10:10:35,528 INFO L272 TraceCheckUtils]: 25: Hoare triple {27448#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {27448#false} is VALID [2022-04-28 10:10:35,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {27448#false} ~cond := #in~cond; {27448#false} is VALID [2022-04-28 10:10:35,528 INFO L290 TraceCheckUtils]: 27: Hoare triple {27448#false} assume 0 == ~cond; {27448#false} is VALID [2022-04-28 10:10:35,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {27448#false} assume !false; {27448#false} is VALID [2022-04-28 10:10:35,528 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-28 10:10:35,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:35,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864071378] [2022-04-28 10:10:35,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864071378] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:35,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402220949] [2022-04-28 10:10:35,529 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:10:35,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:35,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:35,530 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-28 10:10:35,530 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-28 10:10:35,578 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:10:35,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:35,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 10:10:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:35,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:35,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {27447#true} call ULTIMATE.init(); {27447#true} is VALID [2022-04-28 10:10:35,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {27447#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27447#true} is VALID [2022-04-28 10:10:35,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {27447#true} assume true; {27447#true} is VALID [2022-04-28 10:10:35,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27447#true} {27447#true} #94#return; {27447#true} is VALID [2022-04-28 10:10:35,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {27447#true} call #t~ret17 := main(); {27447#true} is VALID [2022-04-28 10:10:35,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {27447#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27447#true} is VALID [2022-04-28 10:10:35,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {27447#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27452#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:10:35,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {27452#(<= 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; {27483#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:10:35,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {27483#(<= 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; {27487#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:35,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {27487#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {27487#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:35,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {27487#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} ~z~0 := ~y~0; {27487#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:35,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {27487#(<= 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; {27483#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:10:35,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {27483#(<= 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; {27452#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:10:35,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {27452#(<= 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; {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:35,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:35,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {27503#(<= 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; {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:35,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {27503#(<= 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; {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:35,835 INFO L290 TraceCheckUtils]: 17: Hoare triple {27503#(<= 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; {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:35,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:35,836 INFO L290 TraceCheckUtils]: 19: Hoare triple {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {27448#false} is VALID [2022-04-28 10:10:35,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {27448#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {27448#false} is VALID [2022-04-28 10:10:35,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {27448#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {27448#false} is VALID [2022-04-28 10:10:35,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {27448#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {27448#false} is VALID [2022-04-28 10:10:35,836 INFO L290 TraceCheckUtils]: 23: Hoare triple {27448#false} assume !(~z~0 % 4294967296 > 0); {27448#false} is VALID [2022-04-28 10:10:35,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {27448#false} assume !(~y~0 % 4294967296 > 0); {27448#false} is VALID [2022-04-28 10:10:35,836 INFO L272 TraceCheckUtils]: 25: Hoare triple {27448#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {27448#false} is VALID [2022-04-28 10:10:35,836 INFO L290 TraceCheckUtils]: 26: Hoare triple {27448#false} ~cond := #in~cond; {27448#false} is VALID [2022-04-28 10:10:35,836 INFO L290 TraceCheckUtils]: 27: Hoare triple {27448#false} assume 0 == ~cond; {27448#false} is VALID [2022-04-28 10:10:35,836 INFO L290 TraceCheckUtils]: 28: Hoare triple {27448#false} assume !false; {27448#false} is VALID [2022-04-28 10:10:35,837 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-28 10:10:35,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:35,957 INFO L290 TraceCheckUtils]: 28: Hoare triple {27448#false} assume !false; {27448#false} is VALID [2022-04-28 10:10:35,957 INFO L290 TraceCheckUtils]: 27: Hoare triple {27448#false} assume 0 == ~cond; {27448#false} is VALID [2022-04-28 10:10:35,957 INFO L290 TraceCheckUtils]: 26: Hoare triple {27448#false} ~cond := #in~cond; {27448#false} is VALID [2022-04-28 10:10:35,957 INFO L272 TraceCheckUtils]: 25: Hoare triple {27448#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {27448#false} is VALID [2022-04-28 10:10:35,957 INFO L290 TraceCheckUtils]: 24: Hoare triple {27448#false} assume !(~y~0 % 4294967296 > 0); {27448#false} is VALID [2022-04-28 10:10:35,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {27448#false} assume !(~z~0 % 4294967296 > 0); {27448#false} is VALID [2022-04-28 10:10:35,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {27448#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {27448#false} is VALID [2022-04-28 10:10:35,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {27448#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {27448#false} is VALID [2022-04-28 10:10:35,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {27448#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {27448#false} is VALID [2022-04-28 10:10:35,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {27448#false} is VALID [2022-04-28 10:10:35,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:35,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {27503#(<= 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; {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:35,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {27503#(<= 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; {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:35,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {27503#(<= 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; {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:35,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:35,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {27452#(<= 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; {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:35,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {27483#(<= 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; {27452#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:10:35,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {27487#(<= 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; {27483#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:10:35,964 INFO L290 TraceCheckUtils]: 10: Hoare triple {27487#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} ~z~0 := ~y~0; {27487#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:35,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {27487#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {27487#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:35,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {27483#(<= 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; {27487#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:35,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {27452#(<= 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; {27483#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:10:35,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {27447#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27452#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:10:35,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {27447#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27447#true} is VALID [2022-04-28 10:10:35,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {27447#true} call #t~ret17 := main(); {27447#true} is VALID [2022-04-28 10:10:35,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27447#true} {27447#true} #94#return; {27447#true} is VALID [2022-04-28 10:10:35,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {27447#true} assume true; {27447#true} is VALID [2022-04-28 10:10:35,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {27447#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27447#true} is VALID [2022-04-28 10:10:35,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {27447#true} call ULTIMATE.init(); {27447#true} is VALID [2022-04-28 10:10:35,969 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-28 10:10:35,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402220949] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:35,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:35,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 12 [2022-04-28 10:10:35,969 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:35,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1655001771] [2022-04-28 10:10:35,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1655001771] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:35,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:35,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:10:35,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104827999] [2022-04-28 10:10:35,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:35,970 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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 29 [2022-04-28 10:10:35,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:35,970 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), 8 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-28 10:10:35,997 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-28 10:10:35,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:10:35,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:35,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:10:35,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:10:35,998 INFO L87 Difference]: Start difference. First operand 257 states and 349 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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-28 10:10:38,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:38,525 INFO L93 Difference]: Finished difference Result 436 states and 607 transitions. [2022-04-28 10:10:38,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:10:38,525 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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 29 [2022-04-28 10:10:38,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:38,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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-28 10:10:38,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2022-04-28 10:10:38,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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-28 10:10:38,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2022-04-28 10:10:38,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 83 transitions. [2022-04-28 10:10:38,602 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-28 10:10:38,613 INFO L225 Difference]: With dead ends: 436 [2022-04-28 10:10:38,613 INFO L226 Difference]: Without dead ends: 411 [2022-04-28 10:10:38,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 55 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-28 10:10:38,614 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 76 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:38,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 61 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:10:38,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-04-28 10:10:39,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 270. [2022-04-28 10:10:39,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:39,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 411 states. Second operand has 270 states, 265 states have (on average 1.3735849056603773) internal successors, (364), 265 states have internal predecessors, (364), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:39,646 INFO L74 IsIncluded]: Start isIncluded. First operand 411 states. Second operand has 270 states, 265 states have (on average 1.3735849056603773) internal successors, (364), 265 states have internal predecessors, (364), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:39,646 INFO L87 Difference]: Start difference. First operand 411 states. Second operand has 270 states, 265 states have (on average 1.3735849056603773) internal successors, (364), 265 states have internal predecessors, (364), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:39,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:39,652 INFO L93 Difference]: Finished difference Result 411 states and 569 transitions. [2022-04-28 10:10:39,652 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 569 transitions. [2022-04-28 10:10:39,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:39,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:39,653 INFO L74 IsIncluded]: Start isIncluded. First operand has 270 states, 265 states have (on average 1.3735849056603773) internal successors, (364), 265 states have internal predecessors, (364), 3 states have call successors, (3), 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 411 states. [2022-04-28 10:10:39,653 INFO L87 Difference]: Start difference. First operand has 270 states, 265 states have (on average 1.3735849056603773) internal successors, (364), 265 states have internal predecessors, (364), 3 states have call successors, (3), 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 411 states. [2022-04-28 10:10:39,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:39,661 INFO L93 Difference]: Finished difference Result 411 states and 569 transitions. [2022-04-28 10:10:39,662 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 569 transitions. [2022-04-28 10:10:39,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:39,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:39,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:39,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:39,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 265 states have (on average 1.3735849056603773) internal successors, (364), 265 states have internal predecessors, (364), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:39,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 368 transitions. [2022-04-28 10:10:39,669 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 368 transitions. Word has length 29 [2022-04-28 10:10:39,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:39,669 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 368 transitions. [2022-04-28 10:10:39,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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-28 10:10:39,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 270 states and 368 transitions. [2022-04-28 10:10:40,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 368 edges. 368 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:40,724 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 368 transitions. [2022-04-28 10:10:40,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:10:40,725 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:40,725 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:40,740 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-28 10:10:40,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:40,925 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:40,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:40,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1025176473, now seen corresponding path program 9 times [2022-04-28 10:10:40,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:40,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [664240164] [2022-04-28 10:10:40,929 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:40,929 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:40,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1025176473, now seen corresponding path program 10 times [2022-04-28 10:10:40,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:40,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91422537] [2022-04-28 10:10:40,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:40,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:41,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:41,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {29897#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29881#true} is VALID [2022-04-28 10:10:41,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {29881#true} assume true; {29881#true} is VALID [2022-04-28 10:10:41,148 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29881#true} {29881#true} #94#return; {29881#true} is VALID [2022-04-28 10:10:41,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {29881#true} call ULTIMATE.init(); {29897#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:41,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {29897#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29881#true} is VALID [2022-04-28 10:10:41,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {29881#true} assume true; {29881#true} is VALID [2022-04-28 10:10:41,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29881#true} {29881#true} #94#return; {29881#true} is VALID [2022-04-28 10:10:41,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {29881#true} call #t~ret17 := main(); {29881#true} is VALID [2022-04-28 10:10:41,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {29881#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29886#(= main_~y~0 0)} is VALID [2022-04-28 10:10:41,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {29886#(= 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; {29887#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:41,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {29887#(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; {29888#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:41,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {29888#(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; {29889#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:41,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {29889#(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; {29890#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:41,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {29890#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {29890#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:41,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {29890#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {29891#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:10:41,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {29891#(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; {29892#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:10:41,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {29892#(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; {29893#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:10:41,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {29893#(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; {29894#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:10:41,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {29894#(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; {29895#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:10:41,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {29895#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {29895#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:10:41,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {29895#(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; {29894#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:10:41,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {29894#(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; {29893#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:10:41,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {29893#(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; {29892#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:10:41,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {29892#(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; {29896#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:41,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {29896#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {29896#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:41,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {29896#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {29896#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:41,157 INFO L290 TraceCheckUtils]: 23: Hoare triple {29896#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {29882#false} is VALID [2022-04-28 10:10:41,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {29882#false} assume !(~y~0 % 4294967296 > 0); {29882#false} is VALID [2022-04-28 10:10:41,157 INFO L272 TraceCheckUtils]: 25: Hoare triple {29882#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29882#false} is VALID [2022-04-28 10:10:41,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {29882#false} ~cond := #in~cond; {29882#false} is VALID [2022-04-28 10:10:41,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {29882#false} assume 0 == ~cond; {29882#false} is VALID [2022-04-28 10:10:41,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {29882#false} assume !false; {29882#false} is VALID [2022-04-28 10:10:41,158 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-28 10:10:41,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:41,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91422537] [2022-04-28 10:10:41,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91422537] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:41,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505406304] [2022-04-28 10:10:41,158 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:10:41,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:41,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:41,159 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-28 10:10:41,164 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-28 10:10:41,197 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:10:41,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:41,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 10:10:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:41,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:41,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {29881#true} call ULTIMATE.init(); {29881#true} is VALID [2022-04-28 10:10:41,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {29881#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29881#true} is VALID [2022-04-28 10:10:41,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {29881#true} assume true; {29881#true} is VALID [2022-04-28 10:10:41,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29881#true} {29881#true} #94#return; {29881#true} is VALID [2022-04-28 10:10:41,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {29881#true} call #t~ret17 := main(); {29881#true} is VALID [2022-04-28 10:10:41,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {29881#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29881#true} is VALID [2022-04-28 10:10:41,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {29881#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29919#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:10:41,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {29919#(< 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; {29923#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:10:41,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {29923#(< 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; {29927#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:10:41,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {29927#(< 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; {29931#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:10:41,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {29931#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {29931#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:10:41,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {29931#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {29931#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:10:41,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {29931#(< 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; {29927#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:10:41,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {29927#(< 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; {29923#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:10:41,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {29923#(< 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; {29919#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:10:41,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {29919#(< 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; {29950#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:41,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {29950#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {29950#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:41,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {29950#(< 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; {29950#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:41,364 INFO L290 TraceCheckUtils]: 18: Hoare triple {29950#(< 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; {29950#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:41,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {29950#(< 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; {29950#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:41,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {29950#(< 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; {29950#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:41,365 INFO L290 TraceCheckUtils]: 21: Hoare triple {29950#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {29950#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:41,365 INFO L290 TraceCheckUtils]: 22: Hoare triple {29950#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {29882#false} is VALID [2022-04-28 10:10:41,365 INFO L290 TraceCheckUtils]: 23: Hoare triple {29882#false} assume !(~z~0 % 4294967296 > 0); {29882#false} is VALID [2022-04-28 10:10:41,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {29882#false} assume !(~y~0 % 4294967296 > 0); {29882#false} is VALID [2022-04-28 10:10:41,365 INFO L272 TraceCheckUtils]: 25: Hoare triple {29882#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29882#false} is VALID [2022-04-28 10:10:41,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {29882#false} ~cond := #in~cond; {29882#false} is VALID [2022-04-28 10:10:41,365 INFO L290 TraceCheckUtils]: 27: Hoare triple {29882#false} assume 0 == ~cond; {29882#false} is VALID [2022-04-28 10:10:41,365 INFO L290 TraceCheckUtils]: 28: Hoare triple {29882#false} assume !false; {29882#false} is VALID [2022-04-28 10:10:41,366 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:10:41,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:41,496 INFO L290 TraceCheckUtils]: 28: Hoare triple {29882#false} assume !false; {29882#false} is VALID [2022-04-28 10:10:41,496 INFO L290 TraceCheckUtils]: 27: Hoare triple {29882#false} assume 0 == ~cond; {29882#false} is VALID [2022-04-28 10:10:41,496 INFO L290 TraceCheckUtils]: 26: Hoare triple {29882#false} ~cond := #in~cond; {29882#false} is VALID [2022-04-28 10:10:41,496 INFO L272 TraceCheckUtils]: 25: Hoare triple {29882#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29882#false} is VALID [2022-04-28 10:10:41,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {29882#false} assume !(~y~0 % 4294967296 > 0); {29882#false} is VALID [2022-04-28 10:10:41,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {29882#false} assume !(~z~0 % 4294967296 > 0); {29882#false} is VALID [2022-04-28 10:10:41,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {29950#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {29882#false} is VALID [2022-04-28 10:10:41,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {29950#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {29950#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:41,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {29950#(< 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; {29950#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:41,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {29950#(< 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; {29950#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:41,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {29950#(< 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; {29950#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:41,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {29950#(< 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; {29950#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:41,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {29950#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {29950#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:41,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {29919#(< 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; {29950#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:41,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {29923#(< 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; {29919#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:10:41,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {29927#(< 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; {29923#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:10:41,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {29931#(< 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; {29927#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:10:41,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {29931#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {29931#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:10:41,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {29931#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {29931#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:10:41,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {29927#(< 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; {29931#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:10:41,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {29923#(< 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; {29927#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:10:41,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {29919#(< 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; {29923#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:10:41,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {29881#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29919#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:10:41,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {29881#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29881#true} is VALID [2022-04-28 10:10:41,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {29881#true} call #t~ret17 := main(); {29881#true} is VALID [2022-04-28 10:10:41,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29881#true} {29881#true} #94#return; {29881#true} is VALID [2022-04-28 10:10:41,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {29881#true} assume true; {29881#true} is VALID [2022-04-28 10:10:41,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {29881#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29881#true} is VALID [2022-04-28 10:10:41,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {29881#true} call ULTIMATE.init(); {29881#true} is VALID [2022-04-28 10:10:41,508 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:10:41,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505406304] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:41,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:41,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 19 [2022-04-28 10:10:41,509 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:41,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [664240164] [2022-04-28 10:10:41,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [664240164] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:41,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:41,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:10:41,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052097490] [2022-04-28 10:10:41,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:41,509 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-28 10:10:41,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:41,510 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-28 10:10:41,532 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-28 10:10:41,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:10:41,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:41,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:10:41,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:10:41,533 INFO L87 Difference]: Start difference. First operand 270 states and 368 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-28 10:10:46,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:46,478 INFO L93 Difference]: Finished difference Result 477 states and 686 transitions. [2022-04-28 10:10:46,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-28 10:10:46,478 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-28 10:10:46,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:46,478 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-28 10:10:46,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 201 transitions. [2022-04-28 10:10:46,480 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-28 10:10:46,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 201 transitions. [2022-04-28 10:10:46,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 201 transitions. [2022-04-28 10:10:46,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:46,664 INFO L225 Difference]: With dead ends: 477 [2022-04-28 10:10:46,664 INFO L226 Difference]: Without dead ends: 427 [2022-04-28 10:10:46,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=267, Invalid=2703, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 10:10:46,665 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 97 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:46,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 85 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:10:46,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-04-28 10:10:47,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 313. [2022-04-28 10:10:47,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:47,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 427 states. Second operand has 313 states, 308 states have (on average 1.3603896103896105) internal successors, (419), 308 states have internal predecessors, (419), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:47,990 INFO L74 IsIncluded]: Start isIncluded. First operand 427 states. Second operand has 313 states, 308 states have (on average 1.3603896103896105) internal successors, (419), 308 states have internal predecessors, (419), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:47,990 INFO L87 Difference]: Start difference. First operand 427 states. Second operand has 313 states, 308 states have (on average 1.3603896103896105) internal successors, (419), 308 states have internal predecessors, (419), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:47,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:47,996 INFO L93 Difference]: Finished difference Result 427 states and 543 transitions. [2022-04-28 10:10:47,997 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 543 transitions. [2022-04-28 10:10:47,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:47,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:47,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 313 states, 308 states have (on average 1.3603896103896105) internal successors, (419), 308 states have internal predecessors, (419), 3 states have call successors, (3), 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 427 states. [2022-04-28 10:10:47,998 INFO L87 Difference]: Start difference. First operand has 313 states, 308 states have (on average 1.3603896103896105) internal successors, (419), 308 states have internal predecessors, (419), 3 states have call successors, (3), 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 427 states. [2022-04-28 10:10:48,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:48,004 INFO L93 Difference]: Finished difference Result 427 states and 543 transitions. [2022-04-28 10:10:48,004 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 543 transitions. [2022-04-28 10:10:48,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:48,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:48,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:48,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:48,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 308 states have (on average 1.3603896103896105) internal successors, (419), 308 states have internal predecessors, (419), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:48,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 423 transitions. [2022-04-28 10:10:48,009 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 423 transitions. Word has length 29 [2022-04-28 10:10:48,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:48,009 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 423 transitions. [2022-04-28 10:10:48,009 INFO L496 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-28 10:10:48,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 313 states and 423 transitions. [2022-04-28 10:10:49,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 423 edges. 423 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:49,000 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 423 transitions. [2022-04-28 10:10:49,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:10:49,001 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:49,001 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:49,017 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-28 10:10:49,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 10:10:49,202 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:49,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:49,202 INFO L85 PathProgramCache]: Analyzing trace with hash 2080282713, now seen corresponding path program 23 times [2022-04-28 10:10:49,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:49,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1579354176] [2022-04-28 10:10:49,204 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:49,204 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:49,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2080282713, now seen corresponding path program 24 times [2022-04-28 10:10:49,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:49,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445327962] [2022-04-28 10:10:49,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:49,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:49,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:49,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {32601#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32582#true} is VALID [2022-04-28 10:10:49,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {32582#true} assume true; {32582#true} is VALID [2022-04-28 10:10:49,448 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32582#true} {32582#true} #94#return; {32582#true} is VALID [2022-04-28 10:10:49,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {32582#true} call ULTIMATE.init(); {32601#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:49,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {32601#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32582#true} is VALID [2022-04-28 10:10:49,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {32582#true} assume true; {32582#true} is VALID [2022-04-28 10:10:49,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32582#true} {32582#true} #94#return; {32582#true} is VALID [2022-04-28 10:10:49,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {32582#true} call #t~ret17 := main(); {32582#true} is VALID [2022-04-28 10:10:49,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {32582#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32587#(= main_~y~0 0)} is VALID [2022-04-28 10:10:49,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {32587#(= 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; {32588#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:49,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {32588#(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; {32589#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:49,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {32589#(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; {32590#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:49,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {32590#(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; {32591#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:49,453 INFO L290 TraceCheckUtils]: 10: Hoare triple {32591#(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; {32592#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:49,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {32592#(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; {32593#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:49,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {32593#(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; {32594#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:49,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {32594#(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; {32595#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:49,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {32595#(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; {32596#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:49,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {32596#(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; {32597#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:49,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {32597#(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; {32598#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:49,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {32598#(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; {32599#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:49,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {32599#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {32599#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:49,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {32599#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {32600#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-28 10:10:49,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {32600#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-28 10:10:49,460 INFO L290 TraceCheckUtils]: 21: Hoare triple {32583#false} assume !(~y~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-28 10:10:49,460 INFO L290 TraceCheckUtils]: 22: Hoare triple {32583#false} assume !(~x~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-28 10:10:49,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {32583#false} assume !(~z~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-28 10:10:49,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {32583#false} assume !(~y~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-28 10:10:49,460 INFO L272 TraceCheckUtils]: 25: Hoare triple {32583#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32583#false} is VALID [2022-04-28 10:10:49,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {32583#false} ~cond := #in~cond; {32583#false} is VALID [2022-04-28 10:10:49,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {32583#false} assume 0 == ~cond; {32583#false} is VALID [2022-04-28 10:10:49,460 INFO L290 TraceCheckUtils]: 28: Hoare triple {32583#false} assume !false; {32583#false} is VALID [2022-04-28 10:10:49,461 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:10:49,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:49,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445327962] [2022-04-28 10:10:49,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445327962] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:49,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320604442] [2022-04-28 10:10:49,461 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:10:49,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:49,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:49,462 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-28 10:10:49,463 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-28 10:10:49,536 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:10:49,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:49,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:10:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:49,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:49,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {32582#true} call ULTIMATE.init(); {32582#true} is VALID [2022-04-28 10:10:49,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {32582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32582#true} is VALID [2022-04-28 10:10:49,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {32582#true} assume true; {32582#true} is VALID [2022-04-28 10:10:49,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32582#true} {32582#true} #94#return; {32582#true} is VALID [2022-04-28 10:10:49,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {32582#true} call #t~ret17 := main(); {32582#true} is VALID [2022-04-28 10:10:49,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {32582#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32587#(= main_~y~0 0)} is VALID [2022-04-28 10:10:49,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {32587#(= 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; {32588#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:49,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {32588#(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; {32589#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:49,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {32589#(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; {32590#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:49,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {32590#(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; {32591#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:49,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {32591#(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; {32592#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:49,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {32592#(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; {32593#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:49,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {32593#(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; {32594#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:49,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {32594#(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; {32595#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:49,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {32595#(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; {32596#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:49,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {32596#(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; {32597#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:49,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {32597#(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; {32598#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:49,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {32598#(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; {32599#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:49,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {32599#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {32599#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:49,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {32599#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {32662#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:10:49,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {32662#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-28 10:10:49,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {32583#false} assume !(~y~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-28 10:10:49,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {32583#false} assume !(~x~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-28 10:10:49,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {32583#false} assume !(~z~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-28 10:10:49,814 INFO L290 TraceCheckUtils]: 24: Hoare triple {32583#false} assume !(~y~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-28 10:10:49,814 INFO L272 TraceCheckUtils]: 25: Hoare triple {32583#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32583#false} is VALID [2022-04-28 10:10:49,814 INFO L290 TraceCheckUtils]: 26: Hoare triple {32583#false} ~cond := #in~cond; {32583#false} is VALID [2022-04-28 10:10:49,814 INFO L290 TraceCheckUtils]: 27: Hoare triple {32583#false} assume 0 == ~cond; {32583#false} is VALID [2022-04-28 10:10:49,814 INFO L290 TraceCheckUtils]: 28: Hoare triple {32583#false} assume !false; {32583#false} is VALID [2022-04-28 10:10:49,814 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:10:49,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:50,201 INFO L290 TraceCheckUtils]: 28: Hoare triple {32583#false} assume !false; {32583#false} is VALID [2022-04-28 10:10:50,202 INFO L290 TraceCheckUtils]: 27: Hoare triple {32583#false} assume 0 == ~cond; {32583#false} is VALID [2022-04-28 10:10:50,202 INFO L290 TraceCheckUtils]: 26: Hoare triple {32583#false} ~cond := #in~cond; {32583#false} is VALID [2022-04-28 10:10:50,202 INFO L272 TraceCheckUtils]: 25: Hoare triple {32583#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32583#false} is VALID [2022-04-28 10:10:50,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {32583#false} assume !(~y~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-28 10:10:50,202 INFO L290 TraceCheckUtils]: 23: Hoare triple {32583#false} assume !(~z~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-28 10:10:50,202 INFO L290 TraceCheckUtils]: 22: Hoare triple {32583#false} assume !(~x~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-28 10:10:50,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {32583#false} assume !(~y~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-28 10:10:50,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {32714#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-28 10:10:50,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {32718#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {32714#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:50,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {32718#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {32718#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:50,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {32725#(< 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; {32718#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:50,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {32729#(< 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; {32725#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:10:50,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {32733#(< 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; {32729#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:10:50,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {32737#(< 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; {32733#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:10:50,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {32741#(< 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; {32737#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:50,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {32745#(< 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; {32741#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:50,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {32749#(< 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; {32745#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:10:50,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {32753#(< 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; {32749#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:50,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {32757#(< 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; {32753#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:10:50,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {32761#(< 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; {32757#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:10:50,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {32765#(< 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; {32761#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:10:50,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {32769#(< 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; {32765#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:10:50,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {32582#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32769#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:10:50,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {32582#true} call #t~ret17 := main(); {32582#true} is VALID [2022-04-28 10:10:50,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32582#true} {32582#true} #94#return; {32582#true} is VALID [2022-04-28 10:10:50,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {32582#true} assume true; {32582#true} is VALID [2022-04-28 10:10:50,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {32582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32582#true} is VALID [2022-04-28 10:10:50,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {32582#true} call ULTIMATE.init(); {32582#true} is VALID [2022-04-28 10:10:50,212 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:10:50,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320604442] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:50,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:50,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 10:10:50,213 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:50,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1579354176] [2022-04-28 10:10:50,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1579354176] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:50,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:50,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:10:50,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226290562] [2022-04-28 10:10:50,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:50,213 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (3), 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-28 10:10:50,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:50,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:50,231 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-28 10:10:50,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:10:50,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:50,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:10:50,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:10:50,232 INFO L87 Difference]: Start difference. First operand 313 states and 423 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 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-28 10:10:55,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:55,021 INFO L93 Difference]: Finished difference Result 451 states and 670 transitions. [2022-04-28 10:10:55,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:10:55,021 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (3), 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-28 10:10:55,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:55,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:55,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 199 transitions. [2022-04-28 10:10:55,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:55,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 199 transitions. [2022-04-28 10:10:55,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 199 transitions. [2022-04-28 10:10:55,189 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-28 10:10:55,196 INFO L225 Difference]: With dead ends: 451 [2022-04-28 10:10:55,196 INFO L226 Difference]: Without dead ends: 433 [2022-04-28 10:10:55,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=472, Invalid=1598, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:10:55,197 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 165 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1892 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:55,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 153 Invalid, 1998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1892 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 10:10:55,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-04-28 10:10:56,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 335. [2022-04-28 10:10:56,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:56,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 433 states. Second operand has 335 states, 330 states have (on average 1.3666666666666667) internal successors, (451), 330 states have internal predecessors, (451), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:56,718 INFO L74 IsIncluded]: Start isIncluded. First operand 433 states. Second operand has 335 states, 330 states have (on average 1.3666666666666667) internal successors, (451), 330 states have internal predecessors, (451), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:56,718 INFO L87 Difference]: Start difference. First operand 433 states. Second operand has 335 states, 330 states have (on average 1.3666666666666667) internal successors, (451), 330 states have internal predecessors, (451), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:56,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:56,727 INFO L93 Difference]: Finished difference Result 433 states and 577 transitions. [2022-04-28 10:10:56,727 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 577 transitions. [2022-04-28 10:10:56,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:56,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:56,728 INFO L74 IsIncluded]: Start isIncluded. First operand has 335 states, 330 states have (on average 1.3666666666666667) internal successors, (451), 330 states have internal predecessors, (451), 3 states have call successors, (3), 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-28 10:10:56,729 INFO L87 Difference]: Start difference. First operand has 335 states, 330 states have (on average 1.3666666666666667) internal successors, (451), 330 states have internal predecessors, (451), 3 states have call successors, (3), 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-28 10:10:56,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:56,738 INFO L93 Difference]: Finished difference Result 433 states and 577 transitions. [2022-04-28 10:10:56,738 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 577 transitions. [2022-04-28 10:10:56,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:56,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:56,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:56,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:56,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 330 states have (on average 1.3666666666666667) internal successors, (451), 330 states have internal predecessors, (451), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:56,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 455 transitions. [2022-04-28 10:10:56,746 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 455 transitions. Word has length 29 [2022-04-28 10:10:56,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:56,746 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 455 transitions. [2022-04-28 10:10:56,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:56,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 335 states and 455 transitions. [2022-04-28 10:10:57,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 455 edges. 455 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:57,977 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 455 transitions. [2022-04-28 10:10:57,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:10:57,977 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:57,977 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:57,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:58,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-28 10:10:58,178 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:58,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:58,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1393943515, now seen corresponding path program 5 times [2022-04-28 10:10:58,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:58,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1498862074] [2022-04-28 10:10:58,181 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:58,181 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:58,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1393943515, now seen corresponding path program 6 times [2022-04-28 10:10:58,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:58,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623165084] [2022-04-28 10:10:58,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:58,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:58,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:58,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {35269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35256#true} is VALID [2022-04-28 10:10:58,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {35256#true} assume true; {35256#true} is VALID [2022-04-28 10:10:58,350 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35256#true} {35256#true} #94#return; {35256#true} is VALID [2022-04-28 10:10:58,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {35256#true} call ULTIMATE.init(); {35269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:58,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {35269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35256#true} is VALID [2022-04-28 10:10:58,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {35256#true} assume true; {35256#true} is VALID [2022-04-28 10:10:58,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35256#true} {35256#true} #94#return; {35256#true} is VALID [2022-04-28 10:10:58,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {35256#true} call #t~ret17 := main(); {35256#true} is VALID [2022-04-28 10:10:58,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {35256#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35261#(= main_~y~0 0)} is VALID [2022-04-28 10:10:58,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {35261#(= 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; {35262#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:58,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {35262#(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; {35263#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:58,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {35263#(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; {35264#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:58,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {35264#(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; {35265#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:58,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {35265#(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; {35266#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:58,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {35266#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {35266#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:58,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {35266#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {35267#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:58,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {35267#(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; {35268#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:58,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {35268#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {35257#false} is VALID [2022-04-28 10:10:58,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {35257#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35257#false} is VALID [2022-04-28 10:10:58,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {35257#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35257#false} is VALID [2022-04-28 10:10:58,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {35257#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35257#false} is VALID [2022-04-28 10:10:58,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {35257#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35257#false} is VALID [2022-04-28 10:10:58,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {35257#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35257#false} is VALID [2022-04-28 10:10:58,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {35257#false} assume !(~y~0 % 4294967296 > 0); {35257#false} is VALID [2022-04-28 10:10:58,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {35257#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; {35257#false} is VALID [2022-04-28 10:10:58,358 INFO L290 TraceCheckUtils]: 22: Hoare triple {35257#false} assume !(~x~0 % 4294967296 > 0); {35257#false} is VALID [2022-04-28 10:10:58,358 INFO L290 TraceCheckUtils]: 23: Hoare triple {35257#false} assume !(~z~0 % 4294967296 > 0); {35257#false} is VALID [2022-04-28 10:10:58,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {35257#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {35257#false} is VALID [2022-04-28 10:10:58,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {35257#false} assume !(~y~0 % 4294967296 > 0); {35257#false} is VALID [2022-04-28 10:10:58,358 INFO L272 TraceCheckUtils]: 26: Hoare triple {35257#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {35257#false} is VALID [2022-04-28 10:10:58,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {35257#false} ~cond := #in~cond; {35257#false} is VALID [2022-04-28 10:10:58,358 INFO L290 TraceCheckUtils]: 28: Hoare triple {35257#false} assume 0 == ~cond; {35257#false} is VALID [2022-04-28 10:10:58,358 INFO L290 TraceCheckUtils]: 29: Hoare triple {35257#false} assume !false; {35257#false} is VALID [2022-04-28 10:10:58,358 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-28 10:10:58,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:58,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623165084] [2022-04-28 10:10:58,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623165084] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:58,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172049280] [2022-04-28 10:10:58,359 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:10:58,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:58,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:58,364 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-28 10:10:58,365 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-28 10:10:58,432 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:10:58,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:58,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:10:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:58,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:58,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {35256#true} call ULTIMATE.init(); {35256#true} is VALID [2022-04-28 10:10:58,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {35256#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35256#true} is VALID [2022-04-28 10:10:58,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {35256#true} assume true; {35256#true} is VALID [2022-04-28 10:10:58,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35256#true} {35256#true} #94#return; {35256#true} is VALID [2022-04-28 10:10:58,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {35256#true} call #t~ret17 := main(); {35256#true} is VALID [2022-04-28 10:10:58,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {35256#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35261#(= main_~y~0 0)} is VALID [2022-04-28 10:10:58,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {35261#(= 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; {35262#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:58,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {35262#(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; {35263#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:58,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {35263#(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; {35264#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:58,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {35264#(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; {35265#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:58,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {35265#(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; {35266#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:58,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {35266#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {35266#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:58,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {35266#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {35267#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:58,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {35267#(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; {35312#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:10:58,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {35312#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {35312#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:10:58,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {35312#(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; {35267#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:58,835 INFO L290 TraceCheckUtils]: 16: Hoare triple {35267#(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; {35322#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:58,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {35322#(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; {35326#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:10:58,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {35326#(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; {35330#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:10:58,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {35330#(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; {35334#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:10:58,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {35334#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~y~0 % 4294967296 > 0); {35334#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:10:58,838 INFO L290 TraceCheckUtils]: 21: Hoare triple {35334#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {35334#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:10:58,838 INFO L290 TraceCheckUtils]: 22: Hoare triple {35334#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~x~0 % 4294967296 > 0); {35334#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:10:58,838 INFO L290 TraceCheckUtils]: 23: Hoare triple {35334#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {35257#false} is VALID [2022-04-28 10:10:58,838 INFO L290 TraceCheckUtils]: 24: Hoare triple {35257#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {35257#false} is VALID [2022-04-28 10:10:58,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {35257#false} assume !(~y~0 % 4294967296 > 0); {35257#false} is VALID [2022-04-28 10:10:58,839 INFO L272 TraceCheckUtils]: 26: Hoare triple {35257#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {35257#false} is VALID [2022-04-28 10:10:58,839 INFO L290 TraceCheckUtils]: 27: Hoare triple {35257#false} ~cond := #in~cond; {35257#false} is VALID [2022-04-28 10:10:58,839 INFO L290 TraceCheckUtils]: 28: Hoare triple {35257#false} assume 0 == ~cond; {35257#false} is VALID [2022-04-28 10:10:58,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {35257#false} assume !false; {35257#false} is VALID [2022-04-28 10:10:58,839 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:10:58,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:59,141 INFO L290 TraceCheckUtils]: 29: Hoare triple {35257#false} assume !false; {35257#false} is VALID [2022-04-28 10:10:59,141 INFO L290 TraceCheckUtils]: 28: Hoare triple {35257#false} assume 0 == ~cond; {35257#false} is VALID [2022-04-28 10:10:59,141 INFO L290 TraceCheckUtils]: 27: Hoare triple {35257#false} ~cond := #in~cond; {35257#false} is VALID [2022-04-28 10:10:59,141 INFO L272 TraceCheckUtils]: 26: Hoare triple {35257#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {35257#false} is VALID [2022-04-28 10:10:59,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {35257#false} assume !(~y~0 % 4294967296 > 0); {35257#false} is VALID [2022-04-28 10:10:59,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {35257#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {35257#false} is VALID [2022-04-28 10:10:59,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {35383#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {35257#false} is VALID [2022-04-28 10:10:59,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {35383#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {35383#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:59,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {35383#(< 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; {35383#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:59,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {35383#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {35383#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:59,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {35396#(< 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; {35383#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:59,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {35400#(< 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; {35396#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 10:10:59,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {35404#(< 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; {35400#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 10:10:59,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {35408#(< 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; {35404#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 10:10:59,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {35412#(< 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; {35408#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 10:10:59,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {35412#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {35412#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 10:10:59,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {35408#(< 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; {35412#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 10:10:59,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {35422#(< 0 (mod (+ main_~y~0 4) 4294967296))} ~z~0 := ~y~0; {35408#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 10:10:59,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {35422#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {35422#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:59,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {35429#(< 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; {35422#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:59,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {35433#(< 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; {35429#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:59,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {35437#(< 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; {35433#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:10:59,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {35441#(< 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; {35437#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:59,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {35445#(< 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; {35441#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:10:59,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {35256#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35445#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:10:59,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {35256#true} call #t~ret17 := main(); {35256#true} is VALID [2022-04-28 10:10:59,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35256#true} {35256#true} #94#return; {35256#true} is VALID [2022-04-28 10:10:59,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {35256#true} assume true; {35256#true} is VALID [2022-04-28 10:10:59,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {35256#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35256#true} is VALID [2022-04-28 10:10:59,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {35256#true} call ULTIMATE.init(); {35256#true} is VALID [2022-04-28 10:10:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:10:59,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172049280] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:59,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:59,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 28 [2022-04-28 10:10:59,157 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:59,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1498862074] [2022-04-28 10:10:59,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1498862074] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:59,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:59,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:10:59,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600178681] [2022-04-28 10:10:59,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:59,158 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 30 [2022-04-28 10:10:59,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:59,158 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-28 10:10:59,176 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-28 10:10:59,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:10:59,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:59,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:10:59,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:10:59,177 INFO L87 Difference]: Start difference. First operand 335 states and 455 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-28 10:11:01,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:01,695 INFO L93 Difference]: Finished difference Result 393 states and 525 transitions. [2022-04-28 10:11:01,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:11:01,695 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 30 [2022-04-28 10:11:01,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:01,695 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-28 10:11:01,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 98 transitions. [2022-04-28 10:11:01,696 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-28 10:11:01,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 98 transitions. [2022-04-28 10:11:01,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 98 transitions. [2022-04-28 10:11:01,773 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-28 10:11:01,779 INFO L225 Difference]: With dead ends: 393 [2022-04-28 10:11:01,779 INFO L226 Difference]: Without dead ends: 377 [2022-04-28 10:11:01,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=238, Invalid=1094, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 10:11:01,780 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 76 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:01,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 82 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:11:01,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-04-28 10:11:03,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 335. [2022-04-28 10:11:03,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:03,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 377 states. Second operand has 335 states, 330 states have (on average 1.3636363636363635) internal successors, (450), 330 states have internal predecessors, (450), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:03,295 INFO L74 IsIncluded]: Start isIncluded. First operand 377 states. Second operand has 335 states, 330 states have (on average 1.3636363636363635) internal successors, (450), 330 states have internal predecessors, (450), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:03,295 INFO L87 Difference]: Start difference. First operand 377 states. Second operand has 335 states, 330 states have (on average 1.3636363636363635) internal successors, (450), 330 states have internal predecessors, (450), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:03,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:03,300 INFO L93 Difference]: Finished difference Result 377 states and 508 transitions. [2022-04-28 10:11:03,300 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 508 transitions. [2022-04-28 10:11:03,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:03,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:03,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 335 states, 330 states have (on average 1.3636363636363635) internal successors, (450), 330 states have internal predecessors, (450), 3 states have call successors, (3), 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 377 states. [2022-04-28 10:11:03,301 INFO L87 Difference]: Start difference. First operand has 335 states, 330 states have (on average 1.3636363636363635) internal successors, (450), 330 states have internal predecessors, (450), 3 states have call successors, (3), 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 377 states. [2022-04-28 10:11:03,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:03,308 INFO L93 Difference]: Finished difference Result 377 states and 508 transitions. [2022-04-28 10:11:03,308 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 508 transitions. [2022-04-28 10:11:03,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:03,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:03,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:03,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:03,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 330 states have (on average 1.3636363636363635) internal successors, (450), 330 states have internal predecessors, (450), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:03,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 454 transitions. [2022-04-28 10:11:03,316 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 454 transitions. Word has length 30 [2022-04-28 10:11:03,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:03,317 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 454 transitions. [2022-04-28 10:11:03,317 INFO L496 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-28 10:11:03,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 335 states and 454 transitions. [2022-04-28 10:11:04,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 454 edges. 454 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:04,423 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 454 transitions. [2022-04-28 10:11:04,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:11:04,424 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:04,424 INFO L195 NwaCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:04,439 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-28 10:11:04,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-28 10:11:04,624 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:04,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:04,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1204383434, now seen corresponding path program 25 times [2022-04-28 10:11:04,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:04,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1469304644] [2022-04-28 10:11:04,627 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:04,628 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:04,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1204383434, now seen corresponding path program 26 times [2022-04-28 10:11:04,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:04,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239215200] [2022-04-28 10:11:04,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:04,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:04,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:04,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {37714#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {37694#true} is VALID [2022-04-28 10:11:04,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {37694#true} assume true; {37694#true} is VALID [2022-04-28 10:11:04,883 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37694#true} {37694#true} #94#return; {37694#true} is VALID [2022-04-28 10:11:04,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {37694#true} call ULTIMATE.init(); {37714#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:04,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {37714#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {37694#true} is VALID [2022-04-28 10:11:04,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {37694#true} assume true; {37694#true} is VALID [2022-04-28 10:11:04,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37694#true} {37694#true} #94#return; {37694#true} is VALID [2022-04-28 10:11:04,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {37694#true} call #t~ret17 := main(); {37694#true} is VALID [2022-04-28 10:11:04,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {37694#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37699#(= main_~y~0 0)} is VALID [2022-04-28 10:11:04,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {37699#(= 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; {37700#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:04,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {37700#(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; {37701#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:04,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {37701#(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; {37702#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:04,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {37702#(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; {37703#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:04,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {37703#(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; {37704#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:04,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {37704#(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; {37705#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:04,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {37705#(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; {37706#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:04,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {37706#(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; {37707#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:04,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {37707#(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; {37708#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:04,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {37708#(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; {37709#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:04,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {37709#(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; {37710#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:04,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {37710#(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; {37711#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:04,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {37711#(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; {37712#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:04,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {37712#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {37712#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:04,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {37712#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {37713#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:11:04,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {37713#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-28 10:11:04,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {37695#false} assume !(~y~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-28 10:11:04,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {37695#false} assume !(~x~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-28 10:11:04,893 INFO L290 TraceCheckUtils]: 24: Hoare triple {37695#false} assume !(~z~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-28 10:11:04,893 INFO L290 TraceCheckUtils]: 25: Hoare triple {37695#false} assume !(~y~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-28 10:11:04,893 INFO L272 TraceCheckUtils]: 26: Hoare triple {37695#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {37695#false} is VALID [2022-04-28 10:11:04,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {37695#false} ~cond := #in~cond; {37695#false} is VALID [2022-04-28 10:11:04,893 INFO L290 TraceCheckUtils]: 28: Hoare triple {37695#false} assume 0 == ~cond; {37695#false} is VALID [2022-04-28 10:11:04,893 INFO L290 TraceCheckUtils]: 29: Hoare triple {37695#false} assume !false; {37695#false} is VALID [2022-04-28 10:11:04,893 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:04,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:04,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239215200] [2022-04-28 10:11:04,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239215200] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:04,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068646976] [2022-04-28 10:11:04,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:11:04,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:04,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:04,895 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-28 10:11:04,898 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-28 10:11:04,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:11:04,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:04,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:11:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:04,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:05,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {37694#true} call ULTIMATE.init(); {37694#true} is VALID [2022-04-28 10:11:05,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {37694#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {37694#true} is VALID [2022-04-28 10:11:05,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {37694#true} assume true; {37694#true} is VALID [2022-04-28 10:11:05,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37694#true} {37694#true} #94#return; {37694#true} is VALID [2022-04-28 10:11:05,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {37694#true} call #t~ret17 := main(); {37694#true} is VALID [2022-04-28 10:11:05,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {37694#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37699#(= main_~y~0 0)} is VALID [2022-04-28 10:11:05,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {37699#(= 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; {37700#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:05,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {37700#(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; {37701#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:05,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {37701#(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; {37702#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:05,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {37702#(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; {37703#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:05,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {37703#(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; {37704#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:05,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {37704#(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; {37705#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:05,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {37705#(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; {37706#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:05,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {37706#(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; {37707#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:05,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {37707#(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; {37708#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:05,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {37708#(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; {37709#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:05,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {37709#(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; {37710#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:05,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {37710#(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; {37711#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:05,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {37711#(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; {37712#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:05,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {37712#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {37712#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:05,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {37712#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {37778#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:11:05,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {37778#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-28 10:11:05,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {37695#false} assume !(~y~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-28 10:11:05,226 INFO L290 TraceCheckUtils]: 23: Hoare triple {37695#false} assume !(~x~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-28 10:11:05,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {37695#false} assume !(~z~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-28 10:11:05,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {37695#false} assume !(~y~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-28 10:11:05,227 INFO L272 TraceCheckUtils]: 26: Hoare triple {37695#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {37695#false} is VALID [2022-04-28 10:11:05,227 INFO L290 TraceCheckUtils]: 27: Hoare triple {37695#false} ~cond := #in~cond; {37695#false} is VALID [2022-04-28 10:11:05,227 INFO L290 TraceCheckUtils]: 28: Hoare triple {37695#false} assume 0 == ~cond; {37695#false} is VALID [2022-04-28 10:11:05,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {37695#false} assume !false; {37695#false} is VALID [2022-04-28 10:11:05,227 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:05,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:05,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {37695#false} assume !false; {37695#false} is VALID [2022-04-28 10:11:05,669 INFO L290 TraceCheckUtils]: 28: Hoare triple {37695#false} assume 0 == ~cond; {37695#false} is VALID [2022-04-28 10:11:05,669 INFO L290 TraceCheckUtils]: 27: Hoare triple {37695#false} ~cond := #in~cond; {37695#false} is VALID [2022-04-28 10:11:05,669 INFO L272 TraceCheckUtils]: 26: Hoare triple {37695#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {37695#false} is VALID [2022-04-28 10:11:05,669 INFO L290 TraceCheckUtils]: 25: Hoare triple {37695#false} assume !(~y~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-28 10:11:05,669 INFO L290 TraceCheckUtils]: 24: Hoare triple {37695#false} assume !(~z~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-28 10:11:05,669 INFO L290 TraceCheckUtils]: 23: Hoare triple {37695#false} assume !(~x~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-28 10:11:05,669 INFO L290 TraceCheckUtils]: 22: Hoare triple {37695#false} assume !(~y~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-28 10:11:05,669 INFO L290 TraceCheckUtils]: 21: Hoare triple {37830#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-28 10:11:05,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {37834#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {37830#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:05,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {37834#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {37834#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:05,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {37841#(< 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; {37834#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:05,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {37845#(< 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; {37841#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:05,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {37849#(< 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; {37845#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:05,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {37853#(< 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; {37849#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:05,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {37857#(< 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; {37853#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:05,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {37861#(< 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; {37857#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:05,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {37865#(< 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; {37861#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:11:05,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {37869#(< 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; {37865#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:05,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {37873#(< 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; {37869#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:11:05,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {37877#(< 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; {37873#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:11:05,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {37881#(< 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; {37877#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:11:05,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {37885#(< 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; {37881#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:11:05,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {37889#(< 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; {37885#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:11:05,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {37694#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37889#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:11:05,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {37694#true} call #t~ret17 := main(); {37694#true} is VALID [2022-04-28 10:11:05,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37694#true} {37694#true} #94#return; {37694#true} is VALID [2022-04-28 10:11:05,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {37694#true} assume true; {37694#true} is VALID [2022-04-28 10:11:05,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {37694#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {37694#true} is VALID [2022-04-28 10:11:05,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {37694#true} call ULTIMATE.init(); {37694#true} is VALID [2022-04-28 10:11:05,694 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:05,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068646976] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:05,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:05,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:11:05,695 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:05,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1469304644] [2022-04-28 10:11:05,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1469304644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:05,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:05,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:11:05,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426796427] [2022-04-28 10:11:05,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:05,695 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 10:11:05,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:05,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 10:11:05,720 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-28 10:11:05,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:11:05,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:05,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:11:05,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:11:05,723 INFO L87 Difference]: Start difference. First operand 335 states and 454 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 10:11:11,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:11,155 INFO L93 Difference]: Finished difference Result 480 states and 715 transitions. [2022-04-28 10:11:11,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:11:11,155 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 10:11:11,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 10:11:11,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 212 transitions. [2022-04-28 10:11:11,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 10:11:11,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 212 transitions. [2022-04-28 10:11:11,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 212 transitions. [2022-04-28 10:11:11,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:11,338 INFO L225 Difference]: With dead ends: 480 [2022-04-28 10:11:11,338 INFO L226 Difference]: Without dead ends: 462 [2022-04-28 10:11:11,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=535, Invalid=1817, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 10:11:11,339 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 183 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2191 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 2306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 2191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:11,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 164 Invalid, 2306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 2191 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 10:11:11,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-04-28 10:11:12,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 357. [2022-04-28 10:11:12,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:12,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 462 states. Second operand has 357 states, 352 states have (on average 1.3693181818181819) internal successors, (482), 352 states have internal predecessors, (482), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:12,889 INFO L74 IsIncluded]: Start isIncluded. First operand 462 states. Second operand has 357 states, 352 states have (on average 1.3693181818181819) internal successors, (482), 352 states have internal predecessors, (482), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:12,890 INFO L87 Difference]: Start difference. First operand 462 states. Second operand has 357 states, 352 states have (on average 1.3693181818181819) internal successors, (482), 352 states have internal predecessors, (482), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:12,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:12,897 INFO L93 Difference]: Finished difference Result 462 states and 617 transitions. [2022-04-28 10:11:12,897 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 617 transitions. [2022-04-28 10:11:12,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:12,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:12,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 357 states, 352 states have (on average 1.3693181818181819) internal successors, (482), 352 states have internal predecessors, (482), 3 states have call successors, (3), 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-28 10:11:12,898 INFO L87 Difference]: Start difference. First operand has 357 states, 352 states have (on average 1.3693181818181819) internal successors, (482), 352 states have internal predecessors, (482), 3 states have call successors, (3), 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-28 10:11:12,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:12,904 INFO L93 Difference]: Finished difference Result 462 states and 617 transitions. [2022-04-28 10:11:12,904 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 617 transitions. [2022-04-28 10:11:12,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:12,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:12,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:12,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:12,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 352 states have (on average 1.3693181818181819) internal successors, (482), 352 states have internal predecessors, (482), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:12,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 486 transitions. [2022-04-28 10:11:12,910 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 486 transitions. Word has length 30 [2022-04-28 10:11:12,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:12,911 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 486 transitions. [2022-04-28 10:11:12,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 10:11:12,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 357 states and 486 transitions. [2022-04-28 10:11:14,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 486 edges. 486 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:14,213 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 486 transitions. [2022-04-28 10:11:14,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:11:14,213 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:14,213 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:14,229 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-28 10:11:14,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 10:11:14,414 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:14,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:14,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1167289689, now seen corresponding path program 7 times [2022-04-28 10:11:14,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:14,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1092482604] [2022-04-28 10:11:14,416 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:14,416 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:14,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1167289689, now seen corresponding path program 8 times [2022-04-28 10:11:14,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:14,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152830326] [2022-04-28 10:11:14,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:14,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:14,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:14,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {40546#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40538#true} is VALID [2022-04-28 10:11:14,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {40538#true} assume true; {40538#true} is VALID [2022-04-28 10:11:14,489 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40538#true} {40538#true} #94#return; {40538#true} is VALID [2022-04-28 10:11:14,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {40538#true} call ULTIMATE.init(); {40546#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:14,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {40546#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40538#true} is VALID [2022-04-28 10:11:14,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {40538#true} assume true; {40538#true} is VALID [2022-04-28 10:11:14,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40538#true} {40538#true} #94#return; {40538#true} is VALID [2022-04-28 10:11:14,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {40538#true} call #t~ret17 := main(); {40538#true} is VALID [2022-04-28 10:11:14,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {40538#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40538#true} is VALID [2022-04-28 10:11:14,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {40538#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40538#true} is VALID [2022-04-28 10:11:14,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {40538#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40538#true} is VALID [2022-04-28 10:11:14,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {40538#true} assume !(~x~0 % 4294967296 > 0); {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:14,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:14,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {40543#(<= 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; {40544#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:11:14,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {40544#(<= 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; {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:14,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:14,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {40545#(<= 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; {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:14,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {40545#(<= 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; {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:14,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:14,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {40545#(<= 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; {40544#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:11:14,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {40544#(<= 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; {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:14,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {40543#(<= 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; {40539#false} is VALID [2022-04-28 10:11:14,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {40539#false} assume !(~x~0 % 4294967296 > 0); {40539#false} is VALID [2022-04-28 10:11:14,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {40539#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {40539#false} is VALID [2022-04-28 10:11:14,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {40539#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {40539#false} is VALID [2022-04-28 10:11:14,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {40539#false} assume !(~z~0 % 4294967296 > 0); {40539#false} is VALID [2022-04-28 10:11:14,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {40539#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {40539#false} is VALID [2022-04-28 10:11:14,502 INFO L290 TraceCheckUtils]: 24: Hoare triple {40539#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {40539#false} is VALID [2022-04-28 10:11:14,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {40539#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {40539#false} is VALID [2022-04-28 10:11:14,502 INFO L290 TraceCheckUtils]: 26: Hoare triple {40539#false} assume !(~y~0 % 4294967296 > 0); {40539#false} is VALID [2022-04-28 10:11:14,502 INFO L272 TraceCheckUtils]: 27: Hoare triple {40539#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {40539#false} is VALID [2022-04-28 10:11:14,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {40539#false} ~cond := #in~cond; {40539#false} is VALID [2022-04-28 10:11:14,503 INFO L290 TraceCheckUtils]: 29: Hoare triple {40539#false} assume 0 == ~cond; {40539#false} is VALID [2022-04-28 10:11:14,503 INFO L290 TraceCheckUtils]: 30: Hoare triple {40539#false} assume !false; {40539#false} is VALID [2022-04-28 10:11:14,504 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:11:14,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:14,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152830326] [2022-04-28 10:11:14,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152830326] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:14,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648940405] [2022-04-28 10:11:14,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:11:14,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:14,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:14,505 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-28 10:11:14,532 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-28 10:11:14,557 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:11:14,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:14,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:11:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:14,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:14,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {40538#true} call ULTIMATE.init(); {40538#true} is VALID [2022-04-28 10:11:14,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {40538#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40538#true} is VALID [2022-04-28 10:11:14,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {40538#true} assume true; {40538#true} is VALID [2022-04-28 10:11:14,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40538#true} {40538#true} #94#return; {40538#true} is VALID [2022-04-28 10:11:14,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {40538#true} call #t~ret17 := main(); {40538#true} is VALID [2022-04-28 10:11:14,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {40538#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40538#true} is VALID [2022-04-28 10:11:14,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {40538#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40538#true} is VALID [2022-04-28 10:11:14,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {40538#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40538#true} is VALID [2022-04-28 10:11:14,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {40538#true} assume !(~x~0 % 4294967296 > 0); {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:14,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:14,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {40543#(<= 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; {40544#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:11:14,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {40544#(<= 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; {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:14,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:14,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {40545#(<= 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; {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:14,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {40545#(<= 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; {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:14,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:14,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {40545#(<= 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; {40544#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:11:14,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {40544#(<= 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; {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:14,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {40543#(<= 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; {40539#false} is VALID [2022-04-28 10:11:14,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {40539#false} assume !(~x~0 % 4294967296 > 0); {40539#false} is VALID [2022-04-28 10:11:14,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {40539#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {40539#false} is VALID [2022-04-28 10:11:14,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {40539#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {40539#false} is VALID [2022-04-28 10:11:14,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {40539#false} assume !(~z~0 % 4294967296 > 0); {40539#false} is VALID [2022-04-28 10:11:14,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {40539#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {40539#false} is VALID [2022-04-28 10:11:14,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {40539#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {40539#false} is VALID [2022-04-28 10:11:14,687 INFO L290 TraceCheckUtils]: 25: Hoare triple {40539#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {40539#false} is VALID [2022-04-28 10:11:14,687 INFO L290 TraceCheckUtils]: 26: Hoare triple {40539#false} assume !(~y~0 % 4294967296 > 0); {40539#false} is VALID [2022-04-28 10:11:14,687 INFO L272 TraceCheckUtils]: 27: Hoare triple {40539#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {40539#false} is VALID [2022-04-28 10:11:14,687 INFO L290 TraceCheckUtils]: 28: Hoare triple {40539#false} ~cond := #in~cond; {40539#false} is VALID [2022-04-28 10:11:14,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {40539#false} assume 0 == ~cond; {40539#false} is VALID [2022-04-28 10:11:14,687 INFO L290 TraceCheckUtils]: 30: Hoare triple {40539#false} assume !false; {40539#false} is VALID [2022-04-28 10:11:14,687 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:11:14,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:14,909 INFO L290 TraceCheckUtils]: 30: Hoare triple {40539#false} assume !false; {40539#false} is VALID [2022-04-28 10:11:14,909 INFO L290 TraceCheckUtils]: 29: Hoare triple {40539#false} assume 0 == ~cond; {40539#false} is VALID [2022-04-28 10:11:14,910 INFO L290 TraceCheckUtils]: 28: Hoare triple {40539#false} ~cond := #in~cond; {40539#false} is VALID [2022-04-28 10:11:14,910 INFO L272 TraceCheckUtils]: 27: Hoare triple {40539#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {40539#false} is VALID [2022-04-28 10:11:14,910 INFO L290 TraceCheckUtils]: 26: Hoare triple {40539#false} assume !(~y~0 % 4294967296 > 0); {40539#false} is VALID [2022-04-28 10:11:14,910 INFO L290 TraceCheckUtils]: 25: Hoare triple {40539#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {40539#false} is VALID [2022-04-28 10:11:14,910 INFO L290 TraceCheckUtils]: 24: Hoare triple {40539#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {40539#false} is VALID [2022-04-28 10:11:14,910 INFO L290 TraceCheckUtils]: 23: Hoare triple {40539#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {40539#false} is VALID [2022-04-28 10:11:14,910 INFO L290 TraceCheckUtils]: 22: Hoare triple {40539#false} assume !(~z~0 % 4294967296 > 0); {40539#false} is VALID [2022-04-28 10:11:14,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {40539#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {40539#false} is VALID [2022-04-28 10:11:14,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {40539#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {40539#false} is VALID [2022-04-28 10:11:14,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {40539#false} assume !(~x~0 % 4294967296 > 0); {40539#false} is VALID [2022-04-28 10:11:14,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {40543#(<= 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; {40539#false} is VALID [2022-04-28 10:11:14,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {40544#(<= 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; {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:14,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {40545#(<= 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; {40544#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:11:14,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:14,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {40545#(<= 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; {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:14,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {40545#(<= 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; {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:14,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:14,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {40544#(<= 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; {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:14,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {40543#(<= 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; {40544#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:11:14,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:14,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {40538#true} assume !(~x~0 % 4294967296 > 0); {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:14,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {40538#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40538#true} is VALID [2022-04-28 10:11:14,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {40538#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40538#true} is VALID [2022-04-28 10:11:14,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {40538#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40538#true} is VALID [2022-04-28 10:11:14,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {40538#true} call #t~ret17 := main(); {40538#true} is VALID [2022-04-28 10:11:14,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40538#true} {40538#true} #94#return; {40538#true} is VALID [2022-04-28 10:11:14,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {40538#true} assume true; {40538#true} is VALID [2022-04-28 10:11:14,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {40538#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40538#true} is VALID [2022-04-28 10:11:14,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {40538#true} call ULTIMATE.init(); {40538#true} is VALID [2022-04-28 10:11:14,917 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:11:14,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648940405] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:14,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:14,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-04-28 10:11:14,918 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:14,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1092482604] [2022-04-28 10:11:14,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1092482604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:14,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:14,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:11:14,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918338861] [2022-04-28 10:11:14,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:14,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 31 [2022-04-28 10:11:14,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:14,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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-28 10:11:14,939 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-28 10:11:14,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:11:14,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:14,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:11:14,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:11:14,940 INFO L87 Difference]: Start difference. First operand 357 states and 486 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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-28 10:11:17,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:17,956 INFO L93 Difference]: Finished difference Result 567 states and 770 transitions. [2022-04-28 10:11:17,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:11:17,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 31 [2022-04-28 10:11:17,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:17,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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-28 10:11:17,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-28 10:11:17,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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-28 10:11:17,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-28 10:11:17,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 64 transitions. [2022-04-28 10:11:18,011 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-28 10:11:18,020 INFO L225 Difference]: With dead ends: 567 [2022-04-28 10:11:18,020 INFO L226 Difference]: Without dead ends: 462 [2022-04-28 10:11:18,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 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-28 10:11:18,021 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 39 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:18,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 51 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:11:18,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-04-28 10:11:19,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 331. [2022-04-28 10:11:19,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:19,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 462 states. Second operand has 331 states, 326 states have (on average 1.352760736196319) internal successors, (441), 326 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:19,465 INFO L74 IsIncluded]: Start isIncluded. First operand 462 states. Second operand has 331 states, 326 states have (on average 1.352760736196319) internal successors, (441), 326 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:19,465 INFO L87 Difference]: Start difference. First operand 462 states. Second operand has 331 states, 326 states have (on average 1.352760736196319) internal successors, (441), 326 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:19,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:19,475 INFO L93 Difference]: Finished difference Result 462 states and 624 transitions. [2022-04-28 10:11:19,475 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 624 transitions. [2022-04-28 10:11:19,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:19,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:19,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 331 states, 326 states have (on average 1.352760736196319) internal successors, (441), 326 states have internal predecessors, (441), 3 states have call successors, (3), 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-28 10:11:19,477 INFO L87 Difference]: Start difference. First operand has 331 states, 326 states have (on average 1.352760736196319) internal successors, (441), 326 states have internal predecessors, (441), 3 states have call successors, (3), 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-28 10:11:19,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:19,487 INFO L93 Difference]: Finished difference Result 462 states and 624 transitions. [2022-04-28 10:11:19,488 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 624 transitions. [2022-04-28 10:11:19,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:19,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:19,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:19,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:19,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 326 states have (on average 1.352760736196319) internal successors, (441), 326 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:19,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 445 transitions. [2022-04-28 10:11:19,496 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 445 transitions. Word has length 31 [2022-04-28 10:11:19,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:19,496 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 445 transitions. [2022-04-28 10:11:19,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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-28 10:11:19,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 331 states and 445 transitions. [2022-04-28 10:11:20,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:20,759 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 445 transitions. [2022-04-28 10:11:20,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:11:20,759 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:20,759 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:20,775 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-28 10:11:20,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:20,960 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:20,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:20,961 INFO L85 PathProgramCache]: Analyzing trace with hash 148988263, now seen corresponding path program 11 times [2022-04-28 10:11:20,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:20,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1900246657] [2022-04-28 10:11:20,964 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:20,964 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:20,964 INFO L85 PathProgramCache]: Analyzing trace with hash 148988263, now seen corresponding path program 12 times [2022-04-28 10:11:20,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:20,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080032346] [2022-04-28 10:11:20,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:20,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:21,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:21,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {43474#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {43458#true} is VALID [2022-04-28 10:11:21,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {43458#true} assume true; {43458#true} is VALID [2022-04-28 10:11:21,179 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43458#true} {43458#true} #94#return; {43458#true} is VALID [2022-04-28 10:11:21,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {43458#true} call ULTIMATE.init(); {43474#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:21,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {43474#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {43458#true} is VALID [2022-04-28 10:11:21,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {43458#true} assume true; {43458#true} is VALID [2022-04-28 10:11:21,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43458#true} {43458#true} #94#return; {43458#true} is VALID [2022-04-28 10:11:21,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {43458#true} call #t~ret17 := main(); {43458#true} is VALID [2022-04-28 10:11:21,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {43458#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43463#(= main_~y~0 0)} is VALID [2022-04-28 10:11:21,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {43463#(= 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; {43464#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:21,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {43464#(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; {43465#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:21,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {43465#(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; {43466#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:21,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {43466#(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; {43467#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:21,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {43467#(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; {43468#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:21,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {43468#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {43468#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:21,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {43468#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {43469#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:11:21,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {43469#(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; {43470#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:11:21,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {43470#(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; {43471#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:11:21,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {43471#(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; {43472#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:11:21,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {43472#(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; {43473#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:11:21,189 INFO L290 TraceCheckUtils]: 17: Hoare triple {43473#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {43459#false} is VALID [2022-04-28 10:11:21,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {43459#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43459#false} is VALID [2022-04-28 10:11:21,189 INFO L290 TraceCheckUtils]: 19: Hoare triple {43459#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43459#false} is VALID [2022-04-28 10:11:21,189 INFO L290 TraceCheckUtils]: 20: Hoare triple {43459#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43459#false} is VALID [2022-04-28 10:11:21,189 INFO L290 TraceCheckUtils]: 21: Hoare triple {43459#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43459#false} is VALID [2022-04-28 10:11:21,190 INFO L290 TraceCheckUtils]: 22: Hoare triple {43459#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43459#false} is VALID [2022-04-28 10:11:21,190 INFO L290 TraceCheckUtils]: 23: Hoare triple {43459#false} assume !(~y~0 % 4294967296 > 0); {43459#false} is VALID [2022-04-28 10:11:21,190 INFO L290 TraceCheckUtils]: 24: Hoare triple {43459#false} assume !(~x~0 % 4294967296 > 0); {43459#false} is VALID [2022-04-28 10:11:21,190 INFO L290 TraceCheckUtils]: 25: Hoare triple {43459#false} assume !(~z~0 % 4294967296 > 0); {43459#false} is VALID [2022-04-28 10:11:21,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {43459#false} assume !(~y~0 % 4294967296 > 0); {43459#false} is VALID [2022-04-28 10:11:21,190 INFO L272 TraceCheckUtils]: 27: Hoare triple {43459#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {43459#false} is VALID [2022-04-28 10:11:21,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {43459#false} ~cond := #in~cond; {43459#false} is VALID [2022-04-28 10:11:21,190 INFO L290 TraceCheckUtils]: 29: Hoare triple {43459#false} assume 0 == ~cond; {43459#false} is VALID [2022-04-28 10:11:21,190 INFO L290 TraceCheckUtils]: 30: Hoare triple {43459#false} assume !false; {43459#false} is VALID [2022-04-28 10:11:21,191 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:11:21,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:21,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080032346] [2022-04-28 10:11:21,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080032346] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:21,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981427097] [2022-04-28 10:11:21,191 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:11:21,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:21,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:21,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-28 10:11:21,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-28 10:11:21,249 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:11:21,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:21,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 10:11:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:21,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:21,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {43458#true} call ULTIMATE.init(); {43458#true} is VALID [2022-04-28 10:11:21,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {43458#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {43458#true} is VALID [2022-04-28 10:11:21,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {43458#true} assume true; {43458#true} is VALID [2022-04-28 10:11:21,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43458#true} {43458#true} #94#return; {43458#true} is VALID [2022-04-28 10:11:21,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {43458#true} call #t~ret17 := main(); {43458#true} is VALID [2022-04-28 10:11:21,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {43458#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43458#true} is VALID [2022-04-28 10:11:21,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {43458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43458#true} is VALID [2022-04-28 10:11:21,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {43458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43499#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:11:21,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {43499#(< 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; {43503#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:11:21,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {43503#(< 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; {43507#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:11:21,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {43507#(< 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; {43511#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:11:21,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {43511#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {43511#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:11:21,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {43511#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {43511#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:11:21,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {43511#(< 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; {43507#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:11:21,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {43507#(< 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; {43503#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:11:21,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {43503#(< 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; {43499#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:11:21,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {43499#(< 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; {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:21,425 INFO L290 TraceCheckUtils]: 17: Hoare triple {43530#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:21,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {43530#(< 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; {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:21,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {43530#(< 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; {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:21,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {43530#(< 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; {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:21,426 INFO L290 TraceCheckUtils]: 21: Hoare triple {43530#(< 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; {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:21,426 INFO L290 TraceCheckUtils]: 22: Hoare triple {43530#(< 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; {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:21,427 INFO L290 TraceCheckUtils]: 23: Hoare triple {43530#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:21,427 INFO L290 TraceCheckUtils]: 24: Hoare triple {43530#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {43459#false} is VALID [2022-04-28 10:11:21,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {43459#false} assume !(~z~0 % 4294967296 > 0); {43459#false} is VALID [2022-04-28 10:11:21,427 INFO L290 TraceCheckUtils]: 26: Hoare triple {43459#false} assume !(~y~0 % 4294967296 > 0); {43459#false} is VALID [2022-04-28 10:11:21,427 INFO L272 TraceCheckUtils]: 27: Hoare triple {43459#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {43459#false} is VALID [2022-04-28 10:11:21,427 INFO L290 TraceCheckUtils]: 28: Hoare triple {43459#false} ~cond := #in~cond; {43459#false} is VALID [2022-04-28 10:11:21,427 INFO L290 TraceCheckUtils]: 29: Hoare triple {43459#false} assume 0 == ~cond; {43459#false} is VALID [2022-04-28 10:11:21,427 INFO L290 TraceCheckUtils]: 30: Hoare triple {43459#false} assume !false; {43459#false} is VALID [2022-04-28 10:11:21,428 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 10:11:21,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:21,528 INFO L290 TraceCheckUtils]: 30: Hoare triple {43459#false} assume !false; {43459#false} is VALID [2022-04-28 10:11:21,528 INFO L290 TraceCheckUtils]: 29: Hoare triple {43459#false} assume 0 == ~cond; {43459#false} is VALID [2022-04-28 10:11:21,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {43459#false} ~cond := #in~cond; {43459#false} is VALID [2022-04-28 10:11:21,528 INFO L272 TraceCheckUtils]: 27: Hoare triple {43459#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {43459#false} is VALID [2022-04-28 10:11:21,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {43459#false} assume !(~y~0 % 4294967296 > 0); {43459#false} is VALID [2022-04-28 10:11:21,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {43459#false} assume !(~z~0 % 4294967296 > 0); {43459#false} is VALID [2022-04-28 10:11:21,529 INFO L290 TraceCheckUtils]: 24: Hoare triple {43530#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {43459#false} is VALID [2022-04-28 10:11:21,529 INFO L290 TraceCheckUtils]: 23: Hoare triple {43530#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:21,529 INFO L290 TraceCheckUtils]: 22: Hoare triple {43530#(< 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; {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:21,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {43530#(< 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; {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:21,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {43530#(< 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; {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:21,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {43530#(< 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; {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:21,530 INFO L290 TraceCheckUtils]: 18: Hoare triple {43530#(< 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; {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:21,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {43530#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:21,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {43499#(< 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; {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:21,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {43503#(< 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; {43499#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:11:21,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {43507#(< 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; {43503#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:11:21,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {43511#(< 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; {43507#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:11:21,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {43511#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {43511#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:11:21,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {43511#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {43511#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:11:21,535 INFO L290 TraceCheckUtils]: 10: Hoare triple {43507#(< 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; {43511#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:11:21,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {43503#(< 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; {43507#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:11:21,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {43499#(< 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; {43503#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:11:21,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {43458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43499#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:11:21,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {43458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43458#true} is VALID [2022-04-28 10:11:21,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {43458#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43458#true} is VALID [2022-04-28 10:11:21,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {43458#true} call #t~ret17 := main(); {43458#true} is VALID [2022-04-28 10:11:21,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43458#true} {43458#true} #94#return; {43458#true} is VALID [2022-04-28 10:11:21,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {43458#true} assume true; {43458#true} is VALID [2022-04-28 10:11:21,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {43458#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {43458#true} is VALID [2022-04-28 10:11:21,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {43458#true} call ULTIMATE.init(); {43458#true} is VALID [2022-04-28 10:11:21,537 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 10:11:21,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981427097] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:21,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:21,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 19 [2022-04-28 10:11:21,538 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:21,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1900246657] [2022-04-28 10:11:21,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1900246657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:21,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:21,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:11:21,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796786508] [2022-04-28 10:11:21,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:21,538 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-28 10:11:21,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:21,539 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-28 10:11:21,559 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-28 10:11:21,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:11:21,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:21,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:11:21,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:11:21,560 INFO L87 Difference]: Start difference. First operand 331 states and 445 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-28 10:11:24,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:24,356 INFO L93 Difference]: Finished difference Result 431 states and 588 transitions. [2022-04-28 10:11:24,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:11:24,357 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-28 10:11:24,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:24,357 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-28 10:11:24,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 103 transitions. [2022-04-28 10:11:24,358 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-28 10:11:24,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 103 transitions. [2022-04-28 10:11:24,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 103 transitions. [2022-04-28 10:11:24,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:24,445 INFO L225 Difference]: With dead ends: 431 [2022-04-28 10:11:24,445 INFO L226 Difference]: Without dead ends: 357 [2022-04-28 10:11:24,445 INFO L412 NwaCegarLoop]: 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-28 10:11:24,446 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 66 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:24,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 80 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:11:24,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-04-28 10:11:25,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 332. [2022-04-28 10:11:25,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:25,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 357 states. Second operand has 332 states, 327 states have (on average 1.345565749235474) internal successors, (440), 327 states have internal predecessors, (440), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:25,963 INFO L74 IsIncluded]: Start isIncluded. First operand 357 states. Second operand has 332 states, 327 states have (on average 1.345565749235474) internal successors, (440), 327 states have internal predecessors, (440), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:25,963 INFO L87 Difference]: Start difference. First operand 357 states. Second operand has 332 states, 327 states have (on average 1.345565749235474) internal successors, (440), 327 states have internal predecessors, (440), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:25,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:25,968 INFO L93 Difference]: Finished difference Result 357 states and 481 transitions. [2022-04-28 10:11:25,968 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 481 transitions. [2022-04-28 10:11:25,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:25,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:25,968 INFO L74 IsIncluded]: Start isIncluded. First operand has 332 states, 327 states have (on average 1.345565749235474) internal successors, (440), 327 states have internal predecessors, (440), 3 states have call successors, (3), 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 357 states. [2022-04-28 10:11:25,969 INFO L87 Difference]: Start difference. First operand has 332 states, 327 states have (on average 1.345565749235474) internal successors, (440), 327 states have internal predecessors, (440), 3 states have call successors, (3), 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 357 states. [2022-04-28 10:11:25,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:25,973 INFO L93 Difference]: Finished difference Result 357 states and 481 transitions. [2022-04-28 10:11:25,973 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 481 transitions. [2022-04-28 10:11:25,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:25,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:25,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:25,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:25,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 327 states have (on average 1.345565749235474) internal successors, (440), 327 states have internal predecessors, (440), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:25,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 444 transitions. [2022-04-28 10:11:25,981 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 444 transitions. Word has length 31 [2022-04-28 10:11:25,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:25,981 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 444 transitions. [2022-04-28 10:11:25,981 INFO L496 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-28 10:11:25,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 332 states and 444 transitions. [2022-04-28 10:11:27,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 444 edges. 444 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:27,227 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 444 transitions. [2022-04-28 10:11:27,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:11:27,227 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:27,227 INFO L195 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:27,243 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-28 10:11:27,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:27,431 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:27,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:27,432 INFO L85 PathProgramCache]: Analyzing trace with hash 50181113, now seen corresponding path program 27 times [2022-04-28 10:11:27,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:27,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1101832264] [2022-04-28 10:11:27,434 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:27,434 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:27,434 INFO L85 PathProgramCache]: Analyzing trace with hash 50181113, now seen corresponding path program 28 times [2022-04-28 10:11:27,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:27,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872042745] [2022-04-28 10:11:27,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:27,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:27,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:27,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:27,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {45962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {45941#true} is VALID [2022-04-28 10:11:27,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {45941#true} assume true; {45941#true} is VALID [2022-04-28 10:11:27,703 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45941#true} {45941#true} #94#return; {45941#true} is VALID [2022-04-28 10:11:27,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {45941#true} call ULTIMATE.init(); {45962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:27,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {45962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {45941#true} is VALID [2022-04-28 10:11:27,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {45941#true} assume true; {45941#true} is VALID [2022-04-28 10:11:27,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45941#true} {45941#true} #94#return; {45941#true} is VALID [2022-04-28 10:11:27,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {45941#true} call #t~ret17 := main(); {45941#true} is VALID [2022-04-28 10:11:27,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {45941#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {45946#(= main_~y~0 0)} is VALID [2022-04-28 10:11:27,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {45946#(= 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; {45947#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:27,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {45947#(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; {45948#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:27,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {45948#(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; {45949#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:27,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {45949#(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; {45950#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:27,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {45950#(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; {45951#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:27,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {45951#(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; {45952#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:27,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {45952#(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; {45953#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:27,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {45953#(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; {45954#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:27,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {45954#(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; {45955#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:27,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {45955#(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; {45956#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:27,713 INFO L290 TraceCheckUtils]: 16: Hoare triple {45956#(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; {45957#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:27,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {45957#(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; {45958#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:27,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {45958#(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; {45959#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:27,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {45959#(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; {45960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:27,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {45960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {45960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:27,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {45960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {45961#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:11:27,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {45961#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-28 10:11:27,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {45942#false} assume !(~y~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-28 10:11:27,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {45942#false} assume !(~x~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-28 10:11:27,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {45942#false} assume !(~z~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-28 10:11:27,716 INFO L290 TraceCheckUtils]: 26: Hoare triple {45942#false} assume !(~y~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-28 10:11:27,716 INFO L272 TraceCheckUtils]: 27: Hoare triple {45942#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {45942#false} is VALID [2022-04-28 10:11:27,716 INFO L290 TraceCheckUtils]: 28: Hoare triple {45942#false} ~cond := #in~cond; {45942#false} is VALID [2022-04-28 10:11:27,717 INFO L290 TraceCheckUtils]: 29: Hoare triple {45942#false} assume 0 == ~cond; {45942#false} is VALID [2022-04-28 10:11:27,717 INFO L290 TraceCheckUtils]: 30: Hoare triple {45942#false} assume !false; {45942#false} is VALID [2022-04-28 10:11:27,717 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:27,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:27,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872042745] [2022-04-28 10:11:27,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872042745] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:27,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634635729] [2022-04-28 10:11:27,717 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:11:27,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:27,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:27,718 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-28 10:11:27,719 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-28 10:11:27,757 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:11:27,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:27,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:11:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:27,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:28,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {45941#true} call ULTIMATE.init(); {45941#true} is VALID [2022-04-28 10:11:28,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {45941#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {45941#true} is VALID [2022-04-28 10:11:28,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {45941#true} assume true; {45941#true} is VALID [2022-04-28 10:11:28,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45941#true} {45941#true} #94#return; {45941#true} is VALID [2022-04-28 10:11:28,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {45941#true} call #t~ret17 := main(); {45941#true} is VALID [2022-04-28 10:11:28,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {45941#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {45946#(= main_~y~0 0)} is VALID [2022-04-28 10:11:28,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {45946#(= 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; {45947#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:28,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {45947#(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; {45948#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:28,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {45948#(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; {45949#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:28,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {45949#(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; {45950#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:28,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {45950#(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; {45951#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:28,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {45951#(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; {45952#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:28,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {45952#(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; {45953#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:28,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {45953#(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; {45954#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:28,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {45954#(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; {45955#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:28,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {45955#(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; {45956#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:28,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {45956#(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; {45957#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:28,051 INFO L290 TraceCheckUtils]: 17: Hoare triple {45957#(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; {45958#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:28,051 INFO L290 TraceCheckUtils]: 18: Hoare triple {45958#(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; {45959#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:28,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {45959#(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; {45960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:28,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {45960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {45960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:28,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {45960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {46029#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:11:28,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {46029#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !(~z~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-28 10:11:28,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {45942#false} assume !(~y~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-28 10:11:28,053 INFO L290 TraceCheckUtils]: 24: Hoare triple {45942#false} assume !(~x~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-28 10:11:28,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {45942#false} assume !(~z~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-28 10:11:28,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {45942#false} assume !(~y~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-28 10:11:28,054 INFO L272 TraceCheckUtils]: 27: Hoare triple {45942#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {45942#false} is VALID [2022-04-28 10:11:28,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {45942#false} ~cond := #in~cond; {45942#false} is VALID [2022-04-28 10:11:28,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {45942#false} assume 0 == ~cond; {45942#false} is VALID [2022-04-28 10:11:28,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {45942#false} assume !false; {45942#false} is VALID [2022-04-28 10:11:28,054 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:28,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:28,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {45942#false} assume !false; {45942#false} is VALID [2022-04-28 10:11:28,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {45942#false} assume 0 == ~cond; {45942#false} is VALID [2022-04-28 10:11:28,552 INFO L290 TraceCheckUtils]: 28: Hoare triple {45942#false} ~cond := #in~cond; {45942#false} is VALID [2022-04-28 10:11:28,552 INFO L272 TraceCheckUtils]: 27: Hoare triple {45942#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {45942#false} is VALID [2022-04-28 10:11:28,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {45942#false} assume !(~y~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-28 10:11:28,552 INFO L290 TraceCheckUtils]: 25: Hoare triple {45942#false} assume !(~z~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-28 10:11:28,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {45942#false} assume !(~x~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-28 10:11:28,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {45942#false} assume !(~y~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-28 10:11:28,553 INFO L290 TraceCheckUtils]: 22: Hoare triple {46081#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-28 10:11:28,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {46085#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {46081#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:28,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {46085#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {46085#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:28,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {46092#(< 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; {46085#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:28,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {46096#(< 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; {46092#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:28,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {46100#(< 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; {46096#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:28,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {46104#(< 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; {46100#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:28,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {46108#(< 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; {46104#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:28,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {46112#(< 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; {46108#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:28,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {46116#(< 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; {46112#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:11:28,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {46120#(< 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; {46116#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:28,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {46124#(< 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; {46120#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:11:28,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {46128#(< 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; {46124#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:11:28,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {46132#(< 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; {46128#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:11:28,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {46136#(< 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; {46132#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:11:28,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {46140#(< 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; {46136#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:11:28,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {46144#(< 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; {46140#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:11:28,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {45941#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46144#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:11:28,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {45941#true} call #t~ret17 := main(); {45941#true} is VALID [2022-04-28 10:11:28,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45941#true} {45941#true} #94#return; {45941#true} is VALID [2022-04-28 10:11:28,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {45941#true} assume true; {45941#true} is VALID [2022-04-28 10:11:28,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {45941#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {45941#true} is VALID [2022-04-28 10:11:28,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {45941#true} call ULTIMATE.init(); {45941#true} is VALID [2022-04-28 10:11:28,568 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:28,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634635729] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:28,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:28,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:11:28,568 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:28,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1101832264] [2022-04-28 10:11:28,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1101832264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:28,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:28,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:11:28,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333059696] [2022-04-28 10:11:28,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:28,569 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-28 10:11:28,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:28,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-28 10:11:28,595 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-28 10:11:28,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:11:28,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:28,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:11:28,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=964, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:11:28,596 INFO L87 Difference]: Start difference. First operand 332 states and 444 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-28 10:11:34,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:34,401 INFO L93 Difference]: Finished difference Result 479 states and 711 transitions. [2022-04-28 10:11:34,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:11:34,402 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-28 10:11:34,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:34,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-28 10:11:34,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 221 transitions. [2022-04-28 10:11:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-28 10:11:34,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 221 transitions. [2022-04-28 10:11:34,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 221 transitions. [2022-04-28 10:11:34,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:34,594 INFO L225 Difference]: With dead ends: 479 [2022-04-28 10:11:34,594 INFO L226 Difference]: Without dead ends: 460 [2022-04-28 10:11:34,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=602, Invalid=2050, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 10:11:34,595 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 178 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 2567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:34,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 172 Invalid, 2567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 10:11:34,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-04-28 10:11:36,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 353. [2022-04-28 10:11:36,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:36,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 460 states. Second operand has 353 states, 348 states have (on average 1.3505747126436782) internal successors, (470), 348 states have internal predecessors, (470), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:36,151 INFO L74 IsIncluded]: Start isIncluded. First operand 460 states. Second operand has 353 states, 348 states have (on average 1.3505747126436782) internal successors, (470), 348 states have internal predecessors, (470), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:36,151 INFO L87 Difference]: Start difference. First operand 460 states. Second operand has 353 states, 348 states have (on average 1.3505747126436782) internal successors, (470), 348 states have internal predecessors, (470), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:36,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:36,158 INFO L93 Difference]: Finished difference Result 460 states and 609 transitions. [2022-04-28 10:11:36,158 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 609 transitions. [2022-04-28 10:11:36,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:36,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:36,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 353 states, 348 states have (on average 1.3505747126436782) internal successors, (470), 348 states have internal predecessors, (470), 3 states have call successors, (3), 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 460 states. [2022-04-28 10:11:36,159 INFO L87 Difference]: Start difference. First operand has 353 states, 348 states have (on average 1.3505747126436782) internal successors, (470), 348 states have internal predecessors, (470), 3 states have call successors, (3), 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 460 states. [2022-04-28 10:11:36,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:36,166 INFO L93 Difference]: Finished difference Result 460 states and 609 transitions. [2022-04-28 10:11:36,166 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 609 transitions. [2022-04-28 10:11:36,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:36,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:36,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:36,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:36,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 348 states have (on average 1.3505747126436782) internal successors, (470), 348 states have internal predecessors, (470), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:36,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 474 transitions. [2022-04-28 10:11:36,172 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 474 transitions. Word has length 31 [2022-04-28 10:11:36,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:36,172 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 474 transitions. [2022-04-28 10:11:36,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-28 10:11:36,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 353 states and 474 transitions. [2022-04-28 10:11:37,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:37,515 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 474 transitions. [2022-04-28 10:11:37,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:11:37,516 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:37,516 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:37,532 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-28 10:11:37,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-04-28 10:11:37,717 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:37,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:37,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1500175867, now seen corresponding path program 13 times [2022-04-28 10:11:37,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:37,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1992570664] [2022-04-28 10:11:37,719 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:37,719 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:37,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1500175867, now seen corresponding path program 14 times [2022-04-28 10:11:37,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:37,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122532456] [2022-04-28 10:11:37,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:37,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:37,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:37,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {48799#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48781#true} is VALID [2022-04-28 10:11:37,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {48781#true} assume true; {48781#true} is VALID [2022-04-28 10:11:37,997 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48781#true} {48781#true} #94#return; {48781#true} is VALID [2022-04-28 10:11:37,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {48781#true} call ULTIMATE.init(); {48799#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:37,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {48799#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48781#true} is VALID [2022-04-28 10:11:37,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {48781#true} assume true; {48781#true} is VALID [2022-04-28 10:11:37,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48781#true} {48781#true} #94#return; {48781#true} is VALID [2022-04-28 10:11:37,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {48781#true} call #t~ret17 := main(); {48781#true} is VALID [2022-04-28 10:11:37,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {48781#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48786#(= main_~y~0 0)} is VALID [2022-04-28 10:11:37,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {48786#(= 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; {48787#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:38,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {48787#(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; {48788#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:38,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {48788#(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; {48789#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:38,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {48789#(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; {48790#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:38,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {48790#(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; {48791#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:38,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {48791#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {48791#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:38,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {48791#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {48792#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:11:38,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {48792#(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; {48793#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:11:38,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {48793#(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; {48794#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:11:38,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {48794#(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; {48795#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:11:38,006 INFO L290 TraceCheckUtils]: 16: Hoare triple {48795#(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; {48796#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:11:38,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {48796#(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; {48797#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:11:38,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {48797#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {48797#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:11:38,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {48797#(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; {48796#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:11:38,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {48796#(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; {48795#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:11:38,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {48795#(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; {48794#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:11:38,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {48794#(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; {48793#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:11:38,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {48793#(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; {48798#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:11:38,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {48798#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {48798#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:11:38,011 INFO L290 TraceCheckUtils]: 25: Hoare triple {48798#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {48798#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:11:38,012 INFO L290 TraceCheckUtils]: 26: Hoare triple {48798#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {48782#false} is VALID [2022-04-28 10:11:38,012 INFO L290 TraceCheckUtils]: 27: Hoare triple {48782#false} assume !(~y~0 % 4294967296 > 0); {48782#false} is VALID [2022-04-28 10:11:38,012 INFO L272 TraceCheckUtils]: 28: Hoare triple {48782#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {48782#false} is VALID [2022-04-28 10:11:38,012 INFO L290 TraceCheckUtils]: 29: Hoare triple {48782#false} ~cond := #in~cond; {48782#false} is VALID [2022-04-28 10:11:38,012 INFO L290 TraceCheckUtils]: 30: Hoare triple {48782#false} assume 0 == ~cond; {48782#false} is VALID [2022-04-28 10:11:38,012 INFO L290 TraceCheckUtils]: 31: Hoare triple {48782#false} assume !false; {48782#false} is VALID [2022-04-28 10:11:38,013 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:38,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:38,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122532456] [2022-04-28 10:11:38,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122532456] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:38,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63120327] [2022-04-28 10:11:38,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:11:38,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:38,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:38,015 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-28 10:11:38,024 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-28 10:11:38,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:11:38,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:38,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 10:11:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:38,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:38,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {48781#true} call ULTIMATE.init(); {48781#true} is VALID [2022-04-28 10:11:38,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {48781#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48781#true} is VALID [2022-04-28 10:11:38,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {48781#true} assume true; {48781#true} is VALID [2022-04-28 10:11:38,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48781#true} {48781#true} #94#return; {48781#true} is VALID [2022-04-28 10:11:38,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {48781#true} call #t~ret17 := main(); {48781#true} is VALID [2022-04-28 10:11:38,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {48781#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48781#true} is VALID [2022-04-28 10:11:38,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {48781#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48821#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:11:38,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {48821#(< 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; {48825#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:11:38,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {48825#(< 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; {48829#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:11:38,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {48829#(< 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; {48833#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:11:38,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {48833#(< 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; {48837#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:38,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {48837#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {48837#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:38,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {48837#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {48837#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:38,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {48837#(< 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; {48833#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:11:38,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {48833#(< 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; {48829#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:11:38,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {48829#(< 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; {48825#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:11:38,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {48825#(< 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; {48821#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:11:38,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {48821#(< 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; {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:38,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {48859#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:38,314 INFO L290 TraceCheckUtils]: 19: Hoare triple {48859#(< 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; {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:38,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {48859#(< 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; {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:38,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {48859#(< 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; {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:38,315 INFO L290 TraceCheckUtils]: 22: Hoare triple {48859#(< 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; {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:38,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {48859#(< 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; {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:38,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {48859#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:38,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {48859#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {48782#false} is VALID [2022-04-28 10:11:38,316 INFO L290 TraceCheckUtils]: 26: Hoare triple {48782#false} assume !(~z~0 % 4294967296 > 0); {48782#false} is VALID [2022-04-28 10:11:38,316 INFO L290 TraceCheckUtils]: 27: Hoare triple {48782#false} assume !(~y~0 % 4294967296 > 0); {48782#false} is VALID [2022-04-28 10:11:38,316 INFO L272 TraceCheckUtils]: 28: Hoare triple {48782#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {48782#false} is VALID [2022-04-28 10:11:38,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {48782#false} ~cond := #in~cond; {48782#false} is VALID [2022-04-28 10:11:38,316 INFO L290 TraceCheckUtils]: 30: Hoare triple {48782#false} assume 0 == ~cond; {48782#false} is VALID [2022-04-28 10:11:38,316 INFO L290 TraceCheckUtils]: 31: Hoare triple {48782#false} assume !false; {48782#false} is VALID [2022-04-28 10:11:38,316 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:11:38,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:38,421 INFO L290 TraceCheckUtils]: 31: Hoare triple {48782#false} assume !false; {48782#false} is VALID [2022-04-28 10:11:38,421 INFO L290 TraceCheckUtils]: 30: Hoare triple {48782#false} assume 0 == ~cond; {48782#false} is VALID [2022-04-28 10:11:38,421 INFO L290 TraceCheckUtils]: 29: Hoare triple {48782#false} ~cond := #in~cond; {48782#false} is VALID [2022-04-28 10:11:38,421 INFO L272 TraceCheckUtils]: 28: Hoare triple {48782#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {48782#false} is VALID [2022-04-28 10:11:38,421 INFO L290 TraceCheckUtils]: 27: Hoare triple {48782#false} assume !(~y~0 % 4294967296 > 0); {48782#false} is VALID [2022-04-28 10:11:38,422 INFO L290 TraceCheckUtils]: 26: Hoare triple {48782#false} assume !(~z~0 % 4294967296 > 0); {48782#false} is VALID [2022-04-28 10:11:38,422 INFO L290 TraceCheckUtils]: 25: Hoare triple {48859#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {48782#false} is VALID [2022-04-28 10:11:38,422 INFO L290 TraceCheckUtils]: 24: Hoare triple {48859#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:38,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {48859#(< 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; {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:38,423 INFO L290 TraceCheckUtils]: 22: Hoare triple {48859#(< 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; {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:38,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {48859#(< 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; {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:38,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {48859#(< 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; {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:38,424 INFO L290 TraceCheckUtils]: 19: Hoare triple {48859#(< 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; {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:38,424 INFO L290 TraceCheckUtils]: 18: Hoare triple {48859#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:38,425 INFO L290 TraceCheckUtils]: 17: Hoare triple {48821#(< 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; {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:38,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {48825#(< 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; {48821#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:11:38,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {48829#(< 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; {48825#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:11:38,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {48833#(< 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; {48829#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:11:38,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {48837#(< 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; {48833#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:11:38,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {48837#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {48837#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:38,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {48837#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {48837#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:38,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {48833#(< 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; {48837#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:38,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {48829#(< 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; {48833#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:11:38,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {48825#(< 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; {48829#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:11:38,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {48821#(< 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; {48825#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:11:38,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {48781#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48821#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:11:38,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {48781#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48781#true} is VALID [2022-04-28 10:11:38,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {48781#true} call #t~ret17 := main(); {48781#true} is VALID [2022-04-28 10:11:38,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48781#true} {48781#true} #94#return; {48781#true} is VALID [2022-04-28 10:11:38,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {48781#true} assume true; {48781#true} is VALID [2022-04-28 10:11:38,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {48781#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48781#true} is VALID [2022-04-28 10:11:38,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {48781#true} call ULTIMATE.init(); {48781#true} is VALID [2022-04-28 10:11:38,432 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:11:38,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63120327] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:38,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:38,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 22 [2022-04-28 10:11:38,433 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:38,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1992570664] [2022-04-28 10:11:38,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1992570664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:38,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:38,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:11:38,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820843919] [2022-04-28 10:11:38,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:38,433 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-28 10:11:38,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:38,434 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-28 10:11:38,455 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-28 10:11:38,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:11:38,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:38,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:11:38,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:11:38,456 INFO L87 Difference]: Start difference. First operand 353 states and 474 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-28 10:11:45,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:45,908 INFO L93 Difference]: Finished difference Result 635 states and 908 transitions. [2022-04-28 10:11:45,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-28 10:11:45,908 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-28 10:11:45,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:45,908 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-28 10:11:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 251 transitions. [2022-04-28 10:11:45,910 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-28 10:11:45,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 251 transitions. [2022-04-28 10:11:45,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 251 transitions. [2022-04-28 10:11:46,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:46,142 INFO L225 Difference]: With dead ends: 635 [2022-04-28 10:11:46,142 INFO L226 Difference]: Without dead ends: 575 [2022-04-28 10:11:46,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1146 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=360, Invalid=4610, Unknown=0, NotChecked=0, Total=4970 [2022-04-28 10:11:46,144 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 115 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1641 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 1641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:46,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 99 Invalid, 1879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 1641 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 10:11:46,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2022-04-28 10:11:47,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 391. [2022-04-28 10:11:47,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:47,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 575 states. Second operand has 391 states, 386 states have (on average 1.354922279792746) internal successors, (523), 386 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:47,952 INFO L74 IsIncluded]: Start isIncluded. First operand 575 states. Second operand has 391 states, 386 states have (on average 1.354922279792746) internal successors, (523), 386 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:47,957 INFO L87 Difference]: Start difference. First operand 575 states. Second operand has 391 states, 386 states have (on average 1.354922279792746) internal successors, (523), 386 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:47,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:47,971 INFO L93 Difference]: Finished difference Result 575 states and 718 transitions. [2022-04-28 10:11:47,971 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 718 transitions. [2022-04-28 10:11:47,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:47,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:47,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 391 states, 386 states have (on average 1.354922279792746) internal successors, (523), 386 states have internal predecessors, (523), 3 states have call successors, (3), 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 575 states. [2022-04-28 10:11:47,973 INFO L87 Difference]: Start difference. First operand has 391 states, 386 states have (on average 1.354922279792746) internal successors, (523), 386 states have internal predecessors, (523), 3 states have call successors, (3), 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 575 states. [2022-04-28 10:11:47,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:47,988 INFO L93 Difference]: Finished difference Result 575 states and 718 transitions. [2022-04-28 10:11:47,988 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 718 transitions. [2022-04-28 10:11:47,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:47,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:47,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:47,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:47,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 386 states have (on average 1.354922279792746) internal successors, (523), 386 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:48,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 527 transitions. [2022-04-28 10:11:48,004 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 527 transitions. Word has length 32 [2022-04-28 10:11:48,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:48,004 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 527 transitions. [2022-04-28 10:11:48,005 INFO L496 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-28 10:11:48,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 391 states and 527 transitions. [2022-04-28 10:11:49,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 527 edges. 527 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:49,722 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 527 transitions. [2022-04-28 10:11:49,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:11:49,723 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:49,723 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:49,740 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-28 10:11:49,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:49,931 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:49,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:49,932 INFO L85 PathProgramCache]: Analyzing trace with hash -994144843, now seen corresponding path program 7 times [2022-04-28 10:11:49,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:49,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1892493780] [2022-04-28 10:11:49,934 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:49,934 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:49,934 INFO L85 PathProgramCache]: Analyzing trace with hash -994144843, now seen corresponding path program 8 times [2022-04-28 10:11:49,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:49,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759071119] [2022-04-28 10:11:49,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:49,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:50,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:50,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {52311#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {52297#true} is VALID [2022-04-28 10:11:50,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {52297#true} assume true; {52297#true} is VALID [2022-04-28 10:11:50,089 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52297#true} {52297#true} #94#return; {52297#true} is VALID [2022-04-28 10:11:50,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {52297#true} call ULTIMATE.init(); {52311#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:50,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {52311#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {52297#true} is VALID [2022-04-28 10:11:50,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {52297#true} assume true; {52297#true} is VALID [2022-04-28 10:11:50,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52297#true} {52297#true} #94#return; {52297#true} is VALID [2022-04-28 10:11:50,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {52297#true} call #t~ret17 := main(); {52297#true} is VALID [2022-04-28 10:11:50,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {52297#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52302#(= main_~y~0 0)} is VALID [2022-04-28 10:11:50,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {52302#(= 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; {52303#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:50,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {52303#(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; {52304#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:50,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {52304#(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; {52305#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:50,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {52305#(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; {52306#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:50,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {52306#(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; {52307#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:50,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {52307#(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; {52308#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:50,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {52308#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {52308#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:50,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {52308#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {52309#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:50,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {52309#(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; {52310#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:11:50,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {52310#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-28 10:11:50,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-28 10:11:50,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-28 10:11:50,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-28 10:11:50,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-28 10:11:50,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-28 10:11:50,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-28 10:11:50,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {52298#false} assume !(~y~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-28 10:11:50,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {52298#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; {52298#false} is VALID [2022-04-28 10:11:50,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {52298#false} assume !(~x~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-28 10:11:50,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {52298#false} assume !(~z~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-28 10:11:50,098 INFO L290 TraceCheckUtils]: 26: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {52298#false} is VALID [2022-04-28 10:11:50,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {52298#false} assume !(~y~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-28 10:11:50,098 INFO L272 TraceCheckUtils]: 28: Hoare triple {52298#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {52298#false} is VALID [2022-04-28 10:11:50,098 INFO L290 TraceCheckUtils]: 29: Hoare triple {52298#false} ~cond := #in~cond; {52298#false} is VALID [2022-04-28 10:11:50,098 INFO L290 TraceCheckUtils]: 30: Hoare triple {52298#false} assume 0 == ~cond; {52298#false} is VALID [2022-04-28 10:11:50,098 INFO L290 TraceCheckUtils]: 31: Hoare triple {52298#false} assume !false; {52298#false} is VALID [2022-04-28 10:11:50,098 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-28 10:11:50,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:50,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759071119] [2022-04-28 10:11:50,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759071119] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:50,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036521860] [2022-04-28 10:11:50,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:11:50,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:50,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:50,100 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-28 10:11:50,102 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-28 10:11:50,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:11:50,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:50,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 10:11:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:50,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:50,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {52297#true} call ULTIMATE.init(); {52297#true} is VALID [2022-04-28 10:11:50,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {52297#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {52297#true} is VALID [2022-04-28 10:11:50,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {52297#true} assume true; {52297#true} is VALID [2022-04-28 10:11:50,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52297#true} {52297#true} #94#return; {52297#true} is VALID [2022-04-28 10:11:50,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {52297#true} call #t~ret17 := main(); {52297#true} is VALID [2022-04-28 10:11:50,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {52297#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52302#(= main_~y~0 0)} is VALID [2022-04-28 10:11:50,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {52302#(= 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; {52303#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:50,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {52303#(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; {52304#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:50,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {52304#(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; {52305#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:50,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {52305#(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; {52306#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:50,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {52306#(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; {52307#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:50,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {52307#(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; {52308#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:50,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {52308#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {52308#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:50,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {52308#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {52309#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:50,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {52309#(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; {52357#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:11:50,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {52357#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-28 10:11:50,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-28 10:11:50,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-28 10:11:50,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-28 10:11:50,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-28 10:11:50,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-28 10:11:50,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-28 10:11:50,361 INFO L290 TraceCheckUtils]: 22: Hoare triple {52298#false} assume !(~y~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-28 10:11:50,361 INFO L290 TraceCheckUtils]: 23: Hoare triple {52298#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; {52298#false} is VALID [2022-04-28 10:11:50,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {52298#false} assume !(~x~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-28 10:11:50,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {52298#false} assume !(~z~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-28 10:11:50,361 INFO L290 TraceCheckUtils]: 26: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {52298#false} is VALID [2022-04-28 10:11:50,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {52298#false} assume !(~y~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-28 10:11:50,361 INFO L272 TraceCheckUtils]: 28: Hoare triple {52298#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {52298#false} is VALID [2022-04-28 10:11:50,361 INFO L290 TraceCheckUtils]: 29: Hoare triple {52298#false} ~cond := #in~cond; {52298#false} is VALID [2022-04-28 10:11:50,361 INFO L290 TraceCheckUtils]: 30: Hoare triple {52298#false} assume 0 == ~cond; {52298#false} is VALID [2022-04-28 10:11:50,361 INFO L290 TraceCheckUtils]: 31: Hoare triple {52298#false} assume !false; {52298#false} is VALID [2022-04-28 10:11:50,362 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-28 10:11:50,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:50,572 INFO L290 TraceCheckUtils]: 31: Hoare triple {52298#false} assume !false; {52298#false} is VALID [2022-04-28 10:11:50,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {52298#false} assume 0 == ~cond; {52298#false} is VALID [2022-04-28 10:11:50,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {52298#false} ~cond := #in~cond; {52298#false} is VALID [2022-04-28 10:11:50,573 INFO L272 TraceCheckUtils]: 28: Hoare triple {52298#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {52298#false} is VALID [2022-04-28 10:11:50,573 INFO L290 TraceCheckUtils]: 27: Hoare triple {52298#false} assume !(~y~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-28 10:11:50,573 INFO L290 TraceCheckUtils]: 26: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {52298#false} is VALID [2022-04-28 10:11:50,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {52298#false} assume !(~z~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-28 10:11:50,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {52298#false} assume !(~x~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-28 10:11:50,573 INFO L290 TraceCheckUtils]: 23: Hoare triple {52298#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; {52298#false} is VALID [2022-04-28 10:11:50,573 INFO L290 TraceCheckUtils]: 22: Hoare triple {52298#false} assume !(~y~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-28 10:11:50,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-28 10:11:50,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-28 10:11:50,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-28 10:11:50,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-28 10:11:50,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-28 10:11:50,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-28 10:11:50,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {52457#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-28 10:11:50,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {52461#(< 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; {52457#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:50,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {52465#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {52461#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:50,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {52465#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {52465#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:50,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {52472#(< 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; {52465#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:50,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {52476#(< 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; {52472#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:50,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {52480#(< 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; {52476#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:50,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {52484#(< 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; {52480#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:50,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {52488#(< 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; {52484#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:50,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {52492#(< 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; {52488#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:50,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {52297#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52492#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:50,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {52297#true} call #t~ret17 := main(); {52297#true} is VALID [2022-04-28 10:11:50,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52297#true} {52297#true} #94#return; {52297#true} is VALID [2022-04-28 10:11:50,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {52297#true} assume true; {52297#true} is VALID [2022-04-28 10:11:50,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {52297#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {52297#true} is VALID [2022-04-28 10:11:50,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {52297#true} call ULTIMATE.init(); {52297#true} is VALID [2022-04-28 10:11:50,581 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-28 10:11:50,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036521860] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:50,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:50,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-28 10:11:50,581 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:50,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1892493780] [2022-04-28 10:11:50,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1892493780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:50,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:50,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:11:50,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011674635] [2022-04-28 10:11:50,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:50,582 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 32 [2022-04-28 10:11:50,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:50,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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-28 10:11:50,600 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-28 10:11:50,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:11:50,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:50,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:11:50,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:11:50,600 INFO L87 Difference]: Start difference. First operand 391 states and 527 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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-28 10:11:53,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:53,679 INFO L93 Difference]: Finished difference Result 457 states and 607 transitions. [2022-04-28 10:11:53,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:11:53,679 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 32 [2022-04-28 10:11:53,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:53,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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-28 10:11:53,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 105 transitions. [2022-04-28 10:11:53,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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-28 10:11:53,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 105 transitions. [2022-04-28 10:11:53,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 105 transitions. [2022-04-28 10:11:53,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:53,773 INFO L225 Difference]: With dead ends: 457 [2022-04-28 10:11:53,773 INFO L226 Difference]: Without dead ends: 440 [2022-04-28 10:11:53,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=774, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:11:53,774 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 85 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:53,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 85 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:11:53,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-04-28 10:11:55,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 391. [2022-04-28 10:11:55,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:55,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 440 states. Second operand has 391 states, 386 states have (on average 1.3523316062176165) internal successors, (522), 386 states have internal predecessors, (522), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:55,576 INFO L74 IsIncluded]: Start isIncluded. First operand 440 states. Second operand has 391 states, 386 states have (on average 1.3523316062176165) internal successors, (522), 386 states have internal predecessors, (522), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:55,576 INFO L87 Difference]: Start difference. First operand 440 states. Second operand has 391 states, 386 states have (on average 1.3523316062176165) internal successors, (522), 386 states have internal predecessors, (522), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:55,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:55,582 INFO L93 Difference]: Finished difference Result 440 states and 589 transitions. [2022-04-28 10:11:55,582 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 589 transitions. [2022-04-28 10:11:55,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:55,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:55,583 INFO L74 IsIncluded]: Start isIncluded. First operand has 391 states, 386 states have (on average 1.3523316062176165) internal successors, (522), 386 states have internal predecessors, (522), 3 states have call successors, (3), 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-28 10:11:55,584 INFO L87 Difference]: Start difference. First operand has 391 states, 386 states have (on average 1.3523316062176165) internal successors, (522), 386 states have internal predecessors, (522), 3 states have call successors, (3), 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-28 10:11:55,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:55,590 INFO L93 Difference]: Finished difference Result 440 states and 589 transitions. [2022-04-28 10:11:55,590 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 589 transitions. [2022-04-28 10:11:55,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:55,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:55,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:55,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:55,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 386 states have (on average 1.3523316062176165) internal successors, (522), 386 states have internal predecessors, (522), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:55,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 526 transitions. [2022-04-28 10:11:55,598 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 526 transitions. Word has length 32 [2022-04-28 10:11:55,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:55,598 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 526 transitions. [2022-04-28 10:11:55,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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-28 10:11:55,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 391 states and 526 transitions. [2022-04-28 10:11:57,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 526 edges. 526 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:57,109 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 526 transitions. [2022-04-28 10:11:57,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:11:57,109 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:57,109 INFO L195 NwaCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:57,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:57,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:57,310 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:57,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:57,310 INFO L85 PathProgramCache]: Analyzing trace with hash 286976406, now seen corresponding path program 29 times [2022-04-28 10:11:57,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:57,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [939692640] [2022-04-28 10:11:57,313 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:57,313 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:57,313 INFO L85 PathProgramCache]: Analyzing trace with hash 286976406, now seen corresponding path program 30 times [2022-04-28 10:11:57,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:57,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556045997] [2022-04-28 10:11:57,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:57,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:57,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:57,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {55131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {55109#true} is VALID [2022-04-28 10:11:57,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {55109#true} assume true; {55109#true} is VALID [2022-04-28 10:11:57,638 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55109#true} {55109#true} #94#return; {55109#true} is VALID [2022-04-28 10:11:57,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {55109#true} call ULTIMATE.init(); {55131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:57,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {55131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {55109#true} is VALID [2022-04-28 10:11:57,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {55109#true} assume true; {55109#true} is VALID [2022-04-28 10:11:57,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55109#true} {55109#true} #94#return; {55109#true} is VALID [2022-04-28 10:11:57,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {55109#true} call #t~ret17 := main(); {55109#true} is VALID [2022-04-28 10:11:57,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {55109#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {55114#(= main_~y~0 0)} is VALID [2022-04-28 10:11:57,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {55114#(= 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; {55115#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:57,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {55115#(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; {55116#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:57,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {55116#(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; {55117#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:57,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {55117#(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; {55118#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:57,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {55118#(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; {55119#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:57,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {55119#(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; {55120#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:57,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {55120#(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; {55121#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:57,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {55121#(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; {55122#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:57,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {55122#(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; {55123#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:57,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {55123#(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; {55124#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:57,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {55124#(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; {55125#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:57,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {55125#(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; {55126#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:57,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {55126#(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; {55127#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:57,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {55127#(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; {55128#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:57,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {55128#(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; {55129#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:57,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {55129#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {55129#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:57,647 INFO L290 TraceCheckUtils]: 22: Hoare triple {55129#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {55130#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} is VALID [2022-04-28 10:11:57,648 INFO L290 TraceCheckUtils]: 23: Hoare triple {55130#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-28 10:11:57,648 INFO L290 TraceCheckUtils]: 24: Hoare triple {55110#false} assume !(~y~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-28 10:11:57,648 INFO L290 TraceCheckUtils]: 25: Hoare triple {55110#false} assume !(~x~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-28 10:11:57,648 INFO L290 TraceCheckUtils]: 26: Hoare triple {55110#false} assume !(~z~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-28 10:11:57,648 INFO L290 TraceCheckUtils]: 27: Hoare triple {55110#false} assume !(~y~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-28 10:11:57,648 INFO L272 TraceCheckUtils]: 28: Hoare triple {55110#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {55110#false} is VALID [2022-04-28 10:11:57,648 INFO L290 TraceCheckUtils]: 29: Hoare triple {55110#false} ~cond := #in~cond; {55110#false} is VALID [2022-04-28 10:11:57,648 INFO L290 TraceCheckUtils]: 30: Hoare triple {55110#false} assume 0 == ~cond; {55110#false} is VALID [2022-04-28 10:11:57,649 INFO L290 TraceCheckUtils]: 31: Hoare triple {55110#false} assume !false; {55110#false} is VALID [2022-04-28 10:11:57,649 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:57,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:57,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556045997] [2022-04-28 10:11:57,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556045997] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:57,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449866522] [2022-04-28 10:11:57,649 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:11:57,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:57,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:57,650 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-28 10:11:57,653 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-28 10:11:57,792 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-28 10:11:57,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:57,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 10:11:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:57,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:58,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {55109#true} call ULTIMATE.init(); {55109#true} is VALID [2022-04-28 10:11:58,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {55109#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {55109#true} is VALID [2022-04-28 10:11:58,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {55109#true} assume true; {55109#true} is VALID [2022-04-28 10:11:58,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55109#true} {55109#true} #94#return; {55109#true} is VALID [2022-04-28 10:11:58,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {55109#true} call #t~ret17 := main(); {55109#true} is VALID [2022-04-28 10:11:58,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {55109#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {55114#(= main_~y~0 0)} is VALID [2022-04-28 10:11:58,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {55114#(= 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; {55115#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:58,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {55115#(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; {55116#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:58,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {55116#(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; {55117#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:58,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {55117#(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; {55118#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:58,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {55118#(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; {55119#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:58,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {55119#(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; {55120#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:58,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {55120#(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; {55121#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:58,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {55121#(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; {55122#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:58,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {55122#(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; {55123#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:58,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {55123#(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; {55124#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:58,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {55124#(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; {55125#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:58,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {55125#(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; {55126#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:58,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {55126#(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; {55127#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:58,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {55127#(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; {55128#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:58,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {55128#(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; {55129#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:58,127 INFO L290 TraceCheckUtils]: 21: Hoare triple {55129#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {55129#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:58,127 INFO L290 TraceCheckUtils]: 22: Hoare triple {55129#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {55201#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:11:58,128 INFO L290 TraceCheckUtils]: 23: Hoare triple {55201#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-28 10:11:58,128 INFO L290 TraceCheckUtils]: 24: Hoare triple {55110#false} assume !(~y~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-28 10:11:58,128 INFO L290 TraceCheckUtils]: 25: Hoare triple {55110#false} assume !(~x~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-28 10:11:58,128 INFO L290 TraceCheckUtils]: 26: Hoare triple {55110#false} assume !(~z~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-28 10:11:58,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {55110#false} assume !(~y~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-28 10:11:58,128 INFO L272 TraceCheckUtils]: 28: Hoare triple {55110#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {55110#false} is VALID [2022-04-28 10:11:58,128 INFO L290 TraceCheckUtils]: 29: Hoare triple {55110#false} ~cond := #in~cond; {55110#false} is VALID [2022-04-28 10:11:58,128 INFO L290 TraceCheckUtils]: 30: Hoare triple {55110#false} assume 0 == ~cond; {55110#false} is VALID [2022-04-28 10:11:58,128 INFO L290 TraceCheckUtils]: 31: Hoare triple {55110#false} assume !false; {55110#false} is VALID [2022-04-28 10:11:58,129 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:58,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:58,769 INFO L290 TraceCheckUtils]: 31: Hoare triple {55110#false} assume !false; {55110#false} is VALID [2022-04-28 10:11:58,769 INFO L290 TraceCheckUtils]: 30: Hoare triple {55110#false} assume 0 == ~cond; {55110#false} is VALID [2022-04-28 10:11:58,769 INFO L290 TraceCheckUtils]: 29: Hoare triple {55110#false} ~cond := #in~cond; {55110#false} is VALID [2022-04-28 10:11:58,769 INFO L272 TraceCheckUtils]: 28: Hoare triple {55110#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {55110#false} is VALID [2022-04-28 10:11:58,769 INFO L290 TraceCheckUtils]: 27: Hoare triple {55110#false} assume !(~y~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-28 10:11:58,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {55110#false} assume !(~z~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-28 10:11:58,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {55110#false} assume !(~x~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-28 10:11:58,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {55110#false} assume !(~y~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-28 10:11:58,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {55253#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-28 10:11:58,770 INFO L290 TraceCheckUtils]: 22: Hoare triple {55257#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {55253#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:58,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {55257#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {55257#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:58,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {55264#(< 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; {55257#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:58,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {55268#(< 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; {55264#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:58,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {55272#(< 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; {55268#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:58,775 INFO L290 TraceCheckUtils]: 17: Hoare triple {55276#(< 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; {55272#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:58,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {55280#(< 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; {55276#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:58,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {55284#(< 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; {55280#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:58,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {55288#(< 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; {55284#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:11:58,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {55292#(< 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; {55288#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:58,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {55296#(< 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; {55292#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:11:58,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {55300#(< 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; {55296#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:11:58,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {55304#(< 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; {55300#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:11:58,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {55308#(< 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; {55304#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:11:58,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {55312#(< 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; {55308#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:11:58,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {55316#(< 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; {55312#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:11:58,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {55320#(< 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; {55316#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:11:58,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {55109#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {55320#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:11:58,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {55109#true} call #t~ret17 := main(); {55109#true} is VALID [2022-04-28 10:11:58,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55109#true} {55109#true} #94#return; {55109#true} is VALID [2022-04-28 10:11:58,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {55109#true} assume true; {55109#true} is VALID [2022-04-28 10:11:58,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {55109#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {55109#true} is VALID [2022-04-28 10:11:58,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {55109#true} call ULTIMATE.init(); {55109#true} is VALID [2022-04-28 10:11:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:58,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449866522] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:58,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:58,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 10:11:58,786 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:58,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [939692640] [2022-04-28 10:11:58,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [939692640] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:58,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:58,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:11:58,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167152840] [2022-04-28 10:11:58,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:58,787 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 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-28 10:11:58,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:58,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 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-28 10:11:58,821 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-28 10:11:58,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:11:58,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:58,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:11:58,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1075, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:11:58,822 INFO L87 Difference]: Start difference. First operand 391 states and 526 transitions. Second operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 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-28 10:12:05,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:05,485 INFO L93 Difference]: Finished difference Result 547 states and 810 transitions. [2022-04-28 10:12:05,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:12:05,485 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 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-28 10:12:05,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:05,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 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-28 10:12:05,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 234 transitions. [2022-04-28 10:12:05,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 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-28 10:12:05,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 234 transitions. [2022-04-28 10:12:05,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 234 transitions. [2022-04-28 10:12:05,685 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-28 10:12:05,696 INFO L225 Difference]: With dead ends: 547 [2022-04-28 10:12:05,696 INFO L226 Difference]: Without dead ends: 528 [2022-04-28 10:12:05,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=673, Invalid=2297, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 10:12:05,697 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 193 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2790 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 2790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:05,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 183 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 2790 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 10:12:05,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-04-28 10:12:07,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 414. [2022-04-28 10:12:07,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:07,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 528 states. Second operand has 414 states, 409 states have (on average 1.3569682151589242) internal successors, (555), 409 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:07,616 INFO L74 IsIncluded]: Start isIncluded. First operand 528 states. Second operand has 414 states, 409 states have (on average 1.3569682151589242) internal successors, (555), 409 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:07,617 INFO L87 Difference]: Start difference. First operand 528 states. Second operand has 414 states, 409 states have (on average 1.3569682151589242) internal successors, (555), 409 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:07,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:07,625 INFO L93 Difference]: Finished difference Result 528 states and 703 transitions. [2022-04-28 10:12:07,625 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 703 transitions. [2022-04-28 10:12:07,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:07,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:07,626 INFO L74 IsIncluded]: Start isIncluded. First operand has 414 states, 409 states have (on average 1.3569682151589242) internal successors, (555), 409 states have internal predecessors, (555), 3 states have call successors, (3), 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 528 states. [2022-04-28 10:12:07,626 INFO L87 Difference]: Start difference. First operand has 414 states, 409 states have (on average 1.3569682151589242) internal successors, (555), 409 states have internal predecessors, (555), 3 states have call successors, (3), 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 528 states. [2022-04-28 10:12:07,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:07,634 INFO L93 Difference]: Finished difference Result 528 states and 703 transitions. [2022-04-28 10:12:07,634 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 703 transitions. [2022-04-28 10:12:07,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:07,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:07,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:07,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:07,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 409 states have (on average 1.3569682151589242) internal successors, (555), 409 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:07,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 559 transitions. [2022-04-28 10:12:07,642 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 559 transitions. Word has length 32 [2022-04-28 10:12:07,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:07,642 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 559 transitions. [2022-04-28 10:12:07,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 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-28 10:12:07,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 414 states and 559 transitions. [2022-04-28 10:12:10,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 559 edges. 559 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:10,734 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 559 transitions. [2022-04-28 10:12:10,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:12:10,734 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:10,734 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:10,740 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-28 10:12:10,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-28 10:12:10,938 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:10,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:10,939 INFO L85 PathProgramCache]: Analyzing trace with hash 2109757017, now seen corresponding path program 7 times [2022-04-28 10:12:10,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:10,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1329816852] [2022-04-28 10:12:10,941 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:10,941 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:10,941 INFO L85 PathProgramCache]: Analyzing trace with hash 2109757017, now seen corresponding path program 8 times [2022-04-28 10:12:10,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:10,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762013807] [2022-04-28 10:12:10,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:10,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:11,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:11,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {58366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58353#true} is VALID [2022-04-28 10:12:11,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {58353#true} assume true; {58353#true} is VALID [2022-04-28 10:12:11,075 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58353#true} {58353#true} #94#return; {58353#true} is VALID [2022-04-28 10:12:11,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {58353#true} call ULTIMATE.init(); {58366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:11,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {58366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58353#true} is VALID [2022-04-28 10:12:11,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {58353#true} assume true; {58353#true} is VALID [2022-04-28 10:12:11,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58353#true} {58353#true} #94#return; {58353#true} is VALID [2022-04-28 10:12:11,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {58353#true} call #t~ret17 := main(); {58353#true} is VALID [2022-04-28 10:12:11,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {58353#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58353#true} is VALID [2022-04-28 10:12:11,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {58353#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58358#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:12:11,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {58358#(<= 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; {58359#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:12:11,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {58359#(<= 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; {58360#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:12:11,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {58360#(<= 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; {58361#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:12:11,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {58361#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {58361#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:12:11,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {58361#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {58361#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:12:11,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {58361#(<= (* (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; {58362#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:12:11,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {58362#(<= (+ (* 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; {58363#(<= (+ 2 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:12:11,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {58363#(<= (+ 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; {58364#(<= (+ 3 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:12:11,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {58364#(<= (+ 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; {58365#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:12:11,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {58365#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {58365#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:12:11,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {58365#(<= (+ 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; {58365#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:12:11,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {58365#(<= (+ 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; {58365#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:12:11,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {58365#(<= (+ 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; {58365#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:12:11,087 INFO L290 TraceCheckUtils]: 20: Hoare triple {58365#(<= (+ 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; {58365#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:12:11,087 INFO L290 TraceCheckUtils]: 21: Hoare triple {58365#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {58365#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:12:11,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {58365#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {58354#false} is VALID [2022-04-28 10:12:11,088 INFO L290 TraceCheckUtils]: 23: Hoare triple {58354#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58354#false} is VALID [2022-04-28 10:12:11,088 INFO L290 TraceCheckUtils]: 24: Hoare triple {58354#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58354#false} is VALID [2022-04-28 10:12:11,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {58354#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58354#false} is VALID [2022-04-28 10:12:11,089 INFO L290 TraceCheckUtils]: 26: Hoare triple {58354#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58354#false} is VALID [2022-04-28 10:12:11,089 INFO L290 TraceCheckUtils]: 27: Hoare triple {58354#false} assume !(~z~0 % 4294967296 > 0); {58354#false} is VALID [2022-04-28 10:12:11,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {58354#false} assume !(~y~0 % 4294967296 > 0); {58354#false} is VALID [2022-04-28 10:12:11,089 INFO L272 TraceCheckUtils]: 29: Hoare triple {58354#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {58354#false} is VALID [2022-04-28 10:12:11,089 INFO L290 TraceCheckUtils]: 30: Hoare triple {58354#false} ~cond := #in~cond; {58354#false} is VALID [2022-04-28 10:12:11,089 INFO L290 TraceCheckUtils]: 31: Hoare triple {58354#false} assume 0 == ~cond; {58354#false} is VALID [2022-04-28 10:12:11,089 INFO L290 TraceCheckUtils]: 32: Hoare triple {58354#false} assume !false; {58354#false} is VALID [2022-04-28 10:12:11,089 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-28 10:12:11,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:11,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762013807] [2022-04-28 10:12:11,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762013807] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:11,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388653273] [2022-04-28 10:12:11,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:12:11,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:11,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:11,091 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-28 10:12:11,115 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-28 10:12:11,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:12:11,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:11,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 10:12:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:11,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:11,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {58353#true} call ULTIMATE.init(); {58353#true} is VALID [2022-04-28 10:12:11,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {58353#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58353#true} is VALID [2022-04-28 10:12:11,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {58353#true} assume true; {58353#true} is VALID [2022-04-28 10:12:11,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58353#true} {58353#true} #94#return; {58353#true} is VALID [2022-04-28 10:12:11,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {58353#true} call #t~ret17 := main(); {58353#true} is VALID [2022-04-28 10:12:11,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {58353#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58353#true} is VALID [2022-04-28 10:12:11,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {58353#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58358#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:12:11,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {58358#(<= 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; {58391#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:12:11,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {58391#(<= 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; {58395#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:11,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {58395#(<= 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; {58399#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:12:11,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {58399#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !(~x~0 % 4294967296 > 0); {58399#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:12:11,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {58399#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} ~z~0 := ~y~0; {58399#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:12:11,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {58399#(<= 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; {58395#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:11,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {58395#(<= 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; {58391#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:12:11,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {58391#(<= 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; {58358#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:12:11,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {58358#(<= 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; {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:11,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:11,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {58418#(<= 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; {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:11,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {58418#(<= 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; {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:11,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {58418#(<= 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; {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:11,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {58418#(<= 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; {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:11,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:11,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {58354#false} is VALID [2022-04-28 10:12:11,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {58354#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58354#false} is VALID [2022-04-28 10:12:11,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {58354#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58354#false} is VALID [2022-04-28 10:12:11,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {58354#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58354#false} is VALID [2022-04-28 10:12:11,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {58354#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58354#false} is VALID [2022-04-28 10:12:11,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {58354#false} assume !(~z~0 % 4294967296 > 0); {58354#false} is VALID [2022-04-28 10:12:11,346 INFO L290 TraceCheckUtils]: 28: Hoare triple {58354#false} assume !(~y~0 % 4294967296 > 0); {58354#false} is VALID [2022-04-28 10:12:11,346 INFO L272 TraceCheckUtils]: 29: Hoare triple {58354#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {58354#false} is VALID [2022-04-28 10:12:11,346 INFO L290 TraceCheckUtils]: 30: Hoare triple {58354#false} ~cond := #in~cond; {58354#false} is VALID [2022-04-28 10:12:11,346 INFO L290 TraceCheckUtils]: 31: Hoare triple {58354#false} assume 0 == ~cond; {58354#false} is VALID [2022-04-28 10:12:11,346 INFO L290 TraceCheckUtils]: 32: Hoare triple {58354#false} assume !false; {58354#false} is VALID [2022-04-28 10:12:11,346 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-28 10:12:11,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:11,498 INFO L290 TraceCheckUtils]: 32: Hoare triple {58354#false} assume !false; {58354#false} is VALID [2022-04-28 10:12:11,498 INFO L290 TraceCheckUtils]: 31: Hoare triple {58354#false} assume 0 == ~cond; {58354#false} is VALID [2022-04-28 10:12:11,498 INFO L290 TraceCheckUtils]: 30: Hoare triple {58354#false} ~cond := #in~cond; {58354#false} is VALID [2022-04-28 10:12:11,498 INFO L272 TraceCheckUtils]: 29: Hoare triple {58354#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {58354#false} is VALID [2022-04-28 10:12:11,498 INFO L290 TraceCheckUtils]: 28: Hoare triple {58354#false} assume !(~y~0 % 4294967296 > 0); {58354#false} is VALID [2022-04-28 10:12:11,499 INFO L290 TraceCheckUtils]: 27: Hoare triple {58354#false} assume !(~z~0 % 4294967296 > 0); {58354#false} is VALID [2022-04-28 10:12:11,499 INFO L290 TraceCheckUtils]: 26: Hoare triple {58354#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58354#false} is VALID [2022-04-28 10:12:11,499 INFO L290 TraceCheckUtils]: 25: Hoare triple {58354#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58354#false} is VALID [2022-04-28 10:12:11,499 INFO L290 TraceCheckUtils]: 24: Hoare triple {58354#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58354#false} is VALID [2022-04-28 10:12:11,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {58354#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58354#false} is VALID [2022-04-28 10:12:11,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {58354#false} is VALID [2022-04-28 10:12:11,500 INFO L290 TraceCheckUtils]: 21: Hoare triple {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:11,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {58418#(<= 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; {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:11,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {58418#(<= 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; {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:11,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {58418#(<= 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; {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:11,502 INFO L290 TraceCheckUtils]: 17: Hoare triple {58418#(<= 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; {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:11,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:11,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {58358#(<= 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; {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:11,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {58391#(<= 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; {58358#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:12:11,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {58395#(<= 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; {58391#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:12:11,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {58399#(<= 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; {58395#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:11,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {58399#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} ~z~0 := ~y~0; {58399#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:12:11,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {58399#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !(~x~0 % 4294967296 > 0); {58399#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:12:11,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {58395#(<= 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; {58399#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:12:11,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {58391#(<= 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; {58395#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:11,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {58358#(<= 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; {58391#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:12:11,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {58353#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58358#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:12:11,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {58353#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58353#true} is VALID [2022-04-28 10:12:11,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {58353#true} call #t~ret17 := main(); {58353#true} is VALID [2022-04-28 10:12:11,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58353#true} {58353#true} #94#return; {58353#true} is VALID [2022-04-28 10:12:11,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {58353#true} assume true; {58353#true} is VALID [2022-04-28 10:12:11,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {58353#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58353#true} is VALID [2022-04-28 10:12:11,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {58353#true} call ULTIMATE.init(); {58353#true} is VALID [2022-04-28 10:12:11,512 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-28 10:12:11,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388653273] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:11,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:11,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 15 [2022-04-28 10:12:11,512 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:11,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1329816852] [2022-04-28 10:12:11,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1329816852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:11,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:11,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:12:11,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496401079] [2022-04-28 10:12:11,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:11,513 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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 33 [2022-04-28 10:12:11,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:11,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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-28 10:12:11,541 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-28 10:12:11,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:12:11,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:11,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:12:11,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:12:11,541 INFO L87 Difference]: Start difference. First operand 414 states and 559 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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-28 10:12:17,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:17,510 INFO L93 Difference]: Finished difference Result 786 states and 1051 transitions. [2022-04-28 10:12:17,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:12:17,511 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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 33 [2022-04-28 10:12:17,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:17,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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-28 10:12:17,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 97 transitions. [2022-04-28 10:12:17,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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-28 10:12:17,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 97 transitions. [2022-04-28 10:12:17,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 97 transitions. [2022-04-28 10:12:17,618 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-28 10:12:17,638 INFO L225 Difference]: With dead ends: 786 [2022-04-28 10:12:17,638 INFO L226 Difference]: Without dead ends: 751 [2022-04-28 10:12:17,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 62 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-28 10:12:17,639 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 107 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:17,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 63 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:12:17,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2022-04-28 10:12:19,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 447. [2022-04-28 10:12:19,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:19,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 751 states. Second operand has 447 states, 442 states have (on average 1.3484162895927603) internal successors, (596), 442 states have internal predecessors, (596), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:19,937 INFO L74 IsIncluded]: Start isIncluded. First operand 751 states. Second operand has 447 states, 442 states have (on average 1.3484162895927603) internal successors, (596), 442 states have internal predecessors, (596), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:19,937 INFO L87 Difference]: Start difference. First operand 751 states. Second operand has 447 states, 442 states have (on average 1.3484162895927603) internal successors, (596), 442 states have internal predecessors, (596), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:19,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:19,952 INFO L93 Difference]: Finished difference Result 751 states and 999 transitions. [2022-04-28 10:12:19,952 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 999 transitions. [2022-04-28 10:12:19,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:19,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:19,952 INFO L74 IsIncluded]: Start isIncluded. First operand has 447 states, 442 states have (on average 1.3484162895927603) internal successors, (596), 442 states have internal predecessors, (596), 3 states have call successors, (3), 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 751 states. [2022-04-28 10:12:19,953 INFO L87 Difference]: Start difference. First operand has 447 states, 442 states have (on average 1.3484162895927603) internal successors, (596), 442 states have internal predecessors, (596), 3 states have call successors, (3), 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 751 states. [2022-04-28 10:12:19,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:19,967 INFO L93 Difference]: Finished difference Result 751 states and 999 transitions. [2022-04-28 10:12:19,967 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 999 transitions. [2022-04-28 10:12:19,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:19,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:19,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:19,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:19,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 442 states have (on average 1.3484162895927603) internal successors, (596), 442 states have internal predecessors, (596), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:19,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 600 transitions. [2022-04-28 10:12:19,980 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 600 transitions. Word has length 33 [2022-04-28 10:12:19,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:19,981 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 600 transitions. [2022-04-28 10:12:19,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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-28 10:12:19,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 447 states and 600 transitions. [2022-04-28 10:12:22,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 600 edges. 600 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:22,496 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 600 transitions. [2022-04-28 10:12:22,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:12:22,497 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:22,497 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:22,512 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-28 10:12:22,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-28 10:12:22,697 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:22,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:22,697 INFO L85 PathProgramCache]: Analyzing trace with hash -962304103, now seen corresponding path program 31 times [2022-04-28 10:12:22,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:22,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1633767917] [2022-04-28 10:12:22,701 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:22,701 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:22,701 INFO L85 PathProgramCache]: Analyzing trace with hash -962304103, now seen corresponding path program 32 times [2022-04-28 10:12:22,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:22,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341507389] [2022-04-28 10:12:22,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:22,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:22,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:23,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {62575#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {62552#true} is VALID [2022-04-28 10:12:23,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {62552#true} assume true; {62552#true} is VALID [2022-04-28 10:12:23,000 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62552#true} {62552#true} #94#return; {62552#true} is VALID [2022-04-28 10:12:23,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {62552#true} call ULTIMATE.init(); {62575#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:23,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {62575#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {62552#true} is VALID [2022-04-28 10:12:23,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {62552#true} assume true; {62552#true} is VALID [2022-04-28 10:12:23,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62552#true} {62552#true} #94#return; {62552#true} is VALID [2022-04-28 10:12:23,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {62552#true} call #t~ret17 := main(); {62552#true} is VALID [2022-04-28 10:12:23,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {62552#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62557#(= main_~y~0 0)} is VALID [2022-04-28 10:12:23,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {62557#(= 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; {62558#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:23,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {62558#(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; {62559#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:23,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {62559#(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; {62560#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:23,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {62560#(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; {62561#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:23,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {62561#(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; {62562#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:23,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {62562#(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; {62563#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:23,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {62563#(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; {62564#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:23,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {62564#(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; {62565#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:23,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {62565#(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; {62566#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:23,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {62566#(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; {62567#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:23,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {62567#(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; {62568#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:23,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {62568#(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; {62569#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:23,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {62569#(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; {62570#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:23,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {62570#(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; {62571#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:23,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {62571#(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; {62572#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:23,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {62572#(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; {62573#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:23,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {62573#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {62573#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:23,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {62573#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {62574#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:12:23,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {62574#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-28 10:12:23,012 INFO L290 TraceCheckUtils]: 25: Hoare triple {62553#false} assume !(~y~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-28 10:12:23,012 INFO L290 TraceCheckUtils]: 26: Hoare triple {62553#false} assume !(~x~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-28 10:12:23,012 INFO L290 TraceCheckUtils]: 27: Hoare triple {62553#false} assume !(~z~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-28 10:12:23,012 INFO L290 TraceCheckUtils]: 28: Hoare triple {62553#false} assume !(~y~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-28 10:12:23,012 INFO L272 TraceCheckUtils]: 29: Hoare triple {62553#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {62553#false} is VALID [2022-04-28 10:12:23,012 INFO L290 TraceCheckUtils]: 30: Hoare triple {62553#false} ~cond := #in~cond; {62553#false} is VALID [2022-04-28 10:12:23,012 INFO L290 TraceCheckUtils]: 31: Hoare triple {62553#false} assume 0 == ~cond; {62553#false} is VALID [2022-04-28 10:12:23,012 INFO L290 TraceCheckUtils]: 32: Hoare triple {62553#false} assume !false; {62553#false} is VALID [2022-04-28 10:12:23,012 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-28 10:12:23,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:23,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341507389] [2022-04-28 10:12:23,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341507389] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:23,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704497451] [2022-04-28 10:12:23,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:12:23,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:23,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:23,015 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-28 10:12:23,016 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-28 10:12:23,055 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:12:23,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:23,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 10:12:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:23,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:23,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {62552#true} call ULTIMATE.init(); {62552#true} is VALID [2022-04-28 10:12:23,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {62552#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {62552#true} is VALID [2022-04-28 10:12:23,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {62552#true} assume true; {62552#true} is VALID [2022-04-28 10:12:23,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62552#true} {62552#true} #94#return; {62552#true} is VALID [2022-04-28 10:12:23,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {62552#true} call #t~ret17 := main(); {62552#true} is VALID [2022-04-28 10:12:23,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {62552#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62557#(= main_~y~0 0)} is VALID [2022-04-28 10:12:23,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {62557#(= 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; {62558#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:23,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {62558#(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; {62559#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:23,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {62559#(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; {62560#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:23,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {62560#(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; {62561#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:23,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {62561#(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; {62562#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:23,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {62562#(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; {62563#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:23,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {62563#(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; {62564#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:23,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {62564#(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; {62565#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:23,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {62565#(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; {62566#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:23,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {62566#(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; {62567#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:23,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {62567#(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; {62568#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:23,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {62568#(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; {62569#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:23,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {62569#(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; {62570#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:23,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {62570#(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; {62571#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:23,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {62571#(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; {62572#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:23,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {62572#(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; {62573#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:23,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {62573#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {62573#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:23,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {62573#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {62648#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:12:23,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {62648#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~z~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-28 10:12:23,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {62553#false} assume !(~y~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-28 10:12:23,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {62553#false} assume !(~x~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-28 10:12:23,378 INFO L290 TraceCheckUtils]: 27: Hoare triple {62553#false} assume !(~z~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-28 10:12:23,378 INFO L290 TraceCheckUtils]: 28: Hoare triple {62553#false} assume !(~y~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-28 10:12:23,378 INFO L272 TraceCheckUtils]: 29: Hoare triple {62553#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {62553#false} is VALID [2022-04-28 10:12:23,378 INFO L290 TraceCheckUtils]: 30: Hoare triple {62553#false} ~cond := #in~cond; {62553#false} is VALID [2022-04-28 10:12:23,378 INFO L290 TraceCheckUtils]: 31: Hoare triple {62553#false} assume 0 == ~cond; {62553#false} is VALID [2022-04-28 10:12:23,378 INFO L290 TraceCheckUtils]: 32: Hoare triple {62553#false} assume !false; {62553#false} is VALID [2022-04-28 10:12:23,378 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-28 10:12:23,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:24,003 INFO L290 TraceCheckUtils]: 32: Hoare triple {62553#false} assume !false; {62553#false} is VALID [2022-04-28 10:12:24,003 INFO L290 TraceCheckUtils]: 31: Hoare triple {62553#false} assume 0 == ~cond; {62553#false} is VALID [2022-04-28 10:12:24,003 INFO L290 TraceCheckUtils]: 30: Hoare triple {62553#false} ~cond := #in~cond; {62553#false} is VALID [2022-04-28 10:12:24,003 INFO L272 TraceCheckUtils]: 29: Hoare triple {62553#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {62553#false} is VALID [2022-04-28 10:12:24,003 INFO L290 TraceCheckUtils]: 28: Hoare triple {62553#false} assume !(~y~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-28 10:12:24,003 INFO L290 TraceCheckUtils]: 27: Hoare triple {62553#false} assume !(~z~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-28 10:12:24,004 INFO L290 TraceCheckUtils]: 26: Hoare triple {62553#false} assume !(~x~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-28 10:12:24,004 INFO L290 TraceCheckUtils]: 25: Hoare triple {62553#false} assume !(~y~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-28 10:12:24,019 INFO L290 TraceCheckUtils]: 24: Hoare triple {62700#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-28 10:12:24,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {62704#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {62700#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:24,020 INFO L290 TraceCheckUtils]: 22: Hoare triple {62704#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {62704#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:24,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {62711#(< 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; {62704#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:24,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {62715#(< 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; {62711#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:12:24,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {62719#(< 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; {62715#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:12:24,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {62723#(< 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; {62719#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:12:24,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {62727#(< 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; {62723#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:12:24,025 INFO L290 TraceCheckUtils]: 16: Hoare triple {62731#(< 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; {62727#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:24,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {62735#(< 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; {62731#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:12:24,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {62739#(< 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; {62735#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:24,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {62743#(< 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; {62739#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:12:24,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {62747#(< 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; {62743#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:12:24,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {62751#(< 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; {62747#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:12:24,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {62755#(< 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; {62751#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:12:24,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {62759#(< 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; {62755#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:12:24,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {62763#(< 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; {62759#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:12:24,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {62767#(< 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; {62763#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:12:24,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {62771#(< 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; {62767#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:12:24,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {62552#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62771#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:12:24,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {62552#true} call #t~ret17 := main(); {62552#true} is VALID [2022-04-28 10:12:24,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62552#true} {62552#true} #94#return; {62552#true} is VALID [2022-04-28 10:12:24,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {62552#true} assume true; {62552#true} is VALID [2022-04-28 10:12:24,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {62552#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {62552#true} is VALID [2022-04-28 10:12:24,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {62552#true} call ULTIMATE.init(); {62552#true} is VALID [2022-04-28 10:12:24,035 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-28 10:12:24,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704497451] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:24,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:24,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 10:12:24,036 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:24,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1633767917] [2022-04-28 10:12:24,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1633767917] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:24,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:24,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:12:24,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133815082] [2022-04-28 10:12:24,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:24,036 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 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-28 10:12:24,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:24,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 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-28 10:12:24,056 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-28 10:12:24,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:12:24,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:24,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:12:24,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1192, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:12:24,058 INFO L87 Difference]: Start difference. First operand 447 states and 600 transitions. Second operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 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-28 10:12:32,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:32,013 INFO L93 Difference]: Finished difference Result 634 states and 941 transitions. [2022-04-28 10:12:32,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:12:32,014 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 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-28 10:12:32,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:32,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 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-28 10:12:32,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 247 transitions. [2022-04-28 10:12:32,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 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-28 10:12:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 247 transitions. [2022-04-28 10:12:32,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 247 transitions. [2022-04-28 10:12:32,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:32,238 INFO L225 Difference]: With dead ends: 634 [2022-04-28 10:12:32,238 INFO L226 Difference]: Without dead ends: 613 [2022-04-28 10:12:32,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=748, Invalid=2558, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 10:12:32,239 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 207 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 3151 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 3151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:32,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 194 Invalid, 3286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 3151 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 10:12:32,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2022-04-28 10:12:34,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 472. [2022-04-28 10:12:34,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:34,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 613 states. Second operand has 472 states, 467 states have (on average 1.3533190578158458) internal successors, (632), 467 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-28 10:12:34,690 INFO L74 IsIncluded]: Start isIncluded. First operand 613 states. Second operand has 472 states, 467 states have (on average 1.3533190578158458) internal successors, (632), 467 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-28 10:12:34,690 INFO L87 Difference]: Start difference. First operand 613 states. Second operand has 472 states, 467 states have (on average 1.3533190578158458) internal successors, (632), 467 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-28 10:12:34,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:34,700 INFO L93 Difference]: Finished difference Result 613 states and 809 transitions. [2022-04-28 10:12:34,701 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 809 transitions. [2022-04-28 10:12:34,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:34,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:34,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 472 states, 467 states have (on average 1.3533190578158458) internal successors, (632), 467 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 613 states. [2022-04-28 10:12:34,702 INFO L87 Difference]: Start difference. First operand has 472 states, 467 states have (on average 1.3533190578158458) internal successors, (632), 467 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 613 states. [2022-04-28 10:12:34,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:34,712 INFO L93 Difference]: Finished difference Result 613 states and 809 transitions. [2022-04-28 10:12:34,712 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 809 transitions. [2022-04-28 10:12:34,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:34,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:34,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:34,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:34,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 467 states have (on average 1.3533190578158458) internal successors, (632), 467 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-28 10:12:34,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 636 transitions. [2022-04-28 10:12:34,721 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 636 transitions. Word has length 33 [2022-04-28 10:12:34,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:34,721 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 636 transitions. [2022-04-28 10:12:34,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 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-28 10:12:34,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 472 states and 636 transitions. [2022-04-28 10:12:38,231 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-28 10:12:38,232 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 636 transitions. [2022-04-28 10:12:38,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:12:38,232 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:38,232 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:38,248 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-28 10:12:38,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-28 10:12:38,433 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:38,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:38,433 INFO L85 PathProgramCache]: Analyzing trace with hash 2139889685, now seen corresponding path program 15 times [2022-04-28 10:12:38,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:38,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1824539803] [2022-04-28 10:12:38,436 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:38,436 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:38,436 INFO L85 PathProgramCache]: Analyzing trace with hash 2139889685, now seen corresponding path program 16 times [2022-04-28 10:12:38,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:38,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003354369] [2022-04-28 10:12:38,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:38,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:38,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:38,649 INFO L290 TraceCheckUtils]: 0: Hoare triple {66284#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {66266#true} is VALID [2022-04-28 10:12:38,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {66266#true} assume true; {66266#true} is VALID [2022-04-28 10:12:38,649 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66266#true} {66266#true} #94#return; {66266#true} is VALID [2022-04-28 10:12:38,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {66266#true} call ULTIMATE.init(); {66284#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:38,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {66284#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {66266#true} is VALID [2022-04-28 10:12:38,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {66266#true} assume true; {66266#true} is VALID [2022-04-28 10:12:38,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66266#true} {66266#true} #94#return; {66266#true} is VALID [2022-04-28 10:12:38,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {66266#true} call #t~ret17 := main(); {66266#true} is VALID [2022-04-28 10:12:38,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {66266#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {66271#(= main_~y~0 0)} is VALID [2022-04-28 10:12:38,650 INFO L290 TraceCheckUtils]: 6: Hoare triple {66271#(= 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; {66272#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:38,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {66272#(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; {66273#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:38,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {66273#(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; {66274#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:38,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {66274#(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; {66275#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:38,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {66275#(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; {66276#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:38,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {66276#(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; {66277#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:38,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {66277#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {66277#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:38,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {66277#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {66278#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:12:38,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {66278#(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; {66279#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:12:38,655 INFO L290 TraceCheckUtils]: 15: Hoare triple {66279#(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; {66280#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:12:38,655 INFO L290 TraceCheckUtils]: 16: Hoare triple {66280#(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; {66281#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:12:38,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {66281#(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; {66282#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:12:38,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {66282#(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; {66283#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:12:38,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {66283#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {66267#false} is VALID [2022-04-28 10:12:38,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {66267#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66267#false} is VALID [2022-04-28 10:12:38,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {66267#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66267#false} is VALID [2022-04-28 10:12:38,657 INFO L290 TraceCheckUtils]: 22: Hoare triple {66267#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66267#false} is VALID [2022-04-28 10:12:38,657 INFO L290 TraceCheckUtils]: 23: Hoare triple {66267#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66267#false} is VALID [2022-04-28 10:12:38,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {66267#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66267#false} is VALID [2022-04-28 10:12:38,657 INFO L290 TraceCheckUtils]: 25: Hoare triple {66267#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66267#false} is VALID [2022-04-28 10:12:38,657 INFO L290 TraceCheckUtils]: 26: Hoare triple {66267#false} assume !(~y~0 % 4294967296 > 0); {66267#false} is VALID [2022-04-28 10:12:38,657 INFO L290 TraceCheckUtils]: 27: Hoare triple {66267#false} assume !(~x~0 % 4294967296 > 0); {66267#false} is VALID [2022-04-28 10:12:38,657 INFO L290 TraceCheckUtils]: 28: Hoare triple {66267#false} assume !(~z~0 % 4294967296 > 0); {66267#false} is VALID [2022-04-28 10:12:38,658 INFO L290 TraceCheckUtils]: 29: Hoare triple {66267#false} assume !(~y~0 % 4294967296 > 0); {66267#false} is VALID [2022-04-28 10:12:38,658 INFO L272 TraceCheckUtils]: 30: Hoare triple {66267#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {66267#false} is VALID [2022-04-28 10:12:38,658 INFO L290 TraceCheckUtils]: 31: Hoare triple {66267#false} ~cond := #in~cond; {66267#false} is VALID [2022-04-28 10:12:38,658 INFO L290 TraceCheckUtils]: 32: Hoare triple {66267#false} assume 0 == ~cond; {66267#false} is VALID [2022-04-28 10:12:38,658 INFO L290 TraceCheckUtils]: 33: Hoare triple {66267#false} assume !false; {66267#false} is VALID [2022-04-28 10:12:38,658 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:12:38,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:38,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003354369] [2022-04-28 10:12:38,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003354369] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:38,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442386584] [2022-04-28 10:12:38,659 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:12:38,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:38,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:38,664 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-28 10:12:38,664 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-28 10:12:38,718 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:12:38,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:38,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 10:12:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:38,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:38,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {66266#true} call ULTIMATE.init(); {66266#true} is VALID [2022-04-28 10:12:38,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {66266#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {66266#true} is VALID [2022-04-28 10:12:38,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {66266#true} assume true; {66266#true} is VALID [2022-04-28 10:12:38,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66266#true} {66266#true} #94#return; {66266#true} is VALID [2022-04-28 10:12:38,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {66266#true} call #t~ret17 := main(); {66266#true} is VALID [2022-04-28 10:12:38,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {66266#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {66266#true} is VALID [2022-04-28 10:12:38,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {66266#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66266#true} is VALID [2022-04-28 10:12:38,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {66266#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66309#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:12:38,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {66309#(< 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; {66313#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:12:38,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {66313#(< 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; {66317#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:12:38,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {66317#(< 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; {66321#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:12:38,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {66321#(< 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; {66325#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:38,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {66325#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {66325#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:38,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {66325#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {66325#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:38,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {66325#(< 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; {66321#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:12:38,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {66321#(< 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; {66317#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:12:38,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {66317#(< 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; {66313#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:12:38,949 INFO L290 TraceCheckUtils]: 17: Hoare triple {66313#(< 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; {66309#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:12:38,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {66309#(< 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; {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:38,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {66347#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:38,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {66347#(< 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; {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:38,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {66347#(< 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; {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:38,951 INFO L290 TraceCheckUtils]: 22: Hoare triple {66347#(< 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; {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:38,951 INFO L290 TraceCheckUtils]: 23: Hoare triple {66347#(< 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; {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:38,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {66347#(< 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; {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:38,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {66347#(< 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; {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:38,952 INFO L290 TraceCheckUtils]: 26: Hoare triple {66347#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:38,952 INFO L290 TraceCheckUtils]: 27: Hoare triple {66347#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {66267#false} is VALID [2022-04-28 10:12:38,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {66267#false} assume !(~z~0 % 4294967296 > 0); {66267#false} is VALID [2022-04-28 10:12:38,953 INFO L290 TraceCheckUtils]: 29: Hoare triple {66267#false} assume !(~y~0 % 4294967296 > 0); {66267#false} is VALID [2022-04-28 10:12:38,953 INFO L272 TraceCheckUtils]: 30: Hoare triple {66267#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {66267#false} is VALID [2022-04-28 10:12:38,953 INFO L290 TraceCheckUtils]: 31: Hoare triple {66267#false} ~cond := #in~cond; {66267#false} is VALID [2022-04-28 10:12:38,953 INFO L290 TraceCheckUtils]: 32: Hoare triple {66267#false} assume 0 == ~cond; {66267#false} is VALID [2022-04-28 10:12:38,953 INFO L290 TraceCheckUtils]: 33: Hoare triple {66267#false} assume !false; {66267#false} is VALID [2022-04-28 10:12:38,953 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 10:12:38,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:39,060 INFO L290 TraceCheckUtils]: 33: Hoare triple {66267#false} assume !false; {66267#false} is VALID [2022-04-28 10:12:39,060 INFO L290 TraceCheckUtils]: 32: Hoare triple {66267#false} assume 0 == ~cond; {66267#false} is VALID [2022-04-28 10:12:39,060 INFO L290 TraceCheckUtils]: 31: Hoare triple {66267#false} ~cond := #in~cond; {66267#false} is VALID [2022-04-28 10:12:39,060 INFO L272 TraceCheckUtils]: 30: Hoare triple {66267#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {66267#false} is VALID [2022-04-28 10:12:39,060 INFO L290 TraceCheckUtils]: 29: Hoare triple {66267#false} assume !(~y~0 % 4294967296 > 0); {66267#false} is VALID [2022-04-28 10:12:39,060 INFO L290 TraceCheckUtils]: 28: Hoare triple {66267#false} assume !(~z~0 % 4294967296 > 0); {66267#false} is VALID [2022-04-28 10:12:39,061 INFO L290 TraceCheckUtils]: 27: Hoare triple {66347#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {66267#false} is VALID [2022-04-28 10:12:39,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {66347#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:39,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {66347#(< 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; {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:39,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {66347#(< 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; {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:39,062 INFO L290 TraceCheckUtils]: 23: Hoare triple {66347#(< 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; {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:39,062 INFO L290 TraceCheckUtils]: 22: Hoare triple {66347#(< 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; {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:39,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {66347#(< 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; {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:39,062 INFO L290 TraceCheckUtils]: 20: Hoare triple {66347#(< 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; {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:39,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {66347#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:39,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {66309#(< 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; {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:39,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {66313#(< 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; {66309#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:12:39,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {66317#(< 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; {66313#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:12:39,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {66321#(< 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; {66317#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:12:39,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {66325#(< 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; {66321#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:12:39,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {66325#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {66325#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:39,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {66325#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {66325#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:39,068 INFO L290 TraceCheckUtils]: 11: Hoare triple {66321#(< 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; {66325#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:39,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {66317#(< 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; {66321#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:12:39,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {66313#(< 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; {66317#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:12:39,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {66309#(< 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; {66313#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:12:39,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {66266#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66309#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:12:39,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {66266#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66266#true} is VALID [2022-04-28 10:12:39,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {66266#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {66266#true} is VALID [2022-04-28 10:12:39,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {66266#true} call #t~ret17 := main(); {66266#true} is VALID [2022-04-28 10:12:39,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66266#true} {66266#true} #94#return; {66266#true} is VALID [2022-04-28 10:12:39,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {66266#true} assume true; {66266#true} is VALID [2022-04-28 10:12:39,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {66266#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {66266#true} is VALID [2022-04-28 10:12:39,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {66266#true} call ULTIMATE.init(); {66266#true} is VALID [2022-04-28 10:12:39,071 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 10:12:39,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442386584] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:39,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:39,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 22 [2022-04-28 10:12:39,072 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:39,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1824539803] [2022-04-28 10:12:39,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1824539803] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:39,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:39,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:12:39,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733449255] [2022-04-28 10:12:39,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:39,072 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-28 10:12:39,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:39,073 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-28 10:12:39,091 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-28 10:12:39,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:12:39,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:39,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:12:39,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:12:39,091 INFO L87 Difference]: Start difference. First operand 472 states and 636 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-28 10:12:43,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:43,716 INFO L93 Difference]: Finished difference Result 599 states and 814 transitions. [2022-04-28 10:12:43,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 10:12:43,716 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-28 10:12:43,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:43,717 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-28 10:12:43,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 120 transitions. [2022-04-28 10:12:43,718 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-28 10:12:43,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 120 transitions. [2022-04-28 10:12:43,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 120 transitions. [2022-04-28 10:12:43,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:43,829 INFO L225 Difference]: With dead ends: 599 [2022-04-28 10:12:43,829 INFO L226 Difference]: Without dead ends: 502 [2022-04-28 10:12:43,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=1952, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 10:12:43,830 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 75 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:43,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 103 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:12:43,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2022-04-28 10:12:46,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 473. [2022-04-28 10:12:46,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:46,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 502 states. Second operand has 473 states, 468 states have (on average 1.3461538461538463) internal successors, (630), 468 states have internal predecessors, (630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:46,289 INFO L74 IsIncluded]: Start isIncluded. First operand 502 states. Second operand has 473 states, 468 states have (on average 1.3461538461538463) internal successors, (630), 468 states have internal predecessors, (630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:46,289 INFO L87 Difference]: Start difference. First operand 502 states. Second operand has 473 states, 468 states have (on average 1.3461538461538463) internal successors, (630), 468 states have internal predecessors, (630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:46,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:46,296 INFO L93 Difference]: Finished difference Result 502 states and 677 transitions. [2022-04-28 10:12:46,296 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 677 transitions. [2022-04-28 10:12:46,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:46,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:46,297 INFO L74 IsIncluded]: Start isIncluded. First operand has 473 states, 468 states have (on average 1.3461538461538463) internal successors, (630), 468 states have internal predecessors, (630), 3 states have call successors, (3), 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 502 states. [2022-04-28 10:12:46,297 INFO L87 Difference]: Start difference. First operand has 473 states, 468 states have (on average 1.3461538461538463) internal successors, (630), 468 states have internal predecessors, (630), 3 states have call successors, (3), 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 502 states. [2022-04-28 10:12:46,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:46,305 INFO L93 Difference]: Finished difference Result 502 states and 677 transitions. [2022-04-28 10:12:46,305 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 677 transitions. [2022-04-28 10:12:46,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:46,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:46,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:46,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:46,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 468 states have (on average 1.3461538461538463) internal successors, (630), 468 states have internal predecessors, (630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:46,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 634 transitions. [2022-04-28 10:12:46,314 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 634 transitions. Word has length 34 [2022-04-28 10:12:46,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:46,314 INFO L495 AbstractCegarLoop]: Abstraction has 473 states and 634 transitions. [2022-04-28 10:12:46,314 INFO L496 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-28 10:12:46,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 473 states and 634 transitions. [2022-04-28 10:12:48,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 634 edges. 634 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:48,405 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 634 transitions. [2022-04-28 10:12:48,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:12:48,406 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:48,406 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:48,422 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-28 10:12:48,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:48,607 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:48,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:48,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1795073307, now seen corresponding path program 9 times [2022-04-28 10:12:48,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:48,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1655501259] [2022-04-28 10:12:48,610 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:48,610 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:48,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1795073307, now seen corresponding path program 10 times [2022-04-28 10:12:48,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:48,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103891146] [2022-04-28 10:12:48,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:48,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:48,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:48,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {69707#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {69692#true} is VALID [2022-04-28 10:12:48,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {69692#true} assume true; {69692#true} is VALID [2022-04-28 10:12:48,781 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {69692#true} {69692#true} #94#return; {69692#true} is VALID [2022-04-28 10:12:48,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {69692#true} call ULTIMATE.init(); {69707#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:48,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {69707#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {69692#true} is VALID [2022-04-28 10:12:48,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {69692#true} assume true; {69692#true} is VALID [2022-04-28 10:12:48,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69692#true} {69692#true} #94#return; {69692#true} is VALID [2022-04-28 10:12:48,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {69692#true} call #t~ret17 := main(); {69692#true} is VALID [2022-04-28 10:12:48,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {69692#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {69697#(= main_~y~0 0)} is VALID [2022-04-28 10:12:48,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {69697#(= 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; {69698#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:48,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {69698#(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; {69699#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:48,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {69699#(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; {69700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:48,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {69700#(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; {69701#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:48,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {69701#(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; {69702#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:48,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {69702#(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; {69703#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:48,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {69703#(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; {69704#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:48,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {69704#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {69704#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:48,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {69704#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {69705#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:48,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {69705#(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; {69706#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:12:48,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {69706#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-28 10:12:48,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-28 10:12:48,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-28 10:12:48,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-28 10:12:48,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-28 10:12:48,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-28 10:12:48,788 INFO L290 TraceCheckUtils]: 22: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-28 10:12:48,788 INFO L290 TraceCheckUtils]: 23: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-28 10:12:48,788 INFO L290 TraceCheckUtils]: 24: Hoare triple {69693#false} assume !(~y~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-28 10:12:48,788 INFO L290 TraceCheckUtils]: 25: Hoare triple {69693#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; {69693#false} is VALID [2022-04-28 10:12:48,788 INFO L290 TraceCheckUtils]: 26: Hoare triple {69693#false} assume !(~x~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-28 10:12:48,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {69693#false} assume !(~z~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-28 10:12:48,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {69693#false} is VALID [2022-04-28 10:12:48,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {69693#false} assume !(~y~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-28 10:12:48,788 INFO L272 TraceCheckUtils]: 30: Hoare triple {69693#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {69693#false} is VALID [2022-04-28 10:12:48,789 INFO L290 TraceCheckUtils]: 31: Hoare triple {69693#false} ~cond := #in~cond; {69693#false} is VALID [2022-04-28 10:12:48,789 INFO L290 TraceCheckUtils]: 32: Hoare triple {69693#false} assume 0 == ~cond; {69693#false} is VALID [2022-04-28 10:12:48,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {69693#false} assume !false; {69693#false} is VALID [2022-04-28 10:12:48,789 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:12:48,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:48,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103891146] [2022-04-28 10:12:48,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103891146] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:48,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697063537] [2022-04-28 10:12:48,789 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:12:48,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:48,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:48,790 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-28 10:12:48,791 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-28 10:12:48,834 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:12:48,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:48,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:12:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:48,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:49,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {69692#true} call ULTIMATE.init(); {69692#true} is VALID [2022-04-28 10:12:49,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {69692#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {69692#true} is VALID [2022-04-28 10:12:49,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {69692#true} assume true; {69692#true} is VALID [2022-04-28 10:12:49,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69692#true} {69692#true} #94#return; {69692#true} is VALID [2022-04-28 10:12:49,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {69692#true} call #t~ret17 := main(); {69692#true} is VALID [2022-04-28 10:12:49,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {69692#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {69697#(= main_~y~0 0)} is VALID [2022-04-28 10:12:49,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {69697#(= 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; {69698#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:49,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {69698#(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; {69699#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:49,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {69699#(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; {69700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:49,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {69700#(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; {69701#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:49,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {69701#(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; {69702#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:49,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {69702#(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; {69703#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:49,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {69703#(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; {69704#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:49,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {69704#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {69704#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:49,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {69704#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {69705#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:49,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {69705#(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; {69756#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:12:49,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {69756#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-28 10:12:49,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-28 10:12:49,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-28 10:12:49,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-28 10:12:49,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-28 10:12:49,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-28 10:12:49,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-28 10:12:49,065 INFO L290 TraceCheckUtils]: 23: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-28 10:12:49,065 INFO L290 TraceCheckUtils]: 24: Hoare triple {69693#false} assume !(~y~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-28 10:12:49,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {69693#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; {69693#false} is VALID [2022-04-28 10:12:49,065 INFO L290 TraceCheckUtils]: 26: Hoare triple {69693#false} assume !(~x~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-28 10:12:49,065 INFO L290 TraceCheckUtils]: 27: Hoare triple {69693#false} assume !(~z~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-28 10:12:49,065 INFO L290 TraceCheckUtils]: 28: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {69693#false} is VALID [2022-04-28 10:12:49,065 INFO L290 TraceCheckUtils]: 29: Hoare triple {69693#false} assume !(~y~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-28 10:12:49,065 INFO L272 TraceCheckUtils]: 30: Hoare triple {69693#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {69693#false} is VALID [2022-04-28 10:12:49,065 INFO L290 TraceCheckUtils]: 31: Hoare triple {69693#false} ~cond := #in~cond; {69693#false} is VALID [2022-04-28 10:12:49,065 INFO L290 TraceCheckUtils]: 32: Hoare triple {69693#false} assume 0 == ~cond; {69693#false} is VALID [2022-04-28 10:12:49,065 INFO L290 TraceCheckUtils]: 33: Hoare triple {69693#false} assume !false; {69693#false} is VALID [2022-04-28 10:12:49,066 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:12:49,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:49,308 INFO L290 TraceCheckUtils]: 33: Hoare triple {69693#false} assume !false; {69693#false} is VALID [2022-04-28 10:12:49,308 INFO L290 TraceCheckUtils]: 32: Hoare triple {69693#false} assume 0 == ~cond; {69693#false} is VALID [2022-04-28 10:12:49,308 INFO L290 TraceCheckUtils]: 31: Hoare triple {69693#false} ~cond := #in~cond; {69693#false} is VALID [2022-04-28 10:12:49,309 INFO L272 TraceCheckUtils]: 30: Hoare triple {69693#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {69693#false} is VALID [2022-04-28 10:12:49,309 INFO L290 TraceCheckUtils]: 29: Hoare triple {69693#false} assume !(~y~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-28 10:12:49,309 INFO L290 TraceCheckUtils]: 28: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {69693#false} is VALID [2022-04-28 10:12:49,309 INFO L290 TraceCheckUtils]: 27: Hoare triple {69693#false} assume !(~z~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-28 10:12:49,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {69693#false} assume !(~x~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-28 10:12:49,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {69693#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; {69693#false} is VALID [2022-04-28 10:12:49,309 INFO L290 TraceCheckUtils]: 24: Hoare triple {69693#false} assume !(~y~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-28 10:12:49,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-28 10:12:49,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-28 10:12:49,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-28 10:12:49,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-28 10:12:49,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-28 10:12:49,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-28 10:12:49,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-28 10:12:49,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {69862#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-28 10:12:49,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {69866#(< 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; {69862#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:49,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {69870#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {69866#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:49,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {69870#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {69870#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:49,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {69877#(< 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; {69870#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:49,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {69881#(< 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; {69877#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:49,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {69885#(< 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; {69881#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:12:49,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {69889#(< 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; {69885#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:12:49,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {69893#(< 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; {69889#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:12:49,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {69897#(< 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; {69893#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:12:49,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {69901#(< 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; {69897#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:49,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {69692#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {69901#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:12:49,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {69692#true} call #t~ret17 := main(); {69692#true} is VALID [2022-04-28 10:12:49,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69692#true} {69692#true} #94#return; {69692#true} is VALID [2022-04-28 10:12:49,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {69692#true} assume true; {69692#true} is VALID [2022-04-28 10:12:49,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {69692#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {69692#true} is VALID [2022-04-28 10:12:49,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {69692#true} call ULTIMATE.init(); {69692#true} is VALID [2022-04-28 10:12:49,318 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:12:49,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697063537] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:49,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:49,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 10:12:49,318 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:49,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1655501259] [2022-04-28 10:12:49,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1655501259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:49,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:49,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:12:49,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268252376] [2022-04-28 10:12:49,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:49,319 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 34 [2022-04-28 10:12:49,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:49,319 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-28 10:12:49,341 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-28 10:12:49,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:12:49,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:49,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:12:49,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:12:49,342 INFO L87 Difference]: Start difference. First operand 473 states and 634 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-28 10:12:53,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:53,436 INFO L93 Difference]: Finished difference Result 558 states and 735 transitions. [2022-04-28 10:12:53,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:12:53,437 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 34 [2022-04-28 10:12:53,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:53,437 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-28 10:12:53,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 116 transitions. [2022-04-28 10:12:53,438 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-28 10:12:53,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 116 transitions. [2022-04-28 10:12:53,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 116 transitions. [2022-04-28 10:12:53,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:53,543 INFO L225 Difference]: With dead ends: 558 [2022-04-28 10:12:53,543 INFO L226 Difference]: Without dead ends: 540 [2022-04-28 10:12:53,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=931, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 10:12:53,544 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 97 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:53,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 96 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:12:53,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-04-28 10:12:56,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 473. [2022-04-28 10:12:56,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:56,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 540 states. Second operand has 473 states, 468 states have (on average 1.3440170940170941) internal successors, (629), 468 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:56,005 INFO L74 IsIncluded]: Start isIncluded. First operand 540 states. Second operand has 473 states, 468 states have (on average 1.3440170940170941) internal successors, (629), 468 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:56,006 INFO L87 Difference]: Start difference. First operand 540 states. Second operand has 473 states, 468 states have (on average 1.3440170940170941) internal successors, (629), 468 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:56,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:56,018 INFO L93 Difference]: Finished difference Result 540 states and 716 transitions. [2022-04-28 10:12:56,018 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 716 transitions. [2022-04-28 10:12:56,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:56,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:56,019 INFO L74 IsIncluded]: Start isIncluded. First operand has 473 states, 468 states have (on average 1.3440170940170941) internal successors, (629), 468 states have internal predecessors, (629), 3 states have call successors, (3), 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 540 states. [2022-04-28 10:12:56,020 INFO L87 Difference]: Start difference. First operand has 473 states, 468 states have (on average 1.3440170940170941) internal successors, (629), 468 states have internal predecessors, (629), 3 states have call successors, (3), 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 540 states. [2022-04-28 10:12:56,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:56,028 INFO L93 Difference]: Finished difference Result 540 states and 716 transitions. [2022-04-28 10:12:56,028 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 716 transitions. [2022-04-28 10:12:56,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:56,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:56,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:56,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:56,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 468 states have (on average 1.3440170940170941) internal successors, (629), 468 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:56,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 633 transitions. [2022-04-28 10:12:56,038 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 633 transitions. Word has length 34 [2022-04-28 10:12:56,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:56,039 INFO L495 AbstractCegarLoop]: Abstraction has 473 states and 633 transitions. [2022-04-28 10:12:56,039 INFO L496 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-28 10:12:56,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 473 states and 633 transitions. [2022-04-28 10:12:58,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 633 edges. 633 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:58,054 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 633 transitions. [2022-04-28 10:12:58,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:12:58,054 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:58,054 INFO L195 NwaCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:58,070 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-28 10:12:58,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-28 10:12:58,255 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:58,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:58,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1035294218, now seen corresponding path program 33 times [2022-04-28 10:12:58,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:58,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2074222943] [2022-04-28 10:12:58,258 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:58,258 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:58,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1035294218, now seen corresponding path program 34 times [2022-04-28 10:12:58,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:58,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500585825] [2022-04-28 10:12:58,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:58,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:58,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:58,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {73110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {73086#true} is VALID [2022-04-28 10:12:58,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {73086#true} assume true; {73086#true} is VALID [2022-04-28 10:12:58,651 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73086#true} {73086#true} #94#return; {73086#true} is VALID [2022-04-28 10:12:58,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {73086#true} call ULTIMATE.init(); {73110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:58,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {73110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {73086#true} is VALID [2022-04-28 10:12:58,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {73086#true} assume true; {73086#true} is VALID [2022-04-28 10:12:58,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73086#true} {73086#true} #94#return; {73086#true} is VALID [2022-04-28 10:12:58,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {73086#true} call #t~ret17 := main(); {73086#true} is VALID [2022-04-28 10:12:58,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {73086#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73091#(= main_~y~0 0)} is VALID [2022-04-28 10:12:58,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {73091#(= 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; {73092#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:58,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {73092#(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; {73093#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:58,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {73093#(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; {73094#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:58,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {73094#(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; {73095#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:58,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {73095#(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; {73096#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:58,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {73096#(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; {73097#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:58,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {73097#(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; {73098#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:58,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {73098#(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; {73099#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:58,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {73099#(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; {73100#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:58,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {73100#(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; {73101#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:58,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {73101#(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; {73102#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:58,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {73102#(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; {73103#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:58,661 INFO L290 TraceCheckUtils]: 18: Hoare triple {73103#(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; {73104#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:58,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {73104#(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; {73105#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:58,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {73105#(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; {73106#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:58,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {73106#(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; {73107#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:58,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {73107#(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; {73108#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:12:58,665 INFO L290 TraceCheckUtils]: 23: Hoare triple {73108#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {73108#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:12:58,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {73108#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {73109#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} is VALID [2022-04-28 10:12:58,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {73109#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-28 10:12:58,666 INFO L290 TraceCheckUtils]: 26: Hoare triple {73087#false} assume !(~y~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-28 10:12:58,666 INFO L290 TraceCheckUtils]: 27: Hoare triple {73087#false} assume !(~x~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-28 10:12:58,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {73087#false} assume !(~z~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-28 10:12:58,666 INFO L290 TraceCheckUtils]: 29: Hoare triple {73087#false} assume !(~y~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-28 10:12:58,666 INFO L272 TraceCheckUtils]: 30: Hoare triple {73087#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {73087#false} is VALID [2022-04-28 10:12:58,666 INFO L290 TraceCheckUtils]: 31: Hoare triple {73087#false} ~cond := #in~cond; {73087#false} is VALID [2022-04-28 10:12:58,666 INFO L290 TraceCheckUtils]: 32: Hoare triple {73087#false} assume 0 == ~cond; {73087#false} is VALID [2022-04-28 10:12:58,666 INFO L290 TraceCheckUtils]: 33: Hoare triple {73087#false} assume !false; {73087#false} is VALID [2022-04-28 10:12:58,667 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:12:58,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:58,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500585825] [2022-04-28 10:12:58,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500585825] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:58,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862106187] [2022-04-28 10:12:58,667 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:12:58,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:58,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:58,669 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-28 10:12:58,670 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-28 10:12:58,725 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:12:58,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:58,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:12:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:58,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:59,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {73086#true} call ULTIMATE.init(); {73086#true} is VALID [2022-04-28 10:12:59,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {73086#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {73086#true} is VALID [2022-04-28 10:12:59,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {73086#true} assume true; {73086#true} is VALID [2022-04-28 10:12:59,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73086#true} {73086#true} #94#return; {73086#true} is VALID [2022-04-28 10:12:59,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {73086#true} call #t~ret17 := main(); {73086#true} is VALID [2022-04-28 10:12:59,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {73086#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73091#(= main_~y~0 0)} is VALID [2022-04-28 10:12:59,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {73091#(= 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; {73092#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:59,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {73092#(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; {73093#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:59,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {73093#(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; {73094#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:59,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {73094#(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; {73095#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:59,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {73095#(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; {73096#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:59,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {73096#(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; {73097#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:59,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {73097#(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; {73098#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:59,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {73098#(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; {73099#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:59,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {73099#(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; {73100#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:59,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {73100#(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; {73101#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:59,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {73101#(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; {73102#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:59,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {73102#(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; {73103#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:59,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {73103#(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; {73104#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:59,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {73104#(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; {73105#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:59,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {73105#(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; {73106#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:59,083 INFO L290 TraceCheckUtils]: 21: Hoare triple {73106#(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; {73107#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:59,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {73107#(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; {73108#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:12:59,083 INFO L290 TraceCheckUtils]: 23: Hoare triple {73108#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {73108#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:12:59,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {73108#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {73186#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-28 10:12:59,084 INFO L290 TraceCheckUtils]: 25: Hoare triple {73186#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !(~z~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-28 10:12:59,084 INFO L290 TraceCheckUtils]: 26: Hoare triple {73087#false} assume !(~y~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-28 10:12:59,084 INFO L290 TraceCheckUtils]: 27: Hoare triple {73087#false} assume !(~x~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-28 10:12:59,084 INFO L290 TraceCheckUtils]: 28: Hoare triple {73087#false} assume !(~z~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-28 10:12:59,085 INFO L290 TraceCheckUtils]: 29: Hoare triple {73087#false} assume !(~y~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-28 10:12:59,085 INFO L272 TraceCheckUtils]: 30: Hoare triple {73087#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {73087#false} is VALID [2022-04-28 10:12:59,085 INFO L290 TraceCheckUtils]: 31: Hoare triple {73087#false} ~cond := #in~cond; {73087#false} is VALID [2022-04-28 10:12:59,085 INFO L290 TraceCheckUtils]: 32: Hoare triple {73087#false} assume 0 == ~cond; {73087#false} is VALID [2022-04-28 10:12:59,085 INFO L290 TraceCheckUtils]: 33: Hoare triple {73087#false} assume !false; {73087#false} is VALID [2022-04-28 10:12:59,085 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:12:59,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:59,753 INFO L290 TraceCheckUtils]: 33: Hoare triple {73087#false} assume !false; {73087#false} is VALID [2022-04-28 10:12:59,753 INFO L290 TraceCheckUtils]: 32: Hoare triple {73087#false} assume 0 == ~cond; {73087#false} is VALID [2022-04-28 10:12:59,753 INFO L290 TraceCheckUtils]: 31: Hoare triple {73087#false} ~cond := #in~cond; {73087#false} is VALID [2022-04-28 10:12:59,753 INFO L272 TraceCheckUtils]: 30: Hoare triple {73087#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {73087#false} is VALID [2022-04-28 10:12:59,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {73087#false} assume !(~y~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-28 10:12:59,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {73087#false} assume !(~z~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-28 10:12:59,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {73087#false} assume !(~x~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-28 10:12:59,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {73087#false} assume !(~y~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-28 10:12:59,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {73238#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-28 10:12:59,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {73242#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {73238#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:59,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {73242#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {73242#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:59,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {73249#(< 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; {73242#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:59,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {73253#(< 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; {73249#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:12:59,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {73257#(< 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; {73253#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:12:59,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {73261#(< 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; {73257#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:12:59,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {73265#(< 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; {73261#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:12:59,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {73269#(< 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; {73265#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:59,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {73273#(< 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; {73269#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:12:59,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {73277#(< 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; {73273#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:59,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {73281#(< 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; {73277#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:12:59,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {73285#(< 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; {73281#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:12:59,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {73289#(< 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; {73285#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:12:59,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {73293#(< 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; {73289#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:12:59,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {73297#(< 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; {73293#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:12:59,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {73301#(< 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; {73297#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:12:59,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {73305#(< 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; {73301#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:12:59,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {73309#(< 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; {73305#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:12:59,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {73313#(< 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; {73309#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:12:59,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {73086#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73313#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:12:59,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {73086#true} call #t~ret17 := main(); {73086#true} is VALID [2022-04-28 10:12:59,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73086#true} {73086#true} #94#return; {73086#true} is VALID [2022-04-28 10:12:59,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {73086#true} assume true; {73086#true} is VALID [2022-04-28 10:12:59,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {73086#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {73086#true} is VALID [2022-04-28 10:12:59,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {73086#true} call ULTIMATE.init(); {73086#true} is VALID [2022-04-28 10:12:59,767 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:12:59,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862106187] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:59,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:59,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 10:12:59,767 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:59,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2074222943] [2022-04-28 10:12:59,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2074222943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:59,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:59,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:12:59,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666114150] [2022-04-28 10:12:59,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:59,768 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 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-28 10:12:59,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:59,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 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-28 10:12:59,789 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-28 10:12:59,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:12:59,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:59,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:12:59,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=1315, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:12:59,789 INFO L87 Difference]: Start difference. First operand 473 states and 633 transitions. Second operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 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-28 10:13:08,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:08,516 INFO L93 Difference]: Finished difference Result 668 states and 990 transitions. [2022-04-28 10:13:08,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:13:08,517 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 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-28 10:13:08,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:08,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 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-28 10:13:08,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 260 transitions. [2022-04-28 10:13:08,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 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-28 10:13:08,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 260 transitions. [2022-04-28 10:13:08,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 260 transitions. [2022-04-28 10:13:08,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:08,754 INFO L225 Difference]: With dead ends: 668 [2022-04-28 10:13:08,754 INFO L226 Difference]: Without dead ends: 647 [2022-04-28 10:13:08,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=827, Invalid=2833, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 10:13:08,755 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 221 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3534 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 3678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 3534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:08,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 205 Invalid, 3678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 3534 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-28 10:13:08,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-04-28 10:13:11,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 498. [2022-04-28 10:13:11,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:11,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 647 states. Second operand has 498 states, 493 states have (on average 1.3488843813387423) internal successors, (665), 493 states have internal predecessors, (665), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:11,341 INFO L74 IsIncluded]: Start isIncluded. First operand 647 states. Second operand has 498 states, 493 states have (on average 1.3488843813387423) internal successors, (665), 493 states have internal predecessors, (665), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:11,341 INFO L87 Difference]: Start difference. First operand 647 states. Second operand has 498 states, 493 states have (on average 1.3488843813387423) internal successors, (665), 493 states have internal predecessors, (665), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:11,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:11,353 INFO L93 Difference]: Finished difference Result 647 states and 852 transitions. [2022-04-28 10:13:11,353 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 852 transitions. [2022-04-28 10:13:11,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:11,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:11,353 INFO L74 IsIncluded]: Start isIncluded. First operand has 498 states, 493 states have (on average 1.3488843813387423) internal successors, (665), 493 states have internal predecessors, (665), 3 states have call successors, (3), 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 647 states. [2022-04-28 10:13:11,354 INFO L87 Difference]: Start difference. First operand has 498 states, 493 states have (on average 1.3488843813387423) internal successors, (665), 493 states have internal predecessors, (665), 3 states have call successors, (3), 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 647 states. [2022-04-28 10:13:11,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:11,365 INFO L93 Difference]: Finished difference Result 647 states and 852 transitions. [2022-04-28 10:13:11,365 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 852 transitions. [2022-04-28 10:13:11,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:11,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:11,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:11,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:11,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 493 states have (on average 1.3488843813387423) internal successors, (665), 493 states have internal predecessors, (665), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:11,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 669 transitions. [2022-04-28 10:13:11,375 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 669 transitions. Word has length 34 [2022-04-28 10:13:11,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:11,375 INFO L495 AbstractCegarLoop]: Abstraction has 498 states and 669 transitions. [2022-04-28 10:13:11,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 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-28 10:13:11,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 498 states and 669 transitions. [2022-04-28 10:13:13,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 669 edges. 669 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:13,211 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 669 transitions. [2022-04-28 10:13:13,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:13:13,211 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:13,211 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:13,228 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-28 10:13:13,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-28 10:13:13,412 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:13,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:13,412 INFO L85 PathProgramCache]: Analyzing trace with hash 289270042, now seen corresponding path program 9 times [2022-04-28 10:13:13,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:13,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1990736736] [2022-04-28 10:13:13,414 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:13,414 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:13,414 INFO L85 PathProgramCache]: Analyzing trace with hash 289270042, now seen corresponding path program 10 times [2022-04-28 10:13:13,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:13,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434266633] [2022-04-28 10:13:13,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:13,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:13,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:13,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {77016#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {76998#true} is VALID [2022-04-28 10:13:13,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {76998#true} assume true; {76998#true} is VALID [2022-04-28 10:13:13,942 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76998#true} {76998#true} #94#return; {76998#true} is VALID [2022-04-28 10:13:13,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {76998#true} call ULTIMATE.init(); {77016#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:13,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {77016#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {76998#true} is VALID [2022-04-28 10:13:13,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {76998#true} assume true; {76998#true} is VALID [2022-04-28 10:13:13,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76998#true} {76998#true} #94#return; {76998#true} is VALID [2022-04-28 10:13:13,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {76998#true} call #t~ret17 := main(); {76998#true} is VALID [2022-04-28 10:13:13,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {76998#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {77003#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:13:13,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {77003#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= 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; {77004#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:13,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {77004#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~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; {77005#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-28 10:13:13,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {77005#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 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; {77006#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-28 10:13:13,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {77006#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)))} assume !(~x~0 % 4294967296 > 0); {77007#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-28 10:13:13,953 INFO L290 TraceCheckUtils]: 10: Hoare triple {77007#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} ~z~0 := ~y~0; {77008#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-28 10:13:13,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {77008#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77009#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:13:13,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {77009#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 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; {77010#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} is VALID [2022-04-28 10:13:13,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {77010#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= 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; {77011#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:13,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {77011#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {77011#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:13,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {77011#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~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; {77010#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} is VALID [2022-04-28 10:13:13,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {77010#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= 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; {77009#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:13:13,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {77009#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 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; {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:13,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:13,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~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; {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:13,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~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; {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:13,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~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; {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:13,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:13,961 INFO L290 TraceCheckUtils]: 23: Hoare triple {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {77009#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:13:13,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {77009#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {77010#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} is VALID [2022-04-28 10:13:13,962 INFO L290 TraceCheckUtils]: 25: Hoare triple {77010#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {77011#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:13,963 INFO L290 TraceCheckUtils]: 26: Hoare triple {77011#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {77011#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:13,963 INFO L290 TraceCheckUtils]: 27: Hoare triple {77011#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {77010#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} is VALID [2022-04-28 10:13:13,964 INFO L290 TraceCheckUtils]: 28: Hoare triple {77010#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {77009#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:13:13,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {77009#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {77013#(and (<= (div main_~z~0 4294967296) 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:13,966 INFO L290 TraceCheckUtils]: 30: Hoare triple {77013#(and (<= (div main_~z~0 4294967296) 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {77013#(and (<= (div main_~z~0 4294967296) 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:13,967 INFO L272 TraceCheckUtils]: 31: Hoare triple {77013#(and (<= (div main_~z~0 4294967296) 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {77014#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:13:13,967 INFO L290 TraceCheckUtils]: 32: Hoare triple {77014#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {77015#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:13:13,968 INFO L290 TraceCheckUtils]: 33: Hoare triple {77015#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {76999#false} is VALID [2022-04-28 10:13:13,968 INFO L290 TraceCheckUtils]: 34: Hoare triple {76999#false} assume !false; {76999#false} is VALID [2022-04-28 10:13:13,968 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:13:13,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:13,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434266633] [2022-04-28 10:13:13,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434266633] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:13,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693400918] [2022-04-28 10:13:13,968 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:13:13,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:13,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:13,969 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-28 10:13:13,971 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-28 10:13:14,093 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:13:14,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:14,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-28 10:13:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:14,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:23,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {76998#true} call ULTIMATE.init(); {76998#true} is VALID [2022-04-28 10:13:23,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {76998#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {76998#true} is VALID [2022-04-28 10:13:23,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {76998#true} assume true; {76998#true} is VALID [2022-04-28 10:13:23,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76998#true} {76998#true} #94#return; {76998#true} is VALID [2022-04-28 10:13:23,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {76998#true} call #t~ret17 := main(); {76998#true} is VALID [2022-04-28 10:13:23,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {76998#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {77003#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:13:23,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {77003#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= 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; {77004#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:23,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {77004#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~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; {77041#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-28 10:13:23,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {77041#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 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; {77045#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:23,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {77045#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {77049#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:23,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {77049#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} ~z~0 := ~y~0; {77053#(and (<= main_~z~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-28 10:13:23,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {77053#(and (<= main_~z~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77057#(and (<= (+ main_~x~0 2) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~z~0 2) (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-28 10:13:23,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {77057#(and (<= (+ main_~x~0 2) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~z~0 2) (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 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; {77061#(and (<= main_~z~0 1) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~x~0 (+ 4294967294 (* 4294967296 (div (+ main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)))) (<= (+ main_~x~0 1) main_~n~0))} is VALID [2022-04-28 10:13:23,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {77061#(and (<= main_~z~0 1) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~x~0 (+ 4294967294 (* 4294967296 (div (+ main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)))) (<= (+ main_~x~0 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77065#(and (<= main_~z~0 0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 main_~n~0))} is VALID [2022-04-28 10:13:23,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {77065#(and (<= main_~z~0 0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 main_~n~0))} assume !(~z~0 % 4294967296 > 0); {77065#(and (<= main_~z~0 0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 main_~n~0))} is VALID [2022-04-28 10:13:23,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {77065#(and (<= main_~z~0 0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 main_~n~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; {77072#(and (<= main_~x~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) 4294967295)) (<= main_~z~0 1) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 main_~n~0))} is VALID [2022-04-28 10:13:23,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {77072#(and (<= main_~x~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) 4294967295)) (<= main_~z~0 1) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 main_~n~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; {77076#(and (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* (div (+ (- 2) main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~z~0 2))} is VALID [2022-04-28 10:13:23,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {77076#(and (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* (div (+ (- 2) main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77080#(and (<= main_~z~0 3) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (- 3) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~x~0 main_~n~0))} is VALID [2022-04-28 10:13:23,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {77080#(and (<= main_~z~0 3) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (- 3) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~x~0 main_~n~0))} assume !(~y~0 % 4294967296 > 0); {77080#(and (<= main_~z~0 3) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (- 3) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~x~0 main_~n~0))} is VALID [2022-04-28 10:13:23,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {77080#(and (<= main_~z~0 3) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (- 3) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~x~0 main_~n~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; {77087#(and (<= main_~z~0 3) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* (div (+ (- 2) main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967294)))} is VALID [2022-04-28 10:13:23,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {77087#(and (<= main_~z~0 3) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* (div (+ (- 2) main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967294)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {77091#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~z~0 3) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~x~0 (+ (* (div (+ (- 1) main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-28 10:13:23,826 INFO L290 TraceCheckUtils]: 21: Hoare triple {77091#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~z~0 3) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~x~0 (+ (* (div (+ (- 1) main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {77053#(and (<= main_~z~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-28 10:13:23,826 INFO L290 TraceCheckUtils]: 22: Hoare triple {77053#(and (<= main_~z~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {77053#(and (<= main_~z~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-28 10:13:23,830 INFO L290 TraceCheckUtils]: 23: Hoare triple {77053#(and (<= main_~z~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {77057#(and (<= (+ main_~x~0 2) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~z~0 2) (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-28 10:13:23,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {77057#(and (<= (+ main_~x~0 2) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~z~0 2) (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {77061#(and (<= main_~z~0 1) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~x~0 (+ 4294967294 (* 4294967296 (div (+ main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)))) (<= (+ main_~x~0 1) main_~n~0))} is VALID [2022-04-28 10:13:23,834 INFO L290 TraceCheckUtils]: 25: Hoare triple {77061#(and (<= main_~z~0 1) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~x~0 (+ 4294967294 (* 4294967296 (div (+ main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)))) (<= (+ main_~x~0 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {77011#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:23,834 INFO L290 TraceCheckUtils]: 26: Hoare triple {77011#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {77011#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:23,835 INFO L290 TraceCheckUtils]: 27: Hoare triple {77011#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {77010#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} is VALID [2022-04-28 10:13:23,836 INFO L290 TraceCheckUtils]: 28: Hoare triple {77010#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {77009#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:13:23,836 INFO L290 TraceCheckUtils]: 29: Hoare triple {77009#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:23,837 INFO L290 TraceCheckUtils]: 30: Hoare triple {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:23,838 INFO L272 TraceCheckUtils]: 31: Hoare triple {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {77125#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:13:23,839 INFO L290 TraceCheckUtils]: 32: Hoare triple {77125#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {77129#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:13:23,839 INFO L290 TraceCheckUtils]: 33: Hoare triple {77129#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {76999#false} is VALID [2022-04-28 10:13:23,839 INFO L290 TraceCheckUtils]: 34: Hoare triple {76999#false} assume !false; {76999#false} is VALID [2022-04-28 10:13:23,839 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:13:23,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:25,186 INFO L290 TraceCheckUtils]: 34: Hoare triple {76999#false} assume !false; {76999#false} is VALID [2022-04-28 10:13:25,187 INFO L290 TraceCheckUtils]: 33: Hoare triple {77129#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {76999#false} is VALID [2022-04-28 10:13:25,187 INFO L290 TraceCheckUtils]: 32: Hoare triple {77125#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {77129#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:13:25,188 INFO L272 TraceCheckUtils]: 31: Hoare triple {77145#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {77125#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:13:25,188 INFO L290 TraceCheckUtils]: 30: Hoare triple {77145#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {77145#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:13:25,189 INFO L290 TraceCheckUtils]: 29: Hoare triple {77152#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {77145#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:13:25,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {77156#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {77152#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-28 10:13:25,191 INFO L290 TraceCheckUtils]: 27: Hoare triple {77160#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {77156#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 10:13:25,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {77160#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} assume !(~z~0 % 4294967296 > 0); {77160#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 10:13:25,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {77156#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {77160#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 10:13:25,194 INFO L290 TraceCheckUtils]: 24: Hoare triple {77152#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {77156#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 10:13:25,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {77145#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {77152#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-28 10:13:25,195 INFO L290 TraceCheckUtils]: 22: Hoare triple {77176#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {77145#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:13:25,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {77180#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (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; {77176#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:13:25,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {77184#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {77180#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:13:25,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {77188#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (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; {77184#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:13:25,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {77188#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {77188#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:13:25,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {77195#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77188#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:13:25,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {77199#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (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; {77195#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-28 10:13:25,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {77203#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (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; {77199#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296)))} is VALID [2022-04-28 10:13:25,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {77203#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {77203#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-28 10:13:25,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {77210#(or (= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296)) (< 0 (mod (+ main_~x~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; {77203#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-28 10:13:25,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {77214#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~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; {77210#(or (= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:13:25,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {77176#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77214#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-28 10:13:25,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {77221#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} ~z~0 := ~y~0; {77176#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:13:25,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {77221#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {77221#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:13:25,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {77228#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (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; {77221#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:13:25,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {77232#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (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; {77228#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-28 10:13:25,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {77236#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~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; {77232#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-28 10:13:25,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {76998#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {77236#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:13:25,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {76998#true} call #t~ret17 := main(); {76998#true} is VALID [2022-04-28 10:13:25,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76998#true} {76998#true} #94#return; {76998#true} is VALID [2022-04-28 10:13:25,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {76998#true} assume true; {76998#true} is VALID [2022-04-28 10:13:25,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {76998#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {76998#true} is VALID [2022-04-28 10:13:25,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {76998#true} call ULTIMATE.init(); {76998#true} is VALID [2022-04-28 10:13:25,216 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:13:25,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693400918] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:25,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:25,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22, 21] total 47 [2022-04-28 10:13:25,216 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:25,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1990736736] [2022-04-28 10:13:25,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1990736736] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:25,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:25,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:13:25,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781163046] [2022-04-28 10:13:25,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:25,217 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 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 35 [2022-04-28 10:13:25,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:25,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 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-28 10:13:25,327 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-28 10:13:25,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:13:25,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:25,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:13:25,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=1874, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 10:13:25,328 INFO L87 Difference]: Start difference. First operand 498 states and 669 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 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-28 10:13:31,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:31,412 INFO L93 Difference]: Finished difference Result 634 states and 808 transitions. [2022-04-28 10:13:31,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:13:31,412 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 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 35 [2022-04-28 10:13:31,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:31,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 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-28 10:13:31,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 58 transitions. [2022-04-28 10:13:31,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 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-28 10:13:31,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 58 transitions. [2022-04-28 10:13:31,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 58 transitions. [2022-04-28 10:13:31,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:31,527 INFO L225 Difference]: With dead ends: 634 [2022-04-28 10:13:31,527 INFO L226 Difference]: Without dead ends: 621 [2022-04-28 10:13:31,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=419, Invalid=3121, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 10:13:31,528 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 37 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:31,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 76 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:13:31,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2022-04-28 10:13:34,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 506. [2022-04-28 10:13:34,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:34,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 621 states. Second operand has 506 states, 501 states have (on average 1.347305389221557) internal successors, (675), 501 states have internal predecessors, (675), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:34,270 INFO L74 IsIncluded]: Start isIncluded. First operand 621 states. Second operand has 506 states, 501 states have (on average 1.347305389221557) internal successors, (675), 501 states have internal predecessors, (675), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:34,270 INFO L87 Difference]: Start difference. First operand 621 states. Second operand has 506 states, 501 states have (on average 1.347305389221557) internal successors, (675), 501 states have internal predecessors, (675), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:34,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:34,281 INFO L93 Difference]: Finished difference Result 621 states and 794 transitions. [2022-04-28 10:13:34,281 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 794 transitions. [2022-04-28 10:13:34,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:34,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:34,282 INFO L74 IsIncluded]: Start isIncluded. First operand has 506 states, 501 states have (on average 1.347305389221557) internal successors, (675), 501 states have internal predecessors, (675), 3 states have call successors, (3), 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 621 states. [2022-04-28 10:13:34,282 INFO L87 Difference]: Start difference. First operand has 506 states, 501 states have (on average 1.347305389221557) internal successors, (675), 501 states have internal predecessors, (675), 3 states have call successors, (3), 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 621 states. [2022-04-28 10:13:34,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:34,292 INFO L93 Difference]: Finished difference Result 621 states and 794 transitions. [2022-04-28 10:13:34,293 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 794 transitions. [2022-04-28 10:13:34,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:34,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:34,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:34,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:34,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 501 states have (on average 1.347305389221557) internal successors, (675), 501 states have internal predecessors, (675), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:34,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 679 transitions. [2022-04-28 10:13:34,303 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 679 transitions. Word has length 35 [2022-04-28 10:13:34,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:34,303 INFO L495 AbstractCegarLoop]: Abstraction has 506 states and 679 transitions. [2022-04-28 10:13:34,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 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-28 10:13:34,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 506 states and 679 transitions. [2022-04-28 10:13:38,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 679 edges. 678 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:38,868 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 679 transitions. [2022-04-28 10:13:38,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:13:38,868 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:38,869 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:38,885 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-28 10:13:39,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:39,069 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:39,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:39,070 INFO L85 PathProgramCache]: Analyzing trace with hash -53610471, now seen corresponding path program 17 times [2022-04-28 10:13:39,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:39,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [291339355] [2022-04-28 10:13:39,072 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:39,072 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:39,072 INFO L85 PathProgramCache]: Analyzing trace with hash -53610471, now seen corresponding path program 18 times [2022-04-28 10:13:39,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:39,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128471025] [2022-04-28 10:13:39,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:39,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:39,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:39,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {80825#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {80805#true} is VALID [2022-04-28 10:13:39,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {80805#true} assume true; {80805#true} is VALID [2022-04-28 10:13:39,383 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80805#true} {80805#true} #94#return; {80805#true} is VALID [2022-04-28 10:13:39,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {80805#true} call ULTIMATE.init(); {80825#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:39,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {80825#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {80805#true} is VALID [2022-04-28 10:13:39,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {80805#true} assume true; {80805#true} is VALID [2022-04-28 10:13:39,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80805#true} {80805#true} #94#return; {80805#true} is VALID [2022-04-28 10:13:39,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {80805#true} call #t~ret17 := main(); {80805#true} is VALID [2022-04-28 10:13:39,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {80805#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80810#(= main_~y~0 0)} is VALID [2022-04-28 10:13:39,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {80810#(= 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; {80811#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:39,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {80811#(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; {80812#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:39,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {80812#(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; {80813#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:39,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {80813#(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; {80814#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:39,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {80814#(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; {80815#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:39,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {80815#(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; {80816#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:39,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {80816#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {80816#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:39,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {80816#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {80817#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:13:39,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {80817#(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; {80818#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:13:39,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {80818#(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; {80819#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:13:39,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {80819#(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; {80820#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:13:39,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {80820#(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; {80821#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:13:39,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {80821#(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; {80822#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:13:39,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {80822#(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; {80823#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:13:39,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {80823#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {80823#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:13:39,394 INFO L290 TraceCheckUtils]: 21: Hoare triple {80823#(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; {80822#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:13:39,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {80822#(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; {80821#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:13:39,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {80821#(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; {80820#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:13:39,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {80820#(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; {80819#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:13:39,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {80819#(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; {80818#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:13:39,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {80818#(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; {80824#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:13:39,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {80824#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {80824#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:13:39,399 INFO L290 TraceCheckUtils]: 28: Hoare triple {80824#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {80824#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:13:39,399 INFO L290 TraceCheckUtils]: 29: Hoare triple {80824#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {80806#false} is VALID [2022-04-28 10:13:39,400 INFO L290 TraceCheckUtils]: 30: Hoare triple {80806#false} assume !(~y~0 % 4294967296 > 0); {80806#false} is VALID [2022-04-28 10:13:39,400 INFO L272 TraceCheckUtils]: 31: Hoare triple {80806#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {80806#false} is VALID [2022-04-28 10:13:39,400 INFO L290 TraceCheckUtils]: 32: Hoare triple {80806#false} ~cond := #in~cond; {80806#false} is VALID [2022-04-28 10:13:39,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {80806#false} assume 0 == ~cond; {80806#false} is VALID [2022-04-28 10:13:39,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {80806#false} assume !false; {80806#false} is VALID [2022-04-28 10:13:39,400 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:13:39,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:39,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128471025] [2022-04-28 10:13:39,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128471025] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:39,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809572718] [2022-04-28 10:13:39,401 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:13:39,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:39,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:39,404 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-28 10:13:39,426 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-28 10:13:39,480 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:13:39,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:39,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:13:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:39,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:39,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {80805#true} call ULTIMATE.init(); {80805#true} is VALID [2022-04-28 10:13:39,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {80805#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {80805#true} is VALID [2022-04-28 10:13:39,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {80805#true} assume true; {80805#true} is VALID [2022-04-28 10:13:39,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80805#true} {80805#true} #94#return; {80805#true} is VALID [2022-04-28 10:13:39,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {80805#true} call #t~ret17 := main(); {80805#true} is VALID [2022-04-28 10:13:39,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {80805#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80805#true} is VALID [2022-04-28 10:13:39,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {80805#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80847#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:13:39,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {80847#(< 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; {80851#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:13:39,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {80851#(< 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; {80855#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:13:39,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {80855#(< 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; {80859#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:13:39,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {80859#(< 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; {80863#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:13:39,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {80863#(< 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; {80867#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:13:39,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {80867#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {80867#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:13:39,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {80867#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {80867#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:13:39,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {80867#(< 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; {80863#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:13:39,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {80863#(< 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; {80859#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:13:39,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {80859#(< 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; {80855#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:13:39,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {80855#(< 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; {80851#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:13:39,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {80851#(< 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; {80847#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:13:39,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {80847#(< 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; {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:39,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {80892#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:39,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {80892#(< 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; {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:39,800 INFO L290 TraceCheckUtils]: 22: Hoare triple {80892#(< 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; {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:39,801 INFO L290 TraceCheckUtils]: 23: Hoare triple {80892#(< 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; {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:39,801 INFO L290 TraceCheckUtils]: 24: Hoare triple {80892#(< 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; {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:39,801 INFO L290 TraceCheckUtils]: 25: Hoare triple {80892#(< 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; {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:39,802 INFO L290 TraceCheckUtils]: 26: Hoare triple {80892#(< 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; {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:39,802 INFO L290 TraceCheckUtils]: 27: Hoare triple {80892#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:39,802 INFO L290 TraceCheckUtils]: 28: Hoare triple {80892#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {80806#false} is VALID [2022-04-28 10:13:39,802 INFO L290 TraceCheckUtils]: 29: Hoare triple {80806#false} assume !(~z~0 % 4294967296 > 0); {80806#false} is VALID [2022-04-28 10:13:39,802 INFO L290 TraceCheckUtils]: 30: Hoare triple {80806#false} assume !(~y~0 % 4294967296 > 0); {80806#false} is VALID [2022-04-28 10:13:39,802 INFO L272 TraceCheckUtils]: 31: Hoare triple {80806#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {80806#false} is VALID [2022-04-28 10:13:39,802 INFO L290 TraceCheckUtils]: 32: Hoare triple {80806#false} ~cond := #in~cond; {80806#false} is VALID [2022-04-28 10:13:39,803 INFO L290 TraceCheckUtils]: 33: Hoare triple {80806#false} assume 0 == ~cond; {80806#false} is VALID [2022-04-28 10:13:39,803 INFO L290 TraceCheckUtils]: 34: Hoare triple {80806#false} assume !false; {80806#false} is VALID [2022-04-28 10:13:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:13:39,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:39,967 INFO L290 TraceCheckUtils]: 34: Hoare triple {80806#false} assume !false; {80806#false} is VALID [2022-04-28 10:13:39,967 INFO L290 TraceCheckUtils]: 33: Hoare triple {80806#false} assume 0 == ~cond; {80806#false} is VALID [2022-04-28 10:13:39,967 INFO L290 TraceCheckUtils]: 32: Hoare triple {80806#false} ~cond := #in~cond; {80806#false} is VALID [2022-04-28 10:13:39,967 INFO L272 TraceCheckUtils]: 31: Hoare triple {80806#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {80806#false} is VALID [2022-04-28 10:13:39,967 INFO L290 TraceCheckUtils]: 30: Hoare triple {80806#false} assume !(~y~0 % 4294967296 > 0); {80806#false} is VALID [2022-04-28 10:13:39,967 INFO L290 TraceCheckUtils]: 29: Hoare triple {80806#false} assume !(~z~0 % 4294967296 > 0); {80806#false} is VALID [2022-04-28 10:13:39,968 INFO L290 TraceCheckUtils]: 28: Hoare triple {80892#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {80806#false} is VALID [2022-04-28 10:13:39,968 INFO L290 TraceCheckUtils]: 27: Hoare triple {80892#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:39,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {80892#(< 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; {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:39,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {80892#(< 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; {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:39,969 INFO L290 TraceCheckUtils]: 24: Hoare triple {80892#(< 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; {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:39,969 INFO L290 TraceCheckUtils]: 23: Hoare triple {80892#(< 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; {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:39,969 INFO L290 TraceCheckUtils]: 22: Hoare triple {80892#(< 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; {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:39,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {80892#(< 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; {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:39,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {80892#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:39,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {80847#(< 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; {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:39,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {80851#(< 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; {80847#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:13:39,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {80855#(< 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; {80851#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:13:39,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {80859#(< 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; {80855#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:13:39,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {80863#(< 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; {80859#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:13:39,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {80867#(< 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; {80863#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:13:39,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {80867#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {80867#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:13:39,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {80867#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {80867#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:13:39,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {80863#(< 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; {80867#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:13:39,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {80859#(< 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; {80863#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:13:39,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {80855#(< 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; {80859#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:13:39,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {80851#(< 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; {80855#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:13:39,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {80847#(< 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; {80851#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:13:39,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {80805#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80847#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:13:39,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {80805#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80805#true} is VALID [2022-04-28 10:13:39,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {80805#true} call #t~ret17 := main(); {80805#true} is VALID [2022-04-28 10:13:39,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80805#true} {80805#true} #94#return; {80805#true} is VALID [2022-04-28 10:13:39,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {80805#true} assume true; {80805#true} is VALID [2022-04-28 10:13:39,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {80805#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {80805#true} is VALID [2022-04-28 10:13:39,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {80805#true} call ULTIMATE.init(); {80805#true} is VALID [2022-04-28 10:13:39,980 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:13:39,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809572718] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:39,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:39,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 25 [2022-04-28 10:13:39,980 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:39,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [291339355] [2022-04-28 10:13:39,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [291339355] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:39,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:39,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:13:39,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237950047] [2022-04-28 10:13:39,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:39,981 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-28 10:13:39,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:39,981 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-28 10:13:40,012 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-28 10:13:40,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:13:40,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:40,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:13:40,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2022-04-28 10:13:40,015 INFO L87 Difference]: Start difference. First operand 506 states and 679 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-28 10:13:52,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:52,746 INFO L93 Difference]: Finished difference Result 874 states and 1246 transitions. [2022-04-28 10:13:52,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-04-28 10:13:52,747 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-28 10:13:52,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:52,747 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-28 10:13:52,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 324 transitions. [2022-04-28 10:13:52,750 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-28 10:13:52,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 324 transitions. [2022-04-28 10:13:52,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 324 transitions. [2022-04-28 10:13:53,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 324 edges. 324 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:53,086 INFO L225 Difference]: With dead ends: 874 [2022-04-28 10:13:53,087 INFO L226 Difference]: Without dead ends: 804 [2022-04-28 10:13:53,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1969 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=467, Invalid=7365, Unknown=0, NotChecked=0, Total=7832 [2022-04-28 10:13:53,088 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 146 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2773 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 3104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 2773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:53,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 119 Invalid, 3104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 2773 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 10:13:53,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2022-04-28 10:13:56,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 551. [2022-04-28 10:13:56,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:56,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 804 states. Second operand has 551 states, 546 states have (on average 1.3516483516483517) internal successors, (738), 546 states have internal predecessors, (738), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:56,359 INFO L74 IsIncluded]: Start isIncluded. First operand 804 states. Second operand has 551 states, 546 states have (on average 1.3516483516483517) internal successors, (738), 546 states have internal predecessors, (738), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:56,359 INFO L87 Difference]: Start difference. First operand 804 states. Second operand has 551 states, 546 states have (on average 1.3516483516483517) internal successors, (738), 546 states have internal predecessors, (738), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:56,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:56,383 INFO L93 Difference]: Finished difference Result 804 states and 1003 transitions. [2022-04-28 10:13:56,383 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1003 transitions. [2022-04-28 10:13:56,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:56,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:56,384 INFO L74 IsIncluded]: Start isIncluded. First operand has 551 states, 546 states have (on average 1.3516483516483517) internal successors, (738), 546 states have internal predecessors, (738), 3 states have call successors, (3), 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 804 states. [2022-04-28 10:13:56,385 INFO L87 Difference]: Start difference. First operand has 551 states, 546 states have (on average 1.3516483516483517) internal successors, (738), 546 states have internal predecessors, (738), 3 states have call successors, (3), 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 804 states. [2022-04-28 10:13:56,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:56,402 INFO L93 Difference]: Finished difference Result 804 states and 1003 transitions. [2022-04-28 10:13:56,402 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1003 transitions. [2022-04-28 10:13:56,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:56,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:56,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:56,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:56,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 546 states have (on average 1.3516483516483517) internal successors, (738), 546 states have internal predecessors, (738), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:56,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 742 transitions. [2022-04-28 10:13:56,414 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 742 transitions. Word has length 35 [2022-04-28 10:13:56,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:56,414 INFO L495 AbstractCegarLoop]: Abstraction has 551 states and 742 transitions. [2022-04-28 10:13:56,414 INFO L496 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-28 10:13:56,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 551 states and 742 transitions. [2022-04-28 10:13:58,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 742 edges. 742 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:58,798 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 742 transitions. [2022-04-28 10:13:58,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:13:58,799 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:58,799 INFO L195 NwaCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:58,818 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-28 10:13:58,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-04-28 10:13:59,000 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:59,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:59,000 INFO L85 PathProgramCache]: Analyzing trace with hash 996979513, now seen corresponding path program 35 times [2022-04-28 10:13:59,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:59,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1755152568] [2022-04-28 10:13:59,002 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:59,002 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:59,002 INFO L85 PathProgramCache]: Analyzing trace with hash 996979513, now seen corresponding path program 36 times [2022-04-28 10:13:59,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:59,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107991964] [2022-04-28 10:13:59,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:59,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:59,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:59,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {85653#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {85628#true} is VALID [2022-04-28 10:13:59,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {85628#true} assume true; {85628#true} is VALID [2022-04-28 10:13:59,430 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {85628#true} {85628#true} #94#return; {85628#true} is VALID [2022-04-28 10:13:59,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {85628#true} call ULTIMATE.init(); {85653#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:59,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {85653#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {85628#true} is VALID [2022-04-28 10:13:59,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {85628#true} assume true; {85628#true} is VALID [2022-04-28 10:13:59,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85628#true} {85628#true} #94#return; {85628#true} is VALID [2022-04-28 10:13:59,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {85628#true} call #t~ret17 := main(); {85628#true} is VALID [2022-04-28 10:13:59,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {85628#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {85633#(= main_~y~0 0)} is VALID [2022-04-28 10:13:59,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {85633#(= 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; {85634#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:59,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {85634#(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; {85635#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:59,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {85635#(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; {85636#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:59,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {85636#(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; {85637#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:59,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {85637#(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; {85638#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:59,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {85638#(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; {85639#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:59,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {85639#(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; {85640#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:59,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {85640#(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; {85641#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:59,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {85641#(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; {85642#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:59,438 INFO L290 TraceCheckUtils]: 15: Hoare triple {85642#(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; {85643#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:59,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {85643#(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; {85644#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:59,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {85644#(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; {85645#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:59,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {85645#(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; {85646#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:59,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {85646#(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; {85647#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:13:59,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {85647#(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; {85648#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:13:59,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {85648#(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; {85649#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:13:59,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {85649#(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; {85650#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:13:59,444 INFO L290 TraceCheckUtils]: 23: Hoare triple {85650#(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; {85651#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:13:59,444 INFO L290 TraceCheckUtils]: 24: Hoare triple {85651#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {85651#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:13:59,445 INFO L290 TraceCheckUtils]: 25: Hoare triple {85651#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {85652#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} is VALID [2022-04-28 10:13:59,445 INFO L290 TraceCheckUtils]: 26: Hoare triple {85652#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-28 10:13:59,446 INFO L290 TraceCheckUtils]: 27: Hoare triple {85629#false} assume !(~y~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-28 10:13:59,446 INFO L290 TraceCheckUtils]: 28: Hoare triple {85629#false} assume !(~x~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-28 10:13:59,446 INFO L290 TraceCheckUtils]: 29: Hoare triple {85629#false} assume !(~z~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-28 10:13:59,446 INFO L290 TraceCheckUtils]: 30: Hoare triple {85629#false} assume !(~y~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-28 10:13:59,446 INFO L272 TraceCheckUtils]: 31: Hoare triple {85629#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {85629#false} is VALID [2022-04-28 10:13:59,446 INFO L290 TraceCheckUtils]: 32: Hoare triple {85629#false} ~cond := #in~cond; {85629#false} is VALID [2022-04-28 10:13:59,446 INFO L290 TraceCheckUtils]: 33: Hoare triple {85629#false} assume 0 == ~cond; {85629#false} is VALID [2022-04-28 10:13:59,446 INFO L290 TraceCheckUtils]: 34: Hoare triple {85629#false} assume !false; {85629#false} is VALID [2022-04-28 10:13:59,446 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:13:59,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:59,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107991964] [2022-04-28 10:13:59,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107991964] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:59,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215769195] [2022-04-28 10:13:59,447 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:13:59,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:59,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:59,448 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-28 10:13:59,450 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-28 10:13:59,827 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 10:13:59,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:59,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 10:13:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:59,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:00,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {85628#true} call ULTIMATE.init(); {85628#true} is VALID [2022-04-28 10:14:00,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {85628#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {85628#true} is VALID [2022-04-28 10:14:00,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {85628#true} assume true; {85628#true} is VALID [2022-04-28 10:14:00,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85628#true} {85628#true} #94#return; {85628#true} is VALID [2022-04-28 10:14:00,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {85628#true} call #t~ret17 := main(); {85628#true} is VALID [2022-04-28 10:14:00,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {85628#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {85633#(= main_~y~0 0)} is VALID [2022-04-28 10:14:00,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {85633#(= 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; {85634#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:00,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {85634#(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; {85635#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:00,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {85635#(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; {85636#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:00,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {85636#(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; {85637#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:00,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {85637#(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; {85638#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:00,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {85638#(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; {85639#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:00,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {85639#(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; {85640#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:00,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {85640#(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; {85641#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:00,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {85641#(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; {85642#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:00,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {85642#(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; {85643#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:00,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {85643#(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; {85644#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:00,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {85644#(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; {85645#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:14:00,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {85645#(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; {85646#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:00,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {85646#(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; {85647#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:14:00,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {85647#(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; {85648#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:14:00,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {85648#(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; {85649#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:14:00,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {85649#(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; {85650#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:14:00,204 INFO L290 TraceCheckUtils]: 23: Hoare triple {85650#(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; {85651#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:14:00,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {85651#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {85651#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:14:00,205 INFO L290 TraceCheckUtils]: 25: Hoare triple {85651#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {85732#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-28 10:14:00,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {85732#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !(~z~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-28 10:14:00,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {85629#false} assume !(~y~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-28 10:14:00,205 INFO L290 TraceCheckUtils]: 28: Hoare triple {85629#false} assume !(~x~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-28 10:14:00,205 INFO L290 TraceCheckUtils]: 29: Hoare triple {85629#false} assume !(~z~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-28 10:14:00,206 INFO L290 TraceCheckUtils]: 30: Hoare triple {85629#false} assume !(~y~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-28 10:14:00,206 INFO L272 TraceCheckUtils]: 31: Hoare triple {85629#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {85629#false} is VALID [2022-04-28 10:14:00,206 INFO L290 TraceCheckUtils]: 32: Hoare triple {85629#false} ~cond := #in~cond; {85629#false} is VALID [2022-04-28 10:14:00,206 INFO L290 TraceCheckUtils]: 33: Hoare triple {85629#false} assume 0 == ~cond; {85629#false} is VALID [2022-04-28 10:14:00,206 INFO L290 TraceCheckUtils]: 34: Hoare triple {85629#false} assume !false; {85629#false} is VALID [2022-04-28 10:14:00,206 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:00,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:00,916 INFO L290 TraceCheckUtils]: 34: Hoare triple {85629#false} assume !false; {85629#false} is VALID [2022-04-28 10:14:00,917 INFO L290 TraceCheckUtils]: 33: Hoare triple {85629#false} assume 0 == ~cond; {85629#false} is VALID [2022-04-28 10:14:00,917 INFO L290 TraceCheckUtils]: 32: Hoare triple {85629#false} ~cond := #in~cond; {85629#false} is VALID [2022-04-28 10:14:00,917 INFO L272 TraceCheckUtils]: 31: Hoare triple {85629#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {85629#false} is VALID [2022-04-28 10:14:00,917 INFO L290 TraceCheckUtils]: 30: Hoare triple {85629#false} assume !(~y~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-28 10:14:00,917 INFO L290 TraceCheckUtils]: 29: Hoare triple {85629#false} assume !(~z~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-28 10:14:00,917 INFO L290 TraceCheckUtils]: 28: Hoare triple {85629#false} assume !(~x~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-28 10:14:00,917 INFO L290 TraceCheckUtils]: 27: Hoare triple {85629#false} assume !(~y~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-28 10:14:00,917 INFO L290 TraceCheckUtils]: 26: Hoare triple {85784#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-28 10:14:00,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {85788#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {85784#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:00,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {85788#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {85788#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:14:00,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {85795#(< 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; {85788#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:14:00,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {85799#(< 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; {85795#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:14:00,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {85803#(< 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; {85799#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:14:00,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {85807#(< 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; {85803#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:14:00,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {85811#(< 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; {85807#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:14:00,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {85815#(< 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; {85811#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:00,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {85819#(< 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; {85815#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:14:00,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {85823#(< 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; {85819#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:00,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {85827#(< 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; {85823#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:14:00,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {85831#(< 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; {85827#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:14:00,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {85835#(< 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; {85831#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:14:00,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {85839#(< 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; {85835#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:14:00,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {85843#(< 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; {85839#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:14:00,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {85847#(< 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; {85843#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:14:00,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {85851#(< 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; {85847#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:14:00,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {85855#(< 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; {85851#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:14:00,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {85859#(< 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; {85855#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:14:00,930 INFO L290 TraceCheckUtils]: 6: Hoare triple {85863#(< 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; {85859#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:14:00,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {85628#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {85863#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:14:00,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {85628#true} call #t~ret17 := main(); {85628#true} is VALID [2022-04-28 10:14:00,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85628#true} {85628#true} #94#return; {85628#true} is VALID [2022-04-28 10:14:00,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {85628#true} assume true; {85628#true} is VALID [2022-04-28 10:14:00,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {85628#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {85628#true} is VALID [2022-04-28 10:14:00,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {85628#true} call ULTIMATE.init(); {85628#true} is VALID [2022-04-28 10:14:00,931 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:00,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215769195] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:00,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:00,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 10:14:00,932 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:00,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1755152568] [2022-04-28 10:14:00,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1755152568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:00,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:00,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:14:00,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709853276] [2022-04-28 10:14:00,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:00,933 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 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-28 10:14:00,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:00,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 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-28 10:14:00,958 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-28 10:14:00,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:14:00,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:00,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:14:00,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=1444, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:14:00,959 INFO L87 Difference]: Start difference. First operand 551 states and 742 transitions. Second operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 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-28 10:14:11,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:11,336 INFO L93 Difference]: Finished difference Result 764 states and 1129 transitions. [2022-04-28 10:14:11,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:14:11,337 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 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-28 10:14:11,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:11,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 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-28 10:14:11,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 273 transitions. [2022-04-28 10:14:11,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 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-28 10:14:11,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 273 transitions. [2022-04-28 10:14:11,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 273 transitions. [2022-04-28 10:14:11,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:11,599 INFO L225 Difference]: With dead ends: 764 [2022-04-28 10:14:11,599 INFO L226 Difference]: Without dead ends: 743 [2022-04-28 10:14:11,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=910, Invalid=3122, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 10:14:11,601 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 234 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 3939 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 4092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 3939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:11,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 216 Invalid, 4092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 3939 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-28 10:14:11,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2022-04-28 10:14:15,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 578. [2022-04-28 10:14:15,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:15,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 743 states. Second operand has 578 states, 573 states have (on average 1.356020942408377) internal successors, (777), 573 states have internal predecessors, (777), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:15,036 INFO L74 IsIncluded]: Start isIncluded. First operand 743 states. Second operand has 578 states, 573 states have (on average 1.356020942408377) internal successors, (777), 573 states have internal predecessors, (777), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:15,036 INFO L87 Difference]: Start difference. First operand 743 states. Second operand has 578 states, 573 states have (on average 1.356020942408377) internal successors, (777), 573 states have internal predecessors, (777), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:15,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:15,051 INFO L93 Difference]: Finished difference Result 743 states and 982 transitions. [2022-04-28 10:14:15,051 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 982 transitions. [2022-04-28 10:14:15,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:15,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:15,052 INFO L74 IsIncluded]: Start isIncluded. First operand has 578 states, 573 states have (on average 1.356020942408377) internal successors, (777), 573 states have internal predecessors, (777), 3 states have call successors, (3), 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 743 states. [2022-04-28 10:14:15,052 INFO L87 Difference]: Start difference. First operand has 578 states, 573 states have (on average 1.356020942408377) internal successors, (777), 573 states have internal predecessors, (777), 3 states have call successors, (3), 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 743 states. [2022-04-28 10:14:15,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:15,066 INFO L93 Difference]: Finished difference Result 743 states and 982 transitions. [2022-04-28 10:14:15,066 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 982 transitions. [2022-04-28 10:14:15,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:15,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:15,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:15,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:15,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 573 states have (on average 1.356020942408377) internal successors, (777), 573 states have internal predecessors, (777), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:15,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 781 transitions. [2022-04-28 10:14:15,079 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 781 transitions. Word has length 35 [2022-04-28 10:14:15,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:15,079 INFO L495 AbstractCegarLoop]: Abstraction has 578 states and 781 transitions. [2022-04-28 10:14:15,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 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-28 10:14:15,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 578 states and 781 transitions. [2022-04-28 10:14:17,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 781 edges. 781 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:17,589 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 781 transitions. [2022-04-28 10:14:17,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:14:17,589 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:17,589 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:17,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-04-28 10:14:17,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:17,791 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:17,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:17,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1961738437, now seen corresponding path program 19 times [2022-04-28 10:14:17,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:17,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1573352565] [2022-04-28 10:14:17,795 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:17,795 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:17,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1961738437, now seen corresponding path program 20 times [2022-04-28 10:14:17,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:17,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522268245] [2022-04-28 10:14:17,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:17,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:18,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:18,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {90113#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {90094#true} is VALID [2022-04-28 10:14:18,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {90094#true} assume true; {90094#true} is VALID [2022-04-28 10:14:18,031 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90094#true} {90094#true} #94#return; {90094#true} is VALID [2022-04-28 10:14:18,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {90094#true} call ULTIMATE.init(); {90113#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:18,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {90113#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {90094#true} is VALID [2022-04-28 10:14:18,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {90094#true} assume true; {90094#true} is VALID [2022-04-28 10:14:18,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90094#true} {90094#true} #94#return; {90094#true} is VALID [2022-04-28 10:14:18,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {90094#true} call #t~ret17 := main(); {90094#true} is VALID [2022-04-28 10:14:18,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {90094#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {90099#(= main_~y~0 0)} is VALID [2022-04-28 10:14:18,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {90099#(= 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; {90100#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:18,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {90100#(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; {90101#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:18,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {90101#(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; {90102#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:18,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {90102#(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; {90103#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:18,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {90103#(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; {90104#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:18,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {90104#(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; {90105#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:18,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {90105#(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; {90106#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:18,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {90106#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {90106#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:18,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {90106#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {90107#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:14:18,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {90107#(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; {90108#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:14:18,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {90108#(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; {90109#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:14:18,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {90109#(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; {90110#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:14:18,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {90110#(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; {90111#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:14:18,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {90111#(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; {90112#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:14:18,041 INFO L290 TraceCheckUtils]: 20: Hoare triple {90112#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {90095#false} is VALID [2022-04-28 10:14:18,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {90095#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {90095#false} is VALID [2022-04-28 10:14:18,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {90095#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {90095#false} is VALID [2022-04-28 10:14:18,041 INFO L290 TraceCheckUtils]: 23: Hoare triple {90095#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {90095#false} is VALID [2022-04-28 10:14:18,041 INFO L290 TraceCheckUtils]: 24: Hoare triple {90095#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {90095#false} is VALID [2022-04-28 10:14:18,041 INFO L290 TraceCheckUtils]: 25: Hoare triple {90095#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {90095#false} is VALID [2022-04-28 10:14:18,041 INFO L290 TraceCheckUtils]: 26: Hoare triple {90095#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {90095#false} is VALID [2022-04-28 10:14:18,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {90095#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {90095#false} is VALID [2022-04-28 10:14:18,041 INFO L290 TraceCheckUtils]: 28: Hoare triple {90095#false} assume !(~y~0 % 4294967296 > 0); {90095#false} is VALID [2022-04-28 10:14:18,041 INFO L290 TraceCheckUtils]: 29: Hoare triple {90095#false} assume !(~x~0 % 4294967296 > 0); {90095#false} is VALID [2022-04-28 10:14:18,041 INFO L290 TraceCheckUtils]: 30: Hoare triple {90095#false} assume !(~z~0 % 4294967296 > 0); {90095#false} is VALID [2022-04-28 10:14:18,042 INFO L290 TraceCheckUtils]: 31: Hoare triple {90095#false} assume !(~y~0 % 4294967296 > 0); {90095#false} is VALID [2022-04-28 10:14:18,042 INFO L272 TraceCheckUtils]: 32: Hoare triple {90095#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {90095#false} is VALID [2022-04-28 10:14:18,042 INFO L290 TraceCheckUtils]: 33: Hoare triple {90095#false} ~cond := #in~cond; {90095#false} is VALID [2022-04-28 10:14:18,042 INFO L290 TraceCheckUtils]: 34: Hoare triple {90095#false} assume 0 == ~cond; {90095#false} is VALID [2022-04-28 10:14:18,042 INFO L290 TraceCheckUtils]: 35: Hoare triple {90095#false} assume !false; {90095#false} is VALID [2022-04-28 10:14:18,042 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:14:18,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:18,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522268245] [2022-04-28 10:14:18,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522268245] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:18,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815859284] [2022-04-28 10:14:18,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:14:18,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:18,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:18,043 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-28 10:14:18,044 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-28 10:14:18,093 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:14:18,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:18,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 10:14:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:18,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:18,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {90094#true} call ULTIMATE.init(); {90094#true} is VALID [2022-04-28 10:14:18,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {90094#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {90094#true} is VALID [2022-04-28 10:14:18,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {90094#true} assume true; {90094#true} is VALID [2022-04-28 10:14:18,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90094#true} {90094#true} #94#return; {90094#true} is VALID [2022-04-28 10:14:18,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {90094#true} call #t~ret17 := main(); {90094#true} is VALID [2022-04-28 10:14:18,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {90094#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {90094#true} is VALID [2022-04-28 10:14:18,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {90094#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90094#true} is VALID [2022-04-28 10:14:18,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {90094#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90094#true} is VALID [2022-04-28 10:14:18,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {90094#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90141#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:14:18,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {90141#(< 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; {90145#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:14:18,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {90145#(< 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; {90149#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:14:18,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {90149#(< 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; {90153#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:14:18,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {90153#(< 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; {90157#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:18,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {90157#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {90157#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:18,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {90157#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {90157#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:18,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {90157#(< 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; {90153#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:14:18,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {90153#(< 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; {90149#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:14:18,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {90149#(< 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; {90145#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:14:18,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {90145#(< 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; {90141#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:14:18,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {90141#(< 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; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:18,331 INFO L290 TraceCheckUtils]: 20: Hoare triple {90179#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:18,331 INFO L290 TraceCheckUtils]: 21: Hoare triple {90179#(< 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; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:18,332 INFO L290 TraceCheckUtils]: 22: Hoare triple {90179#(< 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; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:18,332 INFO L290 TraceCheckUtils]: 23: Hoare triple {90179#(< 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; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:18,332 INFO L290 TraceCheckUtils]: 24: Hoare triple {90179#(< 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; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:18,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {90179#(< 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; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:18,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {90179#(< 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; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:18,333 INFO L290 TraceCheckUtils]: 27: Hoare triple {90179#(< 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; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:18,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {90179#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:18,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {90179#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {90095#false} is VALID [2022-04-28 10:14:18,334 INFO L290 TraceCheckUtils]: 30: Hoare triple {90095#false} assume !(~z~0 % 4294967296 > 0); {90095#false} is VALID [2022-04-28 10:14:18,334 INFO L290 TraceCheckUtils]: 31: Hoare triple {90095#false} assume !(~y~0 % 4294967296 > 0); {90095#false} is VALID [2022-04-28 10:14:18,334 INFO L272 TraceCheckUtils]: 32: Hoare triple {90095#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {90095#false} is VALID [2022-04-28 10:14:18,334 INFO L290 TraceCheckUtils]: 33: Hoare triple {90095#false} ~cond := #in~cond; {90095#false} is VALID [2022-04-28 10:14:18,334 INFO L290 TraceCheckUtils]: 34: Hoare triple {90095#false} assume 0 == ~cond; {90095#false} is VALID [2022-04-28 10:14:18,334 INFO L290 TraceCheckUtils]: 35: Hoare triple {90095#false} assume !false; {90095#false} is VALID [2022-04-28 10:14:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-28 10:14:18,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:18,449 INFO L290 TraceCheckUtils]: 35: Hoare triple {90095#false} assume !false; {90095#false} is VALID [2022-04-28 10:14:18,449 INFO L290 TraceCheckUtils]: 34: Hoare triple {90095#false} assume 0 == ~cond; {90095#false} is VALID [2022-04-28 10:14:18,449 INFO L290 TraceCheckUtils]: 33: Hoare triple {90095#false} ~cond := #in~cond; {90095#false} is VALID [2022-04-28 10:14:18,449 INFO L272 TraceCheckUtils]: 32: Hoare triple {90095#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {90095#false} is VALID [2022-04-28 10:14:18,449 INFO L290 TraceCheckUtils]: 31: Hoare triple {90095#false} assume !(~y~0 % 4294967296 > 0); {90095#false} is VALID [2022-04-28 10:14:18,449 INFO L290 TraceCheckUtils]: 30: Hoare triple {90095#false} assume !(~z~0 % 4294967296 > 0); {90095#false} is VALID [2022-04-28 10:14:18,449 INFO L290 TraceCheckUtils]: 29: Hoare triple {90179#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {90095#false} is VALID [2022-04-28 10:14:18,450 INFO L290 TraceCheckUtils]: 28: Hoare triple {90179#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:18,450 INFO L290 TraceCheckUtils]: 27: Hoare triple {90179#(< 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; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:18,459 INFO L290 TraceCheckUtils]: 26: Hoare triple {90179#(< 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; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:18,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {90179#(< 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; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:18,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {90179#(< 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; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:18,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {90179#(< 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; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:18,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {90179#(< 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; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:18,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {90179#(< 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; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:18,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {90179#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:18,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {90141#(< 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; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:18,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {90145#(< 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; {90141#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:14:18,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {90149#(< 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; {90145#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:14:18,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {90153#(< 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; {90149#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:14:18,466 INFO L290 TraceCheckUtils]: 15: Hoare triple {90157#(< 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; {90153#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:14:18,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {90157#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {90157#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:18,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {90157#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {90157#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:18,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {90153#(< 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; {90157#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:18,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {90149#(< 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; {90153#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:14:18,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {90145#(< 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; {90149#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:14:18,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {90141#(< 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; {90145#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:14:18,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {90094#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90141#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:14:18,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {90094#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90094#true} is VALID [2022-04-28 10:14:18,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {90094#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90094#true} is VALID [2022-04-28 10:14:18,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {90094#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {90094#true} is VALID [2022-04-28 10:14:18,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {90094#true} call #t~ret17 := main(); {90094#true} is VALID [2022-04-28 10:14:18,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90094#true} {90094#true} #94#return; {90094#true} is VALID [2022-04-28 10:14:18,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {90094#true} assume true; {90094#true} is VALID [2022-04-28 10:14:18,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {90094#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {90094#true} is VALID [2022-04-28 10:14:18,472 INFO L272 TraceCheckUtils]: 0: Hoare triple {90094#true} call ULTIMATE.init(); {90094#true} is VALID [2022-04-28 10:14:18,472 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-28 10:14:18,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815859284] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:18,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:18,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8, 8] total 23 [2022-04-28 10:14:18,473 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:18,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1573352565] [2022-04-28 10:14:18,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1573352565] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:18,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:18,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:14:18,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757647550] [2022-04-28 10:14:18,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:18,474 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 36 [2022-04-28 10:14:18,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:18,474 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-28 10:14:18,500 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-28 10:14:18,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:14:18,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:18,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:14:18,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2022-04-28 10:14:18,501 INFO L87 Difference]: Start difference. First operand 578 states and 781 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-28 10:14:24,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:24,768 INFO L93 Difference]: Finished difference Result 719 states and 979 transitions. [2022-04-28 10:14:24,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 10:14:24,768 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 36 [2022-04-28 10:14:24,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:24,769 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-28 10:14:24,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 136 transitions. [2022-04-28 10:14:24,769 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-28 10:14:24,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 136 transitions. [2022-04-28 10:14:24,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 136 transitions. [2022-04-28 10:14:24,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:24,891 INFO L225 Difference]: With dead ends: 719 [2022-04-28 10:14:24,891 INFO L226 Difference]: Without dead ends: 612 [2022-04-28 10:14:24,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=230, Invalid=2320, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 10:14:24,892 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 92 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:24,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 118 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:14:24,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2022-04-28 10:14:28,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 579. [2022-04-28 10:14:28,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:28,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 612 states. Second operand has 579 states, 574 states have (on average 1.3501742160278745) internal successors, (775), 574 states have internal predecessors, (775), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:28,322 INFO L74 IsIncluded]: Start isIncluded. First operand 612 states. Second operand has 579 states, 574 states have (on average 1.3501742160278745) internal successors, (775), 574 states have internal predecessors, (775), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:28,323 INFO L87 Difference]: Start difference. First operand 612 states. Second operand has 579 states, 574 states have (on average 1.3501742160278745) internal successors, (775), 574 states have internal predecessors, (775), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:28,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:28,333 INFO L93 Difference]: Finished difference Result 612 states and 828 transitions. [2022-04-28 10:14:28,333 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 828 transitions. [2022-04-28 10:14:28,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:28,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:28,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 579 states, 574 states have (on average 1.3501742160278745) internal successors, (775), 574 states have internal predecessors, (775), 3 states have call successors, (3), 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 612 states. [2022-04-28 10:14:28,334 INFO L87 Difference]: Start difference. First operand has 579 states, 574 states have (on average 1.3501742160278745) internal successors, (775), 574 states have internal predecessors, (775), 3 states have call successors, (3), 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 612 states. [2022-04-28 10:14:28,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:28,344 INFO L93 Difference]: Finished difference Result 612 states and 828 transitions. [2022-04-28 10:14:28,344 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 828 transitions. [2022-04-28 10:14:28,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:28,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:28,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:28,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:28,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 574 states have (on average 1.3501742160278745) internal successors, (775), 574 states have internal predecessors, (775), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:28,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 779 transitions. [2022-04-28 10:14:28,362 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 779 transitions. Word has length 36 [2022-04-28 10:14:28,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:28,362 INFO L495 AbstractCegarLoop]: Abstraction has 579 states and 779 transitions. [2022-04-28 10:14:28,362 INFO L496 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-28 10:14:28,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 579 states and 779 transitions. [2022-04-28 10:14:31,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 779 edges. 779 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:31,481 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 779 transitions. [2022-04-28 10:14:31,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:14:31,481 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:31,481 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:31,498 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-28 10:14:31,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:31,682 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:31,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:31,682 INFO L85 PathProgramCache]: Analyzing trace with hash 2089881717, now seen corresponding path program 11 times [2022-04-28 10:14:31,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:31,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [249641031] [2022-04-28 10:14:31,685 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:31,685 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:31,685 INFO L85 PathProgramCache]: Analyzing trace with hash 2089881717, now seen corresponding path program 12 times [2022-04-28 10:14:31,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:31,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094748457] [2022-04-28 10:14:31,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:31,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:31,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:31,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {94227#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {94211#true} is VALID [2022-04-28 10:14:31,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {94211#true} assume true; {94211#true} is VALID [2022-04-28 10:14:31,901 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {94211#true} {94211#true} #94#return; {94211#true} is VALID [2022-04-28 10:14:31,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {94211#true} call ULTIMATE.init(); {94227#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:31,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {94227#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {94211#true} is VALID [2022-04-28 10:14:31,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {94211#true} assume true; {94211#true} is VALID [2022-04-28 10:14:31,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94211#true} {94211#true} #94#return; {94211#true} is VALID [2022-04-28 10:14:31,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {94211#true} call #t~ret17 := main(); {94211#true} is VALID [2022-04-28 10:14:31,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {94211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {94216#(= main_~y~0 0)} is VALID [2022-04-28 10:14:31,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {94216#(= 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; {94217#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:31,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {94217#(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; {94218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:31,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {94218#(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; {94219#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:31,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {94219#(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; {94220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:31,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {94220#(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; {94221#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:31,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {94221#(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; {94222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:31,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {94222#(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; {94223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:31,907 INFO L290 TraceCheckUtils]: 13: Hoare triple {94223#(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; {94224#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:31,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {94224#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {94224#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:31,908 INFO L290 TraceCheckUtils]: 15: Hoare triple {94224#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {94225#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:14:31,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {94225#(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; {94226#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:14:31,910 INFO L290 TraceCheckUtils]: 17: Hoare triple {94226#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-28 10:14:31,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-28 10:14:31,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-28 10:14:31,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-28 10:14:31,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-28 10:14:31,910 INFO L290 TraceCheckUtils]: 22: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-28 10:14:31,910 INFO L290 TraceCheckUtils]: 23: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-28 10:14:31,910 INFO L290 TraceCheckUtils]: 24: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-28 10:14:31,910 INFO L290 TraceCheckUtils]: 25: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-28 10:14:31,910 INFO L290 TraceCheckUtils]: 26: Hoare triple {94212#false} assume !(~y~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-28 10:14:31,910 INFO L290 TraceCheckUtils]: 27: Hoare triple {94212#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; {94212#false} is VALID [2022-04-28 10:14:31,911 INFO L290 TraceCheckUtils]: 28: Hoare triple {94212#false} assume !(~x~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-28 10:14:31,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {94212#false} assume !(~z~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-28 10:14:31,911 INFO L290 TraceCheckUtils]: 30: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {94212#false} is VALID [2022-04-28 10:14:31,911 INFO L290 TraceCheckUtils]: 31: Hoare triple {94212#false} assume !(~y~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-28 10:14:31,911 INFO L272 TraceCheckUtils]: 32: Hoare triple {94212#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {94212#false} is VALID [2022-04-28 10:14:31,911 INFO L290 TraceCheckUtils]: 33: Hoare triple {94212#false} ~cond := #in~cond; {94212#false} is VALID [2022-04-28 10:14:31,911 INFO L290 TraceCheckUtils]: 34: Hoare triple {94212#false} assume 0 == ~cond; {94212#false} is VALID [2022-04-28 10:14:31,911 INFO L290 TraceCheckUtils]: 35: Hoare triple {94212#false} assume !false; {94212#false} is VALID [2022-04-28 10:14:31,911 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-28 10:14:31,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:31,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094748457] [2022-04-28 10:14:31,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094748457] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:31,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012253077] [2022-04-28 10:14:31,912 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:14:31,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:31,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:31,916 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-28 10:14:31,919 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-28 10:14:32,078 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:14:32,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:32,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:14:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:32,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:32,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {94211#true} call ULTIMATE.init(); {94211#true} is VALID [2022-04-28 10:14:32,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {94211#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {94211#true} is VALID [2022-04-28 10:14:32,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {94211#true} assume true; {94211#true} is VALID [2022-04-28 10:14:32,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94211#true} {94211#true} #94#return; {94211#true} is VALID [2022-04-28 10:14:32,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {94211#true} call #t~ret17 := main(); {94211#true} is VALID [2022-04-28 10:14:32,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {94211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {94216#(= main_~y~0 0)} is VALID [2022-04-28 10:14:32,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {94216#(= 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; {94217#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:32,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {94217#(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; {94218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:32,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {94218#(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; {94219#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:32,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {94219#(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; {94220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:32,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {94220#(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; {94221#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:32,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {94221#(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; {94222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:32,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {94222#(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; {94223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:32,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {94223#(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; {94224#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:32,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {94224#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {94224#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:32,383 INFO L290 TraceCheckUtils]: 15: Hoare triple {94224#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {94225#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:14:32,383 INFO L290 TraceCheckUtils]: 16: Hoare triple {94225#(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; {94279#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:14:32,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {94279#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-28 10:14:32,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-28 10:14:32,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-28 10:14:32,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-28 10:14:32,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-28 10:14:32,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-28 10:14:32,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-28 10:14:32,384 INFO L290 TraceCheckUtils]: 24: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-28 10:14:32,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-28 10:14:32,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {94212#false} assume !(~y~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-28 10:14:32,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {94212#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; {94212#false} is VALID [2022-04-28 10:14:32,385 INFO L290 TraceCheckUtils]: 28: Hoare triple {94212#false} assume !(~x~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-28 10:14:32,385 INFO L290 TraceCheckUtils]: 29: Hoare triple {94212#false} assume !(~z~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-28 10:14:32,385 INFO L290 TraceCheckUtils]: 30: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {94212#false} is VALID [2022-04-28 10:14:32,385 INFO L290 TraceCheckUtils]: 31: Hoare triple {94212#false} assume !(~y~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-28 10:14:32,385 INFO L272 TraceCheckUtils]: 32: Hoare triple {94212#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {94212#false} is VALID [2022-04-28 10:14:32,385 INFO L290 TraceCheckUtils]: 33: Hoare triple {94212#false} ~cond := #in~cond; {94212#false} is VALID [2022-04-28 10:14:32,385 INFO L290 TraceCheckUtils]: 34: Hoare triple {94212#false} assume 0 == ~cond; {94212#false} is VALID [2022-04-28 10:14:32,386 INFO L290 TraceCheckUtils]: 35: Hoare triple {94212#false} assume !false; {94212#false} is VALID [2022-04-28 10:14:32,386 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-28 10:14:32,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:32,701 INFO L290 TraceCheckUtils]: 35: Hoare triple {94212#false} assume !false; {94212#false} is VALID [2022-04-28 10:14:32,701 INFO L290 TraceCheckUtils]: 34: Hoare triple {94212#false} assume 0 == ~cond; {94212#false} is VALID [2022-04-28 10:14:32,701 INFO L290 TraceCheckUtils]: 33: Hoare triple {94212#false} ~cond := #in~cond; {94212#false} is VALID [2022-04-28 10:14:32,701 INFO L272 TraceCheckUtils]: 32: Hoare triple {94212#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {94212#false} is VALID [2022-04-28 10:14:32,701 INFO L290 TraceCheckUtils]: 31: Hoare triple {94212#false} assume !(~y~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-28 10:14:32,701 INFO L290 TraceCheckUtils]: 30: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {94212#false} is VALID [2022-04-28 10:14:32,701 INFO L290 TraceCheckUtils]: 29: Hoare triple {94212#false} assume !(~z~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-28 10:14:32,701 INFO L290 TraceCheckUtils]: 28: Hoare triple {94212#false} assume !(~x~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-28 10:14:32,702 INFO L290 TraceCheckUtils]: 27: Hoare triple {94212#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; {94212#false} is VALID [2022-04-28 10:14:32,702 INFO L290 TraceCheckUtils]: 26: Hoare triple {94212#false} assume !(~y~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-28 10:14:32,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-28 10:14:32,702 INFO L290 TraceCheckUtils]: 24: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-28 10:14:32,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-28 10:14:32,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-28 10:14:32,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-28 10:14:32,702 INFO L290 TraceCheckUtils]: 20: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-28 10:14:32,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-28 10:14:32,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-28 10:14:32,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {94391#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-28 10:14:32,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {94395#(< 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; {94391#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:32,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {94399#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {94395#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:32,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {94399#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {94399#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:32,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {94406#(< 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; {94399#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:32,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {94410#(< 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; {94406#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:14:32,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {94414#(< 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; {94410#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:14:32,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {94418#(< 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; {94414#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:14:32,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {94422#(< 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; {94418#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:14:32,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {94426#(< 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; {94422#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:14:32,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {94430#(< 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; {94426#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:32,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {94434#(< 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; {94430#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:14:32,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {94211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {94434#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:32,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {94211#true} call #t~ret17 := main(); {94211#true} is VALID [2022-04-28 10:14:32,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94211#true} {94211#true} #94#return; {94211#true} is VALID [2022-04-28 10:14:32,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {94211#true} assume true; {94211#true} is VALID [2022-04-28 10:14:32,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {94211#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {94211#true} is VALID [2022-04-28 10:14:32,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {94211#true} call ULTIMATE.init(); {94211#true} is VALID [2022-04-28 10:14:32,710 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-28 10:14:32,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012253077] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:32,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:32,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 10:14:32,711 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:32,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [249641031] [2022-04-28 10:14:32,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [249641031] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:32,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:32,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:14:32,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299652568] [2022-04-28 10:14:32,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:32,711 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 36 [2022-04-28 10:14:32,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:32,711 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-28 10:14:32,731 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-28 10:14:32,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:14:32,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:32,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:14:32,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:14:32,732 INFO L87 Difference]: Start difference. First operand 579 states and 779 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-28 10:14:38,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:38,171 INFO L93 Difference]: Finished difference Result 672 states and 890 transitions. [2022-04-28 10:14:38,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:14:38,171 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 36 [2022-04-28 10:14:38,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:38,171 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-28 10:14:38,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 127 transitions. [2022-04-28 10:14:38,172 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-28 10:14:38,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 127 transitions. [2022-04-28 10:14:38,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 127 transitions. [2022-04-28 10:14:38,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:38,298 INFO L225 Difference]: With dead ends: 672 [2022-04-28 10:14:38,298 INFO L226 Difference]: Without dead ends: 653 [2022-04-28 10:14:38,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=304, Invalid=1102, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:14:38,298 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 111 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:38,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 107 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:14:38,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2022-04-28 10:14:41,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 579. [2022-04-28 10:14:41,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:41,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 653 states. Second operand has 579 states, 574 states have (on average 1.348432055749129) internal successors, (774), 574 states have internal predecessors, (774), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:41,733 INFO L74 IsIncluded]: Start isIncluded. First operand 653 states. Second operand has 579 states, 574 states have (on average 1.348432055749129) internal successors, (774), 574 states have internal predecessors, (774), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:41,733 INFO L87 Difference]: Start difference. First operand 653 states. Second operand has 579 states, 574 states have (on average 1.348432055749129) internal successors, (774), 574 states have internal predecessors, (774), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:41,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:41,745 INFO L93 Difference]: Finished difference Result 653 states and 870 transitions. [2022-04-28 10:14:41,745 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 870 transitions. [2022-04-28 10:14:41,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:41,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:41,745 INFO L74 IsIncluded]: Start isIncluded. First operand has 579 states, 574 states have (on average 1.348432055749129) internal successors, (774), 574 states have internal predecessors, (774), 3 states have call successors, (3), 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 653 states. [2022-04-28 10:14:41,746 INFO L87 Difference]: Start difference. First operand has 579 states, 574 states have (on average 1.348432055749129) internal successors, (774), 574 states have internal predecessors, (774), 3 states have call successors, (3), 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 653 states. [2022-04-28 10:14:41,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:41,757 INFO L93 Difference]: Finished difference Result 653 states and 870 transitions. [2022-04-28 10:14:41,757 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 870 transitions. [2022-04-28 10:14:41,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:41,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:41,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:41,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:41,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 574 states have (on average 1.348432055749129) internal successors, (774), 574 states have internal predecessors, (774), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 778 transitions. [2022-04-28 10:14:41,770 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 778 transitions. Word has length 36 [2022-04-28 10:14:41,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:41,770 INFO L495 AbstractCegarLoop]: Abstraction has 579 states and 778 transitions. [2022-04-28 10:14:41,770 INFO L496 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-28 10:14:41,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 579 states and 778 transitions. [2022-04-28 10:14:44,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 778 edges. 778 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:44,382 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 778 transitions. [2022-04-28 10:14:44,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:14:44,383 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:44,383 INFO L195 NwaCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:44,408 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-28 10:14:44,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-04-28 10:14:44,599 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:44,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:44,600 INFO L85 PathProgramCache]: Analyzing trace with hash -427044266, now seen corresponding path program 37 times [2022-04-28 10:14:44,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:44,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2130445803] [2022-04-28 10:14:44,602 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:44,602 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:44,602 INFO L85 PathProgramCache]: Analyzing trace with hash -427044266, now seen corresponding path program 38 times [2022-04-28 10:14:44,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:44,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840555882] [2022-04-28 10:14:44,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:44,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:44,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:45,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:45,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {98313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {98287#true} is VALID [2022-04-28 10:14:45,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {98287#true} assume true; {98287#true} is VALID [2022-04-28 10:14:45,056 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {98287#true} {98287#true} #94#return; {98287#true} is VALID [2022-04-28 10:14:45,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {98287#true} call ULTIMATE.init(); {98313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:45,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {98313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {98287#true} is VALID [2022-04-28 10:14:45,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {98287#true} assume true; {98287#true} is VALID [2022-04-28 10:14:45,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98287#true} {98287#true} #94#return; {98287#true} is VALID [2022-04-28 10:14:45,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {98287#true} call #t~ret17 := main(); {98287#true} is VALID [2022-04-28 10:14:45,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {98287#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {98292#(= main_~y~0 0)} is VALID [2022-04-28 10:14:45,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {98292#(= 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; {98293#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:45,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {98293#(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; {98294#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:45,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {98294#(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; {98295#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:45,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {98295#(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; {98296#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:45,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {98296#(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; {98297#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:45,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {98297#(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; {98298#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:45,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {98298#(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; {98299#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:45,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {98299#(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; {98300#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:45,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {98300#(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; {98301#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:45,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {98301#(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; {98302#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:45,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {98302#(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; {98303#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:45,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {98303#(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; {98304#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:14:45,067 INFO L290 TraceCheckUtils]: 18: Hoare triple {98304#(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; {98305#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:45,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {98305#(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; {98306#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:14:45,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {98306#(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; {98307#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:14:45,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {98307#(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; {98308#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:14:45,070 INFO L290 TraceCheckUtils]: 22: Hoare triple {98308#(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; {98309#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:14:45,070 INFO L290 TraceCheckUtils]: 23: Hoare triple {98309#(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; {98310#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:14:45,071 INFO L290 TraceCheckUtils]: 24: Hoare triple {98310#(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; {98311#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:14:45,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {98311#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {98311#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:14:45,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {98311#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {98312#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:14:45,073 INFO L290 TraceCheckUtils]: 27: Hoare triple {98312#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-28 10:14:45,073 INFO L290 TraceCheckUtils]: 28: Hoare triple {98288#false} assume !(~y~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-28 10:14:45,073 INFO L290 TraceCheckUtils]: 29: Hoare triple {98288#false} assume !(~x~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-28 10:14:45,073 INFO L290 TraceCheckUtils]: 30: Hoare triple {98288#false} assume !(~z~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-28 10:14:45,073 INFO L290 TraceCheckUtils]: 31: Hoare triple {98288#false} assume !(~y~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-28 10:14:45,073 INFO L272 TraceCheckUtils]: 32: Hoare triple {98288#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {98288#false} is VALID [2022-04-28 10:14:45,073 INFO L290 TraceCheckUtils]: 33: Hoare triple {98288#false} ~cond := #in~cond; {98288#false} is VALID [2022-04-28 10:14:45,073 INFO L290 TraceCheckUtils]: 34: Hoare triple {98288#false} assume 0 == ~cond; {98288#false} is VALID [2022-04-28 10:14:45,073 INFO L290 TraceCheckUtils]: 35: Hoare triple {98288#false} assume !false; {98288#false} is VALID [2022-04-28 10:14:45,074 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:45,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:45,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840555882] [2022-04-28 10:14:45,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840555882] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:45,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119828848] [2022-04-28 10:14:45,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:14:45,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:45,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:45,076 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-28 10:14:45,110 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-28 10:14:45,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:14:45,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:45,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 10:14:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:45,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:45,534 INFO L272 TraceCheckUtils]: 0: Hoare triple {98287#true} call ULTIMATE.init(); {98287#true} is VALID [2022-04-28 10:14:45,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {98287#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {98287#true} is VALID [2022-04-28 10:14:45,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {98287#true} assume true; {98287#true} is VALID [2022-04-28 10:14:45,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98287#true} {98287#true} #94#return; {98287#true} is VALID [2022-04-28 10:14:45,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {98287#true} call #t~ret17 := main(); {98287#true} is VALID [2022-04-28 10:14:45,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {98287#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {98292#(= main_~y~0 0)} is VALID [2022-04-28 10:14:45,535 INFO L290 TraceCheckUtils]: 6: Hoare triple {98292#(= 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; {98293#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:45,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {98293#(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; {98294#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:45,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {98294#(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; {98295#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:45,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {98295#(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; {98296#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:45,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {98296#(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; {98297#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:45,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {98297#(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; {98298#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:45,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {98298#(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; {98299#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:45,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {98299#(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; {98300#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:45,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {98300#(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; {98301#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:45,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {98301#(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; {98302#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:45,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {98302#(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; {98303#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:45,541 INFO L290 TraceCheckUtils]: 17: Hoare triple {98303#(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; {98304#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:14:45,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {98304#(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; {98305#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:45,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {98305#(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; {98306#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:14:45,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {98306#(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; {98307#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:14:45,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {98307#(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; {98308#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:14:45,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {98308#(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; {98309#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:14:45,544 INFO L290 TraceCheckUtils]: 23: Hoare triple {98309#(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; {98310#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:14:45,545 INFO L290 TraceCheckUtils]: 24: Hoare triple {98310#(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; {98311#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:14:45,545 INFO L290 TraceCheckUtils]: 25: Hoare triple {98311#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {98311#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:14:45,546 INFO L290 TraceCheckUtils]: 26: Hoare triple {98311#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {98395#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-28 10:14:45,546 INFO L290 TraceCheckUtils]: 27: Hoare triple {98395#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !(~z~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-28 10:14:45,546 INFO L290 TraceCheckUtils]: 28: Hoare triple {98288#false} assume !(~y~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-28 10:14:45,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {98288#false} assume !(~x~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-28 10:14:45,546 INFO L290 TraceCheckUtils]: 30: Hoare triple {98288#false} assume !(~z~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-28 10:14:45,546 INFO L290 TraceCheckUtils]: 31: Hoare triple {98288#false} assume !(~y~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-28 10:14:45,546 INFO L272 TraceCheckUtils]: 32: Hoare triple {98288#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {98288#false} is VALID [2022-04-28 10:14:45,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {98288#false} ~cond := #in~cond; {98288#false} is VALID [2022-04-28 10:14:45,547 INFO L290 TraceCheckUtils]: 34: Hoare triple {98288#false} assume 0 == ~cond; {98288#false} is VALID [2022-04-28 10:14:45,547 INFO L290 TraceCheckUtils]: 35: Hoare triple {98288#false} assume !false; {98288#false} is VALID [2022-04-28 10:14:45,547 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:45,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:46,322 INFO L290 TraceCheckUtils]: 35: Hoare triple {98288#false} assume !false; {98288#false} is VALID [2022-04-28 10:14:46,322 INFO L290 TraceCheckUtils]: 34: Hoare triple {98288#false} assume 0 == ~cond; {98288#false} is VALID [2022-04-28 10:14:46,322 INFO L290 TraceCheckUtils]: 33: Hoare triple {98288#false} ~cond := #in~cond; {98288#false} is VALID [2022-04-28 10:14:46,323 INFO L272 TraceCheckUtils]: 32: Hoare triple {98288#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {98288#false} is VALID [2022-04-28 10:14:46,323 INFO L290 TraceCheckUtils]: 31: Hoare triple {98288#false} assume !(~y~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-28 10:14:46,323 INFO L290 TraceCheckUtils]: 30: Hoare triple {98288#false} assume !(~z~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-28 10:14:46,323 INFO L290 TraceCheckUtils]: 29: Hoare triple {98288#false} assume !(~x~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-28 10:14:46,323 INFO L290 TraceCheckUtils]: 28: Hoare triple {98288#false} assume !(~y~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-28 10:14:46,323 INFO L290 TraceCheckUtils]: 27: Hoare triple {98447#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-28 10:14:46,324 INFO L290 TraceCheckUtils]: 26: Hoare triple {98451#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {98447#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:46,324 INFO L290 TraceCheckUtils]: 25: Hoare triple {98451#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {98451#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:14:46,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {98458#(< 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; {98451#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:14:46,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {98462#(< 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; {98458#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:14:46,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {98466#(< 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; {98462#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:14:46,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {98470#(< 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; {98466#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:14:46,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {98474#(< 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; {98470#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:14:46,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {98478#(< 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; {98474#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:46,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {98482#(< 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; {98478#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:14:46,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {98486#(< 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; {98482#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:46,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {98490#(< 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; {98486#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:14:46,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {98494#(< 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; {98490#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:14:46,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {98498#(< 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; {98494#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:14:46,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {98502#(< 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; {98498#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:14:46,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {98506#(< 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; {98502#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:14:46,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {98510#(< 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; {98506#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:14:46,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {98514#(< 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; {98510#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:14:46,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {98518#(< 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; {98514#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:14:46,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {98522#(< 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; {98518#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:14:46,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {98526#(< 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; {98522#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:14:46,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {98530#(< 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; {98526#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:14:46,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {98287#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {98530#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:46,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {98287#true} call #t~ret17 := main(); {98287#true} is VALID [2022-04-28 10:14:46,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98287#true} {98287#true} #94#return; {98287#true} is VALID [2022-04-28 10:14:46,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {98287#true} assume true; {98287#true} is VALID [2022-04-28 10:14:46,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {98287#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {98287#true} is VALID [2022-04-28 10:14:46,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {98287#true} call ULTIMATE.init(); {98287#true} is VALID [2022-04-28 10:14:46,341 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:46,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119828848] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:46,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:46,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 10:14:46,342 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:46,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2130445803] [2022-04-28 10:14:46,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2130445803] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:46,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:46,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:14:46,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586841182] [2022-04-28 10:14:46,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:46,342 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 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-28 10:14:46,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:46,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 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-28 10:14:46,364 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-28 10:14:46,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:14:46,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:46,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:14:46,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=1579, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:14:46,365 INFO L87 Difference]: Start difference. First operand 579 states and 778 transitions. Second operand has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 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-28 10:14:57,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:57,624 INFO L93 Difference]: Finished difference Result 800 states and 1181 transitions. [2022-04-28 10:14:57,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:14:57,624 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 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-28 10:14:57,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:57,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 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-28 10:14:57,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 286 transitions. [2022-04-28 10:14:57,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 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-28 10:14:57,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 286 transitions. [2022-04-28 10:14:57,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 286 transitions. [2022-04-28 10:14:57,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 286 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:57,896 INFO L225 Difference]: With dead ends: 800 [2022-04-28 10:14:57,896 INFO L226 Difference]: Without dead ends: 779 [2022-04-28 10:14:57,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=997, Invalid=3425, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 10:14:57,897 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 248 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4366 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 4528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 4366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:57,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 227 Invalid, 4528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 4366 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-28 10:14:57,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2022-04-28 10:15:01,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 606. [2022-04-28 10:15:01,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:01,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 779 states. Second operand has 606 states, 601 states have (on average 1.3527454242928452) internal successors, (813), 601 states have internal predecessors, (813), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:01,488 INFO L74 IsIncluded]: Start isIncluded. First operand 779 states. Second operand has 606 states, 601 states have (on average 1.3527454242928452) internal successors, (813), 601 states have internal predecessors, (813), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:01,488 INFO L87 Difference]: Start difference. First operand 779 states. Second operand has 606 states, 601 states have (on average 1.3527454242928452) internal successors, (813), 601 states have internal predecessors, (813), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:01,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:01,505 INFO L93 Difference]: Finished difference Result 779 states and 1028 transitions. [2022-04-28 10:15:01,505 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1028 transitions. [2022-04-28 10:15:01,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:01,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:01,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 606 states, 601 states have (on average 1.3527454242928452) internal successors, (813), 601 states have internal predecessors, (813), 3 states have call successors, (3), 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 779 states. [2022-04-28 10:15:01,506 INFO L87 Difference]: Start difference. First operand has 606 states, 601 states have (on average 1.3527454242928452) internal successors, (813), 601 states have internal predecessors, (813), 3 states have call successors, (3), 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 779 states. [2022-04-28 10:15:01,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:01,523 INFO L93 Difference]: Finished difference Result 779 states and 1028 transitions. [2022-04-28 10:15:01,523 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1028 transitions. [2022-04-28 10:15:01,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:01,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:01,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:01,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:01,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 601 states have (on average 1.3527454242928452) internal successors, (813), 601 states have internal predecessors, (813), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:01,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 817 transitions. [2022-04-28 10:15:01,537 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 817 transitions. Word has length 36 [2022-04-28 10:15:01,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:01,537 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 817 transitions. [2022-04-28 10:15:01,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 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-28 10:15:01,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 606 states and 817 transitions. [2022-04-28 10:15:06,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 817 edges. 816 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:06,414 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 817 transitions. [2022-04-28 10:15:06,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:15:06,415 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:06,415 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:06,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-04-28 10:15:06,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-04-28 10:15:06,615 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:06,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:06,616 INFO L85 PathProgramCache]: Analyzing trace with hash -122316104, now seen corresponding path program 11 times [2022-04-28 10:15:06,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:06,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1135595295] [2022-04-28 10:15:06,619 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:06,619 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:06,619 INFO L85 PathProgramCache]: Analyzing trace with hash -122316104, now seen corresponding path program 12 times [2022-04-28 10:15:06,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:06,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69286720] [2022-04-28 10:15:06,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:06,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:06,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:06,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {102972#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {102963#true} is VALID [2022-04-28 10:15:06,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {102963#true} assume true; {102963#true} is VALID [2022-04-28 10:15:06,733 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {102963#true} {102963#true} #94#return; {102963#true} is VALID [2022-04-28 10:15:06,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {102963#true} call ULTIMATE.init(); {102972#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:06,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {102972#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {102963#true} is VALID [2022-04-28 10:15:06,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {102963#true} assume true; {102963#true} is VALID [2022-04-28 10:15:06,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {102963#true} {102963#true} #94#return; {102963#true} is VALID [2022-04-28 10:15:06,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {102963#true} call #t~ret17 := main(); {102963#true} is VALID [2022-04-28 10:15:06,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {102963#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {102963#true} is VALID [2022-04-28 10:15:06,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {102963#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {102963#true} is VALID [2022-04-28 10:15:06,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {102963#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {102963#true} is VALID [2022-04-28 10:15:06,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {102963#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {102963#true} is VALID [2022-04-28 10:15:06,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {102963#true} assume !(~x~0 % 4294967296 > 0); {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:06,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:06,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {102968#(<= 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; {102969#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:15:06,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {102969#(<= 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; {102970#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {102970#(<= 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; {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {102971#(<= 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; {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {102971#(<= 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; {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {102971#(<= 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; {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {102971#(<= 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; {102970#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {102970#(<= 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; {102969#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:15:06,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {102969#(<= 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; {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:06,744 INFO L290 TraceCheckUtils]: 22: Hoare triple {102968#(<= 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; {102964#false} is VALID [2022-04-28 10:15:06,745 INFO L290 TraceCheckUtils]: 23: Hoare triple {102964#false} assume !(~x~0 % 4294967296 > 0); {102964#false} is VALID [2022-04-28 10:15:06,745 INFO L290 TraceCheckUtils]: 24: Hoare triple {102964#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {102964#false} is VALID [2022-04-28 10:15:06,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {102964#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {102964#false} is VALID [2022-04-28 10:15:06,745 INFO L290 TraceCheckUtils]: 26: Hoare triple {102964#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {102964#false} is VALID [2022-04-28 10:15:06,745 INFO L290 TraceCheckUtils]: 27: Hoare triple {102964#false} assume !(~z~0 % 4294967296 > 0); {102964#false} is VALID [2022-04-28 10:15:06,745 INFO L290 TraceCheckUtils]: 28: Hoare triple {102964#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {102964#false} is VALID [2022-04-28 10:15:06,745 INFO L290 TraceCheckUtils]: 29: Hoare triple {102964#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {102964#false} is VALID [2022-04-28 10:15:06,745 INFO L290 TraceCheckUtils]: 30: Hoare triple {102964#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {102964#false} is VALID [2022-04-28 10:15:06,745 INFO L290 TraceCheckUtils]: 31: Hoare triple {102964#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {102964#false} is VALID [2022-04-28 10:15:06,745 INFO L290 TraceCheckUtils]: 32: Hoare triple {102964#false} assume !(~y~0 % 4294967296 > 0); {102964#false} is VALID [2022-04-28 10:15:06,746 INFO L272 TraceCheckUtils]: 33: Hoare triple {102964#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {102964#false} is VALID [2022-04-28 10:15:06,746 INFO L290 TraceCheckUtils]: 34: Hoare triple {102964#false} ~cond := #in~cond; {102964#false} is VALID [2022-04-28 10:15:06,746 INFO L290 TraceCheckUtils]: 35: Hoare triple {102964#false} assume 0 == ~cond; {102964#false} is VALID [2022-04-28 10:15:06,746 INFO L290 TraceCheckUtils]: 36: Hoare triple {102964#false} assume !false; {102964#false} is VALID [2022-04-28 10:15:06,746 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:15:06,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:06,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69286720] [2022-04-28 10:15:06,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69286720] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:06,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769675458] [2022-04-28 10:15:06,747 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:15:06,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:06,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:06,748 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-28 10:15:06,749 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-28 10:15:06,828 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:15:06,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:06,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:15:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:06,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:07,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {102963#true} call ULTIMATE.init(); {102963#true} is VALID [2022-04-28 10:15:07,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {102963#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {102963#true} is VALID [2022-04-28 10:15:07,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {102963#true} assume true; {102963#true} is VALID [2022-04-28 10:15:07,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {102963#true} {102963#true} #94#return; {102963#true} is VALID [2022-04-28 10:15:07,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {102963#true} call #t~ret17 := main(); {102963#true} is VALID [2022-04-28 10:15:07,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {102963#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {102963#true} is VALID [2022-04-28 10:15:07,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {102963#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {102963#true} is VALID [2022-04-28 10:15:07,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {102963#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {102963#true} is VALID [2022-04-28 10:15:07,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {102963#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {102963#true} is VALID [2022-04-28 10:15:07,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {102963#true} assume !(~x~0 % 4294967296 > 0); {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:07,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:07,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {102968#(<= 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; {102969#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:15:07,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {102969#(<= 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; {102970#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {102970#(<= 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; {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {102971#(<= 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; {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {102971#(<= 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; {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {102971#(<= 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; {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {102971#(<= 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; {102970#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {102970#(<= 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; {102969#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:15:07,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {102969#(<= 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; {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:07,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {102968#(<= 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; {102964#false} is VALID [2022-04-28 10:15:07,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {102964#false} assume !(~x~0 % 4294967296 > 0); {102964#false} is VALID [2022-04-28 10:15:07,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {102964#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {102964#false} is VALID [2022-04-28 10:15:07,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {102964#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {102964#false} is VALID [2022-04-28 10:15:07,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {102964#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {102964#false} is VALID [2022-04-28 10:15:07,142 INFO L290 TraceCheckUtils]: 27: Hoare triple {102964#false} assume !(~z~0 % 4294967296 > 0); {102964#false} is VALID [2022-04-28 10:15:07,142 INFO L290 TraceCheckUtils]: 28: Hoare triple {102964#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {102964#false} is VALID [2022-04-28 10:15:07,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {102964#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {102964#false} is VALID [2022-04-28 10:15:07,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {102964#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {102964#false} is VALID [2022-04-28 10:15:07,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {102964#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {102964#false} is VALID [2022-04-28 10:15:07,143 INFO L290 TraceCheckUtils]: 32: Hoare triple {102964#false} assume !(~y~0 % 4294967296 > 0); {102964#false} is VALID [2022-04-28 10:15:07,143 INFO L272 TraceCheckUtils]: 33: Hoare triple {102964#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {102964#false} is VALID [2022-04-28 10:15:07,143 INFO L290 TraceCheckUtils]: 34: Hoare triple {102964#false} ~cond := #in~cond; {102964#false} is VALID [2022-04-28 10:15:07,143 INFO L290 TraceCheckUtils]: 35: Hoare triple {102964#false} assume 0 == ~cond; {102964#false} is VALID [2022-04-28 10:15:07,143 INFO L290 TraceCheckUtils]: 36: Hoare triple {102964#false} assume !false; {102964#false} is VALID [2022-04-28 10:15:07,143 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:15:07,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:07,381 INFO L290 TraceCheckUtils]: 36: Hoare triple {102964#false} assume !false; {102964#false} is VALID [2022-04-28 10:15:07,381 INFO L290 TraceCheckUtils]: 35: Hoare triple {102964#false} assume 0 == ~cond; {102964#false} is VALID [2022-04-28 10:15:07,381 INFO L290 TraceCheckUtils]: 34: Hoare triple {102964#false} ~cond := #in~cond; {102964#false} is VALID [2022-04-28 10:15:07,381 INFO L272 TraceCheckUtils]: 33: Hoare triple {102964#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {102964#false} is VALID [2022-04-28 10:15:07,381 INFO L290 TraceCheckUtils]: 32: Hoare triple {102964#false} assume !(~y~0 % 4294967296 > 0); {102964#false} is VALID [2022-04-28 10:15:07,381 INFO L290 TraceCheckUtils]: 31: Hoare triple {102964#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {102964#false} is VALID [2022-04-28 10:15:07,381 INFO L290 TraceCheckUtils]: 30: Hoare triple {102964#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {102964#false} is VALID [2022-04-28 10:15:07,381 INFO L290 TraceCheckUtils]: 29: Hoare triple {102964#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {102964#false} is VALID [2022-04-28 10:15:07,381 INFO L290 TraceCheckUtils]: 28: Hoare triple {102964#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {102964#false} is VALID [2022-04-28 10:15:07,381 INFO L290 TraceCheckUtils]: 27: Hoare triple {102964#false} assume !(~z~0 % 4294967296 > 0); {102964#false} is VALID [2022-04-28 10:15:07,381 INFO L290 TraceCheckUtils]: 26: Hoare triple {102964#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {102964#false} is VALID [2022-04-28 10:15:07,382 INFO L290 TraceCheckUtils]: 25: Hoare triple {102964#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {102964#false} is VALID [2022-04-28 10:15:07,382 INFO L290 TraceCheckUtils]: 24: Hoare triple {102964#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {102964#false} is VALID [2022-04-28 10:15:07,382 INFO L290 TraceCheckUtils]: 23: Hoare triple {102964#false} assume !(~x~0 % 4294967296 > 0); {102964#false} is VALID [2022-04-28 10:15:07,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {102968#(<= 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; {102964#false} is VALID [2022-04-28 10:15:07,383 INFO L290 TraceCheckUtils]: 21: Hoare triple {102969#(<= 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; {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:07,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {102970#(<= 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; {102969#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:15:07,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {102971#(<= 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; {102970#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,386 INFO L290 TraceCheckUtils]: 18: Hoare triple {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {102971#(<= 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; {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {102971#(<= 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; {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {102971#(<= 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; {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {102970#(<= 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; {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {102969#(<= 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; {102970#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {102968#(<= 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; {102969#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:15:07,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:07,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {102963#true} assume !(~x~0 % 4294967296 > 0); {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:07,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {102963#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {102963#true} is VALID [2022-04-28 10:15:07,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {102963#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {102963#true} is VALID [2022-04-28 10:15:07,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {102963#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {102963#true} is VALID [2022-04-28 10:15:07,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {102963#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {102963#true} is VALID [2022-04-28 10:15:07,391 INFO L272 TraceCheckUtils]: 4: Hoare triple {102963#true} call #t~ret17 := main(); {102963#true} is VALID [2022-04-28 10:15:07,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {102963#true} {102963#true} #94#return; {102963#true} is VALID [2022-04-28 10:15:07,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {102963#true} assume true; {102963#true} is VALID [2022-04-28 10:15:07,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {102963#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {102963#true} is VALID [2022-04-28 10:15:07,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {102963#true} call ULTIMATE.init(); {102963#true} is VALID [2022-04-28 10:15:07,391 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:15:07,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769675458] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:07,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:07,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-04-28 10:15:07,392 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:07,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1135595295] [2022-04-28 10:15:07,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1135595295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:07,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:07,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:15:07,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113104077] [2022-04-28 10:15:07,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:07,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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-28 10:15:07,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:07,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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-28 10:15:07,414 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-28 10:15:07,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:15:07,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:07,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:15:07,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 10:15:07,414 INFO L87 Difference]: Start difference. First operand 606 states and 817 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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-28 10:15:15,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:15,627 INFO L93 Difference]: Finished difference Result 1059 states and 1394 transitions. [2022-04-28 10:15:15,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:15:15,627 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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-28 10:15:15,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:15:15,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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-28 10:15:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-04-28 10:15:15,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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-28 10:15:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-04-28 10:15:15,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 74 transitions. [2022-04-28 10:15:15,691 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-28 10:15:15,722 INFO L225 Difference]: With dead ends: 1059 [2022-04-28 10:15:15,722 INFO L226 Difference]: Without dead ends: 897 [2022-04-28 10:15:15,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 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-28 10:15:15,723 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 41 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:15:15,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 67 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:15:15,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2022-04-28 10:15:19,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 570. [2022-04-28 10:15:19,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:19,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 897 states. Second operand has 570 states, 565 states have (on average 1.3380530973451328) internal successors, (756), 565 states have internal predecessors, (756), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:19,210 INFO L74 IsIncluded]: Start isIncluded. First operand 897 states. Second operand has 570 states, 565 states have (on average 1.3380530973451328) internal successors, (756), 565 states have internal predecessors, (756), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:19,210 INFO L87 Difference]: Start difference. First operand 897 states. Second operand has 570 states, 565 states have (on average 1.3380530973451328) internal successors, (756), 565 states have internal predecessors, (756), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:19,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:19,232 INFO L93 Difference]: Finished difference Result 897 states and 1175 transitions. [2022-04-28 10:15:19,232 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1175 transitions. [2022-04-28 10:15:19,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:19,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:19,233 INFO L74 IsIncluded]: Start isIncluded. First operand has 570 states, 565 states have (on average 1.3380530973451328) internal successors, (756), 565 states have internal predecessors, (756), 3 states have call successors, (3), 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 897 states. [2022-04-28 10:15:19,233 INFO L87 Difference]: Start difference. First operand has 570 states, 565 states have (on average 1.3380530973451328) internal successors, (756), 565 states have internal predecessors, (756), 3 states have call successors, (3), 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 897 states. [2022-04-28 10:15:19,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:19,254 INFO L93 Difference]: Finished difference Result 897 states and 1175 transitions. [2022-04-28 10:15:19,254 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1175 transitions. [2022-04-28 10:15:19,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:19,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:19,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:19,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:19,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 565 states have (on average 1.3380530973451328) internal successors, (756), 565 states have internal predecessors, (756), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:19,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 760 transitions. [2022-04-28 10:15:19,267 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 760 transitions. Word has length 37 [2022-04-28 10:15:19,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:19,267 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 760 transitions. [2022-04-28 10:15:19,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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-28 10:15:19,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 570 states and 760 transitions. [2022-04-28 10:15:22,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 760 edges. 760 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:22,274 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 760 transitions. [2022-04-28 10:15:22,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:15:22,275 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:22,275 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:22,291 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-28 10:15:22,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-04-28 10:15:22,476 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:22,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:22,476 INFO L85 PathProgramCache]: Analyzing trace with hash 972307160, now seen corresponding path program 9 times [2022-04-28 10:15:22,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:22,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1229265349] [2022-04-28 10:15:22,478 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:22,478 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:22,478 INFO L85 PathProgramCache]: Analyzing trace with hash 972307160, now seen corresponding path program 10 times [2022-04-28 10:15:22,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:22,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837204898] [2022-04-28 10:15:22,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:22,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:22,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:22,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {108269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {108254#true} is VALID [2022-04-28 10:15:22,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {108254#true} assume true; {108254#true} is VALID [2022-04-28 10:15:22,659 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {108254#true} {108254#true} #94#return; {108254#true} is VALID [2022-04-28 10:15:22,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {108254#true} call ULTIMATE.init(); {108269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:22,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {108269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {108254#true} is VALID [2022-04-28 10:15:22,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {108254#true} assume true; {108254#true} is VALID [2022-04-28 10:15:22,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108254#true} {108254#true} #94#return; {108254#true} is VALID [2022-04-28 10:15:22,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {108254#true} call #t~ret17 := main(); {108254#true} is VALID [2022-04-28 10:15:22,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {108254#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {108254#true} is VALID [2022-04-28 10:15:22,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {108254#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:15:22,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {108259#(<= 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; {108260#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:15:22,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {108260#(<= 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; {108261#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:15:22,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {108261#(<= 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; {108262#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:15:22,666 INFO L290 TraceCheckUtils]: 10: Hoare triple {108262#(<= 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; {108263#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:15:22,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {108263#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {108263#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:15:22,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {108263#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {108263#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:15:22,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {108263#(<= (* (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; {108264#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:15:22,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {108264#(<= (+ (* (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; {108265#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 2) main_~x~0)} is VALID [2022-04-28 10:15:22,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {108265#(<= (+ (* 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; {108266#(<= (+ 3 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:15:22,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {108266#(<= (+ 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; {108267#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-28 10:15:22,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {108267#(<= (+ (* (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; {108268#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:15:22,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {108268#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {108268#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:15:22,673 INFO L290 TraceCheckUtils]: 19: Hoare triple {108268#(<= (+ 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; {108268#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:15:22,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {108268#(<= (+ 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; {108268#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:15:22,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {108268#(<= (+ 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; {108268#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:15:22,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {108268#(<= (+ 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; {108268#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:15:22,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {108268#(<= (+ 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; {108268#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:15:22,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {108268#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {108268#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:15:22,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {108268#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {108255#false} is VALID [2022-04-28 10:15:22,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-28 10:15:22,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-28 10:15:22,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-28 10:15:22,676 INFO L290 TraceCheckUtils]: 29: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-28 10:15:22,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-28 10:15:22,676 INFO L290 TraceCheckUtils]: 31: Hoare triple {108255#false} assume !(~z~0 % 4294967296 > 0); {108255#false} is VALID [2022-04-28 10:15:22,676 INFO L290 TraceCheckUtils]: 32: Hoare triple {108255#false} assume !(~y~0 % 4294967296 > 0); {108255#false} is VALID [2022-04-28 10:15:22,677 INFO L272 TraceCheckUtils]: 33: Hoare triple {108255#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {108255#false} is VALID [2022-04-28 10:15:22,677 INFO L290 TraceCheckUtils]: 34: Hoare triple {108255#false} ~cond := #in~cond; {108255#false} is VALID [2022-04-28 10:15:22,677 INFO L290 TraceCheckUtils]: 35: Hoare triple {108255#false} assume 0 == ~cond; {108255#false} is VALID [2022-04-28 10:15:22,677 INFO L290 TraceCheckUtils]: 36: Hoare triple {108255#false} assume !false; {108255#false} is VALID [2022-04-28 10:15:22,677 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-28 10:15:22,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:22,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837204898] [2022-04-28 10:15:22,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837204898] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:22,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173994727] [2022-04-28 10:15:22,678 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:15:22,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:22,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:22,680 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-28 10:15:22,707 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-28 10:15:22,740 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:15:22,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:22,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 10:15:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:22,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:23,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {108254#true} call ULTIMATE.init(); {108254#true} is VALID [2022-04-28 10:15:23,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {108254#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {108254#true} is VALID [2022-04-28 10:15:23,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {108254#true} assume true; {108254#true} is VALID [2022-04-28 10:15:23,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108254#true} {108254#true} #94#return; {108254#true} is VALID [2022-04-28 10:15:23,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {108254#true} call #t~ret17 := main(); {108254#true} is VALID [2022-04-28 10:15:23,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {108254#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {108254#true} is VALID [2022-04-28 10:15:23,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {108254#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:15:23,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {108259#(<= 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; {108294#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:15:23,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {108294#(<= 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; {108298#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:23,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {108298#(<= 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; {108302#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:15:23,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {108302#(<= 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; {108306#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:23,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {108306#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {108306#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:23,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {108306#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} ~z~0 := ~y~0; {108306#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:23,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {108306#(<= 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; {108302#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:15:23,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {108302#(<= 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; {108298#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:23,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {108298#(<= 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; {108294#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:15:23,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {108294#(<= 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; {108259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:15:23,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {108259#(<= 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; {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:23,083 INFO L290 TraceCheckUtils]: 18: Hoare triple {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:23,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {108328#(<= 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; {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:23,083 INFO L290 TraceCheckUtils]: 20: Hoare triple {108328#(<= 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; {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:23,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {108328#(<= 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; {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:23,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {108328#(<= 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; {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:23,086 INFO L290 TraceCheckUtils]: 23: Hoare triple {108328#(<= 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; {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:23,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:23,087 INFO L290 TraceCheckUtils]: 25: Hoare triple {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {108255#false} is VALID [2022-04-28 10:15:23,087 INFO L290 TraceCheckUtils]: 26: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-28 10:15:23,087 INFO L290 TraceCheckUtils]: 27: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-28 10:15:23,087 INFO L290 TraceCheckUtils]: 28: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-28 10:15:23,087 INFO L290 TraceCheckUtils]: 29: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-28 10:15:23,087 INFO L290 TraceCheckUtils]: 30: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-28 10:15:23,087 INFO L290 TraceCheckUtils]: 31: Hoare triple {108255#false} assume !(~z~0 % 4294967296 > 0); {108255#false} is VALID [2022-04-28 10:15:23,087 INFO L290 TraceCheckUtils]: 32: Hoare triple {108255#false} assume !(~y~0 % 4294967296 > 0); {108255#false} is VALID [2022-04-28 10:15:23,087 INFO L272 TraceCheckUtils]: 33: Hoare triple {108255#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {108255#false} is VALID [2022-04-28 10:15:23,088 INFO L290 TraceCheckUtils]: 34: Hoare triple {108255#false} ~cond := #in~cond; {108255#false} is VALID [2022-04-28 10:15:23,088 INFO L290 TraceCheckUtils]: 35: Hoare triple {108255#false} assume 0 == ~cond; {108255#false} is VALID [2022-04-28 10:15:23,088 INFO L290 TraceCheckUtils]: 36: Hoare triple {108255#false} assume !false; {108255#false} is VALID [2022-04-28 10:15:23,088 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-28 10:15:23,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:23,228 INFO L290 TraceCheckUtils]: 36: Hoare triple {108255#false} assume !false; {108255#false} is VALID [2022-04-28 10:15:23,228 INFO L290 TraceCheckUtils]: 35: Hoare triple {108255#false} assume 0 == ~cond; {108255#false} is VALID [2022-04-28 10:15:23,228 INFO L290 TraceCheckUtils]: 34: Hoare triple {108255#false} ~cond := #in~cond; {108255#false} is VALID [2022-04-28 10:15:23,228 INFO L272 TraceCheckUtils]: 33: Hoare triple {108255#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {108255#false} is VALID [2022-04-28 10:15:23,228 INFO L290 TraceCheckUtils]: 32: Hoare triple {108255#false} assume !(~y~0 % 4294967296 > 0); {108255#false} is VALID [2022-04-28 10:15:23,228 INFO L290 TraceCheckUtils]: 31: Hoare triple {108255#false} assume !(~z~0 % 4294967296 > 0); {108255#false} is VALID [2022-04-28 10:15:23,228 INFO L290 TraceCheckUtils]: 30: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-28 10:15:23,228 INFO L290 TraceCheckUtils]: 29: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-28 10:15:23,228 INFO L290 TraceCheckUtils]: 28: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-28 10:15:23,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-28 10:15:23,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-28 10:15:23,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {108255#false} is VALID [2022-04-28 10:15:23,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:23,230 INFO L290 TraceCheckUtils]: 23: Hoare triple {108328#(<= 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; {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:23,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {108328#(<= 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; {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:23,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {108328#(<= 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; {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:23,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {108328#(<= 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; {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:23,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {108328#(<= 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; {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:23,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:23,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {108259#(<= 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; {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:23,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {108294#(<= 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; {108259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:15:23,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {108298#(<= 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; {108294#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:15:23,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {108302#(<= 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; {108298#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:23,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {108306#(<= 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; {108302#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:15:23,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {108306#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} ~z~0 := ~y~0; {108306#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:23,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {108306#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {108306#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:23,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {108302#(<= 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; {108306#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:23,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {108298#(<= 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; {108302#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:15:23,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {108294#(<= 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; {108298#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:23,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {108259#(<= 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; {108294#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:15:23,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {108254#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:15:23,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {108254#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {108254#true} is VALID [2022-04-28 10:15:23,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {108254#true} call #t~ret17 := main(); {108254#true} is VALID [2022-04-28 10:15:23,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108254#true} {108254#true} #94#return; {108254#true} is VALID [2022-04-28 10:15:23,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {108254#true} assume true; {108254#true} is VALID [2022-04-28 10:15:23,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {108254#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {108254#true} is VALID [2022-04-28 10:15:23,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {108254#true} call ULTIMATE.init(); {108254#true} is VALID [2022-04-28 10:15:23,240 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-28 10:15:23,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173994727] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:23,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:23,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 18 [2022-04-28 10:15:23,240 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:23,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1229265349] [2022-04-28 10:15:23,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1229265349] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:23,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:23,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:15:23,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371492509] [2022-04-28 10:15:23,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:23,241 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 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 37 [2022-04-28 10:15:23,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:23,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 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-28 10:15:23,263 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-28 10:15:23,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:15:23,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:23,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:15:23,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:15:23,264 INFO L87 Difference]: Start difference. First operand 570 states and 760 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 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-28 10:15:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:34,296 INFO L93 Difference]: Finished difference Result 1106 states and 1464 transitions. [2022-04-28 10:15:34,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:15:34,296 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 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 37 [2022-04-28 10:15:34,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:15:34,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 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-28 10:15:34,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 111 transitions. [2022-04-28 10:15:34,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 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-28 10:15:34,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 111 transitions. [2022-04-28 10:15:34,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 111 transitions. [2022-04-28 10:15:34,403 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-28 10:15:34,444 INFO L225 Difference]: With dead ends: 1106 [2022-04-28 10:15:34,444 INFO L226 Difference]: Without dead ends: 1059 [2022-04-28 10:15:34,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 69 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-28 10:15:34,445 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 102 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:15:34,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 85 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:15:34,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2022-04-28 10:15:38,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 610. [2022-04-28 10:15:38,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:38,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1059 states. Second operand has 610 states, 605 states have (on average 1.3305785123966942) internal successors, (805), 605 states have internal predecessors, (805), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:38,502 INFO L74 IsIncluded]: Start isIncluded. First operand 1059 states. Second operand has 610 states, 605 states have (on average 1.3305785123966942) internal successors, (805), 605 states have internal predecessors, (805), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:38,503 INFO L87 Difference]: Start difference. First operand 1059 states. Second operand has 610 states, 605 states have (on average 1.3305785123966942) internal successors, (805), 605 states have internal predecessors, (805), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:38,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:38,531 INFO L93 Difference]: Finished difference Result 1059 states and 1396 transitions. [2022-04-28 10:15:38,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1396 transitions. [2022-04-28 10:15:38,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:38,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:38,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 610 states, 605 states have (on average 1.3305785123966942) internal successors, (805), 605 states have internal predecessors, (805), 3 states have call successors, (3), 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 1059 states. [2022-04-28 10:15:38,532 INFO L87 Difference]: Start difference. First operand has 610 states, 605 states have (on average 1.3305785123966942) internal successors, (805), 605 states have internal predecessors, (805), 3 states have call successors, (3), 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 1059 states. [2022-04-28 10:15:38,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:38,562 INFO L93 Difference]: Finished difference Result 1059 states and 1396 transitions. [2022-04-28 10:15:38,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1396 transitions. [2022-04-28 10:15:38,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:38,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:38,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:38,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:38,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 605 states have (on average 1.3305785123966942) internal successors, (805), 605 states have internal predecessors, (805), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:38,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 809 transitions. [2022-04-28 10:15:38,577 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 809 transitions. Word has length 37 [2022-04-28 10:15:38,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:38,577 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 809 transitions. [2022-04-28 10:15:38,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 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-28 10:15:38,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 610 states and 809 transitions. [2022-04-28 10:15:44,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 809 edges. 808 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:44,173 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 809 transitions. [2022-04-28 10:15:44,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:15:44,173 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:44,173 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:44,190 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-28 10:15:44,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:44,374 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:44,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:44,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1383297369, now seen corresponding path program 21 times [2022-04-28 10:15:44,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:44,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2025236537] [2022-04-28 10:15:44,377 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:44,377 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:44,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1383297369, now seen corresponding path program 22 times [2022-04-28 10:15:44,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:44,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294643848] [2022-04-28 10:15:44,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:44,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:44,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:44,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {114086#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {114066#true} is VALID [2022-04-28 10:15:44,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {114066#true} assume true; {114066#true} is VALID [2022-04-28 10:15:44,654 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {114066#true} {114066#true} #94#return; {114066#true} is VALID [2022-04-28 10:15:44,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {114066#true} call ULTIMATE.init(); {114086#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:44,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {114086#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {114066#true} is VALID [2022-04-28 10:15:44,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {114066#true} assume true; {114066#true} is VALID [2022-04-28 10:15:44,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114066#true} {114066#true} #94#return; {114066#true} is VALID [2022-04-28 10:15:44,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {114066#true} call #t~ret17 := main(); {114066#true} is VALID [2022-04-28 10:15:44,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {114066#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {114071#(= main_~y~0 0)} is VALID [2022-04-28 10:15:44,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {114071#(= 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; {114072#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:44,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {114072#(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; {114073#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:44,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {114073#(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; {114074#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:44,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {114074#(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; {114075#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:44,658 INFO L290 TraceCheckUtils]: 10: Hoare triple {114075#(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; {114076#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:44,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {114076#(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; {114077#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:44,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {114077#(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; {114078#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:44,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {114078#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {114078#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:44,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {114078#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {114079#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:15:44,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {114079#(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; {114080#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:15:44,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {114080#(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; {114081#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:15:44,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {114081#(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; {114082#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:15:44,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {114082#(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; {114083#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:15:44,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {114083#(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; {114084#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:15:44,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {114084#(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; {114085#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:15:44,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {114085#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {114067#false} is VALID [2022-04-28 10:15:44,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {114067#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114067#false} is VALID [2022-04-28 10:15:44,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {114067#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114067#false} is VALID [2022-04-28 10:15:44,664 INFO L290 TraceCheckUtils]: 24: Hoare triple {114067#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114067#false} is VALID [2022-04-28 10:15:44,664 INFO L290 TraceCheckUtils]: 25: Hoare triple {114067#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114067#false} is VALID [2022-04-28 10:15:44,664 INFO L290 TraceCheckUtils]: 26: Hoare triple {114067#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114067#false} is VALID [2022-04-28 10:15:44,664 INFO L290 TraceCheckUtils]: 27: Hoare triple {114067#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114067#false} is VALID [2022-04-28 10:15:44,664 INFO L290 TraceCheckUtils]: 28: Hoare triple {114067#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114067#false} is VALID [2022-04-28 10:15:44,664 INFO L290 TraceCheckUtils]: 29: Hoare triple {114067#false} assume !(~y~0 % 4294967296 > 0); {114067#false} is VALID [2022-04-28 10:15:44,664 INFO L290 TraceCheckUtils]: 30: Hoare triple {114067#false} assume !(~x~0 % 4294967296 > 0); {114067#false} is VALID [2022-04-28 10:15:44,664 INFO L290 TraceCheckUtils]: 31: Hoare triple {114067#false} assume !(~z~0 % 4294967296 > 0); {114067#false} is VALID [2022-04-28 10:15:44,664 INFO L290 TraceCheckUtils]: 32: Hoare triple {114067#false} assume !(~y~0 % 4294967296 > 0); {114067#false} is VALID [2022-04-28 10:15:44,664 INFO L272 TraceCheckUtils]: 33: Hoare triple {114067#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {114067#false} is VALID [2022-04-28 10:15:44,664 INFO L290 TraceCheckUtils]: 34: Hoare triple {114067#false} ~cond := #in~cond; {114067#false} is VALID [2022-04-28 10:15:44,665 INFO L290 TraceCheckUtils]: 35: Hoare triple {114067#false} assume 0 == ~cond; {114067#false} is VALID [2022-04-28 10:15:44,665 INFO L290 TraceCheckUtils]: 36: Hoare triple {114067#false} assume !false; {114067#false} is VALID [2022-04-28 10:15:44,665 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:15:44,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:44,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294643848] [2022-04-28 10:15:44,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294643848] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:44,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242015337] [2022-04-28 10:15:44,665 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:15:44,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:44,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:44,666 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-28 10:15:44,667 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-28 10:15:44,712 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:15:44,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:44,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 10:15:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:44,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:44,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {114066#true} call ULTIMATE.init(); {114066#true} is VALID [2022-04-28 10:15:44,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {114066#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {114066#true} is VALID [2022-04-28 10:15:44,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {114066#true} assume true; {114066#true} is VALID [2022-04-28 10:15:44,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114066#true} {114066#true} #94#return; {114066#true} is VALID [2022-04-28 10:15:44,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {114066#true} call #t~ret17 := main(); {114066#true} is VALID [2022-04-28 10:15:44,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {114066#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {114066#true} is VALID [2022-04-28 10:15:44,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {114066#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114066#true} is VALID [2022-04-28 10:15:44,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {114066#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114111#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:15:44,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {114111#(< 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; {114115#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:15:44,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {114115#(< 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; {114119#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:15:44,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {114119#(< 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; {114123#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:15:44,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {114123#(< 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; {114127#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:15:44,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {114127#(< 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; {114131#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:15:44,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {114131#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {114131#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:15:44,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {114131#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {114131#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:15:44,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {114131#(< 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; {114127#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:15:44,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {114127#(< 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; {114123#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:15:44,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {114123#(< 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; {114119#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:15:44,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {114119#(< 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; {114115#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:15:44,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {114115#(< 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; {114111#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:15:44,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {114111#(< 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; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:44,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {114156#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:44,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {114156#(< 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; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:44,987 INFO L290 TraceCheckUtils]: 23: Hoare triple {114156#(< 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; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:44,987 INFO L290 TraceCheckUtils]: 24: Hoare triple {114156#(< 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; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:44,988 INFO L290 TraceCheckUtils]: 25: Hoare triple {114156#(< 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; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:44,988 INFO L290 TraceCheckUtils]: 26: Hoare triple {114156#(< 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; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:44,989 INFO L290 TraceCheckUtils]: 27: Hoare triple {114156#(< 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; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:44,989 INFO L290 TraceCheckUtils]: 28: Hoare triple {114156#(< 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; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:44,989 INFO L290 TraceCheckUtils]: 29: Hoare triple {114156#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:44,990 INFO L290 TraceCheckUtils]: 30: Hoare triple {114156#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {114067#false} is VALID [2022-04-28 10:15:44,990 INFO L290 TraceCheckUtils]: 31: Hoare triple {114067#false} assume !(~z~0 % 4294967296 > 0); {114067#false} is VALID [2022-04-28 10:15:44,990 INFO L290 TraceCheckUtils]: 32: Hoare triple {114067#false} assume !(~y~0 % 4294967296 > 0); {114067#false} is VALID [2022-04-28 10:15:44,990 INFO L272 TraceCheckUtils]: 33: Hoare triple {114067#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {114067#false} is VALID [2022-04-28 10:15:44,990 INFO L290 TraceCheckUtils]: 34: Hoare triple {114067#false} ~cond := #in~cond; {114067#false} is VALID [2022-04-28 10:15:44,990 INFO L290 TraceCheckUtils]: 35: Hoare triple {114067#false} assume 0 == ~cond; {114067#false} is VALID [2022-04-28 10:15:44,990 INFO L290 TraceCheckUtils]: 36: Hoare triple {114067#false} assume !false; {114067#false} is VALID [2022-04-28 10:15:44,990 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-28 10:15:44,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:45,138 INFO L290 TraceCheckUtils]: 36: Hoare triple {114067#false} assume !false; {114067#false} is VALID [2022-04-28 10:15:45,138 INFO L290 TraceCheckUtils]: 35: Hoare triple {114067#false} assume 0 == ~cond; {114067#false} is VALID [2022-04-28 10:15:45,138 INFO L290 TraceCheckUtils]: 34: Hoare triple {114067#false} ~cond := #in~cond; {114067#false} is VALID [2022-04-28 10:15:45,138 INFO L272 TraceCheckUtils]: 33: Hoare triple {114067#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {114067#false} is VALID [2022-04-28 10:15:45,138 INFO L290 TraceCheckUtils]: 32: Hoare triple {114067#false} assume !(~y~0 % 4294967296 > 0); {114067#false} is VALID [2022-04-28 10:15:45,138 INFO L290 TraceCheckUtils]: 31: Hoare triple {114067#false} assume !(~z~0 % 4294967296 > 0); {114067#false} is VALID [2022-04-28 10:15:45,139 INFO L290 TraceCheckUtils]: 30: Hoare triple {114156#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {114067#false} is VALID [2022-04-28 10:15:45,139 INFO L290 TraceCheckUtils]: 29: Hoare triple {114156#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:45,140 INFO L290 TraceCheckUtils]: 28: Hoare triple {114156#(< 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; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:45,140 INFO L290 TraceCheckUtils]: 27: Hoare triple {114156#(< 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; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:45,140 INFO L290 TraceCheckUtils]: 26: Hoare triple {114156#(< 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; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:45,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {114156#(< 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; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:45,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {114156#(< 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; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:45,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {114156#(< 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; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:45,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {114156#(< 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; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:45,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {114156#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:45,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {114111#(< 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; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:45,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {114115#(< 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; {114111#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:15:45,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {114119#(< 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; {114115#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:15:45,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {114123#(< 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; {114119#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:15:45,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {114127#(< 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; {114123#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:15:45,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {114131#(< 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; {114127#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:15:45,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {114131#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {114131#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:15:45,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {114131#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {114131#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:15:45,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {114127#(< 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; {114131#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:15:45,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {114123#(< 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; {114127#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:15:45,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {114119#(< 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; {114123#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:15:45,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {114115#(< 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; {114119#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:15:45,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {114111#(< 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; {114115#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:15:45,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {114066#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114111#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:15:45,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {114066#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114066#true} is VALID [2022-04-28 10:15:45,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {114066#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {114066#true} is VALID [2022-04-28 10:15:45,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {114066#true} call #t~ret17 := main(); {114066#true} is VALID [2022-04-28 10:15:45,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114066#true} {114066#true} #94#return; {114066#true} is VALID [2022-04-28 10:15:45,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {114066#true} assume true; {114066#true} is VALID [2022-04-28 10:15:45,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {114066#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {114066#true} is VALID [2022-04-28 10:15:45,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {114066#true} call ULTIMATE.init(); {114066#true} is VALID [2022-04-28 10:15:45,152 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-28 10:15:45,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242015337] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:45,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:45,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 25 [2022-04-28 10:15:45,152 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:45,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2025236537] [2022-04-28 10:15:45,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2025236537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:45,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:45,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:15:45,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824525602] [2022-04-28 10:15:45,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:45,153 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-28 10:15:45,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:45,153 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-28 10:15:45,174 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-28 10:15:45,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:15:45,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:45,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:15:45,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2022-04-28 10:15:45,174 INFO L87 Difference]: Start difference. First operand 610 states and 809 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-28 10:15:51,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:51,912 INFO L93 Difference]: Finished difference Result 720 states and 978 transitions. [2022-04-28 10:15:51,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 10:15:51,912 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-28 10:15:51,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:15:51,912 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-28 10:15:51,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 128 transitions. [2022-04-28 10:15:51,913 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-28 10:15:51,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 128 transitions. [2022-04-28 10:15:51,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 128 transitions. [2022-04-28 10:15:52,015 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-28 10:15:52,034 INFO L225 Difference]: With dead ends: 720 [2022-04-28 10:15:52,034 INFO L226 Difference]: Without dead ends: 644 [2022-04-28 10:15:52,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=253, Invalid=2717, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 10:15:52,035 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 79 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:15:52,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 111 Invalid, 1288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:15:52,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2022-04-28 10:15:56,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 611. [2022-04-28 10:15:56,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:56,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 644 states. Second operand has 611 states, 606 states have (on average 1.33003300330033) internal successors, (806), 606 states have internal predecessors, (806), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:56,011 INFO L74 IsIncluded]: Start isIncluded. First operand 644 states. Second operand has 611 states, 606 states have (on average 1.33003300330033) internal successors, (806), 606 states have internal predecessors, (806), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:56,012 INFO L87 Difference]: Start difference. First operand 644 states. Second operand has 611 states, 606 states have (on average 1.33003300330033) internal successors, (806), 606 states have internal predecessors, (806), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:56,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:56,023 INFO L93 Difference]: Finished difference Result 644 states and 859 transitions. [2022-04-28 10:15:56,023 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 859 transitions. [2022-04-28 10:15:56,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:56,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:56,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 611 states, 606 states have (on average 1.33003300330033) internal successors, (806), 606 states have internal predecessors, (806), 3 states have call successors, (3), 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 644 states. [2022-04-28 10:15:56,024 INFO L87 Difference]: Start difference. First operand has 611 states, 606 states have (on average 1.33003300330033) internal successors, (806), 606 states have internal predecessors, (806), 3 states have call successors, (3), 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 644 states. [2022-04-28 10:15:56,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:56,035 INFO L93 Difference]: Finished difference Result 644 states and 859 transitions. [2022-04-28 10:15:56,035 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 859 transitions. [2022-04-28 10:15:56,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:56,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:56,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:56,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 606 states have (on average 1.33003300330033) internal successors, (806), 606 states have internal predecessors, (806), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 810 transitions. [2022-04-28 10:15:56,050 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 810 transitions. Word has length 37 [2022-04-28 10:15:56,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:56,050 INFO L495 AbstractCegarLoop]: Abstraction has 611 states and 810 transitions. [2022-04-28 10:15:56,050 INFO L496 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-28 10:15:56,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 611 states and 810 transitions. [2022-04-28 10:16:00,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 810 edges. 810 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:00,252 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 810 transitions. [2022-04-28 10:16:00,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:16:00,252 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:16:00,253 INFO L195 NwaCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:16:00,268 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-28 10:16:00,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-04-28 10:16:00,453 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:16:00,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:16:00,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1622108455, now seen corresponding path program 39 times [2022-04-28 10:16:00,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:00,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1862587895] [2022-04-28 10:16:00,456 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:16:00,456 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:16:00,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1622108455, now seen corresponding path program 40 times [2022-04-28 10:16:00,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:16:00,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842347903] [2022-04-28 10:16:00,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:16:00,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:16:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:00,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:16:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:00,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {118352#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {118325#true} is VALID [2022-04-28 10:16:00,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {118325#true} assume true; {118325#true} is VALID [2022-04-28 10:16:00,851 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118325#true} {118325#true} #94#return; {118325#true} is VALID [2022-04-28 10:16:00,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {118325#true} call ULTIMATE.init(); {118352#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:16:00,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {118352#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {118325#true} is VALID [2022-04-28 10:16:00,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {118325#true} assume true; {118325#true} is VALID [2022-04-28 10:16:00,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118325#true} {118325#true} #94#return; {118325#true} is VALID [2022-04-28 10:16:00,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {118325#true} call #t~ret17 := main(); {118325#true} is VALID [2022-04-28 10:16:00,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {118325#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {118330#(= main_~y~0 0)} is VALID [2022-04-28 10:16:00,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {118330#(= 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; {118331#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:00,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {118331#(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; {118332#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:00,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {118332#(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; {118333#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:00,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {118333#(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; {118334#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:00,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {118334#(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; {118335#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:00,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {118335#(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; {118336#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:00,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {118336#(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; {118337#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:00,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {118337#(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; {118338#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:00,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {118338#(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; {118339#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:00,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {118339#(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; {118340#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:00,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {118340#(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; {118341#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:00,859 INFO L290 TraceCheckUtils]: 17: Hoare triple {118341#(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; {118342#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:16:00,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {118342#(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; {118343#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:16:00,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {118343#(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; {118344#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:16:00,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {118344#(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; {118345#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:16:00,861 INFO L290 TraceCheckUtils]: 21: Hoare triple {118345#(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; {118346#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:16:00,861 INFO L290 TraceCheckUtils]: 22: Hoare triple {118346#(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; {118347#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:16:00,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {118347#(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; {118348#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:16:00,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {118348#(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; {118349#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:16:00,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {118349#(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; {118350#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:16:00,863 INFO L290 TraceCheckUtils]: 26: Hoare triple {118350#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~x~0 % 4294967296 > 0); {118350#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:16:00,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {118350#(and (<= 20 main_~y~0) (<= main_~y~0 20))} ~z~0 := ~y~0; {118351#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} is VALID [2022-04-28 10:16:00,864 INFO L290 TraceCheckUtils]: 28: Hoare triple {118351#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-28 10:16:00,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {118326#false} assume !(~y~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-28 10:16:00,864 INFO L290 TraceCheckUtils]: 30: Hoare triple {118326#false} assume !(~x~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-28 10:16:00,865 INFO L290 TraceCheckUtils]: 31: Hoare triple {118326#false} assume !(~z~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-28 10:16:00,865 INFO L290 TraceCheckUtils]: 32: Hoare triple {118326#false} assume !(~y~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-28 10:16:00,865 INFO L272 TraceCheckUtils]: 33: Hoare triple {118326#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {118326#false} is VALID [2022-04-28 10:16:00,865 INFO L290 TraceCheckUtils]: 34: Hoare triple {118326#false} ~cond := #in~cond; {118326#false} is VALID [2022-04-28 10:16:00,865 INFO L290 TraceCheckUtils]: 35: Hoare triple {118326#false} assume 0 == ~cond; {118326#false} is VALID [2022-04-28 10:16:00,865 INFO L290 TraceCheckUtils]: 36: Hoare triple {118326#false} assume !false; {118326#false} is VALID [2022-04-28 10:16:00,865 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:16:00,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:16:00,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842347903] [2022-04-28 10:16:00,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842347903] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:16:00,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705013068] [2022-04-28 10:16:00,865 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:16:00,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:00,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:16:00,876 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-28 10:16:00,876 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-28 10:16:00,922 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:16:00,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:16:00,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 10:16:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:00,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:16:01,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {118325#true} call ULTIMATE.init(); {118325#true} is VALID [2022-04-28 10:16:01,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {118325#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {118325#true} is VALID [2022-04-28 10:16:01,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {118325#true} assume true; {118325#true} is VALID [2022-04-28 10:16:01,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118325#true} {118325#true} #94#return; {118325#true} is VALID [2022-04-28 10:16:01,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {118325#true} call #t~ret17 := main(); {118325#true} is VALID [2022-04-28 10:16:01,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {118325#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {118330#(= main_~y~0 0)} is VALID [2022-04-28 10:16:01,255 INFO L290 TraceCheckUtils]: 6: Hoare triple {118330#(= 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; {118331#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:01,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {118331#(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; {118332#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:01,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {118332#(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; {118333#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:01,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {118333#(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; {118334#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:01,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {118334#(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; {118335#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:01,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {118335#(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; {118336#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:01,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {118336#(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; {118337#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:01,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {118337#(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; {118338#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:01,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {118338#(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; {118339#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:01,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {118339#(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; {118340#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:01,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {118340#(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; {118341#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:01,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {118341#(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; {118342#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:16:01,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {118342#(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; {118343#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:16:01,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {118343#(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; {118344#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:16:01,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {118344#(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; {118345#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:16:01,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {118345#(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; {118346#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:16:01,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {118346#(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; {118347#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:16:01,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {118347#(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; {118348#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:16:01,265 INFO L290 TraceCheckUtils]: 24: Hoare triple {118348#(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; {118349#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:16:01,265 INFO L290 TraceCheckUtils]: 25: Hoare triple {118349#(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; {118350#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:16:01,266 INFO L290 TraceCheckUtils]: 26: Hoare triple {118350#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~x~0 % 4294967296 > 0); {118350#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:16:01,266 INFO L290 TraceCheckUtils]: 27: Hoare triple {118350#(and (<= 20 main_~y~0) (<= main_~y~0 20))} ~z~0 := ~y~0; {118437#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-28 10:16:01,266 INFO L290 TraceCheckUtils]: 28: Hoare triple {118437#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-28 10:16:01,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {118326#false} assume !(~y~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-28 10:16:01,267 INFO L290 TraceCheckUtils]: 30: Hoare triple {118326#false} assume !(~x~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-28 10:16:01,267 INFO L290 TraceCheckUtils]: 31: Hoare triple {118326#false} assume !(~z~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-28 10:16:01,267 INFO L290 TraceCheckUtils]: 32: Hoare triple {118326#false} assume !(~y~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-28 10:16:01,267 INFO L272 TraceCheckUtils]: 33: Hoare triple {118326#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {118326#false} is VALID [2022-04-28 10:16:01,267 INFO L290 TraceCheckUtils]: 34: Hoare triple {118326#false} ~cond := #in~cond; {118326#false} is VALID [2022-04-28 10:16:01,267 INFO L290 TraceCheckUtils]: 35: Hoare triple {118326#false} assume 0 == ~cond; {118326#false} is VALID [2022-04-28 10:16:01,267 INFO L290 TraceCheckUtils]: 36: Hoare triple {118326#false} assume !false; {118326#false} is VALID [2022-04-28 10:16:01,267 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:16:01,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:16:02,096 INFO L290 TraceCheckUtils]: 36: Hoare triple {118326#false} assume !false; {118326#false} is VALID [2022-04-28 10:16:02,096 INFO L290 TraceCheckUtils]: 35: Hoare triple {118326#false} assume 0 == ~cond; {118326#false} is VALID [2022-04-28 10:16:02,096 INFO L290 TraceCheckUtils]: 34: Hoare triple {118326#false} ~cond := #in~cond; {118326#false} is VALID [2022-04-28 10:16:02,096 INFO L272 TraceCheckUtils]: 33: Hoare triple {118326#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {118326#false} is VALID [2022-04-28 10:16:02,097 INFO L290 TraceCheckUtils]: 32: Hoare triple {118326#false} assume !(~y~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-28 10:16:02,097 INFO L290 TraceCheckUtils]: 31: Hoare triple {118326#false} assume !(~z~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-28 10:16:02,097 INFO L290 TraceCheckUtils]: 30: Hoare triple {118326#false} assume !(~x~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-28 10:16:02,097 INFO L290 TraceCheckUtils]: 29: Hoare triple {118326#false} assume !(~y~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-28 10:16:02,097 INFO L290 TraceCheckUtils]: 28: Hoare triple {118489#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-28 10:16:02,097 INFO L290 TraceCheckUtils]: 27: Hoare triple {118493#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {118489#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:16:02,098 INFO L290 TraceCheckUtils]: 26: Hoare triple {118493#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {118493#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:16:02,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {118500#(< 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; {118493#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:16:02,099 INFO L290 TraceCheckUtils]: 24: Hoare triple {118504#(< 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; {118500#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:16:02,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {118508#(< 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; {118504#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:16:02,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {118512#(< 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; {118508#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:16:02,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {118516#(< 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; {118512#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:16:02,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {118520#(< 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; {118516#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:02,103 INFO L290 TraceCheckUtils]: 19: Hoare triple {118524#(< 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; {118520#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:16:02,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {118528#(< 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; {118524#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:02,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {118532#(< 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; {118528#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:16:02,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {118536#(< 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; {118532#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:16:02,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {118540#(< 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; {118536#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:16:02,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {118544#(< 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; {118540#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:16:02,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {118548#(< 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; {118544#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:16:02,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {118552#(< 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; {118548#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:16:02,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {118556#(< 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; {118552#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:16:02,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {118560#(< 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; {118556#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:16:02,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {118564#(< 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; {118560#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:16:02,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {118568#(< 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; {118564#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:16:02,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {118572#(< 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; {118568#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:16:02,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {118576#(< 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; {118572#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:02,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {118325#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {118576#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:16:02,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {118325#true} call #t~ret17 := main(); {118325#true} is VALID [2022-04-28 10:16:02,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118325#true} {118325#true} #94#return; {118325#true} is VALID [2022-04-28 10:16:02,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {118325#true} assume true; {118325#true} is VALID [2022-04-28 10:16:02,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {118325#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {118325#true} is VALID [2022-04-28 10:16:02,113 INFO L272 TraceCheckUtils]: 0: Hoare triple {118325#true} call ULTIMATE.init(); {118325#true} is VALID [2022-04-28 10:16:02,113 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:16:02,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705013068] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:16:02,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:16:02,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-28 10:16:02,114 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:16:02,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1862587895] [2022-04-28 10:16:02,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1862587895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:16:02,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:16:02,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:16:02,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725645755] [2022-04-28 10:16:02,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:16:02,114 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 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-28 10:16:02,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:16:02,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 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-28 10:16:02,137 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-28 10:16:02,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:16:02,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:02,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:16:02,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=1720, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:16:02,138 INFO L87 Difference]: Start difference. First operand 611 states and 810 transitions. Second operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 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-28 10:16:14,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:14,624 INFO L93 Difference]: Finished difference Result 862 states and 1270 transitions. [2022-04-28 10:16:14,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:16:14,624 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 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-28 10:16:14,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:16:14,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 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-28 10:16:14,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 295 transitions. [2022-04-28 10:16:14,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 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-28 10:16:14,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 295 transitions. [2022-04-28 10:16:14,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 295 transitions. [2022-04-28 10:16:14,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 295 edges. 295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:14,903 INFO L225 Difference]: With dead ends: 862 [2022-04-28 10:16:14,903 INFO L226 Difference]: Without dead ends: 838 [2022-04-28 10:16:14,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1088, Invalid=3742, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 10:16:14,905 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 244 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4730 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 4894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 4730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:16:14,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 235 Invalid, 4894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 4730 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-28 10:16:14,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2022-04-28 10:16:19,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 639. [2022-04-28 10:16:19,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:16:19,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 838 states. Second operand has 639 states, 634 states have (on average 1.334384858044164) internal successors, (846), 634 states have internal predecessors, (846), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:19,129 INFO L74 IsIncluded]: Start isIncluded. First operand 838 states. Second operand has 639 states, 634 states have (on average 1.334384858044164) internal successors, (846), 634 states have internal predecessors, (846), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:19,129 INFO L87 Difference]: Start difference. First operand 838 states. Second operand has 639 states, 634 states have (on average 1.334384858044164) internal successors, (846), 634 states have internal predecessors, (846), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:19,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:19,148 INFO L93 Difference]: Finished difference Result 838 states and 1089 transitions. [2022-04-28 10:16:19,148 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1089 transitions. [2022-04-28 10:16:19,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:19,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:19,149 INFO L74 IsIncluded]: Start isIncluded. First operand has 639 states, 634 states have (on average 1.334384858044164) internal successors, (846), 634 states have internal predecessors, (846), 3 states have call successors, (3), 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 838 states. [2022-04-28 10:16:19,149 INFO L87 Difference]: Start difference. First operand has 639 states, 634 states have (on average 1.334384858044164) internal successors, (846), 634 states have internal predecessors, (846), 3 states have call successors, (3), 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 838 states. [2022-04-28 10:16:19,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:19,168 INFO L93 Difference]: Finished difference Result 838 states and 1089 transitions. [2022-04-28 10:16:19,168 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1089 transitions. [2022-04-28 10:16:19,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:19,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:19,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:16:19,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:16:19,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 634 states have (on average 1.334384858044164) internal successors, (846), 634 states have internal predecessors, (846), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:19,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 850 transitions. [2022-04-28 10:16:19,189 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 850 transitions. Word has length 37 [2022-04-28 10:16:19,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:16:19,189 INFO L495 AbstractCegarLoop]: Abstraction has 639 states and 850 transitions. [2022-04-28 10:16:19,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 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-28 10:16:19,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 639 states and 850 transitions. [2022-04-28 10:16:23,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 850 edges. 850 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:23,267 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 850 transitions. [2022-04-28 10:16:23,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:16:23,268 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:16:23,268 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:16:23,286 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-28 10:16:23,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-04-28 10:16:23,469 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:16:23,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:16:23,469 INFO L85 PathProgramCache]: Analyzing trace with hash -2000192251, now seen corresponding path program 23 times [2022-04-28 10:16:23,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:23,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [825753337] [2022-04-28 10:16:23,476 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:16:23,476 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:16:23,477 INFO L85 PathProgramCache]: Analyzing trace with hash -2000192251, now seen corresponding path program 24 times [2022-04-28 10:16:23,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:16:23,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572102596] [2022-04-28 10:16:23,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:16:23,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:16:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:23,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:16:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:23,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {123341#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {123319#true} is VALID [2022-04-28 10:16:23,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {123319#true} assume true; {123319#true} is VALID [2022-04-28 10:16:23,785 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {123319#true} {123319#true} #94#return; {123319#true} is VALID [2022-04-28 10:16:23,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {123319#true} call ULTIMATE.init(); {123341#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:16:23,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {123341#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {123319#true} is VALID [2022-04-28 10:16:23,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {123319#true} assume true; {123319#true} is VALID [2022-04-28 10:16:23,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123319#true} {123319#true} #94#return; {123319#true} is VALID [2022-04-28 10:16:23,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {123319#true} call #t~ret17 := main(); {123319#true} is VALID [2022-04-28 10:16:23,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {123319#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {123324#(= main_~y~0 0)} is VALID [2022-04-28 10:16:23,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {123324#(= 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; {123325#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:23,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {123325#(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; {123326#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:23,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {123326#(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; {123327#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:23,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {123327#(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; {123328#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:23,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {123328#(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; {123329#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:23,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {123329#(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; {123330#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:23,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {123330#(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; {123331#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:23,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {123331#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {123331#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:23,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {123331#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {123332#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:16:23,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {123332#(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; {123333#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:16:23,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {123333#(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; {123334#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:16:23,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {123334#(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; {123335#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:16:23,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {123335#(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; {123336#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:16:23,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {123336#(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; {123337#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:16:23,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {123337#(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; {123338#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:16:23,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {123338#(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; {123339#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:16:23,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {123339#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {123339#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:16:23,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {123339#(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; {123338#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:16:23,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {123338#(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; {123337#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:16:23,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {123337#(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; {123336#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:16:23,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {123336#(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; {123335#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:16:23,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {123335#(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; {123334#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:16:23,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {123334#(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; {123333#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:16:23,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {123333#(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; {123340#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:16:23,799 INFO L290 TraceCheckUtils]: 30: Hoare triple {123340#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {123340#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:16:23,799 INFO L290 TraceCheckUtils]: 31: Hoare triple {123340#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {123340#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:16:23,800 INFO L290 TraceCheckUtils]: 32: Hoare triple {123340#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {123320#false} is VALID [2022-04-28 10:16:23,800 INFO L290 TraceCheckUtils]: 33: Hoare triple {123320#false} assume !(~y~0 % 4294967296 > 0); {123320#false} is VALID [2022-04-28 10:16:23,800 INFO L272 TraceCheckUtils]: 34: Hoare triple {123320#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {123320#false} is VALID [2022-04-28 10:16:23,800 INFO L290 TraceCheckUtils]: 35: Hoare triple {123320#false} ~cond := #in~cond; {123320#false} is VALID [2022-04-28 10:16:23,800 INFO L290 TraceCheckUtils]: 36: Hoare triple {123320#false} assume 0 == ~cond; {123320#false} is VALID [2022-04-28 10:16:23,800 INFO L290 TraceCheckUtils]: 37: Hoare triple {123320#false} assume !false; {123320#false} is VALID [2022-04-28 10:16:23,800 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:16:23,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:16:23,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572102596] [2022-04-28 10:16:23,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572102596] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:16:23,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056519836] [2022-04-28 10:16:23,801 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:16:23,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:23,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:16:23,802 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-28 10:16:23,803 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-28 10:16:23,884 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:16:23,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:16:23,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:16:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:23,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:16:24,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {123319#true} call ULTIMATE.init(); {123319#true} is VALID [2022-04-28 10:16:24,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {123319#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {123319#true} is VALID [2022-04-28 10:16:24,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {123319#true} assume true; {123319#true} is VALID [2022-04-28 10:16:24,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123319#true} {123319#true} #94#return; {123319#true} is VALID [2022-04-28 10:16:24,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {123319#true} call #t~ret17 := main(); {123319#true} is VALID [2022-04-28 10:16:24,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {123319#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {123319#true} is VALID [2022-04-28 10:16:24,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {123319#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123363#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:16:24,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {123363#(< 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; {123367#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:16:24,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {123367#(< 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; {123371#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:16:24,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {123371#(< 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; {123375#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:16:24,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {123375#(< 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; {123379#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:24,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {123379#(< 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; {123383#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:16:24,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {123383#(< 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; {123387#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:24,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {123387#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {123387#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:24,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {123387#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {123387#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:24,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {123387#(< 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; {123383#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:16:24,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {123383#(< 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; {123379#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:24,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {123379#(< 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; {123375#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:16:24,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {123375#(< 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; {123371#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:16:24,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {123371#(< 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; {123367#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:16:24,195 INFO L290 TraceCheckUtils]: 20: Hoare triple {123367#(< 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; {123363#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:16:24,196 INFO L290 TraceCheckUtils]: 21: Hoare triple {123363#(< 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; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:24,196 INFO L290 TraceCheckUtils]: 22: Hoare triple {123415#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:24,196 INFO L290 TraceCheckUtils]: 23: Hoare triple {123415#(< 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; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:24,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {123415#(< 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; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:24,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {123415#(< 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; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:24,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {123415#(< 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; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:24,197 INFO L290 TraceCheckUtils]: 27: Hoare triple {123415#(< 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; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:24,198 INFO L290 TraceCheckUtils]: 28: Hoare triple {123415#(< 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; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:24,198 INFO L290 TraceCheckUtils]: 29: Hoare triple {123415#(< 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; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:24,198 INFO L290 TraceCheckUtils]: 30: Hoare triple {123415#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:24,199 INFO L290 TraceCheckUtils]: 31: Hoare triple {123415#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {123320#false} is VALID [2022-04-28 10:16:24,199 INFO L290 TraceCheckUtils]: 32: Hoare triple {123320#false} assume !(~z~0 % 4294967296 > 0); {123320#false} is VALID [2022-04-28 10:16:24,199 INFO L290 TraceCheckUtils]: 33: Hoare triple {123320#false} assume !(~y~0 % 4294967296 > 0); {123320#false} is VALID [2022-04-28 10:16:24,199 INFO L272 TraceCheckUtils]: 34: Hoare triple {123320#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {123320#false} is VALID [2022-04-28 10:16:24,199 INFO L290 TraceCheckUtils]: 35: Hoare triple {123320#false} ~cond := #in~cond; {123320#false} is VALID [2022-04-28 10:16:24,199 INFO L290 TraceCheckUtils]: 36: Hoare triple {123320#false} assume 0 == ~cond; {123320#false} is VALID [2022-04-28 10:16:24,199 INFO L290 TraceCheckUtils]: 37: Hoare triple {123320#false} assume !false; {123320#false} is VALID [2022-04-28 10:16:24,199 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:16:24,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:16:24,375 INFO L290 TraceCheckUtils]: 37: Hoare triple {123320#false} assume !false; {123320#false} is VALID [2022-04-28 10:16:24,376 INFO L290 TraceCheckUtils]: 36: Hoare triple {123320#false} assume 0 == ~cond; {123320#false} is VALID [2022-04-28 10:16:24,376 INFO L290 TraceCheckUtils]: 35: Hoare triple {123320#false} ~cond := #in~cond; {123320#false} is VALID [2022-04-28 10:16:24,376 INFO L272 TraceCheckUtils]: 34: Hoare triple {123320#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {123320#false} is VALID [2022-04-28 10:16:24,376 INFO L290 TraceCheckUtils]: 33: Hoare triple {123320#false} assume !(~y~0 % 4294967296 > 0); {123320#false} is VALID [2022-04-28 10:16:24,376 INFO L290 TraceCheckUtils]: 32: Hoare triple {123320#false} assume !(~z~0 % 4294967296 > 0); {123320#false} is VALID [2022-04-28 10:16:24,376 INFO L290 TraceCheckUtils]: 31: Hoare triple {123415#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {123320#false} is VALID [2022-04-28 10:16:24,376 INFO L290 TraceCheckUtils]: 30: Hoare triple {123415#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:24,377 INFO L290 TraceCheckUtils]: 29: Hoare triple {123415#(< 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; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:24,377 INFO L290 TraceCheckUtils]: 28: Hoare triple {123415#(< 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; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:24,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {123415#(< 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; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:24,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {123415#(< 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; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:24,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {123415#(< 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; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:24,378 INFO L290 TraceCheckUtils]: 24: Hoare triple {123415#(< 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; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:24,378 INFO L290 TraceCheckUtils]: 23: Hoare triple {123415#(< 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; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:24,379 INFO L290 TraceCheckUtils]: 22: Hoare triple {123415#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:24,379 INFO L290 TraceCheckUtils]: 21: Hoare triple {123363#(< 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; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:24,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {123367#(< 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; {123363#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:16:24,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {123371#(< 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; {123367#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:16:24,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {123375#(< 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; {123371#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:16:24,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {123379#(< 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; {123375#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:16:24,383 INFO L290 TraceCheckUtils]: 16: Hoare triple {123383#(< 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; {123379#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:24,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {123387#(< 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; {123383#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:16:24,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {123387#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {123387#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:24,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {123387#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {123387#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:24,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {123383#(< 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; {123387#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:24,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {123379#(< 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; {123383#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:16:24,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {123375#(< 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; {123379#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:24,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {123371#(< 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; {123375#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:16:24,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {123367#(< 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; {123371#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:16:24,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {123363#(< 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; {123367#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:16:24,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {123319#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123363#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:16:24,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {123319#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {123319#true} is VALID [2022-04-28 10:16:24,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {123319#true} call #t~ret17 := main(); {123319#true} is VALID [2022-04-28 10:16:24,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123319#true} {123319#true} #94#return; {123319#true} is VALID [2022-04-28 10:16:24,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {123319#true} assume true; {123319#true} is VALID [2022-04-28 10:16:24,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {123319#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {123319#true} is VALID [2022-04-28 10:16:24,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {123319#true} call ULTIMATE.init(); {123319#true} is VALID [2022-04-28 10:16:24,390 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:16:24,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056519836] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:16:24,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:16:24,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 28 [2022-04-28 10:16:24,390 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:16:24,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [825753337] [2022-04-28 10:16:24,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [825753337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:16:24,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:16:24,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:16:24,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240368240] [2022-04-28 10:16:24,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:16:24,391 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-28 10:16:24,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:16:24,391 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-28 10:16:24,418 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-28 10:16:24,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:16:24,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:24,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:16:24,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:16:24,419 INFO L87 Difference]: Start difference. First operand 639 states and 850 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-28 10:16:43,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:43,056 INFO L93 Difference]: Finished difference Result 1104 states and 1567 transitions. [2022-04-28 10:16:43,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-04-28 10:16:43,056 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-28 10:16:43,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:16:43,056 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-28 10:16:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 384 transitions. [2022-04-28 10:16:43,059 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-28 10:16:43,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 384 transitions. [2022-04-28 10:16:43,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 384 transitions. [2022-04-28 10:16:43,403 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-28 10:16:43,441 INFO L225 Difference]: With dead ends: 1104 [2022-04-28 10:16:43,442 INFO L226 Difference]: Without dead ends: 1024 [2022-04-28 10:16:43,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3175 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=588, Invalid=11184, Unknown=0, NotChecked=0, Total=11772 [2022-04-28 10:16:43,443 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 153 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 3594 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 3997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 3594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:16:43,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 128 Invalid, 3997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 3594 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-28 10:16:43,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2022-04-28 10:16:48,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 691. [2022-04-28 10:16:48,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:16:48,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1024 states. Second operand has 691 states, 686 states have (on average 1.3396501457725947) internal successors, (919), 686 states have internal predecessors, (919), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:48,509 INFO L74 IsIncluded]: Start isIncluded. First operand 1024 states. Second operand has 691 states, 686 states have (on average 1.3396501457725947) internal successors, (919), 686 states have internal predecessors, (919), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:48,509 INFO L87 Difference]: Start difference. First operand 1024 states. Second operand has 691 states, 686 states have (on average 1.3396501457725947) internal successors, (919), 686 states have internal predecessors, (919), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:48,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:48,536 INFO L93 Difference]: Finished difference Result 1024 states and 1265 transitions. [2022-04-28 10:16:48,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1265 transitions. [2022-04-28 10:16:48,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:48,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:48,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 691 states, 686 states have (on average 1.3396501457725947) internal successors, (919), 686 states have internal predecessors, (919), 3 states have call successors, (3), 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 1024 states. [2022-04-28 10:16:48,538 INFO L87 Difference]: Start difference. First operand has 691 states, 686 states have (on average 1.3396501457725947) internal successors, (919), 686 states have internal predecessors, (919), 3 states have call successors, (3), 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 1024 states. [2022-04-28 10:16:48,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:48,565 INFO L93 Difference]: Finished difference Result 1024 states and 1265 transitions. [2022-04-28 10:16:48,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1265 transitions. [2022-04-28 10:16:48,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:48,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:48,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:16:48,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:16:48,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 686 states have (on average 1.3396501457725947) internal successors, (919), 686 states have internal predecessors, (919), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:48,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 923 transitions. [2022-04-28 10:16:48,587 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 923 transitions. Word has length 38 [2022-04-28 10:16:48,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:16:48,587 INFO L495 AbstractCegarLoop]: Abstraction has 691 states and 923 transitions. [2022-04-28 10:16:48,587 INFO L496 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-28 10:16:48,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 691 states and 923 transitions. [2022-04-28 10:16:52,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 923 edges. 923 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:52,280 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 923 transitions. [2022-04-28 10:16:52,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:16:52,281 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:16:52,281 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:16:52,297 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-28 10:16:52,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:52,482 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:16:52,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:16:52,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1001175461, now seen corresponding path program 13 times [2022-04-28 10:16:52,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:52,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [588570274] [2022-04-28 10:16:52,484 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:16:52,484 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:16:52,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1001175461, now seen corresponding path program 14 times [2022-04-28 10:16:52,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:16:52,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957073428] [2022-04-28 10:16:52,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:16:52,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:16:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:52,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:16:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:52,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {129394#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {129377#true} is VALID [2022-04-28 10:16:52,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {129377#true} assume true; {129377#true} is VALID [2022-04-28 10:16:52,688 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {129377#true} {129377#true} #94#return; {129377#true} is VALID [2022-04-28 10:16:52,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {129377#true} call ULTIMATE.init(); {129394#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:16:52,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {129394#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {129377#true} is VALID [2022-04-28 10:16:52,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {129377#true} assume true; {129377#true} is VALID [2022-04-28 10:16:52,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {129377#true} {129377#true} #94#return; {129377#true} is VALID [2022-04-28 10:16:52,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {129377#true} call #t~ret17 := main(); {129377#true} is VALID [2022-04-28 10:16:52,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {129377#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {129382#(= main_~y~0 0)} is VALID [2022-04-28 10:16:52,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {129382#(= 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; {129383#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:52,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {129383#(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; {129384#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:52,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {129384#(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; {129385#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:52,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {129385#(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; {129386#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:52,692 INFO L290 TraceCheckUtils]: 10: Hoare triple {129386#(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; {129387#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:52,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {129387#(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; {129388#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:52,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {129388#(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; {129389#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:52,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {129389#(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; {129390#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:52,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {129390#(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; {129391#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:52,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {129391#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {129391#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:52,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {129391#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {129392#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:16:52,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {129392#(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; {129393#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:16:52,696 INFO L290 TraceCheckUtils]: 18: Hoare triple {129393#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-28 10:16:52,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-28 10:16:52,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-28 10:16:52,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-28 10:16:52,696 INFO L290 TraceCheckUtils]: 22: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-28 10:16:52,696 INFO L290 TraceCheckUtils]: 23: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-28 10:16:52,696 INFO L290 TraceCheckUtils]: 24: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-28 10:16:52,696 INFO L290 TraceCheckUtils]: 25: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-28 10:16:52,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-28 10:16:52,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-28 10:16:52,697 INFO L290 TraceCheckUtils]: 28: Hoare triple {129378#false} assume !(~y~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-28 10:16:52,697 INFO L290 TraceCheckUtils]: 29: Hoare triple {129378#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; {129378#false} is VALID [2022-04-28 10:16:52,697 INFO L290 TraceCheckUtils]: 30: Hoare triple {129378#false} assume !(~x~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-28 10:16:52,697 INFO L290 TraceCheckUtils]: 31: Hoare triple {129378#false} assume !(~z~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-28 10:16:52,697 INFO L290 TraceCheckUtils]: 32: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {129378#false} is VALID [2022-04-28 10:16:52,697 INFO L290 TraceCheckUtils]: 33: Hoare triple {129378#false} assume !(~y~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-28 10:16:52,697 INFO L272 TraceCheckUtils]: 34: Hoare triple {129378#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {129378#false} is VALID [2022-04-28 10:16:52,697 INFO L290 TraceCheckUtils]: 35: Hoare triple {129378#false} ~cond := #in~cond; {129378#false} is VALID [2022-04-28 10:16:52,697 INFO L290 TraceCheckUtils]: 36: Hoare triple {129378#false} assume 0 == ~cond; {129378#false} is VALID [2022-04-28 10:16:52,697 INFO L290 TraceCheckUtils]: 37: Hoare triple {129378#false} assume !false; {129378#false} is VALID [2022-04-28 10:16:52,697 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-04-28 10:16:52,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:16:52,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957073428] [2022-04-28 10:16:52,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957073428] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:16:52,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151279237] [2022-04-28 10:16:52,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:16:52,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:52,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:16:52,700 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-28 10:16:52,700 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-28 10:16:52,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:16:52,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:16:52,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:16:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:52,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:16:53,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {129377#true} call ULTIMATE.init(); {129377#true} is VALID [2022-04-28 10:16:53,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {129377#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {129377#true} is VALID [2022-04-28 10:16:53,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {129377#true} assume true; {129377#true} is VALID [2022-04-28 10:16:53,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {129377#true} {129377#true} #94#return; {129377#true} is VALID [2022-04-28 10:16:53,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {129377#true} call #t~ret17 := main(); {129377#true} is VALID [2022-04-28 10:16:53,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {129377#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {129382#(= main_~y~0 0)} is VALID [2022-04-28 10:16:53,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {129382#(= 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; {129383#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:53,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {129383#(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; {129384#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:53,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {129384#(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; {129385#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:53,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {129385#(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; {129386#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:53,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {129386#(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; {129387#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:53,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {129387#(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; {129388#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:53,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {129388#(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; {129389#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:53,011 INFO L290 TraceCheckUtils]: 13: Hoare triple {129389#(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; {129390#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:53,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {129390#(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; {129391#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:53,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {129391#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {129391#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:53,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {129391#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {129392#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:16:53,013 INFO L290 TraceCheckUtils]: 17: Hoare triple {129392#(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; {129449#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:16:53,013 INFO L290 TraceCheckUtils]: 18: Hoare triple {129449#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-28 10:16:53,013 INFO L290 TraceCheckUtils]: 19: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-28 10:16:53,013 INFO L290 TraceCheckUtils]: 20: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-28 10:16:53,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-28 10:16:53,014 INFO L290 TraceCheckUtils]: 22: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-28 10:16:53,014 INFO L290 TraceCheckUtils]: 23: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-28 10:16:53,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-28 10:16:53,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-28 10:16:53,014 INFO L290 TraceCheckUtils]: 26: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-28 10:16:53,014 INFO L290 TraceCheckUtils]: 27: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-28 10:16:53,014 INFO L290 TraceCheckUtils]: 28: Hoare triple {129378#false} assume !(~y~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-28 10:16:53,014 INFO L290 TraceCheckUtils]: 29: Hoare triple {129378#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; {129378#false} is VALID [2022-04-28 10:16:53,014 INFO L290 TraceCheckUtils]: 30: Hoare triple {129378#false} assume !(~x~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-28 10:16:53,014 INFO L290 TraceCheckUtils]: 31: Hoare triple {129378#false} assume !(~z~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-28 10:16:53,014 INFO L290 TraceCheckUtils]: 32: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {129378#false} is VALID [2022-04-28 10:16:53,014 INFO L290 TraceCheckUtils]: 33: Hoare triple {129378#false} assume !(~y~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-28 10:16:53,014 INFO L272 TraceCheckUtils]: 34: Hoare triple {129378#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {129378#false} is VALID [2022-04-28 10:16:53,014 INFO L290 TraceCheckUtils]: 35: Hoare triple {129378#false} ~cond := #in~cond; {129378#false} is VALID [2022-04-28 10:16:53,015 INFO L290 TraceCheckUtils]: 36: Hoare triple {129378#false} assume 0 == ~cond; {129378#false} is VALID [2022-04-28 10:16:53,015 INFO L290 TraceCheckUtils]: 37: Hoare triple {129378#false} assume !false; {129378#false} is VALID [2022-04-28 10:16:53,015 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-04-28 10:16:53,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:16:53,331 INFO L290 TraceCheckUtils]: 37: Hoare triple {129378#false} assume !false; {129378#false} is VALID [2022-04-28 10:16:53,332 INFO L290 TraceCheckUtils]: 36: Hoare triple {129378#false} assume 0 == ~cond; {129378#false} is VALID [2022-04-28 10:16:53,332 INFO L290 TraceCheckUtils]: 35: Hoare triple {129378#false} ~cond := #in~cond; {129378#false} is VALID [2022-04-28 10:16:53,332 INFO L272 TraceCheckUtils]: 34: Hoare triple {129378#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {129378#false} is VALID [2022-04-28 10:16:53,332 INFO L290 TraceCheckUtils]: 33: Hoare triple {129378#false} assume !(~y~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-28 10:16:53,332 INFO L290 TraceCheckUtils]: 32: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {129378#false} is VALID [2022-04-28 10:16:53,332 INFO L290 TraceCheckUtils]: 31: Hoare triple {129378#false} assume !(~z~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-28 10:16:53,332 INFO L290 TraceCheckUtils]: 30: Hoare triple {129378#false} assume !(~x~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-28 10:16:53,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {129378#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; {129378#false} is VALID [2022-04-28 10:16:53,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {129378#false} assume !(~y~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-28 10:16:53,332 INFO L290 TraceCheckUtils]: 27: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-28 10:16:53,332 INFO L290 TraceCheckUtils]: 26: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-28 10:16:53,332 INFO L290 TraceCheckUtils]: 25: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-28 10:16:53,332 INFO L290 TraceCheckUtils]: 24: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-28 10:16:53,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-28 10:16:53,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-28 10:16:53,333 INFO L290 TraceCheckUtils]: 21: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-28 10:16:53,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-28 10:16:53,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-28 10:16:53,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {129567#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-28 10:16:53,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {129571#(< 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; {129567#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:16:53,334 INFO L290 TraceCheckUtils]: 16: Hoare triple {129575#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {129571#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:53,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {129575#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {129575#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:53,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {129582#(< 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; {129575#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:53,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {129586#(< 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; {129582#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:16:53,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {129590#(< 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; {129586#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:16:53,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {129594#(< 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; {129590#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:16:53,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {129598#(< 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; {129594#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:16:53,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {129602#(< 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; {129598#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:16:53,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {129606#(< 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; {129602#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:53,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {129610#(< 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; {129606#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:16:53,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {129614#(< 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; {129610#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:53,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {129377#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {129614#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:16:53,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {129377#true} call #t~ret17 := main(); {129377#true} is VALID [2022-04-28 10:16:53,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {129377#true} {129377#true} #94#return; {129377#true} is VALID [2022-04-28 10:16:53,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {129377#true} assume true; {129377#true} is VALID [2022-04-28 10:16:53,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {129377#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {129377#true} is VALID [2022-04-28 10:16:53,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {129377#true} call ULTIMATE.init(); {129377#true} is VALID [2022-04-28 10:16:53,342 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-04-28 10:16:53,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151279237] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:16:53,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:16:53,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:16:53,342 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:16:53,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [588570274] [2022-04-28 10:16:53,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [588570274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:16:53,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:16:53,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:16:53,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285124307] [2022-04-28 10:16:53,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:16:53,343 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 38 [2022-04-28 10:16:53,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:16:53,343 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-28 10:16:53,363 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-28 10:16:53,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:16:53,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:53,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:16:53,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:16:53,363 INFO L87 Difference]: Start difference. First operand 691 states and 923 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-28 10:17:01,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:01,052 INFO L93 Difference]: Finished difference Result 808 states and 1060 transitions. [2022-04-28 10:17:01,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:17:01,053 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 38 [2022-04-28 10:17:01,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:17:01,053 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-28 10:17:01,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 134 transitions. [2022-04-28 10:17:01,054 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-28 10:17:01,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 134 transitions. [2022-04-28 10:17:01,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 134 transitions. [2022-04-28 10:17:01,178 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-28 10:17:01,203 INFO L225 Difference]: With dead ends: 808 [2022-04-28 10:17:01,203 INFO L226 Difference]: Without dead ends: 788 [2022-04-28 10:17:01,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 65 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-28 10:17:01,204 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 117 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:17:01,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 120 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:17:01,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-04-28 10:17:06,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 691. [2022-04-28 10:17:06,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:17:06,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 788 states. Second operand has 691 states, 686 states have (on average 1.338192419825073) internal successors, (918), 686 states have internal predecessors, (918), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:06,321 INFO L74 IsIncluded]: Start isIncluded. First operand 788 states. Second operand has 691 states, 686 states have (on average 1.338192419825073) internal successors, (918), 686 states have internal predecessors, (918), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:06,321 INFO L87 Difference]: Start difference. First operand 788 states. Second operand has 691 states, 686 states have (on average 1.338192419825073) internal successors, (918), 686 states have internal predecessors, (918), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:06,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:06,338 INFO L93 Difference]: Finished difference Result 788 states and 1039 transitions. [2022-04-28 10:17:06,338 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1039 transitions. [2022-04-28 10:17:06,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:06,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:06,339 INFO L74 IsIncluded]: Start isIncluded. First operand has 691 states, 686 states have (on average 1.338192419825073) internal successors, (918), 686 states have internal predecessors, (918), 3 states have call successors, (3), 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 788 states. [2022-04-28 10:17:06,340 INFO L87 Difference]: Start difference. First operand has 691 states, 686 states have (on average 1.338192419825073) internal successors, (918), 686 states have internal predecessors, (918), 3 states have call successors, (3), 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 788 states. [2022-04-28 10:17:06,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:06,357 INFO L93 Difference]: Finished difference Result 788 states and 1039 transitions. [2022-04-28 10:17:06,357 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1039 transitions. [2022-04-28 10:17:06,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:06,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:06,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:17:06,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:17:06,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 686 states have (on average 1.338192419825073) internal successors, (918), 686 states have internal predecessors, (918), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:06,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 922 transitions. [2022-04-28 10:17:06,375 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 922 transitions. Word has length 38 [2022-04-28 10:17:06,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:17:06,375 INFO L495 AbstractCegarLoop]: Abstraction has 691 states and 922 transitions. [2022-04-28 10:17:06,375 INFO L496 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-28 10:17:06,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 691 states and 922 transitions. [2022-04-28 10:17:09,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 922 edges. 922 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:09,991 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 922 transitions. [2022-04-28 10:17:09,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:17:09,992 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:17:09,992 INFO L195 NwaCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:17:10,008 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-28 10:17:10,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-04-28 10:17:10,192 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:17:10,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:17:10,192 INFO L85 PathProgramCache]: Analyzing trace with hash -14392650, now seen corresponding path program 41 times [2022-04-28 10:17:10,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:10,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [196973976] [2022-04-28 10:17:10,195 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:17:10,195 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:17:10,195 INFO L85 PathProgramCache]: Analyzing trace with hash -14392650, now seen corresponding path program 42 times [2022-04-28 10:17:10,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:17:10,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431194674] [2022-04-28 10:17:10,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:17:10,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:17:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:10,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:17:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:10,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {134263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {134235#true} is VALID [2022-04-28 10:17:10,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {134235#true} assume true; {134235#true} is VALID [2022-04-28 10:17:10,620 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {134235#true} {134235#true} #94#return; {134235#true} is VALID [2022-04-28 10:17:10,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {134235#true} call ULTIMATE.init(); {134263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:17:10,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {134263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {134235#true} is VALID [2022-04-28 10:17:10,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {134235#true} assume true; {134235#true} is VALID [2022-04-28 10:17:10,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134235#true} {134235#true} #94#return; {134235#true} is VALID [2022-04-28 10:17:10,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {134235#true} call #t~ret17 := main(); {134235#true} is VALID [2022-04-28 10:17:10,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {134235#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {134240#(= main_~y~0 0)} is VALID [2022-04-28 10:17:10,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {134240#(= 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; {134241#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:17:10,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {134241#(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; {134242#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:17:10,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {134242#(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; {134243#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:17:10,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {134243#(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; {134244#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:17:10,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {134244#(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; {134245#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:17:10,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {134245#(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; {134246#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:17:10,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {134246#(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; {134247#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:17:10,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {134247#(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; {134248#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:17:10,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {134248#(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; {134249#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:17:10,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {134249#(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; {134250#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:17:10,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {134250#(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; {134251#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:17:10,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {134251#(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; {134252#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:17:10,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {134252#(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; {134253#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:17:10,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {134253#(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; {134254#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:17:10,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {134254#(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; {134255#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:17:10,633 INFO L290 TraceCheckUtils]: 21: Hoare triple {134255#(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; {134256#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:17:10,633 INFO L290 TraceCheckUtils]: 22: Hoare triple {134256#(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; {134257#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:17:10,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {134257#(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; {134258#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:17:10,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {134258#(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; {134259#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:17:10,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {134259#(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; {134260#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:17:10,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {134260#(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; {134261#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:17:10,637 INFO L290 TraceCheckUtils]: 27: Hoare triple {134261#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {134261#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:17:10,637 INFO L290 TraceCheckUtils]: 28: Hoare triple {134261#(and (<= main_~y~0 21) (<= 21 main_~y~0))} ~z~0 := ~y~0; {134262#(and (<= (div main_~z~0 4294967296) 0) (<= 21 main_~z~0))} is VALID [2022-04-28 10:17:10,638 INFO L290 TraceCheckUtils]: 29: Hoare triple {134262#(and (<= (div main_~z~0 4294967296) 0) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {134236#false} is VALID [2022-04-28 10:17:10,638 INFO L290 TraceCheckUtils]: 30: Hoare triple {134236#false} assume !(~y~0 % 4294967296 > 0); {134236#false} is VALID [2022-04-28 10:17:10,638 INFO L290 TraceCheckUtils]: 31: Hoare triple {134236#false} assume !(~x~0 % 4294967296 > 0); {134236#false} is VALID [2022-04-28 10:17:10,638 INFO L290 TraceCheckUtils]: 32: Hoare triple {134236#false} assume !(~z~0 % 4294967296 > 0); {134236#false} is VALID [2022-04-28 10:17:10,638 INFO L290 TraceCheckUtils]: 33: Hoare triple {134236#false} assume !(~y~0 % 4294967296 > 0); {134236#false} is VALID [2022-04-28 10:17:10,638 INFO L272 TraceCheckUtils]: 34: Hoare triple {134236#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {134236#false} is VALID [2022-04-28 10:17:10,638 INFO L290 TraceCheckUtils]: 35: Hoare triple {134236#false} ~cond := #in~cond; {134236#false} is VALID [2022-04-28 10:17:10,638 INFO L290 TraceCheckUtils]: 36: Hoare triple {134236#false} assume 0 == ~cond; {134236#false} is VALID [2022-04-28 10:17:10,639 INFO L290 TraceCheckUtils]: 37: Hoare triple {134236#false} assume !false; {134236#false} is VALID [2022-04-28 10:17:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:17:10,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:17:10,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431194674] [2022-04-28 10:17:10,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431194674] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:17:10,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95506934] [2022-04-28 10:17:10,639 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:17:10,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:17:10,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:17:10,644 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-28 10:17:10,648 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-28 10:17:11,239 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-28 10:17:11,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:17:11,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 10:17:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:11,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:17:11,619 INFO L272 TraceCheckUtils]: 0: Hoare triple {134235#true} call ULTIMATE.init(); {134235#true} is VALID [2022-04-28 10:17:11,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {134235#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {134235#true} is VALID [2022-04-28 10:17:11,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {134235#true} assume true; {134235#true} is VALID [2022-04-28 10:17:11,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134235#true} {134235#true} #94#return; {134235#true} is VALID [2022-04-28 10:17:11,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {134235#true} call #t~ret17 := main(); {134235#true} is VALID [2022-04-28 10:17:11,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {134235#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {134240#(= main_~y~0 0)} is VALID [2022-04-28 10:17:11,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {134240#(= 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; {134241#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:17:11,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {134241#(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; {134242#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:17:11,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {134242#(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; {134243#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:17:11,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {134243#(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; {134244#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:17:11,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {134244#(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; {134245#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:17:11,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {134245#(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; {134246#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:17:11,624 INFO L290 TraceCheckUtils]: 12: Hoare triple {134246#(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; {134247#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:17:11,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {134247#(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; {134248#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:17:11,625 INFO L290 TraceCheckUtils]: 14: Hoare triple {134248#(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; {134249#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:17:11,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {134249#(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; {134250#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:17:11,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {134250#(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; {134251#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:17:11,626 INFO L290 TraceCheckUtils]: 17: Hoare triple {134251#(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; {134252#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:17:11,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {134252#(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; {134253#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:17:11,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {134253#(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; {134254#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:17:11,628 INFO L290 TraceCheckUtils]: 20: Hoare triple {134254#(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; {134255#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:17:11,628 INFO L290 TraceCheckUtils]: 21: Hoare triple {134255#(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; {134256#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:17:11,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {134256#(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; {134257#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:17:11,629 INFO L290 TraceCheckUtils]: 23: Hoare triple {134257#(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; {134258#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:17:11,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {134258#(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; {134259#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:17:11,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {134259#(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; {134260#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:17:11,631 INFO L290 TraceCheckUtils]: 26: Hoare triple {134260#(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; {134261#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:17:11,631 INFO L290 TraceCheckUtils]: 27: Hoare triple {134261#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {134261#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:17:11,632 INFO L290 TraceCheckUtils]: 28: Hoare triple {134261#(and (<= main_~y~0 21) (<= 21 main_~y~0))} ~z~0 := ~y~0; {134351#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-28 10:17:11,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {134351#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {134351#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-28 10:17:11,632 INFO L290 TraceCheckUtils]: 30: Hoare triple {134351#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {134351#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-28 10:17:11,633 INFO L290 TraceCheckUtils]: 31: Hoare triple {134351#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {134351#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-28 10:17:11,633 INFO L290 TraceCheckUtils]: 32: Hoare triple {134351#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {134236#false} is VALID [2022-04-28 10:17:11,633 INFO L290 TraceCheckUtils]: 33: Hoare triple {134236#false} assume !(~y~0 % 4294967296 > 0); {134236#false} is VALID [2022-04-28 10:17:11,633 INFO L272 TraceCheckUtils]: 34: Hoare triple {134236#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {134236#false} is VALID [2022-04-28 10:17:11,634 INFO L290 TraceCheckUtils]: 35: Hoare triple {134236#false} ~cond := #in~cond; {134236#false} is VALID [2022-04-28 10:17:11,634 INFO L290 TraceCheckUtils]: 36: Hoare triple {134236#false} assume 0 == ~cond; {134236#false} is VALID [2022-04-28 10:17:11,634 INFO L290 TraceCheckUtils]: 37: Hoare triple {134236#false} assume !false; {134236#false} is VALID [2022-04-28 10:17:11,634 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:17:11,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:17:12,542 INFO L290 TraceCheckUtils]: 37: Hoare triple {134236#false} assume !false; {134236#false} is VALID [2022-04-28 10:17:12,543 INFO L290 TraceCheckUtils]: 36: Hoare triple {134236#false} assume 0 == ~cond; {134236#false} is VALID [2022-04-28 10:17:12,543 INFO L290 TraceCheckUtils]: 35: Hoare triple {134236#false} ~cond := #in~cond; {134236#false} is VALID [2022-04-28 10:17:12,543 INFO L272 TraceCheckUtils]: 34: Hoare triple {134236#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {134236#false} is VALID [2022-04-28 10:17:12,543 INFO L290 TraceCheckUtils]: 33: Hoare triple {134236#false} assume !(~y~0 % 4294967296 > 0); {134236#false} is VALID [2022-04-28 10:17:12,543 INFO L290 TraceCheckUtils]: 32: Hoare triple {134394#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {134236#false} is VALID [2022-04-28 10:17:12,543 INFO L290 TraceCheckUtils]: 31: Hoare triple {134394#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {134394#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:17:12,544 INFO L290 TraceCheckUtils]: 30: Hoare triple {134394#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {134394#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:17:12,544 INFO L290 TraceCheckUtils]: 29: Hoare triple {134394#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {134394#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:17:12,544 INFO L290 TraceCheckUtils]: 28: Hoare triple {134407#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {134394#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:17:12,545 INFO L290 TraceCheckUtils]: 27: Hoare triple {134407#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {134407#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:17:12,545 INFO L290 TraceCheckUtils]: 26: Hoare triple {134414#(< 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; {134407#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:17:12,546 INFO L290 TraceCheckUtils]: 25: Hoare triple {134418#(< 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; {134414#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:17:12,547 INFO L290 TraceCheckUtils]: 24: Hoare triple {134422#(< 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; {134418#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:17:12,547 INFO L290 TraceCheckUtils]: 23: Hoare triple {134426#(< 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; {134422#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:17:12,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {134430#(< 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; {134426#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:17:12,549 INFO L290 TraceCheckUtils]: 21: Hoare triple {134434#(< 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; {134430#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:17:12,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {134438#(< 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; {134434#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:17:12,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {134442#(< 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; {134438#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:17:12,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {134446#(< 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; {134442#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:17:12,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {134450#(< 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; {134446#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:17:12,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {134454#(< 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; {134450#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:17:12,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {134458#(< 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; {134454#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:17:12,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {134462#(< 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; {134458#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:17:12,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {134466#(< 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; {134462#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:17:12,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {134470#(< 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; {134466#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:17:12,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {134474#(< 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; {134470#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:17:12,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {134478#(< 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; {134474#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:17:12,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {134482#(< 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; {134478#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:17:12,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {134486#(< 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; {134482#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:17:12,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {134490#(< 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; {134486#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:17:12,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {134494#(< 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; {134490#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:17:12,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {134235#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {134494#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:17:12,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {134235#true} call #t~ret17 := main(); {134235#true} is VALID [2022-04-28 10:17:12,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134235#true} {134235#true} #94#return; {134235#true} is VALID [2022-04-28 10:17:12,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {134235#true} assume true; {134235#true} is VALID [2022-04-28 10:17:12,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {134235#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {134235#true} is VALID [2022-04-28 10:17:12,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {134235#true} call ULTIMATE.init(); {134235#true} is VALID [2022-04-28 10:17:12,560 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:17:12,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95506934] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:17:12,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:17:12,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-28 10:17:12,560 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:17:12,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [196973976] [2022-04-28 10:17:12,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [196973976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:17:12,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:17:12,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 10:17:12,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453052912] [2022-04-28 10:17:12,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:17:12,561 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (3), 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-28 10:17:12,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:17:12,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:12,584 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-28 10:17:12,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 10:17:12,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:12,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 10:17:12,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=1867, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:17:12,585 INFO L87 Difference]: Start difference. First operand 691 states and 922 transitions. Second operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 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-28 10:17:27,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:27,049 INFO L93 Difference]: Finished difference Result 953 states and 1403 transitions. [2022-04-28 10:17:27,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 10:17:27,050 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (3), 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-28 10:17:27,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:17:27,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:27,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 308 transitions. [2022-04-28 10:17:27,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:27,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 308 transitions. [2022-04-28 10:17:27,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 308 transitions. [2022-04-28 10:17:27,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 308 edges. 308 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:27,338 INFO L225 Difference]: With dead ends: 953 [2022-04-28 10:17:27,338 INFO L226 Difference]: Without dead ends: 929 [2022-04-28 10:17:27,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1183, Invalid=4073, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 10:17:27,339 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 259 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 5197 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 5370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 5197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:17:27,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 246 Invalid, 5370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 5197 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-28 10:17:27,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2022-04-28 10:17:32,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 721. [2022-04-28 10:17:32,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:17:32,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 929 states. Second operand has 721 states, 716 states have (on average 1.3421787709497206) internal successors, (961), 716 states have internal predecessors, (961), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:32,674 INFO L74 IsIncluded]: Start isIncluded. First operand 929 states. Second operand has 721 states, 716 states have (on average 1.3421787709497206) internal successors, (961), 716 states have internal predecessors, (961), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:32,675 INFO L87 Difference]: Start difference. First operand 929 states. Second operand has 721 states, 716 states have (on average 1.3421787709497206) internal successors, (961), 716 states have internal predecessors, (961), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:32,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:32,700 INFO L93 Difference]: Finished difference Result 929 states and 1215 transitions. [2022-04-28 10:17:32,700 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1215 transitions. [2022-04-28 10:17:32,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:32,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:32,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 721 states, 716 states have (on average 1.3421787709497206) internal successors, (961), 716 states have internal predecessors, (961), 3 states have call successors, (3), 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 929 states. [2022-04-28 10:17:32,701 INFO L87 Difference]: Start difference. First operand has 721 states, 716 states have (on average 1.3421787709497206) internal successors, (961), 716 states have internal predecessors, (961), 3 states have call successors, (3), 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 929 states. [2022-04-28 10:17:32,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:32,724 INFO L93 Difference]: Finished difference Result 929 states and 1215 transitions. [2022-04-28 10:17:32,724 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1215 transitions. [2022-04-28 10:17:32,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:32,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:32,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:17:32,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:17:32,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 716 states have (on average 1.3421787709497206) internal successors, (961), 716 states have internal predecessors, (961), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:32,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 965 transitions. [2022-04-28 10:17:32,743 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 965 transitions. Word has length 38 [2022-04-28 10:17:32,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:17:32,743 INFO L495 AbstractCegarLoop]: Abstraction has 721 states and 965 transitions. [2022-04-28 10:17:32,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:32,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 721 states and 965 transitions. [2022-04-28 10:17:38,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 965 edges. 964 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:38,301 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 965 transitions. [2022-04-28 10:17:38,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:17:38,301 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:17:38,301 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:17:38,308 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-28 10:17:38,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:17:38,502 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:17:38,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:17:38,502 INFO L85 PathProgramCache]: Analyzing trace with hash 932823321, now seen corresponding path program 15 times [2022-04-28 10:17:38,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:38,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [523427885] [2022-04-28 10:17:38,505 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:17:38,505 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:17:38,505 INFO L85 PathProgramCache]: Analyzing trace with hash 932823321, now seen corresponding path program 16 times [2022-04-28 10:17:38,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:17:38,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490085480] [2022-04-28 10:17:38,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:17:38,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:17:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:38,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:17:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:38,707 INFO L290 TraceCheckUtils]: 0: Hoare triple {139784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {139767#true} is VALID [2022-04-28 10:17:38,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {139767#true} assume true; {139767#true} is VALID [2022-04-28 10:17:38,707 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {139767#true} {139767#true} #94#return; {139767#true} is VALID [2022-04-28 10:17:38,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {139767#true} call ULTIMATE.init(); {139784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:17:38,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {139784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {139767#true} is VALID [2022-04-28 10:17:38,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {139767#true} assume true; {139767#true} is VALID [2022-04-28 10:17:38,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139767#true} {139767#true} #94#return; {139767#true} is VALID [2022-04-28 10:17:38,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {139767#true} call #t~ret17 := main(); {139767#true} is VALID [2022-04-28 10:17:38,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {139767#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {139772#(= main_~y~0 0)} is VALID [2022-04-28 10:17:38,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {139772#(= 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; {139773#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:17:38,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {139773#(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; {139774#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:17:38,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {139774#(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; {139775#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:17:38,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {139775#(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; {139776#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:17:38,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {139776#(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; {139777#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:17:38,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {139777#(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; {139778#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:17:38,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {139778#(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; {139779#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:17:38,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {139779#(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; {139780#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:17:38,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {139780#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {139780#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:17:38,713 INFO L290 TraceCheckUtils]: 15: Hoare triple {139780#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {139781#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:17:38,713 INFO L290 TraceCheckUtils]: 16: Hoare triple {139781#(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; {139782#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:17:38,714 INFO L290 TraceCheckUtils]: 17: Hoare triple {139782#(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; {139783#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:17:38,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {139783#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-28 10:17:38,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-28 10:17:38,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-28 10:17:38,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-28 10:17:38,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-28 10:17:38,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-28 10:17:38,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-28 10:17:38,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-28 10:17:38,715 INFO L290 TraceCheckUtils]: 26: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-28 10:17:38,715 INFO L290 TraceCheckUtils]: 27: Hoare triple {139768#false} assume !(~y~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-28 10:17:38,715 INFO L290 TraceCheckUtils]: 28: Hoare triple {139768#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; {139768#false} is VALID [2022-04-28 10:17:38,715 INFO L290 TraceCheckUtils]: 29: Hoare triple {139768#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; {139768#false} is VALID [2022-04-28 10:17:38,715 INFO L290 TraceCheckUtils]: 30: Hoare triple {139768#false} assume !(~x~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-28 10:17:38,715 INFO L290 TraceCheckUtils]: 31: Hoare triple {139768#false} assume !(~z~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-28 10:17:38,715 INFO L290 TraceCheckUtils]: 32: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {139768#false} is VALID [2022-04-28 10:17:38,715 INFO L290 TraceCheckUtils]: 33: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {139768#false} is VALID [2022-04-28 10:17:38,716 INFO L290 TraceCheckUtils]: 34: Hoare triple {139768#false} assume !(~y~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-28 10:17:38,716 INFO L272 TraceCheckUtils]: 35: Hoare triple {139768#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {139768#false} is VALID [2022-04-28 10:17:38,716 INFO L290 TraceCheckUtils]: 36: Hoare triple {139768#false} ~cond := #in~cond; {139768#false} is VALID [2022-04-28 10:17:38,716 INFO L290 TraceCheckUtils]: 37: Hoare triple {139768#false} assume 0 == ~cond; {139768#false} is VALID [2022-04-28 10:17:38,716 INFO L290 TraceCheckUtils]: 38: Hoare triple {139768#false} assume !false; {139768#false} is VALID [2022-04-28 10:17:38,716 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:17:38,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:17:38,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490085480] [2022-04-28 10:17:38,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490085480] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:17:38,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277924121] [2022-04-28 10:17:38,716 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:17:38,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:17:38,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:17:38,718 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-28 10:17:38,719 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-28 10:17:38,765 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:17:38,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:17:38,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:17:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:38,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:17:39,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {139767#true} call ULTIMATE.init(); {139767#true} is VALID [2022-04-28 10:17:39,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {139767#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {139767#true} is VALID [2022-04-28 10:17:39,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {139767#true} assume true; {139767#true} is VALID [2022-04-28 10:17:39,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139767#true} {139767#true} #94#return; {139767#true} is VALID [2022-04-28 10:17:39,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {139767#true} call #t~ret17 := main(); {139767#true} is VALID [2022-04-28 10:17:39,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {139767#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {139772#(= main_~y~0 0)} is VALID [2022-04-28 10:17:39,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {139772#(= 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; {139773#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:17:39,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {139773#(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; {139774#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:17:39,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {139774#(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; {139775#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:17:39,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {139775#(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; {139776#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:17:39,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {139776#(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; {139777#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:17:39,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {139777#(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; {139778#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:17:39,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {139778#(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; {139779#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:17:39,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {139779#(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; {139780#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:17:39,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {139780#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {139780#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:17:39,037 INFO L290 TraceCheckUtils]: 15: Hoare triple {139780#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {139781#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:17:39,038 INFO L290 TraceCheckUtils]: 16: Hoare triple {139781#(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; {139782#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:17:39,038 INFO L290 TraceCheckUtils]: 17: Hoare triple {139782#(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; {139839#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:17:39,039 INFO L290 TraceCheckUtils]: 18: Hoare triple {139839#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-28 10:17:39,039 INFO L290 TraceCheckUtils]: 19: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-28 10:17:39,039 INFO L290 TraceCheckUtils]: 20: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-28 10:17:39,039 INFO L290 TraceCheckUtils]: 21: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-28 10:17:39,039 INFO L290 TraceCheckUtils]: 22: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-28 10:17:39,039 INFO L290 TraceCheckUtils]: 23: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-28 10:17:39,039 INFO L290 TraceCheckUtils]: 24: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-28 10:17:39,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-28 10:17:39,039 INFO L290 TraceCheckUtils]: 26: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-28 10:17:39,039 INFO L290 TraceCheckUtils]: 27: Hoare triple {139768#false} assume !(~y~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-28 10:17:39,039 INFO L290 TraceCheckUtils]: 28: Hoare triple {139768#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; {139768#false} is VALID [2022-04-28 10:17:39,039 INFO L290 TraceCheckUtils]: 29: Hoare triple {139768#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; {139768#false} is VALID [2022-04-28 10:17:39,040 INFO L290 TraceCheckUtils]: 30: Hoare triple {139768#false} assume !(~x~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-28 10:17:39,040 INFO L290 TraceCheckUtils]: 31: Hoare triple {139768#false} assume !(~z~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-28 10:17:39,040 INFO L290 TraceCheckUtils]: 32: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {139768#false} is VALID [2022-04-28 10:17:39,040 INFO L290 TraceCheckUtils]: 33: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {139768#false} is VALID [2022-04-28 10:17:39,040 INFO L290 TraceCheckUtils]: 34: Hoare triple {139768#false} assume !(~y~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-28 10:17:39,040 INFO L272 TraceCheckUtils]: 35: Hoare triple {139768#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {139768#false} is VALID [2022-04-28 10:17:39,040 INFO L290 TraceCheckUtils]: 36: Hoare triple {139768#false} ~cond := #in~cond; {139768#false} is VALID [2022-04-28 10:17:39,040 INFO L290 TraceCheckUtils]: 37: Hoare triple {139768#false} assume 0 == ~cond; {139768#false} is VALID [2022-04-28 10:17:39,040 INFO L290 TraceCheckUtils]: 38: Hoare triple {139768#false} assume !false; {139768#false} is VALID [2022-04-28 10:17:39,040 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:17:39,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:17:39,357 INFO L290 TraceCheckUtils]: 38: Hoare triple {139768#false} assume !false; {139768#false} is VALID [2022-04-28 10:17:39,357 INFO L290 TraceCheckUtils]: 37: Hoare triple {139768#false} assume 0 == ~cond; {139768#false} is VALID [2022-04-28 10:17:39,357 INFO L290 TraceCheckUtils]: 36: Hoare triple {139768#false} ~cond := #in~cond; {139768#false} is VALID [2022-04-28 10:17:39,358 INFO L272 TraceCheckUtils]: 35: Hoare triple {139768#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {139768#false} is VALID [2022-04-28 10:17:39,358 INFO L290 TraceCheckUtils]: 34: Hoare triple {139768#false} assume !(~y~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-28 10:17:39,358 INFO L290 TraceCheckUtils]: 33: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {139768#false} is VALID [2022-04-28 10:17:39,358 INFO L290 TraceCheckUtils]: 32: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {139768#false} is VALID [2022-04-28 10:17:39,358 INFO L290 TraceCheckUtils]: 31: Hoare triple {139768#false} assume !(~z~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-28 10:17:39,358 INFO L290 TraceCheckUtils]: 30: Hoare triple {139768#false} assume !(~x~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-28 10:17:39,358 INFO L290 TraceCheckUtils]: 29: Hoare triple {139768#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; {139768#false} is VALID [2022-04-28 10:17:39,358 INFO L290 TraceCheckUtils]: 28: Hoare triple {139768#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; {139768#false} is VALID [2022-04-28 10:17:39,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {139768#false} assume !(~y~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-28 10:17:39,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-28 10:17:39,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-28 10:17:39,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-28 10:17:39,358 INFO L290 TraceCheckUtils]: 23: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-28 10:17:39,358 INFO L290 TraceCheckUtils]: 22: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-28 10:17:39,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-28 10:17:39,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-28 10:17:39,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-28 10:17:39,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {139963#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-28 10:17:39,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {139967#(< 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; {139963#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:17:39,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {139971#(< 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; {139967#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:17:39,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {139975#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {139971#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:17:39,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {139975#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {139975#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:17:39,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {139982#(< 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; {139975#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:17:39,363 INFO L290 TraceCheckUtils]: 12: Hoare triple {139986#(< 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; {139982#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:17:39,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {139990#(< 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; {139986#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:17:39,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {139994#(< 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; {139990#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:17:39,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {139998#(< 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; {139994#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:17:39,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {140002#(< 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; {139998#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:17:39,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {140006#(< 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; {140002#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:17:39,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {140010#(< 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; {140006#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:17:39,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {139767#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {140010#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:17:39,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {139767#true} call #t~ret17 := main(); {139767#true} is VALID [2022-04-28 10:17:39,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139767#true} {139767#true} #94#return; {139767#true} is VALID [2022-04-28 10:17:39,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {139767#true} assume true; {139767#true} is VALID [2022-04-28 10:17:39,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {139767#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {139767#true} is VALID [2022-04-28 10:17:39,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {139767#true} call ULTIMATE.init(); {139767#true} is VALID [2022-04-28 10:17:39,368 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:17:39,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277924121] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:17:39,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:17:39,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:17:39,369 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:17:39,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [523427885] [2022-04-28 10:17:39,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [523427885] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:17:39,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:17:39,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:17:39,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661806608] [2022-04-28 10:17:39,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:17:39,369 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 39 [2022-04-28 10:17:39,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:17:39,370 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-28 10:17:39,390 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-28 10:17:39,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:17:39,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:39,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:17:39,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:17:39,390 INFO L87 Difference]: Start difference. First operand 721 states and 965 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-28 10:17:47,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:47,052 INFO L93 Difference]: Finished difference Result 819 states and 1081 transitions. [2022-04-28 10:17:47,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:17:47,053 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 39 [2022-04-28 10:17:47,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:17:47,053 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-28 10:17:47,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 126 transitions. [2022-04-28 10:17:47,054 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-28 10:17:47,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 126 transitions. [2022-04-28 10:17:47,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 126 transitions. [2022-04-28 10:17:47,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:47,185 INFO L225 Difference]: With dead ends: 819 [2022-04-28 10:17:47,185 INFO L226 Difference]: Without dead ends: 798 [2022-04-28 10:17:47,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 67 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-28 10:17:47,185 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 105 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:17:47,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 111 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:17:47,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2022-04-28 10:17:52,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 721. [2022-04-28 10:17:52,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:17:52,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 798 states. Second operand has 721 states, 716 states have (on average 1.3407821229050279) internal successors, (960), 716 states have internal predecessors, (960), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:52,478 INFO L74 IsIncluded]: Start isIncluded. First operand 798 states. Second operand has 721 states, 716 states have (on average 1.3407821229050279) internal successors, (960), 716 states have internal predecessors, (960), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:52,478 INFO L87 Difference]: Start difference. First operand 798 states. Second operand has 721 states, 716 states have (on average 1.3407821229050279) internal successors, (960), 716 states have internal predecessors, (960), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:52,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:52,496 INFO L93 Difference]: Finished difference Result 798 states and 1059 transitions. [2022-04-28 10:17:52,496 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1059 transitions. [2022-04-28 10:17:52,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:52,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:52,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 721 states, 716 states have (on average 1.3407821229050279) internal successors, (960), 716 states have internal predecessors, (960), 3 states have call successors, (3), 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 798 states. [2022-04-28 10:17:52,497 INFO L87 Difference]: Start difference. First operand has 721 states, 716 states have (on average 1.3407821229050279) internal successors, (960), 716 states have internal predecessors, (960), 3 states have call successors, (3), 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 798 states. [2022-04-28 10:17:52,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:52,515 INFO L93 Difference]: Finished difference Result 798 states and 1059 transitions. [2022-04-28 10:17:52,515 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1059 transitions. [2022-04-28 10:17:52,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:52,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:52,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:17:52,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:17:52,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 716 states have (on average 1.3407821229050279) internal successors, (960), 716 states have internal predecessors, (960), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:52,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 964 transitions. [2022-04-28 10:17:52,539 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 964 transitions. Word has length 39 [2022-04-28 10:17:52,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:17:52,539 INFO L495 AbstractCegarLoop]: Abstraction has 721 states and 964 transitions. [2022-04-28 10:17:52,539 INFO L496 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-28 10:17:52,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 721 states and 964 transitions. [2022-04-28 10:17:56,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 964 edges. 964 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:56,346 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 964 transitions. [2022-04-28 10:17:56,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:17:56,346 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:17:56,346 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:17:56,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2022-04-28 10:17:56,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-04-28 10:17:56,559 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:17:56,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:17:56,560 INFO L85 PathProgramCache]: Analyzing trace with hash -159271655, now seen corresponding path program 25 times [2022-04-28 10:17:56,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:56,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1054310448] [2022-04-28 10:17:56,563 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:17:56,563 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:17:56,563 INFO L85 PathProgramCache]: Analyzing trace with hash -159271655, now seen corresponding path program 26 times [2022-04-28 10:17:56,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:17:56,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575916792] [2022-04-28 10:17:56,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:17:56,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:17:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:56,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:17:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:56,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {144758#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {144737#true} is VALID [2022-04-28 10:17:56,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {144737#true} assume true; {144737#true} is VALID [2022-04-28 10:17:56,883 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {144737#true} {144737#true} #94#return; {144737#true} is VALID [2022-04-28 10:17:56,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {144737#true} call ULTIMATE.init(); {144758#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:17:56,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {144758#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {144737#true} is VALID [2022-04-28 10:17:56,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {144737#true} assume true; {144737#true} is VALID [2022-04-28 10:17:56,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144737#true} {144737#true} #94#return; {144737#true} is VALID [2022-04-28 10:17:56,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {144737#true} call #t~ret17 := main(); {144737#true} is VALID [2022-04-28 10:17:56,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {144737#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {144742#(= main_~y~0 0)} is VALID [2022-04-28 10:17:56,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {144742#(= 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; {144743#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:17:56,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {144743#(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; {144744#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:17:56,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {144744#(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; {144745#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:17:56,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {144745#(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; {144746#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:17:56,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {144746#(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; {144747#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:17:56,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {144747#(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; {144748#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:17:56,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {144748#(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; {144749#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:17:56,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {144749#(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; {144750#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:17:56,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {144750#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {144750#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:17:56,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {144750#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {144751#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:17:56,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {144751#(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; {144752#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:17:56,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {144752#(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; {144753#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:17:56,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {144753#(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; {144754#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:17:56,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {144754#(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; {144755#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:17:56,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {144755#(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; {144756#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:17:56,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {144756#(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; {144757#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:17:56,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {144757#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {144738#false} is VALID [2022-04-28 10:17:56,896 INFO L290 TraceCheckUtils]: 23: Hoare triple {144738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144738#false} is VALID [2022-04-28 10:17:56,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {144738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144738#false} is VALID [2022-04-28 10:17:56,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {144738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144738#false} is VALID [2022-04-28 10:17:56,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {144738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144738#false} is VALID [2022-04-28 10:17:56,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {144738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144738#false} is VALID [2022-04-28 10:17:56,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {144738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144738#false} is VALID [2022-04-28 10:17:56,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {144738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144738#false} is VALID [2022-04-28 10:17:56,896 INFO L290 TraceCheckUtils]: 30: Hoare triple {144738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144738#false} is VALID [2022-04-28 10:17:56,896 INFO L290 TraceCheckUtils]: 31: Hoare triple {144738#false} assume !(~y~0 % 4294967296 > 0); {144738#false} is VALID [2022-04-28 10:17:56,897 INFO L290 TraceCheckUtils]: 32: Hoare triple {144738#false} assume !(~x~0 % 4294967296 > 0); {144738#false} is VALID [2022-04-28 10:17:56,897 INFO L290 TraceCheckUtils]: 33: Hoare triple {144738#false} assume !(~z~0 % 4294967296 > 0); {144738#false} is VALID [2022-04-28 10:17:56,897 INFO L290 TraceCheckUtils]: 34: Hoare triple {144738#false} assume !(~y~0 % 4294967296 > 0); {144738#false} is VALID [2022-04-28 10:17:56,897 INFO L272 TraceCheckUtils]: 35: Hoare triple {144738#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {144738#false} is VALID [2022-04-28 10:17:56,897 INFO L290 TraceCheckUtils]: 36: Hoare triple {144738#false} ~cond := #in~cond; {144738#false} is VALID [2022-04-28 10:17:56,897 INFO L290 TraceCheckUtils]: 37: Hoare triple {144738#false} assume 0 == ~cond; {144738#false} is VALID [2022-04-28 10:17:56,897 INFO L290 TraceCheckUtils]: 38: Hoare triple {144738#false} assume !false; {144738#false} is VALID [2022-04-28 10:17:56,897 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:17:56,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:17:56,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575916792] [2022-04-28 10:17:56,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575916792] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:17:56,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871655442] [2022-04-28 10:17:56,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:17:56,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:17:56,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:17:56,900 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-28 10:17:56,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-28 10:17:56,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:17:56,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:17:56,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 10:17:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:56,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:17:57,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {144737#true} call ULTIMATE.init(); {144737#true} is VALID [2022-04-28 10:17:57,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {144737#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {144737#true} is VALID [2022-04-28 10:17:57,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {144737#true} assume true; {144737#true} is VALID [2022-04-28 10:17:57,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144737#true} {144737#true} #94#return; {144737#true} is VALID [2022-04-28 10:17:57,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {144737#true} call #t~ret17 := main(); {144737#true} is VALID [2022-04-28 10:17:57,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {144737#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {144737#true} is VALID [2022-04-28 10:17:57,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {144737#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144737#true} is VALID [2022-04-28 10:17:57,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {144737#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144737#true} is VALID [2022-04-28 10:17:57,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {144737#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144786#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:17:57,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {144786#(< 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; {144790#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:17:57,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {144790#(< 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; {144794#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:17:57,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {144794#(< 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; {144798#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:17:57,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {144798#(< 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; {144802#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:57,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {144802#(< 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; {144806#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:17:57,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {144806#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {144806#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:17:57,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {144806#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {144806#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:17:57,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {144806#(< 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; {144802#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:57,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {144802#(< 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; {144798#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:17:57,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {144798#(< 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; {144794#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:17:57,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {144794#(< 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; {144790#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:17:57,249 INFO L290 TraceCheckUtils]: 20: Hoare triple {144790#(< 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; {144786#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:17:57,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {144786#(< 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; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:57,249 INFO L290 TraceCheckUtils]: 22: Hoare triple {144831#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:57,250 INFO L290 TraceCheckUtils]: 23: Hoare triple {144831#(< 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; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:57,250 INFO L290 TraceCheckUtils]: 24: Hoare triple {144831#(< 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; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:57,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {144831#(< 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; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:57,251 INFO L290 TraceCheckUtils]: 26: Hoare triple {144831#(< 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; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:57,251 INFO L290 TraceCheckUtils]: 27: Hoare triple {144831#(< 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; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:57,251 INFO L290 TraceCheckUtils]: 28: Hoare triple {144831#(< 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; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:57,252 INFO L290 TraceCheckUtils]: 29: Hoare triple {144831#(< 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; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:57,252 INFO L290 TraceCheckUtils]: 30: Hoare triple {144831#(< 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; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:57,252 INFO L290 TraceCheckUtils]: 31: Hoare triple {144831#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:57,252 INFO L290 TraceCheckUtils]: 32: Hoare triple {144831#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {144738#false} is VALID [2022-04-28 10:17:57,252 INFO L290 TraceCheckUtils]: 33: Hoare triple {144738#false} assume !(~z~0 % 4294967296 > 0); {144738#false} is VALID [2022-04-28 10:17:57,253 INFO L290 TraceCheckUtils]: 34: Hoare triple {144738#false} assume !(~y~0 % 4294967296 > 0); {144738#false} is VALID [2022-04-28 10:17:57,253 INFO L272 TraceCheckUtils]: 35: Hoare triple {144738#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {144738#false} is VALID [2022-04-28 10:17:57,253 INFO L290 TraceCheckUtils]: 36: Hoare triple {144738#false} ~cond := #in~cond; {144738#false} is VALID [2022-04-28 10:17:57,253 INFO L290 TraceCheckUtils]: 37: Hoare triple {144738#false} assume 0 == ~cond; {144738#false} is VALID [2022-04-28 10:17:57,253 INFO L290 TraceCheckUtils]: 38: Hoare triple {144738#false} assume !false; {144738#false} is VALID [2022-04-28 10:17:57,253 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 10:17:57,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:17:57,384 INFO L290 TraceCheckUtils]: 38: Hoare triple {144738#false} assume !false; {144738#false} is VALID [2022-04-28 10:17:57,384 INFO L290 TraceCheckUtils]: 37: Hoare triple {144738#false} assume 0 == ~cond; {144738#false} is VALID [2022-04-28 10:17:57,384 INFO L290 TraceCheckUtils]: 36: Hoare triple {144738#false} ~cond := #in~cond; {144738#false} is VALID [2022-04-28 10:17:57,384 INFO L272 TraceCheckUtils]: 35: Hoare triple {144738#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {144738#false} is VALID [2022-04-28 10:17:57,384 INFO L290 TraceCheckUtils]: 34: Hoare triple {144738#false} assume !(~y~0 % 4294967296 > 0); {144738#false} is VALID [2022-04-28 10:17:57,385 INFO L290 TraceCheckUtils]: 33: Hoare triple {144738#false} assume !(~z~0 % 4294967296 > 0); {144738#false} is VALID [2022-04-28 10:17:57,385 INFO L290 TraceCheckUtils]: 32: Hoare triple {144831#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {144738#false} is VALID [2022-04-28 10:17:57,385 INFO L290 TraceCheckUtils]: 31: Hoare triple {144831#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:57,385 INFO L290 TraceCheckUtils]: 30: Hoare triple {144831#(< 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; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:57,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {144831#(< 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; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:57,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {144831#(< 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; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:57,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {144831#(< 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; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:57,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {144831#(< 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; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:57,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {144831#(< 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; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:57,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {144831#(< 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; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:57,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {144831#(< 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; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:57,388 INFO L290 TraceCheckUtils]: 22: Hoare triple {144831#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:57,388 INFO L290 TraceCheckUtils]: 21: Hoare triple {144786#(< 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; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:57,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {144790#(< 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; {144786#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:17:57,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {144794#(< 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; {144790#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:17:57,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {144798#(< 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; {144794#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:17:57,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {144802#(< 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; {144798#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:17:57,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {144806#(< 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; {144802#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:57,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {144806#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {144806#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:17:57,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {144806#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {144806#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:17:57,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {144802#(< 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; {144806#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:17:57,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {144798#(< 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; {144802#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:57,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {144794#(< 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; {144798#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:17:57,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {144790#(< 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; {144794#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:17:57,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {144786#(< 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; {144790#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:17:57,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {144737#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144786#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:17:57,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {144737#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144737#true} is VALID [2022-04-28 10:17:57,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {144737#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144737#true} is VALID [2022-04-28 10:17:57,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {144737#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {144737#true} is VALID [2022-04-28 10:17:57,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {144737#true} call #t~ret17 := main(); {144737#true} is VALID [2022-04-28 10:17:57,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144737#true} {144737#true} #94#return; {144737#true} is VALID [2022-04-28 10:17:57,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {144737#true} assume true; {144737#true} is VALID [2022-04-28 10:17:57,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {144737#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {144737#true} is VALID [2022-04-28 10:17:57,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {144737#true} call ULTIMATE.init(); {144737#true} is VALID [2022-04-28 10:17:57,398 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 10:17:57,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871655442] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:17:57,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:17:57,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9, 9] total 26 [2022-04-28 10:17:57,399 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:17:57,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1054310448] [2022-04-28 10:17:57,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1054310448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:17:57,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:17:57,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:17:57,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820722246] [2022-04-28 10:17:57,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:17:57,399 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-28 10:17:57,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:17:57,400 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-28 10:17:57,421 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-28 10:17:57,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:17:57,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:57,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:17:57,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:17:57,422 INFO L87 Difference]: Start difference. First operand 721 states and 964 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-28 10:18:05,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:05,681 INFO L93 Difference]: Finished difference Result 882 states and 1190 transitions. [2022-04-28 10:18:05,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 10:18:05,682 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-28 10:18:05,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:18:05,682 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-28 10:18:05,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 148 transitions. [2022-04-28 10:18:05,683 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-28 10:18:05,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 148 transitions. [2022-04-28 10:18:05,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 148 transitions. [2022-04-28 10:18:05,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:18:05,827 INFO L225 Difference]: With dead ends: 882 [2022-04-28 10:18:05,827 INFO L226 Difference]: Without dead ends: 759 [2022-04-28 10:18:05,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=281, Invalid=3259, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 10:18:05,827 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 99 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:18:05,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 101 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:18:05,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2022-04-28 10:18:11,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 722. [2022-04-28 10:18:11,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:18:11,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 759 states. Second operand has 722 states, 717 states have (on average 1.3361227336122734) internal successors, (958), 717 states have internal predecessors, (958), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:11,158 INFO L74 IsIncluded]: Start isIncluded. First operand 759 states. Second operand has 722 states, 717 states have (on average 1.3361227336122734) internal successors, (958), 717 states have internal predecessors, (958), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:11,158 INFO L87 Difference]: Start difference. First operand 759 states. Second operand has 722 states, 717 states have (on average 1.3361227336122734) internal successors, (958), 717 states have internal predecessors, (958), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:11,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:11,173 INFO L93 Difference]: Finished difference Result 759 states and 1017 transitions. [2022-04-28 10:18:11,173 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1017 transitions. [2022-04-28 10:18:11,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:11,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:11,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 722 states, 717 states have (on average 1.3361227336122734) internal successors, (958), 717 states have internal predecessors, (958), 3 states have call successors, (3), 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 759 states. [2022-04-28 10:18:11,174 INFO L87 Difference]: Start difference. First operand has 722 states, 717 states have (on average 1.3361227336122734) internal successors, (958), 717 states have internal predecessors, (958), 3 states have call successors, (3), 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 759 states. [2022-04-28 10:18:11,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:11,188 INFO L93 Difference]: Finished difference Result 759 states and 1017 transitions. [2022-04-28 10:18:11,188 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1017 transitions. [2022-04-28 10:18:11,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:11,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:11,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:18:11,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:18:11,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 717 states have (on average 1.3361227336122734) internal successors, (958), 717 states have internal predecessors, (958), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:11,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 962 transitions. [2022-04-28 10:18:11,218 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 962 transitions. Word has length 39 [2022-04-28 10:18:11,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:18:11,219 INFO L495 AbstractCegarLoop]: Abstraction has 722 states and 962 transitions. [2022-04-28 10:18:11,219 INFO L496 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-28 10:18:11,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 722 states and 962 transitions. [2022-04-28 10:18:17,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 962 edges. 961 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:18:17,947 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 962 transitions. [2022-04-28 10:18:17,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:18:17,948 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:18:17,948 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:18:17,964 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-28 10:18:18,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-04-28 10:18:18,149 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:18:18,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:18:18,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1714810247, now seen corresponding path program 43 times [2022-04-28 10:18:18,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:18:18,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1465097353] [2022-04-28 10:18:18,152 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:18:18,152 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:18:18,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1714810247, now seen corresponding path program 44 times [2022-04-28 10:18:18,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:18:18,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37981094] [2022-04-28 10:18:18,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:18:18,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:18:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:18,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:18:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:18,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {149822#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {149793#true} is VALID [2022-04-28 10:18:18,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {149793#true} assume true; {149793#true} is VALID [2022-04-28 10:18:18,609 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {149793#true} {149793#true} #94#return; {149793#true} is VALID [2022-04-28 10:18:18,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {149793#true} call ULTIMATE.init(); {149822#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:18:18,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {149822#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {149793#true} is VALID [2022-04-28 10:18:18,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {149793#true} assume true; {149793#true} is VALID [2022-04-28 10:18:18,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149793#true} {149793#true} #94#return; {149793#true} is VALID [2022-04-28 10:18:18,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {149793#true} call #t~ret17 := main(); {149793#true} is VALID [2022-04-28 10:18:18,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {149793#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {149798#(= main_~y~0 0)} is VALID [2022-04-28 10:18:18,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {149798#(= 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; {149799#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:18:18,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {149799#(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; {149800#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:18:18,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {149800#(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; {149801#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:18:18,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {149801#(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; {149802#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:18:18,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {149802#(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; {149803#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:18:18,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {149803#(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; {149804#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:18:18,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {149804#(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; {149805#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:18:18,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {149805#(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; {149806#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:18:18,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {149806#(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; {149807#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:18,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {149807#(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; {149808#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:18:18,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {149808#(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; {149809#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:18:18,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {149809#(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; {149810#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:18:18,617 INFO L290 TraceCheckUtils]: 18: Hoare triple {149810#(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; {149811#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:18:18,617 INFO L290 TraceCheckUtils]: 19: Hoare triple {149811#(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; {149812#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:18:18,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {149812#(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; {149813#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:18:18,619 INFO L290 TraceCheckUtils]: 21: Hoare triple {149813#(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; {149814#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:18:18,619 INFO L290 TraceCheckUtils]: 22: Hoare triple {149814#(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; {149815#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:18:18,620 INFO L290 TraceCheckUtils]: 23: Hoare triple {149815#(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; {149816#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:18:18,620 INFO L290 TraceCheckUtils]: 24: Hoare triple {149816#(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; {149817#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:18:18,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {149817#(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; {149818#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:18:18,621 INFO L290 TraceCheckUtils]: 26: Hoare triple {149818#(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; {149819#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:18:18,622 INFO L290 TraceCheckUtils]: 27: Hoare triple {149819#(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; {149820#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:18:18,622 INFO L290 TraceCheckUtils]: 28: Hoare triple {149820#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {149820#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:18:18,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {149820#(and (<= main_~y~0 22) (<= 22 main_~y~0))} ~z~0 := ~y~0; {149821#(and (<= 22 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:18:18,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {149821#(and (<= 22 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {149794#false} is VALID [2022-04-28 10:18:18,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {149794#false} assume !(~y~0 % 4294967296 > 0); {149794#false} is VALID [2022-04-28 10:18:18,623 INFO L290 TraceCheckUtils]: 32: Hoare triple {149794#false} assume !(~x~0 % 4294967296 > 0); {149794#false} is VALID [2022-04-28 10:18:18,623 INFO L290 TraceCheckUtils]: 33: Hoare triple {149794#false} assume !(~z~0 % 4294967296 > 0); {149794#false} is VALID [2022-04-28 10:18:18,623 INFO L290 TraceCheckUtils]: 34: Hoare triple {149794#false} assume !(~y~0 % 4294967296 > 0); {149794#false} is VALID [2022-04-28 10:18:18,623 INFO L272 TraceCheckUtils]: 35: Hoare triple {149794#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {149794#false} is VALID [2022-04-28 10:18:18,623 INFO L290 TraceCheckUtils]: 36: Hoare triple {149794#false} ~cond := #in~cond; {149794#false} is VALID [2022-04-28 10:18:18,624 INFO L290 TraceCheckUtils]: 37: Hoare triple {149794#false} assume 0 == ~cond; {149794#false} is VALID [2022-04-28 10:18:18,624 INFO L290 TraceCheckUtils]: 38: Hoare triple {149794#false} assume !false; {149794#false} is VALID [2022-04-28 10:18:18,624 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:18:18,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:18:18,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37981094] [2022-04-28 10:18:18,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37981094] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:18:18,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440375843] [2022-04-28 10:18:18,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:18:18,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:18:18,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:18:18,625 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-28 10:18:18,626 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-28 10:18:18,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:18:18,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:18:18,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-28 10:18:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:18,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:18:19,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {149793#true} call ULTIMATE.init(); {149793#true} is VALID [2022-04-28 10:18:19,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {149793#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {149793#true} is VALID [2022-04-28 10:18:19,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {149793#true} assume true; {149793#true} is VALID [2022-04-28 10:18:19,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149793#true} {149793#true} #94#return; {149793#true} is VALID [2022-04-28 10:18:19,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {149793#true} call #t~ret17 := main(); {149793#true} is VALID [2022-04-28 10:18:19,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {149793#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {149798#(= main_~y~0 0)} is VALID [2022-04-28 10:18:19,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {149798#(= 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; {149799#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:18:19,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {149799#(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; {149800#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:18:19,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {149800#(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; {149801#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:18:19,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {149801#(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; {149802#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:18:19,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {149802#(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; {149803#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:18:19,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {149803#(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; {149804#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:18:19,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {149804#(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; {149805#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:18:19,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {149805#(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; {149806#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:18:19,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {149806#(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; {149807#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:19,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {149807#(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; {149808#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:18:19,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {149808#(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; {149809#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:18:19,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {149809#(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; {149810#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:18:19,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {149810#(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; {149811#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:18:19,062 INFO L290 TraceCheckUtils]: 19: Hoare triple {149811#(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; {149812#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:18:19,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {149812#(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; {149813#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:18:19,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {149813#(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; {149814#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:18:19,064 INFO L290 TraceCheckUtils]: 22: Hoare triple {149814#(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; {149815#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:18:19,064 INFO L290 TraceCheckUtils]: 23: Hoare triple {149815#(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; {149816#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:18:19,065 INFO L290 TraceCheckUtils]: 24: Hoare triple {149816#(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; {149817#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:18:19,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {149817#(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; {149818#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:18:19,066 INFO L290 TraceCheckUtils]: 26: Hoare triple {149818#(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; {149819#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:18:19,066 INFO L290 TraceCheckUtils]: 27: Hoare triple {149819#(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; {149820#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:18:19,067 INFO L290 TraceCheckUtils]: 28: Hoare triple {149820#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {149820#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:18:19,067 INFO L290 TraceCheckUtils]: 29: Hoare triple {149820#(and (<= main_~y~0 22) (<= 22 main_~y~0))} ~z~0 := ~y~0; {149913#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-28 10:18:19,067 INFO L290 TraceCheckUtils]: 30: Hoare triple {149913#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !(~z~0 % 4294967296 > 0); {149913#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-28 10:18:19,068 INFO L290 TraceCheckUtils]: 31: Hoare triple {149913#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !(~y~0 % 4294967296 > 0); {149913#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-28 10:18:19,068 INFO L290 TraceCheckUtils]: 32: Hoare triple {149913#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !(~x~0 % 4294967296 > 0); {149913#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-28 10:18:19,069 INFO L290 TraceCheckUtils]: 33: Hoare triple {149913#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !(~z~0 % 4294967296 > 0); {149794#false} is VALID [2022-04-28 10:18:19,069 INFO L290 TraceCheckUtils]: 34: Hoare triple {149794#false} assume !(~y~0 % 4294967296 > 0); {149794#false} is VALID [2022-04-28 10:18:19,069 INFO L272 TraceCheckUtils]: 35: Hoare triple {149794#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {149794#false} is VALID [2022-04-28 10:18:19,069 INFO L290 TraceCheckUtils]: 36: Hoare triple {149794#false} ~cond := #in~cond; {149794#false} is VALID [2022-04-28 10:18:19,069 INFO L290 TraceCheckUtils]: 37: Hoare triple {149794#false} assume 0 == ~cond; {149794#false} is VALID [2022-04-28 10:18:19,069 INFO L290 TraceCheckUtils]: 38: Hoare triple {149794#false} assume !false; {149794#false} is VALID [2022-04-28 10:18:19,069 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:18:19,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:18:20,039 INFO L290 TraceCheckUtils]: 38: Hoare triple {149794#false} assume !false; {149794#false} is VALID [2022-04-28 10:18:20,039 INFO L290 TraceCheckUtils]: 37: Hoare triple {149794#false} assume 0 == ~cond; {149794#false} is VALID [2022-04-28 10:18:20,039 INFO L290 TraceCheckUtils]: 36: Hoare triple {149794#false} ~cond := #in~cond; {149794#false} is VALID [2022-04-28 10:18:20,039 INFO L272 TraceCheckUtils]: 35: Hoare triple {149794#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {149794#false} is VALID [2022-04-28 10:18:20,040 INFO L290 TraceCheckUtils]: 34: Hoare triple {149794#false} assume !(~y~0 % 4294967296 > 0); {149794#false} is VALID [2022-04-28 10:18:20,040 INFO L290 TraceCheckUtils]: 33: Hoare triple {149956#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {149794#false} is VALID [2022-04-28 10:18:20,040 INFO L290 TraceCheckUtils]: 32: Hoare triple {149956#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {149956#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:18:20,040 INFO L290 TraceCheckUtils]: 31: Hoare triple {149956#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {149956#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:18:20,041 INFO L290 TraceCheckUtils]: 30: Hoare triple {149956#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {149956#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:18:20,041 INFO L290 TraceCheckUtils]: 29: Hoare triple {149969#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {149956#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:18:20,041 INFO L290 TraceCheckUtils]: 28: Hoare triple {149969#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {149969#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:18:20,042 INFO L290 TraceCheckUtils]: 27: Hoare triple {149976#(< 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; {149969#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:18:20,043 INFO L290 TraceCheckUtils]: 26: Hoare triple {149980#(< 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; {149976#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:18:20,043 INFO L290 TraceCheckUtils]: 25: Hoare triple {149984#(< 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; {149980#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:18:20,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {149988#(< 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; {149984#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:18:20,045 INFO L290 TraceCheckUtils]: 23: Hoare triple {149992#(< 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; {149988#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:18:20,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {149996#(< 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; {149992#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:18:20,046 INFO L290 TraceCheckUtils]: 21: Hoare triple {150000#(< 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; {149996#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:18:20,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {150004#(< 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; {150000#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:18:20,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {150008#(< 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; {150004#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:18:20,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {150012#(< 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; {150008#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:18:20,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {150016#(< 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; {150012#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:18:20,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {150020#(< 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; {150016#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:18:20,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {150024#(< 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; {150020#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:18:20,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {150028#(< 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; {150024#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:18:20,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {150032#(< 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; {150028#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:18:20,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {150036#(< 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; {150032#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:18:20,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {150040#(< 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; {150036#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:18:20,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {150044#(< 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; {150040#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:18:20,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {150048#(< 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; {150044#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:18:20,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {150052#(< 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; {150048#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:18:20,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {150056#(< 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; {150052#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:18:20,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {150060#(< 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; {150056#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:18:20,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {149793#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {150060#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:18:20,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {149793#true} call #t~ret17 := main(); {149793#true} is VALID [2022-04-28 10:18:20,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149793#true} {149793#true} #94#return; {149793#true} is VALID [2022-04-28 10:18:20,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {149793#true} assume true; {149793#true} is VALID [2022-04-28 10:18:20,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {149793#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {149793#true} is VALID [2022-04-28 10:18:20,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {149793#true} call ULTIMATE.init(); {149793#true} is VALID [2022-04-28 10:18:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:18:20,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440375843] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:18:20,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:18:20,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52 [2022-04-28 10:18:20,058 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:18:20,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1465097353] [2022-04-28 10:18:20,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1465097353] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:18:20,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:18:20,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 10:18:20,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085828227] [2022-04-28 10:18:20,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:18:20,058 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 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-28 10:18:20,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:18:20,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 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-28 10:18:20,082 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-28 10:18:20,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 10:18:20,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:18:20,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 10:18:20,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=2020, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 10:18:20,083 INFO L87 Difference]: Start difference. First operand 722 states and 962 transitions. Second operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 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-28 10:18:35,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:35,564 INFO L93 Difference]: Finished difference Result 993 states and 1461 transitions. [2022-04-28 10:18:35,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 10:18:35,565 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 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-28 10:18:35,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:18:35,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 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-28 10:18:35,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 321 transitions. [2022-04-28 10:18:35,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 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-28 10:18:35,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 321 transitions. [2022-04-28 10:18:35,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 321 transitions. [2022-04-28 10:18:35,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 321 edges. 321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:18:35,868 INFO L225 Difference]: With dead ends: 993 [2022-04-28 10:18:35,868 INFO L226 Difference]: Without dead ends: 969 [2022-04-28 10:18:35,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1282, Invalid=4418, Unknown=0, NotChecked=0, Total=5700 [2022-04-28 10:18:35,869 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 272 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 5686 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 5868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 5686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:18:35,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 257 Invalid, 5868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 5686 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-28 10:18:35,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2022-04-28 10:18:41,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 752. [2022-04-28 10:18:41,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:18:41,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 969 states. Second operand has 752 states, 747 states have (on average 1.3400267737617135) internal successors, (1001), 747 states have internal predecessors, (1001), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:41,476 INFO L74 IsIncluded]: Start isIncluded. First operand 969 states. Second operand has 752 states, 747 states have (on average 1.3400267737617135) internal successors, (1001), 747 states have internal predecessors, (1001), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:41,477 INFO L87 Difference]: Start difference. First operand 969 states. Second operand has 752 states, 747 states have (on average 1.3400267737617135) internal successors, (1001), 747 states have internal predecessors, (1001), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:41,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:41,501 INFO L93 Difference]: Finished difference Result 969 states and 1266 transitions. [2022-04-28 10:18:41,501 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1266 transitions. [2022-04-28 10:18:41,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:41,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:41,503 INFO L74 IsIncluded]: Start isIncluded. First operand has 752 states, 747 states have (on average 1.3400267737617135) internal successors, (1001), 747 states have internal predecessors, (1001), 3 states have call successors, (3), 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 969 states. [2022-04-28 10:18:41,503 INFO L87 Difference]: Start difference. First operand has 752 states, 747 states have (on average 1.3400267737617135) internal successors, (1001), 747 states have internal predecessors, (1001), 3 states have call successors, (3), 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 969 states. [2022-04-28 10:18:41,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:41,528 INFO L93 Difference]: Finished difference Result 969 states and 1266 transitions. [2022-04-28 10:18:41,528 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1266 transitions. [2022-04-28 10:18:41,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:41,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:41,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:18:41,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:18:41,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 747 states have (on average 1.3400267737617135) internal successors, (1001), 747 states have internal predecessors, (1001), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:41,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1005 transitions. [2022-04-28 10:18:41,548 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1005 transitions. Word has length 39 [2022-04-28 10:18:41,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:18:41,548 INFO L495 AbstractCegarLoop]: Abstraction has 752 states and 1005 transitions. [2022-04-28 10:18:41,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 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-28 10:18:41,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 752 states and 1005 transitions. [2022-04-28 10:18:45,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1005 edges. 1005 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:18:45,440 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1005 transitions. [2022-04-28 10:18:45,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:18:45,441 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:18:45,441 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:18:45,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2022-04-28 10:18:45,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:18:45,641 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:18:45,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:18:45,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1576064171, now seen corresponding path program 27 times [2022-04-28 10:18:45,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:18:45,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [415090526] [2022-04-28 10:18:45,644 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:18:45,644 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:18:45,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1576064171, now seen corresponding path program 28 times [2022-04-28 10:18:45,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:18:45,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501101708] [2022-04-28 10:18:45,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:18:45,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:18:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:45,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:18:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:45,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {155579#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {155557#true} is VALID [2022-04-28 10:18:45,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {155557#true} assume true; {155557#true} is VALID [2022-04-28 10:18:45,943 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {155557#true} {155557#true} #94#return; {155557#true} is VALID [2022-04-28 10:18:45,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {155557#true} call ULTIMATE.init(); {155579#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:18:45,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {155579#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {155557#true} is VALID [2022-04-28 10:18:45,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {155557#true} assume true; {155557#true} is VALID [2022-04-28 10:18:45,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {155557#true} {155557#true} #94#return; {155557#true} is VALID [2022-04-28 10:18:45,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {155557#true} call #t~ret17 := main(); {155557#true} is VALID [2022-04-28 10:18:45,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {155557#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {155562#(= main_~y~0 0)} is VALID [2022-04-28 10:18:45,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {155562#(= 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; {155563#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:18:45,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {155563#(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; {155564#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:18:45,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {155564#(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; {155565#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:18:45,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {155565#(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; {155566#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:18:45,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {155566#(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; {155567#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:18:45,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {155567#(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; {155568#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:18:45,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {155568#(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; {155569#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:18:45,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {155569#(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; {155570#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:18:45,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {155570#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {155570#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:18:45,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {155570#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {155571#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:18:45,949 INFO L290 TraceCheckUtils]: 16: Hoare triple {155571#(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; {155572#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:18:45,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {155572#(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; {155573#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:18:45,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {155573#(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; {155574#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:18:45,951 INFO L290 TraceCheckUtils]: 19: Hoare triple {155574#(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; {155575#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:18:45,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {155575#(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; {155576#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:18:45,952 INFO L290 TraceCheckUtils]: 21: Hoare triple {155576#(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; {155577#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:18:45,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {155577#(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; {155578#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:18:45,953 INFO L290 TraceCheckUtils]: 23: Hoare triple {155578#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {155558#false} is VALID [2022-04-28 10:18:45,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {155558#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155558#false} is VALID [2022-04-28 10:18:45,953 INFO L290 TraceCheckUtils]: 25: Hoare triple {155558#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155558#false} is VALID [2022-04-28 10:18:45,953 INFO L290 TraceCheckUtils]: 26: Hoare triple {155558#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155558#false} is VALID [2022-04-28 10:18:45,954 INFO L290 TraceCheckUtils]: 27: Hoare triple {155558#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155558#false} is VALID [2022-04-28 10:18:45,954 INFO L290 TraceCheckUtils]: 28: Hoare triple {155558#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155558#false} is VALID [2022-04-28 10:18:45,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {155558#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155558#false} is VALID [2022-04-28 10:18:45,954 INFO L290 TraceCheckUtils]: 30: Hoare triple {155558#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155558#false} is VALID [2022-04-28 10:18:45,954 INFO L290 TraceCheckUtils]: 31: Hoare triple {155558#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155558#false} is VALID [2022-04-28 10:18:45,954 INFO L290 TraceCheckUtils]: 32: Hoare triple {155558#false} assume !(~y~0 % 4294967296 > 0); {155558#false} is VALID [2022-04-28 10:18:45,954 INFO L290 TraceCheckUtils]: 33: Hoare triple {155558#false} assume !(~x~0 % 4294967296 > 0); {155558#false} is VALID [2022-04-28 10:18:45,954 INFO L290 TraceCheckUtils]: 34: Hoare triple {155558#false} assume !(~z~0 % 4294967296 > 0); {155558#false} is VALID [2022-04-28 10:18:45,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {155558#false} assume !(~y~0 % 4294967296 > 0); {155558#false} is VALID [2022-04-28 10:18:45,954 INFO L272 TraceCheckUtils]: 36: Hoare triple {155558#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {155558#false} is VALID [2022-04-28 10:18:45,954 INFO L290 TraceCheckUtils]: 37: Hoare triple {155558#false} ~cond := #in~cond; {155558#false} is VALID [2022-04-28 10:18:45,954 INFO L290 TraceCheckUtils]: 38: Hoare triple {155558#false} assume 0 == ~cond; {155558#false} is VALID [2022-04-28 10:18:45,955 INFO L290 TraceCheckUtils]: 39: Hoare triple {155558#false} assume !false; {155558#false} is VALID [2022-04-28 10:18:45,955 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:18:45,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:18:45,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501101708] [2022-04-28 10:18:45,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501101708] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:18:45,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438732298] [2022-04-28 10:18:45,955 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:18:45,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:18:45,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:18:45,956 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-28 10:18:45,957 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-28 10:18:46,016 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:18:46,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:18:46,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 10:18:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:46,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:18:46,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {155557#true} call ULTIMATE.init(); {155557#true} is VALID [2022-04-28 10:18:46,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {155557#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {155557#true} is VALID [2022-04-28 10:18:46,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {155557#true} assume true; {155557#true} is VALID [2022-04-28 10:18:46,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {155557#true} {155557#true} #94#return; {155557#true} is VALID [2022-04-28 10:18:46,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {155557#true} call #t~ret17 := main(); {155557#true} is VALID [2022-04-28 10:18:46,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {155557#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {155557#true} is VALID [2022-04-28 10:18:46,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {155557#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155557#true} is VALID [2022-04-28 10:18:46,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {155557#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155604#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:18:46,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {155604#(< 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; {155608#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:18:46,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {155608#(< 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; {155612#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:18:46,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {155612#(< 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; {155616#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:18:46,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {155616#(< 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; {155620#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:18:46,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {155620#(< 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; {155624#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:18:46,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {155624#(< 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; {155628#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:18:46,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {155628#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {155628#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:18:46,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {155628#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {155628#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:18:46,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {155628#(< 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; {155624#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:18:46,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {155624#(< 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; {155620#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:18:46,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {155620#(< 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; {155616#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:18:46,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {155616#(< 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; {155612#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:18:46,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {155612#(< 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; {155608#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:18:46,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {155608#(< 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; {155604#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:18:46,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {155604#(< 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; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:46,341 INFO L290 TraceCheckUtils]: 23: Hoare triple {155656#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:46,342 INFO L290 TraceCheckUtils]: 24: Hoare triple {155656#(< 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; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:46,342 INFO L290 TraceCheckUtils]: 25: Hoare triple {155656#(< 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; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:46,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {155656#(< 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; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:46,343 INFO L290 TraceCheckUtils]: 27: Hoare triple {155656#(< 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; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:46,343 INFO L290 TraceCheckUtils]: 28: Hoare triple {155656#(< 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; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:46,344 INFO L290 TraceCheckUtils]: 29: Hoare triple {155656#(< 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; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:46,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {155656#(< 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; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:46,344 INFO L290 TraceCheckUtils]: 31: Hoare triple {155656#(< 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; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:46,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {155656#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:46,345 INFO L290 TraceCheckUtils]: 33: Hoare triple {155656#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {155558#false} is VALID [2022-04-28 10:18:46,345 INFO L290 TraceCheckUtils]: 34: Hoare triple {155558#false} assume !(~z~0 % 4294967296 > 0); {155558#false} is VALID [2022-04-28 10:18:46,345 INFO L290 TraceCheckUtils]: 35: Hoare triple {155558#false} assume !(~y~0 % 4294967296 > 0); {155558#false} is VALID [2022-04-28 10:18:46,345 INFO L272 TraceCheckUtils]: 36: Hoare triple {155558#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {155558#false} is VALID [2022-04-28 10:18:46,346 INFO L290 TraceCheckUtils]: 37: Hoare triple {155558#false} ~cond := #in~cond; {155558#false} is VALID [2022-04-28 10:18:46,346 INFO L290 TraceCheckUtils]: 38: Hoare triple {155558#false} assume 0 == ~cond; {155558#false} is VALID [2022-04-28 10:18:46,346 INFO L290 TraceCheckUtils]: 39: Hoare triple {155558#false} assume !false; {155558#false} is VALID [2022-04-28 10:18:46,346 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 49 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-28 10:18:46,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:18:46,519 INFO L290 TraceCheckUtils]: 39: Hoare triple {155558#false} assume !false; {155558#false} is VALID [2022-04-28 10:18:46,519 INFO L290 TraceCheckUtils]: 38: Hoare triple {155558#false} assume 0 == ~cond; {155558#false} is VALID [2022-04-28 10:18:46,520 INFO L290 TraceCheckUtils]: 37: Hoare triple {155558#false} ~cond := #in~cond; {155558#false} is VALID [2022-04-28 10:18:46,520 INFO L272 TraceCheckUtils]: 36: Hoare triple {155558#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {155558#false} is VALID [2022-04-28 10:18:46,520 INFO L290 TraceCheckUtils]: 35: Hoare triple {155558#false} assume !(~y~0 % 4294967296 > 0); {155558#false} is VALID [2022-04-28 10:18:46,520 INFO L290 TraceCheckUtils]: 34: Hoare triple {155558#false} assume !(~z~0 % 4294967296 > 0); {155558#false} is VALID [2022-04-28 10:18:46,520 INFO L290 TraceCheckUtils]: 33: Hoare triple {155656#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {155558#false} is VALID [2022-04-28 10:18:46,521 INFO L290 TraceCheckUtils]: 32: Hoare triple {155656#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:46,521 INFO L290 TraceCheckUtils]: 31: Hoare triple {155656#(< 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; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:46,521 INFO L290 TraceCheckUtils]: 30: Hoare triple {155656#(< 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; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:46,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {155656#(< 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; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:46,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {155656#(< 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; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:46,522 INFO L290 TraceCheckUtils]: 27: Hoare triple {155656#(< 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; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:46,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {155656#(< 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; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:46,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {155656#(< 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; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:46,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {155656#(< 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; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:46,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {155656#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:46,525 INFO L290 TraceCheckUtils]: 22: Hoare triple {155604#(< 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; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:18:46,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {155608#(< 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; {155604#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:18:46,527 INFO L290 TraceCheckUtils]: 20: Hoare triple {155612#(< 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; {155608#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:18:46,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {155616#(< 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; {155612#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:18:46,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {155620#(< 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; {155616#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:18:46,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {155624#(< 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; {155620#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:18:46,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {155628#(< 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; {155624#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:18:46,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {155628#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {155628#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:18:46,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {155628#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {155628#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:18:46,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {155624#(< 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; {155628#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:18:46,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {155620#(< 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; {155624#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:18:46,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {155616#(< 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; {155620#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:18:46,535 INFO L290 TraceCheckUtils]: 10: Hoare triple {155612#(< 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; {155616#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:18:46,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {155608#(< 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; {155612#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:18:46,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {155604#(< 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; {155608#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:18:46,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {155557#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155604#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:18:46,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {155557#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155557#true} is VALID [2022-04-28 10:18:46,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {155557#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {155557#true} is VALID [2022-04-28 10:18:46,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {155557#true} call #t~ret17 := main(); {155557#true} is VALID [2022-04-28 10:18:46,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {155557#true} {155557#true} #94#return; {155557#true} is VALID [2022-04-28 10:18:46,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {155557#true} assume true; {155557#true} is VALID [2022-04-28 10:18:46,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {155557#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {155557#true} is VALID [2022-04-28 10:18:46,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {155557#true} call ULTIMATE.init(); {155557#true} is VALID [2022-04-28 10:18:46,539 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 49 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-28 10:18:46,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438732298] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:18:46,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:18:46,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 28 [2022-04-28 10:18:46,539 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:18:46,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [415090526] [2022-04-28 10:18:46,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [415090526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:18:46,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:18:46,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:18:46,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539013037] [2022-04-28 10:18:46,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:18:46,540 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-28 10:18:46,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:18:46,540 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-28 10:18:46,567 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-28 10:18:46,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:18:46,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:18:46,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:18:46,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:18:46,568 INFO L87 Difference]: Start difference. First operand 752 states and 1005 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-28 10:18:55,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:55,802 INFO L93 Difference]: Finished difference Result 876 states and 1196 transitions. [2022-04-28 10:18:55,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-28 10:18:55,803 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-28 10:18:55,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:18:55,803 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-28 10:18:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 146 transitions. [2022-04-28 10:18:55,804 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-28 10:18:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 146 transitions. [2022-04-28 10:18:55,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 146 transitions. [2022-04-28 10:18:55,921 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-28 10:18:55,948 INFO L225 Difference]: With dead ends: 876 [2022-04-28 10:18:55,948 INFO L226 Difference]: Without dead ends: 790 [2022-04-28 10:18:55,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=326, Invalid=4096, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 10:18:55,949 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 93 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:18:55,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 121 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 10:18:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2022-04-28 10:19:01,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 753. [2022-04-28 10:19:01,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:19:01,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 790 states. Second operand has 753 states, 748 states have (on average 1.339572192513369) internal successors, (1002), 748 states have internal predecessors, (1002), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:01,475 INFO L74 IsIncluded]: Start isIncluded. First operand 790 states. Second operand has 753 states, 748 states have (on average 1.339572192513369) internal successors, (1002), 748 states have internal predecessors, (1002), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:01,475 INFO L87 Difference]: Start difference. First operand 790 states. Second operand has 753 states, 748 states have (on average 1.339572192513369) internal successors, (1002), 748 states have internal predecessors, (1002), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:01,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:01,492 INFO L93 Difference]: Finished difference Result 790 states and 1061 transitions. [2022-04-28 10:19:01,492 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1061 transitions. [2022-04-28 10:19:01,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:19:01,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:19:01,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 753 states, 748 states have (on average 1.339572192513369) internal successors, (1002), 748 states have internal predecessors, (1002), 3 states have call successors, (3), 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 790 states. [2022-04-28 10:19:01,494 INFO L87 Difference]: Start difference. First operand has 753 states, 748 states have (on average 1.339572192513369) internal successors, (1002), 748 states have internal predecessors, (1002), 3 states have call successors, (3), 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 790 states. [2022-04-28 10:19:01,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:01,511 INFO L93 Difference]: Finished difference Result 790 states and 1061 transitions. [2022-04-28 10:19:01,511 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1061 transitions. [2022-04-28 10:19:01,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:19:01,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:19:01,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:19:01,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:19:01,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 748 states have (on average 1.339572192513369) internal successors, (1002), 748 states have internal predecessors, (1002), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:01,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1006 transitions. [2022-04-28 10:19:01,531 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1006 transitions. Word has length 40 [2022-04-28 10:19:01,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:19:01,531 INFO L495 AbstractCegarLoop]: Abstraction has 753 states and 1006 transitions. [2022-04-28 10:19:01,531 INFO L496 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-28 10:19:01,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 753 states and 1006 transitions. [2022-04-28 10:19:05,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1006 edges. 1006 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:19:05,181 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1006 transitions. [2022-04-28 10:19:05,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:19:05,182 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:19:05,182 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:19:05,198 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-28 10:19:05,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:19:05,383 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:19:05,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:19:05,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1170033867, now seen corresponding path program 17 times [2022-04-28 10:19:05,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:19:05,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [909079759] [2022-04-28 10:19:05,385 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:19:05,385 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:19:05,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1170033867, now seen corresponding path program 18 times [2022-04-28 10:19:05,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:19:05,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739745441] [2022-04-28 10:19:05,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:19:05,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:19:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:05,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:19:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:05,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {160761#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {160743#true} is VALID [2022-04-28 10:19:05,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {160743#true} assume true; {160743#true} is VALID [2022-04-28 10:19:05,580 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {160743#true} {160743#true} #94#return; {160743#true} is VALID [2022-04-28 10:19:05,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {160743#true} call ULTIMATE.init(); {160761#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:19:05,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {160761#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {160743#true} is VALID [2022-04-28 10:19:05,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {160743#true} assume true; {160743#true} is VALID [2022-04-28 10:19:05,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160743#true} {160743#true} #94#return; {160743#true} is VALID [2022-04-28 10:19:05,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {160743#true} call #t~ret17 := main(); {160743#true} is VALID [2022-04-28 10:19:05,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {160743#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {160748#(= main_~y~0 0)} is VALID [2022-04-28 10:19:05,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {160748#(= 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; {160749#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:19:05,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {160749#(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; {160750#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:19:05,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {160750#(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; {160751#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:19:05,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {160751#(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; {160752#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:19:05,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {160752#(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; {160753#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:19:05,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {160753#(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; {160754#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:19:05,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {160754#(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; {160755#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:19:05,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {160755#(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; {160756#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:19:05,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {160756#(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; {160757#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:19:05,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {160757#(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; {160758#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:19:05,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {160758#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {160758#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:19:05,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {160758#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {160759#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:19:05,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {160759#(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; {160760#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:19:05,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {160760#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {160744#false} is VALID [2022-04-28 10:19:05,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-28 10:19:05,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-28 10:19:05,589 INFO L290 TraceCheckUtils]: 22: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-28 10:19:05,589 INFO L290 TraceCheckUtils]: 23: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-28 10:19:05,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-28 10:19:05,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-28 10:19:05,589 INFO L290 TraceCheckUtils]: 26: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-28 10:19:05,589 INFO L290 TraceCheckUtils]: 27: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-28 10:19:05,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-28 10:19:05,589 INFO L290 TraceCheckUtils]: 29: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-28 10:19:05,589 INFO L290 TraceCheckUtils]: 30: Hoare triple {160744#false} assume !(~y~0 % 4294967296 > 0); {160744#false} is VALID [2022-04-28 10:19:05,589 INFO L290 TraceCheckUtils]: 31: Hoare triple {160744#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; {160744#false} is VALID [2022-04-28 10:19:05,589 INFO L290 TraceCheckUtils]: 32: Hoare triple {160744#false} assume !(~x~0 % 4294967296 > 0); {160744#false} is VALID [2022-04-28 10:19:05,589 INFO L290 TraceCheckUtils]: 33: Hoare triple {160744#false} assume !(~z~0 % 4294967296 > 0); {160744#false} is VALID [2022-04-28 10:19:05,589 INFO L290 TraceCheckUtils]: 34: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {160744#false} is VALID [2022-04-28 10:19:05,590 INFO L290 TraceCheckUtils]: 35: Hoare triple {160744#false} assume !(~y~0 % 4294967296 > 0); {160744#false} is VALID [2022-04-28 10:19:05,590 INFO L272 TraceCheckUtils]: 36: Hoare triple {160744#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {160744#false} is VALID [2022-04-28 10:19:05,590 INFO L290 TraceCheckUtils]: 37: Hoare triple {160744#false} ~cond := #in~cond; {160744#false} is VALID [2022-04-28 10:19:05,590 INFO L290 TraceCheckUtils]: 38: Hoare triple {160744#false} assume 0 == ~cond; {160744#false} is VALID [2022-04-28 10:19:05,590 INFO L290 TraceCheckUtils]: 39: Hoare triple {160744#false} assume !false; {160744#false} is VALID [2022-04-28 10:19:05,590 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-04-28 10:19:05,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:19:05,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739745441] [2022-04-28 10:19:05,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739745441] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:19:05,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902055057] [2022-04-28 10:19:05,591 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:19:05,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:19:05,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:19:05,592 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-28 10:19:05,594 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-28 10:19:05,719 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:19:05,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:19:05,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:19:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:05,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:19:05,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {160743#true} call ULTIMATE.init(); {160743#true} is VALID [2022-04-28 10:19:05,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {160743#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {160743#true} is VALID [2022-04-28 10:19:05,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {160743#true} assume true; {160743#true} is VALID [2022-04-28 10:19:05,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160743#true} {160743#true} #94#return; {160743#true} is VALID [2022-04-28 10:19:05,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {160743#true} call #t~ret17 := main(); {160743#true} is VALID [2022-04-28 10:19:05,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {160743#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {160743#true} is VALID [2022-04-28 10:19:05,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-28 10:19:05,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-28 10:19:05,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-28 10:19:05,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-28 10:19:05,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-28 10:19:05,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-28 10:19:05,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-28 10:19:05,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-28 10:19:05,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-28 10:19:05,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-28 10:19:05,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {160743#true} assume !(~x~0 % 4294967296 > 0); {160743#true} is VALID [2022-04-28 10:19:05,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {160743#true} ~z~0 := ~y~0; {160816#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:19:05,856 INFO L290 TraceCheckUtils]: 18: Hoare triple {160816#(= 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; {160820#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:19:05,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {160820#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {160824#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:19:05,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {160824#(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; {160828#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:19:05,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {160828#(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; {160744#false} is VALID [2022-04-28 10:19:05,858 INFO L290 TraceCheckUtils]: 22: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-28 10:19:05,858 INFO L290 TraceCheckUtils]: 23: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-28 10:19:05,858 INFO L290 TraceCheckUtils]: 24: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-28 10:19:05,859 INFO L290 TraceCheckUtils]: 25: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-28 10:19:05,859 INFO L290 TraceCheckUtils]: 26: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-28 10:19:05,859 INFO L290 TraceCheckUtils]: 27: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-28 10:19:05,859 INFO L290 TraceCheckUtils]: 28: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-28 10:19:05,859 INFO L290 TraceCheckUtils]: 29: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-28 10:19:05,859 INFO L290 TraceCheckUtils]: 30: Hoare triple {160744#false} assume !(~y~0 % 4294967296 > 0); {160744#false} is VALID [2022-04-28 10:19:05,859 INFO L290 TraceCheckUtils]: 31: Hoare triple {160744#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; {160744#false} is VALID [2022-04-28 10:19:05,859 INFO L290 TraceCheckUtils]: 32: Hoare triple {160744#false} assume !(~x~0 % 4294967296 > 0); {160744#false} is VALID [2022-04-28 10:19:05,859 INFO L290 TraceCheckUtils]: 33: Hoare triple {160744#false} assume !(~z~0 % 4294967296 > 0); {160744#false} is VALID [2022-04-28 10:19:05,859 INFO L290 TraceCheckUtils]: 34: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {160744#false} is VALID [2022-04-28 10:19:05,859 INFO L290 TraceCheckUtils]: 35: Hoare triple {160744#false} assume !(~y~0 % 4294967296 > 0); {160744#false} is VALID [2022-04-28 10:19:05,859 INFO L272 TraceCheckUtils]: 36: Hoare triple {160744#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {160744#false} is VALID [2022-04-28 10:19:05,859 INFO L290 TraceCheckUtils]: 37: Hoare triple {160744#false} ~cond := #in~cond; {160744#false} is VALID [2022-04-28 10:19:05,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {160744#false} assume 0 == ~cond; {160744#false} is VALID [2022-04-28 10:19:05,860 INFO L290 TraceCheckUtils]: 39: Hoare triple {160744#false} assume !false; {160744#false} is VALID [2022-04-28 10:19:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-04-28 10:19:05,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:19:05,993 INFO L290 TraceCheckUtils]: 39: Hoare triple {160744#false} assume !false; {160744#false} is VALID [2022-04-28 10:19:05,993 INFO L290 TraceCheckUtils]: 38: Hoare triple {160744#false} assume 0 == ~cond; {160744#false} is VALID [2022-04-28 10:19:05,993 INFO L290 TraceCheckUtils]: 37: Hoare triple {160744#false} ~cond := #in~cond; {160744#false} is VALID [2022-04-28 10:19:05,993 INFO L272 TraceCheckUtils]: 36: Hoare triple {160744#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {160744#false} is VALID [2022-04-28 10:19:05,993 INFO L290 TraceCheckUtils]: 35: Hoare triple {160744#false} assume !(~y~0 % 4294967296 > 0); {160744#false} is VALID [2022-04-28 10:19:05,993 INFO L290 TraceCheckUtils]: 34: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {160744#false} is VALID [2022-04-28 10:19:05,993 INFO L290 TraceCheckUtils]: 33: Hoare triple {160744#false} assume !(~z~0 % 4294967296 > 0); {160744#false} is VALID [2022-04-28 10:19:05,993 INFO L290 TraceCheckUtils]: 32: Hoare triple {160744#false} assume !(~x~0 % 4294967296 > 0); {160744#false} is VALID [2022-04-28 10:19:05,993 INFO L290 TraceCheckUtils]: 31: Hoare triple {160744#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; {160744#false} is VALID [2022-04-28 10:19:05,993 INFO L290 TraceCheckUtils]: 30: Hoare triple {160744#false} assume !(~y~0 % 4294967296 > 0); {160744#false} is VALID [2022-04-28 10:19:05,994 INFO L290 TraceCheckUtils]: 29: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-28 10:19:05,994 INFO L290 TraceCheckUtils]: 28: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-28 10:19:05,994 INFO L290 TraceCheckUtils]: 27: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-28 10:19:05,994 INFO L290 TraceCheckUtils]: 26: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-28 10:19:05,994 INFO L290 TraceCheckUtils]: 25: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-28 10:19:05,994 INFO L290 TraceCheckUtils]: 24: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-28 10:19:05,994 INFO L290 TraceCheckUtils]: 23: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-28 10:19:05,994 INFO L290 TraceCheckUtils]: 22: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-28 10:19:06,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {160828#(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; {160744#false} is VALID [2022-04-28 10:19:06,003 INFO L290 TraceCheckUtils]: 20: Hoare triple {160824#(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; {160828#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:19:06,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {160946#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {160824#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:19:06,005 INFO L290 TraceCheckUtils]: 18: Hoare triple {160950#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160946#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:19:06,005 INFO L290 TraceCheckUtils]: 17: Hoare triple {160743#true} ~z~0 := ~y~0; {160950#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:19:06,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {160743#true} assume !(~x~0 % 4294967296 > 0); {160743#true} is VALID [2022-04-28 10:19:06,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-28 10:19:06,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-28 10:19:06,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-28 10:19:06,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-28 10:19:06,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-28 10:19:06,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-28 10:19:06,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-28 10:19:06,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-28 10:19:06,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-28 10:19:06,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-28 10:19:06,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {160743#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {160743#true} is VALID [2022-04-28 10:19:06,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {160743#true} call #t~ret17 := main(); {160743#true} is VALID [2022-04-28 10:19:06,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160743#true} {160743#true} #94#return; {160743#true} is VALID [2022-04-28 10:19:06,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {160743#true} assume true; {160743#true} is VALID [2022-04-28 10:19:06,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {160743#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {160743#true} is VALID [2022-04-28 10:19:06,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {160743#true} call ULTIMATE.init(); {160743#true} is VALID [2022-04-28 10:19:06,007 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-04-28 10:19:06,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902055057] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:19:06,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:19:06,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 22 [2022-04-28 10:19:06,007 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:19:06,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [909079759] [2022-04-28 10:19:06,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [909079759] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:19:06,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:19:06,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:19:06,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792301627] [2022-04-28 10:19:06,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:19:06,008 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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 40 [2022-04-28 10:19:06,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:19:06,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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-28 10:19:06,028 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-28 10:19:06,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:19:06,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:19:06,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:19:06,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:19:06,028 INFO L87 Difference]: Start difference. First operand 753 states and 1006 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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-28 10:19:14,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:14,525 INFO L93 Difference]: Finished difference Result 879 states and 1154 transitions. [2022-04-28 10:19:14,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:19:14,525 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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 40 [2022-04-28 10:19:14,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:19:14,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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-28 10:19:14,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 145 transitions. [2022-04-28 10:19:14,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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-28 10:19:14,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 145 transitions. [2022-04-28 10:19:14,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 145 transitions. [2022-04-28 10:19:14,644 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-28 10:19:14,677 INFO L225 Difference]: With dead ends: 879 [2022-04-28 10:19:14,677 INFO L226 Difference]: Without dead ends: 858 [2022-04-28 10:19:14,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=1131, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:19:14,677 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 132 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:19:14,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 126 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:19:14,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2022-04-28 10:19:20,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 753. [2022-04-28 10:19:20,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:19:20,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 858 states. Second operand has 753 states, 748 states have (on average 1.338235294117647) internal successors, (1001), 748 states have internal predecessors, (1001), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:20,205 INFO L74 IsIncluded]: Start isIncluded. First operand 858 states. Second operand has 753 states, 748 states have (on average 1.338235294117647) internal successors, (1001), 748 states have internal predecessors, (1001), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:20,205 INFO L87 Difference]: Start difference. First operand 858 states. Second operand has 753 states, 748 states have (on average 1.338235294117647) internal successors, (1001), 748 states have internal predecessors, (1001), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:20,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:20,225 INFO L93 Difference]: Finished difference Result 858 states and 1132 transitions. [2022-04-28 10:19:20,225 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1132 transitions. [2022-04-28 10:19:20,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:19:20,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:19:20,226 INFO L74 IsIncluded]: Start isIncluded. First operand has 753 states, 748 states have (on average 1.338235294117647) internal successors, (1001), 748 states have internal predecessors, (1001), 3 states have call successors, (3), 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 858 states. [2022-04-28 10:19:20,227 INFO L87 Difference]: Start difference. First operand has 753 states, 748 states have (on average 1.338235294117647) internal successors, (1001), 748 states have internal predecessors, (1001), 3 states have call successors, (3), 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 858 states. [2022-04-28 10:19:20,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:20,246 INFO L93 Difference]: Finished difference Result 858 states and 1132 transitions. [2022-04-28 10:19:20,246 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1132 transitions. [2022-04-28 10:19:20,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:19:20,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:19:20,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:19:20,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:19:20,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 748 states have (on average 1.338235294117647) internal successors, (1001), 748 states have internal predecessors, (1001), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:20,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1005 transitions. [2022-04-28 10:19:20,266 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1005 transitions. Word has length 40 [2022-04-28 10:19:20,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:19:20,266 INFO L495 AbstractCegarLoop]: Abstraction has 753 states and 1005 transitions. [2022-04-28 10:19:20,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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-28 10:19:20,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 753 states and 1005 transitions. [2022-04-28 10:19:24,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1005 edges. 1005 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:19:24,909 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1005 transitions. [2022-04-28 10:19:24,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:19:24,910 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:19:24,910 INFO L195 NwaCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:19:24,914 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-28 10:19:25,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:19:25,110 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:19:25,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:19:25,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1406819094, now seen corresponding path program 45 times [2022-04-28 10:19:25,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:19:25,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [921036189] [2022-04-28 10:19:25,113 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:19:25,113 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:19:25,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1406819094, now seen corresponding path program 46 times [2022-04-28 10:19:25,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:19:25,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946766921] [2022-04-28 10:19:25,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:19:25,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:19:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:25,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:19:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:25,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {166045#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {166015#true} is VALID [2022-04-28 10:19:25,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {166015#true} assume true; {166015#true} is VALID [2022-04-28 10:19:25,601 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {166015#true} {166015#true} #94#return; {166015#true} is VALID [2022-04-28 10:19:25,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {166015#true} call ULTIMATE.init(); {166045#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:19:25,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {166045#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {166015#true} is VALID [2022-04-28 10:19:25,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {166015#true} assume true; {166015#true} is VALID [2022-04-28 10:19:25,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {166015#true} {166015#true} #94#return; {166015#true} is VALID [2022-04-28 10:19:25,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {166015#true} call #t~ret17 := main(); {166015#true} is VALID [2022-04-28 10:19:25,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {166015#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {166020#(= main_~y~0 0)} is VALID [2022-04-28 10:19:25,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {166020#(= 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; {166021#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:19:25,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {166021#(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; {166022#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:19:25,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {166022#(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; {166023#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:19:25,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {166023#(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; {166024#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:19:25,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {166024#(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; {166025#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:19:25,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {166025#(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; {166026#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:19:25,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {166026#(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; {166027#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:19:25,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {166027#(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; {166028#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:19:25,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {166028#(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; {166029#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:19:25,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {166029#(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; {166030#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:19:25,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {166030#(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; {166031#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:19:25,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {166031#(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; {166032#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:19:25,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {166032#(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; {166033#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:19:25,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {166033#(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; {166034#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:19:25,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {166034#(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; {166035#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:19:25,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {166035#(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; {166036#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:19:25,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {166036#(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; {166037#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:19:25,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {166037#(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; {166038#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:19:25,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {166038#(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; {166039#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:19:25,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {166039#(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; {166040#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:19:25,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {166040#(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; {166041#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:19:25,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {166041#(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; {166042#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:19:25,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {166042#(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; {166043#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:19:25,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {166043#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {166043#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:19:25,616 INFO L290 TraceCheckUtils]: 30: Hoare triple {166043#(and (<= main_~y~0 23) (<= 23 main_~y~0))} ~z~0 := ~y~0; {166044#(and (<= (div main_~z~0 4294967296) 0) (<= 23 main_~z~0))} is VALID [2022-04-28 10:19:25,616 INFO L290 TraceCheckUtils]: 31: Hoare triple {166044#(and (<= (div main_~z~0 4294967296) 0) (<= 23 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-28 10:19:25,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {166016#false} assume !(~y~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-28 10:19:25,616 INFO L290 TraceCheckUtils]: 33: Hoare triple {166016#false} assume !(~x~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-28 10:19:25,616 INFO L290 TraceCheckUtils]: 34: Hoare triple {166016#false} assume !(~z~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-28 10:19:25,616 INFO L290 TraceCheckUtils]: 35: Hoare triple {166016#false} assume !(~y~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-28 10:19:25,616 INFO L272 TraceCheckUtils]: 36: Hoare triple {166016#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {166016#false} is VALID [2022-04-28 10:19:25,616 INFO L290 TraceCheckUtils]: 37: Hoare triple {166016#false} ~cond := #in~cond; {166016#false} is VALID [2022-04-28 10:19:25,617 INFO L290 TraceCheckUtils]: 38: Hoare triple {166016#false} assume 0 == ~cond; {166016#false} is VALID [2022-04-28 10:19:25,617 INFO L290 TraceCheckUtils]: 39: Hoare triple {166016#false} assume !false; {166016#false} is VALID [2022-04-28 10:19:25,617 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:19:25,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:19:25,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946766921] [2022-04-28 10:19:25,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946766921] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:19:25,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006298000] [2022-04-28 10:19:25,617 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:19:25,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:19:25,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:19:25,618 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-28 10:19:25,619 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-28 10:19:25,666 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:19:25,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:19:25,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-28 10:19:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:25,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:19:26,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {166015#true} call ULTIMATE.init(); {166015#true} is VALID [2022-04-28 10:19:26,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {166015#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {166015#true} is VALID [2022-04-28 10:19:26,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {166015#true} assume true; {166015#true} is VALID [2022-04-28 10:19:26,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {166015#true} {166015#true} #94#return; {166015#true} is VALID [2022-04-28 10:19:26,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {166015#true} call #t~ret17 := main(); {166015#true} is VALID [2022-04-28 10:19:26,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {166015#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {166020#(= main_~y~0 0)} is VALID [2022-04-28 10:19:26,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {166020#(= 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; {166021#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:19:26,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {166021#(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; {166022#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:19:26,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {166022#(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; {166023#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:19:26,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {166023#(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; {166024#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:19:26,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {166024#(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; {166025#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:19:26,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {166025#(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; {166026#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:19:26,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {166026#(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; {166027#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:19:26,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {166027#(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; {166028#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:19:26,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {166028#(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; {166029#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:19:26,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {166029#(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; {166030#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:19:26,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {166030#(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; {166031#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:19:26,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {166031#(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; {166032#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:19:26,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {166032#(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; {166033#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:19:26,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {166033#(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; {166034#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:19:26,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {166034#(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; {166035#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:19:26,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {166035#(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; {166036#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:19:26,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {166036#(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; {166037#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:19:26,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {166037#(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; {166038#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:19:26,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {166038#(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; {166039#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:19:26,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {166039#(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; {166040#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:19:26,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {166040#(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; {166041#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:19:26,060 INFO L290 TraceCheckUtils]: 27: Hoare triple {166041#(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; {166042#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:19:26,061 INFO L290 TraceCheckUtils]: 28: Hoare triple {166042#(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; {166043#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:19:26,061 INFO L290 TraceCheckUtils]: 29: Hoare triple {166043#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {166043#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:19:26,061 INFO L290 TraceCheckUtils]: 30: Hoare triple {166043#(and (<= main_~y~0 23) (<= 23 main_~y~0))} ~z~0 := ~y~0; {166139#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-28 10:19:26,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {166139#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !(~z~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-28 10:19:26,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {166016#false} assume !(~y~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-28 10:19:26,062 INFO L290 TraceCheckUtils]: 33: Hoare triple {166016#false} assume !(~x~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-28 10:19:26,062 INFO L290 TraceCheckUtils]: 34: Hoare triple {166016#false} assume !(~z~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-28 10:19:26,062 INFO L290 TraceCheckUtils]: 35: Hoare triple {166016#false} assume !(~y~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-28 10:19:26,062 INFO L272 TraceCheckUtils]: 36: Hoare triple {166016#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {166016#false} is VALID [2022-04-28 10:19:26,062 INFO L290 TraceCheckUtils]: 37: Hoare triple {166016#false} ~cond := #in~cond; {166016#false} is VALID [2022-04-28 10:19:26,062 INFO L290 TraceCheckUtils]: 38: Hoare triple {166016#false} assume 0 == ~cond; {166016#false} is VALID [2022-04-28 10:19:26,062 INFO L290 TraceCheckUtils]: 39: Hoare triple {166016#false} assume !false; {166016#false} is VALID [2022-04-28 10:19:26,063 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:19:26,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:19:27,125 INFO L290 TraceCheckUtils]: 39: Hoare triple {166016#false} assume !false; {166016#false} is VALID [2022-04-28 10:19:27,125 INFO L290 TraceCheckUtils]: 38: Hoare triple {166016#false} assume 0 == ~cond; {166016#false} is VALID [2022-04-28 10:19:27,125 INFO L290 TraceCheckUtils]: 37: Hoare triple {166016#false} ~cond := #in~cond; {166016#false} is VALID [2022-04-28 10:19:27,126 INFO L272 TraceCheckUtils]: 36: Hoare triple {166016#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {166016#false} is VALID [2022-04-28 10:19:27,126 INFO L290 TraceCheckUtils]: 35: Hoare triple {166016#false} assume !(~y~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-28 10:19:27,126 INFO L290 TraceCheckUtils]: 34: Hoare triple {166016#false} assume !(~z~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-28 10:19:27,126 INFO L290 TraceCheckUtils]: 33: Hoare triple {166016#false} assume !(~x~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-28 10:19:27,126 INFO L290 TraceCheckUtils]: 32: Hoare triple {166016#false} assume !(~y~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-28 10:19:27,126 INFO L290 TraceCheckUtils]: 31: Hoare triple {166191#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-28 10:19:27,126 INFO L290 TraceCheckUtils]: 30: Hoare triple {166195#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {166191#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:19:27,127 INFO L290 TraceCheckUtils]: 29: Hoare triple {166195#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {166195#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:19:27,127 INFO L290 TraceCheckUtils]: 28: Hoare triple {166202#(< 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; {166195#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:19:27,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {166206#(< 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; {166202#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:19:27,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {166210#(< 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; {166206#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:19:27,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {166214#(< 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; {166210#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:19:27,130 INFO L290 TraceCheckUtils]: 24: Hoare triple {166218#(< 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; {166214#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:19:27,131 INFO L290 TraceCheckUtils]: 23: Hoare triple {166222#(< 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; {166218#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:19:27,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {166226#(< 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; {166222#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:19:27,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {166230#(< 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; {166226#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:19:27,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {166234#(< 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; {166230#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:19:27,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {166238#(< 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; {166234#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:19:27,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {166242#(< 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; {166238#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:19:27,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {166246#(< 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; {166242#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:19:27,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {166250#(< 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; {166246#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:19:27,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {166254#(< 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; {166250#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:19:27,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {166258#(< 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; {166254#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:19:27,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {166262#(< 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; {166258#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:19:27,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {166266#(< 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; {166262#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:19:27,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {166270#(< 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; {166266#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:19:27,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {166274#(< 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; {166270#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:19:27,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {166278#(< 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; {166274#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:19:27,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {166282#(< 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; {166278#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:19:27,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {166286#(< 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; {166282#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:19:27,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {166290#(< 0 (mod (+ 23 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; {166286#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:19:27,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {166015#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {166290#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-28 10:19:27,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {166015#true} call #t~ret17 := main(); {166015#true} is VALID [2022-04-28 10:19:27,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {166015#true} {166015#true} #94#return; {166015#true} is VALID [2022-04-28 10:19:27,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {166015#true} assume true; {166015#true} is VALID [2022-04-28 10:19:27,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {166015#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {166015#true} is VALID [2022-04-28 10:19:27,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {166015#true} call ULTIMATE.init(); {166015#true} is VALID [2022-04-28 10:19:27,143 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:19:27,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006298000] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:19:27,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:19:27,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 54 [2022-04-28 10:19:27,144 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:19:27,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [921036189] [2022-04-28 10:19:27,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [921036189] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:19:27,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:19:27,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 10:19:27,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458135933] [2022-04-28 10:19:27,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:19:27,144 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 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-28 10:19:27,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:19:27,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 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-28 10:19:27,174 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-28 10:19:27,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 10:19:27,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:19:27,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 10:19:27,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=2179, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 10:19:27,175 INFO L87 Difference]: Start difference. First operand 753 states and 1005 transitions. Second operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 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-28 10:19:43,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:43,768 INFO L93 Difference]: Finished difference Result 1033 states and 1522 transitions. [2022-04-28 10:19:43,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 10:19:43,768 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 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-28 10:19:43,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:19:43,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 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-28 10:19:43,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 334 transitions. [2022-04-28 10:19:43,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 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-28 10:19:43,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 334 transitions. [2022-04-28 10:19:43,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 334 transitions. [2022-04-28 10:19:44,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 334 edges. 334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:19:44,134 INFO L225 Difference]: With dead ends: 1033 [2022-04-28 10:19:44,134 INFO L226 Difference]: Without dead ends: 1009 [2022-04-28 10:19:44,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1385, Invalid=4777, Unknown=0, NotChecked=0, Total=6162 [2022-04-28 10:19:44,135 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 287 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 6197 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 6388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 6197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:19:44,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 268 Invalid, 6388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 6197 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-28 10:19:44,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2022-04-28 10:19:49,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 783. [2022-04-28 10:19:49,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:19:49,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1009 states. Second operand has 783 states, 778 states have (on average 1.3419023136246786) internal successors, (1044), 778 states have internal predecessors, (1044), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:49,914 INFO L74 IsIncluded]: Start isIncluded. First operand 1009 states. Second operand has 783 states, 778 states have (on average 1.3419023136246786) internal successors, (1044), 778 states have internal predecessors, (1044), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:49,914 INFO L87 Difference]: Start difference. First operand 1009 states. Second operand has 783 states, 778 states have (on average 1.3419023136246786) internal successors, (1044), 778 states have internal predecessors, (1044), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:49,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:49,940 INFO L93 Difference]: Finished difference Result 1009 states and 1320 transitions. [2022-04-28 10:19:49,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1320 transitions. [2022-04-28 10:19:49,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:19:49,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:19:49,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 783 states, 778 states have (on average 1.3419023136246786) internal successors, (1044), 778 states have internal predecessors, (1044), 3 states have call successors, (3), 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 1009 states. [2022-04-28 10:19:49,942 INFO L87 Difference]: Start difference. First operand has 783 states, 778 states have (on average 1.3419023136246786) internal successors, (1044), 778 states have internal predecessors, (1044), 3 states have call successors, (3), 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 1009 states. [2022-04-28 10:19:49,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:49,988 INFO L93 Difference]: Finished difference Result 1009 states and 1320 transitions. [2022-04-28 10:19:49,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1320 transitions. [2022-04-28 10:19:49,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:19:49,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:19:49,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:19:49,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:19:49,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 778 states have (on average 1.3419023136246786) internal successors, (1044), 778 states have internal predecessors, (1044), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:50,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1048 transitions. [2022-04-28 10:19:50,021 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1048 transitions. Word has length 40 [2022-04-28 10:19:50,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:19:50,021 INFO L495 AbstractCegarLoop]: Abstraction has 783 states and 1048 transitions. [2022-04-28 10:19:50,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 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-28 10:19:50,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 783 states and 1048 transitions. [2022-04-28 10:19:53,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1048 edges. 1048 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:19:53,941 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1048 transitions. [2022-04-28 10:19:53,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:19:53,942 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:19:53,942 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:19:53,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2022-04-28 10:19:54,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-04-28 10:19:54,143 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:19:54,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:19:54,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1046867033, now seen corresponding path program 13 times [2022-04-28 10:19:54,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:19:54,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1315478666] [2022-04-28 10:19:54,145 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:19:54,145 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:19:54,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1046867033, now seen corresponding path program 14 times [2022-04-28 10:19:54,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:19:54,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834098466] [2022-04-28 10:19:54,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:19:54,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:19:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:54,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:19:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:54,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {172031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {172011#true} is VALID [2022-04-28 10:19:54,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {172011#true} assume true; {172011#true} is VALID [2022-04-28 10:19:54,693 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {172011#true} {172011#true} #94#return; {172011#true} is VALID [2022-04-28 10:19:54,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {172011#true} call ULTIMATE.init(); {172031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:19:54,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {172031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {172011#true} is VALID [2022-04-28 10:19:54,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {172011#true} assume true; {172011#true} is VALID [2022-04-28 10:19:54,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {172011#true} {172011#true} #94#return; {172011#true} is VALID [2022-04-28 10:19:54,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {172011#true} call #t~ret17 := main(); {172011#true} is VALID [2022-04-28 10:19:54,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {172011#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {172016#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:19:54,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {172016#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= 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; {172017#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:19:54,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {172017#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~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; {172018#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-28 10:19:54,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {172018#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 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; {172019#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:19:54,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {172019#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 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; {172020#(and (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-28 10:19:54,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {172020#(and (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)))} assume !(~x~0 % 4294967296 > 0); {172021#(and (<= main_~y~0 4) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-28 10:19:54,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {172021#(and (<= main_~y~0 4) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} ~z~0 := ~y~0; {172022#(and (<= main_~z~0 4) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-28 10:19:54,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {172022#(and (<= main_~z~0 4) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {172023#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:19:54,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {172023#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 1 (* (div (+ main_~n~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; {172024#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 2))} is VALID [2022-04-28 10:19:54,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {172024#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~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; {172025#(and (<= main_~z~0 1) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:19:54,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {172025#(and (<= main_~z~0 1) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~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; {172026#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:19:54,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {172026#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {172026#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:19:54,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {172026#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 4 (* (div (+ main_~n~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; {172025#(and (<= main_~z~0 1) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:19:54,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {172025#(and (<= main_~z~0 1) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~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; {172024#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 2))} is VALID [2022-04-28 10:19:54,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {172024#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {172023#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:19:54,713 INFO L290 TraceCheckUtils]: 20: Hoare triple {172023#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 1 (* (div (+ main_~n~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; {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} is VALID [2022-04-28 10:19:54,714 INFO L290 TraceCheckUtils]: 21: Hoare triple {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} assume !(~y~0 % 4294967296 > 0); {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} is VALID [2022-04-28 10:19:54,714 INFO L290 TraceCheckUtils]: 22: Hoare triple {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= 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; {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} is VALID [2022-04-28 10:19:54,714 INFO L290 TraceCheckUtils]: 23: Hoare triple {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= 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; {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} is VALID [2022-04-28 10:19:54,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= 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; {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} is VALID [2022-04-28 10:19:54,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= 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; {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} is VALID [2022-04-28 10:19:54,716 INFO L290 TraceCheckUtils]: 26: Hoare triple {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} assume !(~x~0 % 4294967296 > 0); {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} is VALID [2022-04-28 10:19:54,716 INFO L290 TraceCheckUtils]: 27: Hoare triple {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {172023#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:19:54,717 INFO L290 TraceCheckUtils]: 28: Hoare triple {172023#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {172024#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 2))} is VALID [2022-04-28 10:19:54,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {172024#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {172025#(and (<= main_~z~0 1) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:19:54,718 INFO L290 TraceCheckUtils]: 30: Hoare triple {172025#(and (<= main_~z~0 1) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {172026#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:19:54,719 INFO L290 TraceCheckUtils]: 31: Hoare triple {172026#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {172026#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:19:54,720 INFO L290 TraceCheckUtils]: 32: Hoare triple {172026#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {172025#(and (<= main_~z~0 1) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:19:54,720 INFO L290 TraceCheckUtils]: 33: Hoare triple {172025#(and (<= main_~z~0 1) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {172024#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 2))} is VALID [2022-04-28 10:19:54,721 INFO L290 TraceCheckUtils]: 34: Hoare triple {172024#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {172023#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:19:54,722 INFO L290 TraceCheckUtils]: 35: Hoare triple {172023#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {172028#(and (<= (div main_~z~0 4294967296) 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:19:54,723 INFO L290 TraceCheckUtils]: 36: Hoare triple {172028#(and (<= (div main_~z~0 4294967296) 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {172028#(and (<= (div main_~z~0 4294967296) 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:19:54,724 INFO L272 TraceCheckUtils]: 37: Hoare triple {172028#(and (<= (div main_~z~0 4294967296) 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {172029#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:19:54,724 INFO L290 TraceCheckUtils]: 38: Hoare triple {172029#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {172030#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:19:54,724 INFO L290 TraceCheckUtils]: 39: Hoare triple {172030#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {172012#false} is VALID [2022-04-28 10:19:54,724 INFO L290 TraceCheckUtils]: 40: Hoare triple {172012#false} assume !false; {172012#false} is VALID [2022-04-28 10:19:54,725 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:19:54,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:19:54,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834098466] [2022-04-28 10:19:54,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834098466] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:19:54,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129606702] [2022-04-28 10:19:54,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:19:54,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:19:54,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:19:54,726 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-28 10:19:54,727 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-28 10:19:54,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:19:54,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:19:54,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 85 conjunts are in the unsatisfiable core [2022-04-28 10:19:54,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:54,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:20:14,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {172011#true} call ULTIMATE.init(); {172011#true} is VALID [2022-04-28 10:20:14,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {172011#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {172011#true} is VALID [2022-04-28 10:20:14,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {172011#true} assume true; {172011#true} is VALID [2022-04-28 10:20:14,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {172011#true} {172011#true} #94#return; {172011#true} is VALID [2022-04-28 10:20:14,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {172011#true} call #t~ret17 := main(); {172011#true} is VALID [2022-04-28 10:20:14,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {172011#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {172016#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:20:14,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {172016#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= 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; {172017#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:20:14,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {172017#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~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; {172018#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-28 10:20:14,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {172018#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 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; {172059#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:20:14,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {172059#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 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; {172063#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-28 10:20:14,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {172063#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {172067#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (not (< 0 (mod main_~x~0 4294967296))) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-28 10:20:14,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {172067#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (not (< 0 (mod main_~x~0 4294967296))) (<= (+ main_~x~0 4) main_~n~0))} ~z~0 := ~y~0; {172071#(and (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967291)) (<= main_~z~0 4) (not (< 0 (mod main_~x~0 4294967296))) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-28 10:20:14,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {172071#(and (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967291)) (<= main_~z~0 4) (not (< 0 (mod main_~x~0 4294967296))) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {172075#(and (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967292)) (<= main_~z~0 3) (<= (+ main_~x~0 3) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:20:14,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {172075#(and (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967292)) (<= main_~z~0 3) (<= (+ main_~x~0 3) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {172079#(and (<= (+ main_~x~0 2) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~z~0 2) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967293)))} is VALID [2022-04-28 10:20:14,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {172079#(and (<= (+ main_~x~0 2) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~z~0 2) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 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; {172083#(and (<= main_~z~0 1) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 (+ 4294967294 (* (div (+ main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0))} is VALID [2022-04-28 10:20:14,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {172083#(and (<= main_~z~0 1) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 (+ 4294967294 (* (div (+ main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {172087#(and (<= main_~z~0 0) (<= main_~x~0 (+ 4294967295 (* 4294967296 (div (+ main_~z~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)))) (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0))} is VALID [2022-04-28 10:20:14,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {172087#(and (<= main_~z~0 0) (<= main_~x~0 (+ 4294967295 (* 4294967296 (div (+ main_~z~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)))) (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0))} assume !(~z~0 % 4294967296 > 0); {172087#(and (<= main_~z~0 0) (<= main_~x~0 (+ 4294967295 (* 4294967296 (div (+ main_~z~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)))) (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0))} is VALID [2022-04-28 10:20:14,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {172087#(and (<= main_~z~0 0) (<= main_~x~0 (+ 4294967295 (* 4294967296 (div (+ main_~z~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)))) (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~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; {172094#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~z~0 1) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)))))} is VALID [2022-04-28 10:20:14,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {172094#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~z~0 1) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {172098#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~z~0 2) (<= main_~x~0 (+ 4294967295 (* (div (+ (- 2) main_~z~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:20:14,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {172098#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~z~0 2) (<= main_~x~0 (+ 4294967295 (* (div (+ (- 2) main_~z~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~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; {172102#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~z~0 3) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (- 3) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:20:14,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {172102#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~z~0 3) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (- 3) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~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; {172106#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~z~0 4) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (- 4) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:20:14,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {172106#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~z~0 4) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (- 4) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {172106#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~z~0 4) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (- 4) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:20:14,169 INFO L290 TraceCheckUtils]: 22: Hoare triple {172106#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~z~0 4) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (- 4) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~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; {172113#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~z~0 main_~x~0 (- 3) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:20:14,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {172113#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~z~0 main_~x~0 (- 3) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= (+ main_~x~0 1) main_~n~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; {172117#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* (div (+ (- 2) main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~z~0 4))} is VALID [2022-04-28 10:20:14,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {172117#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* (div (+ (- 2) main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= 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; {172121#(and (<= (+ main_~x~0 3) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~z~0 4) (<= main_~x~0 (+ 4294967292 (* (div (+ (- 1) main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:20:14,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {172121#(and (<= (+ main_~x~0 3) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~z~0 4) (<= main_~x~0 (+ 4294967292 (* (div (+ (- 1) main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~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; {172071#(and (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967291)) (<= main_~z~0 4) (not (< 0 (mod main_~x~0 4294967296))) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-28 10:20:14,182 INFO L290 TraceCheckUtils]: 26: Hoare triple {172071#(and (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967291)) (<= main_~z~0 4) (not (< 0 (mod main_~x~0 4294967296))) (<= (+ main_~x~0 4) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {172071#(and (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967291)) (<= main_~z~0 4) (not (< 0 (mod main_~x~0 4294967296))) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-28 10:20:14,188 INFO L290 TraceCheckUtils]: 27: Hoare triple {172071#(and (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967291)) (<= main_~z~0 4) (not (< 0 (mod main_~x~0 4294967296))) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {172075#(and (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967292)) (<= main_~z~0 3) (<= (+ main_~x~0 3) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:20:14,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {172075#(and (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967292)) (<= main_~z~0 3) (<= (+ main_~x~0 3) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {172079#(and (<= (+ main_~x~0 2) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~z~0 2) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967293)))} is VALID [2022-04-28 10:20:14,192 INFO L290 TraceCheckUtils]: 29: Hoare triple {172079#(and (<= (+ main_~x~0 2) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~z~0 2) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967293)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {172083#(and (<= main_~z~0 1) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 (+ 4294967294 (* (div (+ main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0))} is VALID [2022-04-28 10:20:14,201 INFO L290 TraceCheckUtils]: 30: Hoare triple {172083#(and (<= main_~z~0 1) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 (+ 4294967294 (* (div (+ main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {172026#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:20:14,201 INFO L290 TraceCheckUtils]: 31: Hoare triple {172026#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {172026#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:20:14,202 INFO L290 TraceCheckUtils]: 32: Hoare triple {172026#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {172025#(and (<= main_~z~0 1) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:20:14,203 INFO L290 TraceCheckUtils]: 33: Hoare triple {172025#(and (<= main_~z~0 1) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {172024#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 2))} is VALID [2022-04-28 10:20:14,203 INFO L290 TraceCheckUtils]: 34: Hoare triple {172024#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {172023#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:20:14,204 INFO L290 TraceCheckUtils]: 35: Hoare triple {172023#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} is VALID [2022-04-28 10:20:14,205 INFO L290 TraceCheckUtils]: 36: Hoare triple {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} assume !(~y~0 % 4294967296 > 0); {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} is VALID [2022-04-28 10:20:14,206 INFO L272 TraceCheckUtils]: 37: Hoare triple {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {172161#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:20:14,207 INFO L290 TraceCheckUtils]: 38: Hoare triple {172161#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {172165#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:20:14,207 INFO L290 TraceCheckUtils]: 39: Hoare triple {172165#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {172012#false} is VALID [2022-04-28 10:20:14,207 INFO L290 TraceCheckUtils]: 40: Hoare triple {172012#false} assume !false; {172012#false} is VALID [2022-04-28 10:20:14,208 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:20:14,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:20:16,200 INFO L290 TraceCheckUtils]: 40: Hoare triple {172012#false} assume !false; {172012#false} is VALID [2022-04-28 10:20:16,200 INFO L290 TraceCheckUtils]: 39: Hoare triple {172165#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {172012#false} is VALID [2022-04-28 10:20:16,201 INFO L290 TraceCheckUtils]: 38: Hoare triple {172161#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {172165#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:20:16,201 INFO L272 TraceCheckUtils]: 37: Hoare triple {172181#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {172161#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:20:16,202 INFO L290 TraceCheckUtils]: 36: Hoare triple {172181#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {172181#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:20:16,203 INFO L290 TraceCheckUtils]: 35: Hoare triple {172188#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {172181#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:20:16,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {172192#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {172188#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-28 10:20:16,205 INFO L290 TraceCheckUtils]: 33: Hoare triple {172196#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {172192#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 10:20:16,206 INFO L290 TraceCheckUtils]: 32: Hoare triple {172200#(= (mod (+ main_~z~0 4) 4294967296) (mod main_~n~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {172196#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 10:20:16,206 INFO L290 TraceCheckUtils]: 31: Hoare triple {172200#(= (mod (+ main_~z~0 4) 4294967296) (mod main_~n~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {172200#(= (mod (+ main_~z~0 4) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-28 10:20:16,207 INFO L290 TraceCheckUtils]: 30: Hoare triple {172196#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {172200#(= (mod (+ main_~z~0 4) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-28 10:20:16,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {172192#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {172196#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 10:20:16,210 INFO L290 TraceCheckUtils]: 28: Hoare triple {172188#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {172192#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 10:20:16,211 INFO L290 TraceCheckUtils]: 27: Hoare triple {172181#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {172188#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-28 10:20:16,212 INFO L290 TraceCheckUtils]: 26: Hoare triple {172219#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {172181#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:20:16,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {172223#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (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; {172219#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:20:16,214 INFO L290 TraceCheckUtils]: 24: Hoare triple {172227#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {172223#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:20:16,215 INFO L290 TraceCheckUtils]: 23: Hoare triple {172231#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (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; {172227#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:20:16,216 INFO L290 TraceCheckUtils]: 22: Hoare triple {172235#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod (+ 4294967292 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; {172231#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:20:16,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {172235#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {172235#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:20:16,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {172242#(or (= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296)) (< 0 (mod (+ 4294967292 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; {172235#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:20:16,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {172246#(or (= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296)) (< 0 (mod (+ 4294967292 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; {172242#(or (= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:20:16,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {172250#(or (= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296)) (< 0 (mod (+ 4294967292 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; {172246#(or (= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:20:16,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {172254#(or (= (mod (+ main_~z~0 4) 4294967296) (mod main_~n~0 4294967296)) (< 0 (mod (+ 4294967292 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; {172250#(or (= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:20:16,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {172254#(or (= (mod (+ main_~z~0 4) 4294967296) (mod main_~n~0 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {172254#(or (= (mod (+ main_~z~0 4) 4294967296) (mod main_~n~0 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:20:16,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {172261#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (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; {172254#(or (= (mod (+ main_~z~0 4) 4294967296) (mod main_~n~0 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:20:16,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {172265#(or (= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296)) (< 0 (mod (+ main_~x~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; {172261#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-28 10:20:16,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {172269#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~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; {172265#(or (= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:20:16,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {172219#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {172269#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-28 10:20:16,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {172276#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} ~z~0 := ~y~0; {172219#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:20:16,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {172276#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {172276#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:20:16,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {172283#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (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; {172276#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:20:16,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {172287#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (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; {172283#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-28 10:20:16,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {172291#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~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; {172287#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-28 10:20:16,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {172295#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 0 (mod (+ 4294967292 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; {172291#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:20:16,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {172011#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {172295#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:20:16,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {172011#true} call #t~ret17 := main(); {172011#true} is VALID [2022-04-28 10:20:16,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {172011#true} {172011#true} #94#return; {172011#true} is VALID [2022-04-28 10:20:16,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {172011#true} assume true; {172011#true} is VALID [2022-04-28 10:20:16,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {172011#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {172011#true} is VALID [2022-04-28 10:20:16,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {172011#true} call ULTIMATE.init(); {172011#true} is VALID [2022-04-28 10:20:16,238 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:20:16,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129606702] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:20:16,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:20:16,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 27, 26] total 57 [2022-04-28 10:20:16,239 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:20:16,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1315478666] [2022-04-28 10:20:16,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1315478666] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:20:16,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:20:16,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:20:16,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567752849] [2022-04-28 10:20:16,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:20:16,240 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 16 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 41 [2022-04-28 10:20:16,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:20:16,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 16 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-28 10:20:16,298 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-28 10:20:16,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:20:16,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:20:16,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:20:16,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=2778, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 10:20:16,299 INFO L87 Difference]: Start difference. First operand 783 states and 1048 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 16 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-28 10:20:28,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:28,640 INFO L93 Difference]: Finished difference Result 1002 states and 1271 transitions. [2022-04-28 10:20:28,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:20:28,640 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 16 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 41 [2022-04-28 10:20:28,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:20:28,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 16 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-28 10:20:28,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 65 transitions. [2022-04-28 10:20:28,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 16 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-28 10:20:28,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 65 transitions. [2022-04-28 10:20:28,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 65 transitions. [2022-04-28 10:20:28,735 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-28 10:20:28,774 INFO L225 Difference]: With dead ends: 1002 [2022-04-28 10:20:28,774 INFO L226 Difference]: Without dead ends: 987 [2022-04-28 10:20:28,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=574, Invalid=4538, Unknown=0, NotChecked=0, Total=5112 [2022-04-28 10:20:28,775 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 38 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:20:28,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 93 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:20:28,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2022-04-28 10:20:34,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 793. [2022-04-28 10:20:34,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:20:34,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 987 states. Second operand has 793 states, 788 states have (on average 1.3413705583756346) internal successors, (1057), 788 states have internal predecessors, (1057), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:20:34,921 INFO L74 IsIncluded]: Start isIncluded. First operand 987 states. Second operand has 793 states, 788 states have (on average 1.3413705583756346) internal successors, (1057), 788 states have internal predecessors, (1057), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:20:34,921 INFO L87 Difference]: Start difference. First operand 987 states. Second operand has 793 states, 788 states have (on average 1.3413705583756346) internal successors, (1057), 788 states have internal predecessors, (1057), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:20:34,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:34,946 INFO L93 Difference]: Finished difference Result 987 states and 1255 transitions. [2022-04-28 10:20:34,947 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1255 transitions. [2022-04-28 10:20:34,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:20:34,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:20:34,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 793 states, 788 states have (on average 1.3413705583756346) internal successors, (1057), 788 states have internal predecessors, (1057), 3 states have call successors, (3), 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 987 states. [2022-04-28 10:20:34,948 INFO L87 Difference]: Start difference. First operand has 793 states, 788 states have (on average 1.3413705583756346) internal successors, (1057), 788 states have internal predecessors, (1057), 3 states have call successors, (3), 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 987 states. [2022-04-28 10:20:34,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:34,973 INFO L93 Difference]: Finished difference Result 987 states and 1255 transitions. [2022-04-28 10:20:34,973 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1255 transitions. [2022-04-28 10:20:34,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:20:34,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:20:34,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:20:34,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:20:34,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 788 states have (on average 1.3413705583756346) internal successors, (1057), 788 states have internal predecessors, (1057), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:20:34,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1061 transitions. [2022-04-28 10:20:34,996 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1061 transitions. Word has length 41 [2022-04-28 10:20:34,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:20:34,997 INFO L495 AbstractCegarLoop]: Abstraction has 793 states and 1061 transitions. [2022-04-28 10:20:34,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 16 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-28 10:20:34,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 793 states and 1061 transitions. [2022-04-28 10:20:41,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1061 edges. 1060 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:20:41,185 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1061 transitions. [2022-04-28 10:20:41,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:20:41,185 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:20:41,185 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:20:41,201 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-28 10:20:41,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-04-28 10:20:41,386 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:20:41,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:20:41,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1107564487, now seen corresponding path program 11 times [2022-04-28 10:20:41,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:20:41,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [276117177] [2022-04-28 10:20:41,388 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:20:41,388 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:20:41,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1107564487, now seen corresponding path program 12 times [2022-04-28 10:20:41,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:20:41,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981563016] [2022-04-28 10:20:41,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:20:41,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:20:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:41,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:20:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:41,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {177927#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {177910#true} is VALID [2022-04-28 10:20:41,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {177910#true} assume true; {177910#true} is VALID [2022-04-28 10:20:41,584 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {177910#true} {177910#true} #94#return; {177910#true} is VALID [2022-04-28 10:20:41,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {177910#true} call ULTIMATE.init(); {177927#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:20:41,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {177927#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {177910#true} is VALID [2022-04-28 10:20:41,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {177910#true} assume true; {177910#true} is VALID [2022-04-28 10:20:41,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177910#true} {177910#true} #94#return; {177910#true} is VALID [2022-04-28 10:20:41,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {177910#true} call #t~ret17 := main(); {177910#true} is VALID [2022-04-28 10:20:41,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {177910#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {177910#true} is VALID [2022-04-28 10:20:41,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {177910#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177915#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:20:41,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {177915#(<= 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; {177916#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:20:41,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {177916#(<= 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; {177917#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:20:41,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {177917#(<= 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; {177918#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:20:41,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {177918#(<= 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; {177919#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:20:41,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {177919#(<= 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; {177920#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:20:41,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {177920#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {177920#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:20:41,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {177920#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {177920#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:20:41,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {177920#(<= (* 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; {177921#(<= (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:20:41,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {177921#(<= (+ (* (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; {177922#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 2) main_~x~0)} is VALID [2022-04-28 10:20:41,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {177922#(<= (+ (* (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; {177923#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 3) main_~x~0)} is VALID [2022-04-28 10:20:41,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {177923#(<= (+ (* 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; {177924#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-28 10:20:41,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {177924#(<= (+ (* (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; {177925#(<= (+ 5 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:20:41,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {177925#(<= (+ 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; {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:20:41,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:20:41,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {177926#(<= (+ 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; {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:20:41,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {177926#(<= (+ 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; {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:20:41,599 INFO L290 TraceCheckUtils]: 23: Hoare triple {177926#(<= (+ 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; {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:20:41,599 INFO L290 TraceCheckUtils]: 24: Hoare triple {177926#(<= (+ 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; {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:20:41,600 INFO L290 TraceCheckUtils]: 25: Hoare triple {177926#(<= (+ 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; {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:20:41,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {177926#(<= (+ 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; {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:20:41,600 INFO L290 TraceCheckUtils]: 27: Hoare triple {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:20:41,601 INFO L290 TraceCheckUtils]: 28: Hoare triple {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {177911#false} is VALID [2022-04-28 10:20:41,601 INFO L290 TraceCheckUtils]: 29: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-28 10:20:41,601 INFO L290 TraceCheckUtils]: 30: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-28 10:20:41,601 INFO L290 TraceCheckUtils]: 31: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-28 10:20:41,601 INFO L290 TraceCheckUtils]: 32: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-28 10:20:41,601 INFO L290 TraceCheckUtils]: 33: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-28 10:20:41,601 INFO L290 TraceCheckUtils]: 34: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-28 10:20:41,601 INFO L290 TraceCheckUtils]: 35: Hoare triple {177911#false} assume !(~z~0 % 4294967296 > 0); {177911#false} is VALID [2022-04-28 10:20:41,601 INFO L290 TraceCheckUtils]: 36: Hoare triple {177911#false} assume !(~y~0 % 4294967296 > 0); {177911#false} is VALID [2022-04-28 10:20:41,601 INFO L272 TraceCheckUtils]: 37: Hoare triple {177911#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {177911#false} is VALID [2022-04-28 10:20:41,601 INFO L290 TraceCheckUtils]: 38: Hoare triple {177911#false} ~cond := #in~cond; {177911#false} is VALID [2022-04-28 10:20:41,602 INFO L290 TraceCheckUtils]: 39: Hoare triple {177911#false} assume 0 == ~cond; {177911#false} is VALID [2022-04-28 10:20:41,602 INFO L290 TraceCheckUtils]: 40: Hoare triple {177911#false} assume !false; {177911#false} is VALID [2022-04-28 10:20:41,602 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-28 10:20:41,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:20:41,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981563016] [2022-04-28 10:20:41,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981563016] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:20:41,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038464026] [2022-04-28 10:20:41,602 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:20:41,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:20:41,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:20:41,603 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-28 10:20:41,604 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-28 10:20:41,683 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:20:41,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:20:41,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 10:20:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:41,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:20:42,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {177910#true} call ULTIMATE.init(); {177910#true} is VALID [2022-04-28 10:20:42,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {177910#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {177910#true} is VALID [2022-04-28 10:20:42,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {177910#true} assume true; {177910#true} is VALID [2022-04-28 10:20:42,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177910#true} {177910#true} #94#return; {177910#true} is VALID [2022-04-28 10:20:42,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {177910#true} call #t~ret17 := main(); {177910#true} is VALID [2022-04-28 10:20:42,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {177910#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {177910#true} is VALID [2022-04-28 10:20:42,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {177910#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177915#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:20:42,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {177915#(<= 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; {177952#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:20:42,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {177952#(<= 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; {177956#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:42,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {177956#(<= 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; {177960#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:20:42,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {177960#(<= 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; {177964#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:42,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {177964#(<= 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; {177968#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:20:42,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {177968#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !(~x~0 % 4294967296 > 0); {177968#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:20:42,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {177968#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} ~z~0 := ~y~0; {177968#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:20:42,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {177968#(<= 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; {177964#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:42,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {177964#(<= 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; {177960#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:20:42,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {177960#(<= 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; {177956#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:42,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {177956#(<= 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; {177952#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:20:42,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {177952#(<= 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; {177915#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:20:42,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {177915#(<= 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; {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:42,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:42,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {177993#(<= 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; {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:42,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {177993#(<= 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; {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:42,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {177993#(<= 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; {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:42,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {177993#(<= 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; {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:42,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {177993#(<= 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; {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:42,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {177993#(<= 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; {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:42,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:42,060 INFO L290 TraceCheckUtils]: 28: Hoare triple {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {177911#false} is VALID [2022-04-28 10:20:42,060 INFO L290 TraceCheckUtils]: 29: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-28 10:20:42,060 INFO L290 TraceCheckUtils]: 30: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-28 10:20:42,060 INFO L290 TraceCheckUtils]: 31: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-28 10:20:42,060 INFO L290 TraceCheckUtils]: 32: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-28 10:20:42,060 INFO L290 TraceCheckUtils]: 33: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-28 10:20:42,060 INFO L290 TraceCheckUtils]: 34: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-28 10:20:42,060 INFO L290 TraceCheckUtils]: 35: Hoare triple {177911#false} assume !(~z~0 % 4294967296 > 0); {177911#false} is VALID [2022-04-28 10:20:42,060 INFO L290 TraceCheckUtils]: 36: Hoare triple {177911#false} assume !(~y~0 % 4294967296 > 0); {177911#false} is VALID [2022-04-28 10:20:42,060 INFO L272 TraceCheckUtils]: 37: Hoare triple {177911#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {177911#false} is VALID [2022-04-28 10:20:42,061 INFO L290 TraceCheckUtils]: 38: Hoare triple {177911#false} ~cond := #in~cond; {177911#false} is VALID [2022-04-28 10:20:42,061 INFO L290 TraceCheckUtils]: 39: Hoare triple {177911#false} assume 0 == ~cond; {177911#false} is VALID [2022-04-28 10:20:42,061 INFO L290 TraceCheckUtils]: 40: Hoare triple {177911#false} assume !false; {177911#false} is VALID [2022-04-28 10:20:42,061 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-28 10:20:42,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:20:42,349 INFO L290 TraceCheckUtils]: 40: Hoare triple {177911#false} assume !false; {177911#false} is VALID [2022-04-28 10:20:42,349 INFO L290 TraceCheckUtils]: 39: Hoare triple {177911#false} assume 0 == ~cond; {177911#false} is VALID [2022-04-28 10:20:42,349 INFO L290 TraceCheckUtils]: 38: Hoare triple {177911#false} ~cond := #in~cond; {177911#false} is VALID [2022-04-28 10:20:42,349 INFO L272 TraceCheckUtils]: 37: Hoare triple {177911#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {177911#false} is VALID [2022-04-28 10:20:42,349 INFO L290 TraceCheckUtils]: 36: Hoare triple {177911#false} assume !(~y~0 % 4294967296 > 0); {177911#false} is VALID [2022-04-28 10:20:42,349 INFO L290 TraceCheckUtils]: 35: Hoare triple {177911#false} assume !(~z~0 % 4294967296 > 0); {177911#false} is VALID [2022-04-28 10:20:42,349 INFO L290 TraceCheckUtils]: 34: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-28 10:20:42,349 INFO L290 TraceCheckUtils]: 33: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-28 10:20:42,350 INFO L290 TraceCheckUtils]: 32: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-28 10:20:42,350 INFO L290 TraceCheckUtils]: 31: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-28 10:20:42,350 INFO L290 TraceCheckUtils]: 30: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-28 10:20:42,350 INFO L290 TraceCheckUtils]: 29: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-28 10:20:42,350 INFO L290 TraceCheckUtils]: 28: Hoare triple {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {177911#false} is VALID [2022-04-28 10:20:42,351 INFO L290 TraceCheckUtils]: 27: Hoare triple {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:42,351 INFO L290 TraceCheckUtils]: 26: Hoare triple {177993#(<= 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; {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:42,351 INFO L290 TraceCheckUtils]: 25: Hoare triple {177993#(<= 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; {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:42,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {177993#(<= 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; {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:42,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {177993#(<= 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; {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:42,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {177993#(<= 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; {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:42,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {177993#(<= 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; {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:42,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:42,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {177915#(<= 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; {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:42,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {177952#(<= 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; {177915#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:20:42,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {177956#(<= 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; {177952#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:20:42,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {177960#(<= 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; {177956#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:42,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {177964#(<= 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; {177960#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:20:42,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {177968#(<= 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; {177964#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:42,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {177968#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} ~z~0 := ~y~0; {177968#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:20:42,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {177968#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !(~x~0 % 4294967296 > 0); {177968#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:20:42,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {177964#(<= 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; {177968#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:20:42,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {177960#(<= 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; {177964#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:42,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {177956#(<= 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; {177960#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:20:42,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {177952#(<= 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; {177956#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:42,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {177915#(<= 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; {177952#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:20:42,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {177910#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177915#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:20:42,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {177910#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {177910#true} is VALID [2022-04-28 10:20:42,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {177910#true} call #t~ret17 := main(); {177910#true} is VALID [2022-04-28 10:20:42,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177910#true} {177910#true} #94#return; {177910#true} is VALID [2022-04-28 10:20:42,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {177910#true} assume true; {177910#true} is VALID [2022-04-28 10:20:42,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {177910#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {177910#true} is VALID [2022-04-28 10:20:42,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {177910#true} call ULTIMATE.init(); {177910#true} is VALID [2022-04-28 10:20:42,363 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-28 10:20:42,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038464026] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:20:42,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:20:42,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 21 [2022-04-28 10:20:42,364 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:20:42,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [276117177] [2022-04-28 10:20:42,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [276117177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:20:42,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:20:42,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:20:42,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960852012] [2022-04-28 10:20:42,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:20:42,364 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 14 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 41 [2022-04-28 10:20:42,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:20:42,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.8) internal successors, (27), 14 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-28 10:20:42,392 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-28 10:20:42,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:20:42,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:20:42,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:20:42,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:20:42,392 INFO L87 Difference]: Start difference. First operand 793 states and 1061 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 14 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)