/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-e106359-m [2022-04-15 12:55:32,803 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:55:32,804 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:55:32,830 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:55:32,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:55:32,831 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:55:32,831 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:55:32,833 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:55:32,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:55:32,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:55:32,835 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:55:32,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:55:32,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:55:32,845 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:55:32,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:55:32,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:55:32,849 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:55:32,850 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:55:32,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:55:32,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:55:32,855 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:55:32,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:55:32,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:55:32,856 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:55:32,857 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:55:32,858 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:55:32,858 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:55:32,859 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:55:32,859 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:55:32,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:55:32,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:55:32,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:55:32,860 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:55:32,861 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:55:32,861 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:55:32,861 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:55:32,862 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:55:32,862 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:55:32,862 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:55:32,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:55:32,863 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:55:32,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:55:32,864 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:55:32,869 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:55:32,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:55:32,869 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:55:32,870 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:55:32,870 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:55:32,870 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:55:32,870 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:55:32,870 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:55:32,870 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:55:32,870 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:55:32,870 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:55:32,871 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:55:32,871 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:55:32,871 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:55:32,871 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:55:32,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:55:32,871 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:55:32,871 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:55:32,871 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:55:32,872 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:55:32,872 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:55:32,872 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:55:32,872 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:55:33,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:55:33,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:55:33,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:55:33,062 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:55:33,063 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:55:33,064 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-15 12:55:33,099 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3dd1072d/281bc1a6b4c34122989b0e99c349e8d3/FLAGbfb2114fd [2022-04-15 12:55:33,453 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:55:33,453 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de61.c [2022-04-15 12:55:33,456 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3dd1072d/281bc1a6b4c34122989b0e99c349e8d3/FLAGbfb2114fd [2022-04-15 12:55:33,464 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3dd1072d/281bc1a6b4c34122989b0e99c349e8d3 [2022-04-15 12:55:33,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:55:33,467 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:55:33,468 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:55:33,468 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:55:33,470 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:55:33,472 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:55:33" (1/1) ... [2022-04-15 12:55:33,473 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4031132a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:55:33, skipping insertion in model container [2022-04-15 12:55:33,473 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:55:33" (1/1) ... [2022-04-15 12:55:33,479 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:55:33,492 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:55:33,654 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-15 12:55:33,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:55:33,674 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:55:33,690 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-15 12:55:33,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:55:33,701 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:55:33,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:55:33 WrapperNode [2022-04-15 12:55:33,702 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:55:33,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:55:33,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:55:33,703 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:55:33,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:55:33" (1/1) ... [2022-04-15 12:55:33,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:55:33" (1/1) ... [2022-04-15 12:55:33,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:55:33" (1/1) ... [2022-04-15 12:55:33,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:55:33" (1/1) ... [2022-04-15 12:55:33,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:55:33" (1/1) ... [2022-04-15 12:55:33,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:55:33" (1/1) ... [2022-04-15 12:55:33,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:55:33" (1/1) ... [2022-04-15 12:55:33,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:55:33,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:55:33,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:55:33,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:55:33,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:55:33" (1/1) ... [2022-04-15 12:55:33,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:55:33,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:33,782 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 12:55:33,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 12:55:33,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:55:33,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:55:33,804 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:55:33,804 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:55:33,804 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:55:33,804 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:55:33,804 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:55:33,804 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:55:33,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:55:33,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 12:55:33,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:55:33,810 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:55:33,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:55:33,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:55:33,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:55:33,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:55:33,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:55:33,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:55:33,851 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:55:33,852 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:55:34,018 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:55:34,022 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:55:34,022 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-04-15 12:55:34,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:55:34 BoogieIcfgContainer [2022-04-15 12:55:34,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:55:34,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:55:34,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:55:34,029 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:55:34,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:55:33" (1/3) ... [2022-04-15 12:55:34,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5946f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:55:34, skipping insertion in model container [2022-04-15 12:55:34,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:55:33" (2/3) ... [2022-04-15 12:55:34,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5946f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:55:34, skipping insertion in model container [2022-04-15 12:55:34,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:55:34" (3/3) ... [2022-04-15 12:55:34,031 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de61.c [2022-04-15 12:55:34,034 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:55:34,034 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:55:34,059 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:55:34,062 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:55:34,063 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:55:34,073 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-15 12:55:34,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:55:34,077 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:34,078 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:34,078 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:34,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:34,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1370249117, now seen corresponding path program 1 times [2022-04-15 12:55:34,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:34,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1764690797] [2022-04-15 12:55:34,098 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:55:34,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1370249117, now seen corresponding path program 2 times [2022-04-15 12:55:34,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:34,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840805601] [2022-04-15 12:55:34,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:34,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:34,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:34,275 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-15 12:55:34,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-15 12:55:34,276 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #94#return; {28#true} is VALID [2022-04-15 12:55:34,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:34,279 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-15 12:55:34,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-15 12:55:34,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #94#return; {28#true} is VALID [2022-04-15 12:55:34,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret17 := main(); {28#true} is VALID [2022-04-15 12:55:34,280 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-15 12:55:34,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume !(~x~0 % 4294967296 > 0); {28#true} is VALID [2022-04-15 12:55:34,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#true} ~z~0 := ~y~0; {28#true} is VALID [2022-04-15 12:55:34,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#true} assume !(~z~0 % 4294967296 > 0); {28#true} is VALID [2022-04-15 12:55:34,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#true} assume !(~y~0 % 4294967296 > 0); {28#true} is VALID [2022-04-15 12:55:34,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-04-15 12:55:34,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume !(~z~0 % 4294967296 > 0); {29#false} is VALID [2022-04-15 12:55:34,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} assume !(~y~0 % 4294967296 > 0); {29#false} is VALID [2022-04-15 12:55:34,282 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-15 12:55:34,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-15 12:55:34,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-15 12:55:34,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-15 12:55:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:55:34,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:34,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840805601] [2022-04-15 12:55:34,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840805601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:34,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:34,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:55:34,286 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:34,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1764690797] [2022-04-15 12:55:34,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1764690797] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:34,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:34,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:55:34,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141936575] [2022-04-15 12:55:34,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:34,290 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-15 12:55:34,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:34,293 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-15 12:55:34,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:34,308 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:55:34,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:34,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:55:34,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:55:34,327 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-15 12:55:34,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:34,412 INFO L93 Difference]: Finished difference Result 43 states and 66 transitions. [2022-04-15 12:55:34,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:55:34,412 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-15 12:55:34,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:34,413 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-15 12:55:34,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-15 12:55:34,418 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-15 12:55:34,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-15 12:55:34,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2022-04-15 12:55:34,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:34,480 INFO L225 Difference]: With dead ends: 43 [2022-04-15 12:55:34,480 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 12:55:34,482 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:55:34,485 INFO L913 BasicCegarLoop]: 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-15 12:55:34,487 INFO L914 BasicCegarLoop]: 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-15 12:55:34,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 12:55:34,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 12:55:34,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:34,509 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-15 12:55:34,510 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-15 12:55:34,510 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-15 12:55:34,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:34,511 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-04-15 12:55:34,512 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-15 12:55:34,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:34,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:34,512 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-15 12:55:34,512 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-15 12:55:34,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:34,514 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-04-15 12:55:34,514 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-15 12:55:34,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:34,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:34,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:34,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:34,515 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-15 12:55:34,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-04-15 12:55:34,517 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 17 [2022-04-15 12:55:34,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:34,517 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-04-15 12:55:34,517 INFO L479 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-15 12:55:34,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 23 transitions. [2022-04-15 12:55:34,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:34,549 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-15 12:55:34,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:55:34,550 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:34,550 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:34,550 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:55:34,550 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:34,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:34,551 INFO L85 PathProgramCache]: Analyzing trace with hash 2115201689, now seen corresponding path program 1 times [2022-04-15 12:55:34,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:34,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1116064012] [2022-04-15 12:55:34,552 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:55:34,552 INFO L85 PathProgramCache]: Analyzing trace with hash 2115201689, now seen corresponding path program 2 times [2022-04-15 12:55:34,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:34,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906406815] [2022-04-15 12:55:34,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:34,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:34,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:34,902 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-15 12:55:34,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#true} assume true; {194#true} is VALID [2022-04-15 12:55:34,902 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {194#true} {194#true} #94#return; {194#true} is VALID [2022-04-15 12:55:34,903 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-15 12:55:34,903 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-15 12:55:34,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {194#true} assume true; {194#true} is VALID [2022-04-15 12:55:34,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} #94#return; {194#true} is VALID [2022-04-15 12:55:34,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {194#true} call #t~ret17 := main(); {194#true} is VALID [2022-04-15 12:55:34,905 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-15 12:55:34,906 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-15 12:55:34,907 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-15 12:55:34,908 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-15 12:55:34,908 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-15 12:55:34,909 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-15 12:55:34,910 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-15 12:55:34,911 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-15 12:55:34,912 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-15 12:55:34,913 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-15 12:55:34,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {204#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {195#false} is VALID [2022-04-15 12:55:34,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {195#false} assume !false; {195#false} is VALID [2022-04-15 12:55:34,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:55:34,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:34,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906406815] [2022-04-15 12:55:34,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906406815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:34,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:34,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:55:34,919 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:34,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1116064012] [2022-04-15 12:55:34,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1116064012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:34,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:34,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:55:34,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838379319] [2022-04-15 12:55:34,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:34,922 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-15 12:55:34,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:34,923 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-15 12:55:34,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:34,940 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:55:34,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:34,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:55:34,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:55:34,943 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-15 12:55:35,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:35,302 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2022-04-15 12:55:35,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:55:35,302 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-15 12:55:35,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:35,303 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-15 12:55:35,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-15 12:55:35,305 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-15 12:55:35,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-15 12:55:35,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 53 transitions. [2022-04-15 12:55:35,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:35,352 INFO L225 Difference]: With dead ends: 38 [2022-04-15 12:55:35,352 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 12:55:35,353 INFO L912 BasicCegarLoop]: 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-15 12:55:35,353 INFO L913 BasicCegarLoop]: 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-15 12:55:35,354 INFO L914 BasicCegarLoop]: 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-15 12:55:35,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 12:55:35,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 12:55:35,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:35,357 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-15 12:55:35,357 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-15 12:55:35,357 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-15 12:55:35,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:35,358 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-15 12:55:35,358 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-15 12:55:35,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:35,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:35,359 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-15 12:55:35,359 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-15 12:55:35,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:35,360 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-15 12:55:35,360 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-15 12:55:35,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:35,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:35,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:35,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:35,361 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-15 12:55:35,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-04-15 12:55:35,362 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 17 [2022-04-15 12:55:35,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:35,362 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-04-15 12:55:35,362 INFO L479 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-15 12:55:35,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 24 transitions. [2022-04-15 12:55:35,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:35,385 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-15 12:55:35,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:55:35,386 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:35,386 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:35,386 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:55:35,387 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:35,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:35,388 INFO L85 PathProgramCache]: Analyzing trace with hash -121895178, now seen corresponding path program 1 times [2022-04-15 12:55:35,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:35,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1604432606] [2022-04-15 12:55:36,182 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:36,184 INFO L85 PathProgramCache]: Analyzing trace with hash -994530153, now seen corresponding path program 1 times [2022-04-15 12:55:36,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:36,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10805111] [2022-04-15 12:55:36,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:36,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:36,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:36,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {384#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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-15 12:55:36,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {370#true} assume true; {370#true} is VALID [2022-04-15 12:55:36,780 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {370#true} {370#true} #94#return; {370#true} is VALID [2022-04-15 12:55:36,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {370#true} call ULTIMATE.init(); {384#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:36,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {384#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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-15 12:55:36,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {370#true} assume true; {370#true} is VALID [2022-04-15 12:55:36,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {370#true} {370#true} #94#return; {370#true} is VALID [2022-04-15 12:55:36,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {370#true} call #t~ret17 := main(); {370#true} is VALID [2022-04-15 12:55:36,783 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#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 12:55:36,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {375#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} [98] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_1 v_main_~y~0_Out_2) (= v_main_~x~0_In_1 v_main_~x~0_Out_2)) (and (= 0 |v_main_#t~post6_Out_2|) (< 0 (mod (+ v_main_~x~0_Out_2 1) 4294967296)) (= |v_main_#t~post5_Out_2| 0) (= (+ v_main_~x~0_In_1 v_main_~y~0_In_1) (+ v_main_~x~0_Out_2 v_main_~y~0_Out_2)) (<= v_main_~x~0_Out_2 v_main_~x~0_In_1))) InVars {main_~x~0=v_main_~x~0_In_1, main_~y~0=v_main_~y~0_In_1} OutVars{main_~y~0=v_main_~y~0_Out_2, main_#t~post5=|v_main_#t~post5_Out_2|, main_~x~0=v_main_~x~0_Out_2, main_#t~post6=|v_main_#t~post6_Out_2|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {376#(or (= main_~n~0 main_~x~0) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~y~0 main_~x~0))))} is VALID [2022-04-15 12:55:36,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {376#(or (= main_~n~0 main_~x~0) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~y~0 main_~x~0))))} [97] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {377#(or (and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-15 12:55:36,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#(or (and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} ~z~0 := ~y~0; {378#(or (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (or (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))) (not (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (and (= 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)) (<= (div (+ main_~x~0 1) 4294967296) (div main_~x~0 4294967296))))} is VALID [2022-04-15 12:55:36,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {378#(or (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (or (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))) (not (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (and (= 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)) (<= (div (+ main_~x~0 1) 4294967296) (div main_~x~0 4294967296))))} assume !(~z~0 % 4294967296 > 0); {379#(and (or (and (= main_~n~0 main_~x~0) (<= (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (div (+ main_~x~0 1) 4294967296) (div main_~x~0 4294967296))) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (or (not (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (<= (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:55:36,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {379#(and (or (and (= main_~n~0 main_~x~0) (<= (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (div (+ main_~x~0 1) 4294967296) (div main_~x~0 4294967296))) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (or (not (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (<= (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {380#(and (or (and (= main_~n~0 main_~x~0) (<= (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (div (+ main_~x~0 1) 4294967296) (div main_~x~0 4294967296))) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (< (+ 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-15 12:55:36,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {380#(and (or (and (= main_~n~0 main_~x~0) (<= (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (div (+ main_~x~0 1) 4294967296) (div main_~x~0 4294967296))) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (< (+ 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); {381#(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-15 12:55:36,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {381#(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); {381#(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-15 12:55:36,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {381#(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); {381#(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-15 12:55:36,793 INFO L272 TraceCheckUtils]: 14: Hoare triple {381#(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)); {382#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:55:36,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {382#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {383#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:55:36,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {383#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {371#false} is VALID [2022-04-15 12:55:36,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {371#false} assume !false; {371#false} is VALID [2022-04-15 12:55:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:55:36,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:36,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10805111] [2022-04-15 12:55:36,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10805111] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:36,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:36,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:55:36,880 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:36,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1604432606] [2022-04-15 12:55:36,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1604432606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:36,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:36,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:55:36,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195525769] [2022-04-15 12:55:36,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:36,881 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 12:55:36,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:36,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:36,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:36,898 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:55:36,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:36,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:55:36,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:55:36,899 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:37,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:37,883 INFO L93 Difference]: Finished difference Result 47 states and 69 transitions. [2022-04-15 12:55:37,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:55:37,884 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 12:55:37,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:37,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:37,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-15 12:55:37,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:37,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-15 12:55:37,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2022-04-15 12:55:37,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:37,967 INFO L225 Difference]: With dead ends: 47 [2022-04-15 12:55:37,967 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 12:55:37,968 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:55:37,968 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 66 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:37,969 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 47 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:55:37,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 12:55:37,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2022-04-15 12:55:37,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:37,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 28 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:37,995 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 28 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:37,995 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 28 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:37,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:37,996 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2022-04-15 12:55:37,996 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2022-04-15 12:55:37,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:37,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:37,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 12:55:37,997 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 12:55:37,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:37,999 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2022-04-15 12:55:37,999 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2022-04-15 12:55:37,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:37,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:37,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:37,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:37,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:38,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2022-04-15 12:55:38,000 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 18 [2022-04-15 12:55:38,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:38,001 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2022-04-15 12:55:38,001 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:38,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 40 transitions. [2022-04-15 12:55:38,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:38,046 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2022-04-15 12:55:38,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 12:55:38,046 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:38,047 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:38,047 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:55:38,047 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:38,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:38,047 INFO L85 PathProgramCache]: Analyzing trace with hash 550711896, now seen corresponding path program 1 times [2022-04-15 12:55:38,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:38,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [291209180] [2022-04-15 12:55:38,226 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:38,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1059809129, now seen corresponding path program 1 times [2022-04-15 12:55:38,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:38,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485133249] [2022-04-15 12:55:38,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:38,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:38,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:38,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {625#true} is VALID [2022-04-15 12:55:38,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {625#true} assume true; {625#true} is VALID [2022-04-15 12:55:38,280 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {625#true} {625#true} #94#return; {625#true} is VALID [2022-04-15 12:55:38,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {625#true} call ULTIMATE.init(); {631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:38,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {625#true} is VALID [2022-04-15 12:55:38,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {625#true} assume true; {625#true} is VALID [2022-04-15 12:55:38,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {625#true} {625#true} #94#return; {625#true} is VALID [2022-04-15 12:55:38,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {625#true} call #t~ret17 := main(); {625#true} is VALID [2022-04-15 12:55:38,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {625#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {625#true} is VALID [2022-04-15 12:55:38,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {625#true} [100] L16-2-->L16-3_primed: Formula: (or (and (<= v_main_~x~0_Out_4 v_main_~x~0_In_2) (= |v_main_#t~post5_Out_4| 0) (< 0 (mod (+ v_main_~x~0_Out_4 1) 4294967296)) (= 0 |v_main_#t~post6_Out_4|) (= (+ v_main_~x~0_In_2 v_main_~y~0_In_2) (+ v_main_~x~0_Out_4 v_main_~y~0_Out_4))) (and (= v_main_~x~0_In_2 v_main_~x~0_Out_4) (= v_main_~y~0_In_2 v_main_~y~0_Out_4))) InVars {main_~x~0=v_main_~x~0_In_2, main_~y~0=v_main_~y~0_In_2} OutVars{main_~y~0=v_main_~y~0_Out_4, main_#t~post5=|v_main_#t~post5_Out_4|, main_~x~0=v_main_~x~0_Out_4, main_#t~post6=|v_main_#t~post6_Out_4|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {625#true} is VALID [2022-04-15 12:55:38,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {625#true} [99] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {625#true} is VALID [2022-04-15 12:55:38,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {625#true} ~z~0 := ~y~0; {625#true} is VALID [2022-04-15 12:55:38,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {625#true} assume !(~z~0 % 4294967296 > 0); {625#true} is VALID [2022-04-15 12:55:38,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {625#true} assume !(~y~0 % 4294967296 > 0); {630#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:38,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {630#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {630#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:38,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {630#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {630#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:38,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {630#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {626#false} is VALID [2022-04-15 12:55:38,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {626#false} assume !(~y~0 % 4294967296 > 0); {626#false} is VALID [2022-04-15 12:55:38,286 INFO L272 TraceCheckUtils]: 15: Hoare triple {626#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {626#false} is VALID [2022-04-15 12:55:38,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {626#false} ~cond := #in~cond; {626#false} is VALID [2022-04-15 12:55:38,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {626#false} assume 0 == ~cond; {626#false} is VALID [2022-04-15 12:55:38,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {626#false} assume !false; {626#false} is VALID [2022-04-15 12:55:38,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:55:38,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:38,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485133249] [2022-04-15 12:55:38,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485133249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:38,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:38,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:55:38,325 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:38,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [291209180] [2022-04-15 12:55:38,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [291209180] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:38,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:38,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:55:38,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986989068] [2022-04-15 12:55:38,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:38,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 12:55:38,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:38,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:38,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:38,340 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:55:38,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:38,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:55:38,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:55:38,341 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:38,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:38,567 INFO L93 Difference]: Finished difference Result 49 states and 73 transitions. [2022-04-15 12:55:38,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:55:38,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 12:55:38,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:38,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-15 12:55:38,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:38,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-15 12:55:38,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-04-15 12:55:38,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:38,616 INFO L225 Difference]: With dead ends: 49 [2022-04-15 12:55:38,616 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 12:55:38,617 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:55:38,617 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 43 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:38,618 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 28 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:55:38,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 12:55:38,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2022-04-15 12:55:38,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:38,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 33 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 28 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:38,665 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 33 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 28 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:38,665 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 33 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 28 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:38,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:38,666 INFO L93 Difference]: Finished difference Result 41 states and 60 transitions. [2022-04-15 12:55:38,666 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2022-04-15 12:55:38,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:38,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:38,670 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 28 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-15 12:55:38,670 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 28 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-15 12:55:38,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:38,673 INFO L93 Difference]: Finished difference Result 41 states and 60 transitions. [2022-04-15 12:55:38,673 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2022-04-15 12:55:38,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:38,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:38,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:38,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:38,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 28 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:38,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2022-04-15 12:55:38,677 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 19 [2022-04-15 12:55:38,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:38,677 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2022-04-15 12:55:38,677 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:38,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 47 transitions. [2022-04-15 12:55:38,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:38,732 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2022-04-15 12:55:38,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 12:55:38,733 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:38,733 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:38,733 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 12:55:38,733 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:38,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:38,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1989908199, now seen corresponding path program 1 times [2022-04-15 12:55:38,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:38,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [291553077] [2022-04-15 12:55:38,863 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:38,866 INFO L85 PathProgramCache]: Analyzing trace with hash 50746598, now seen corresponding path program 1 times [2022-04-15 12:55:38,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:38,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310862312] [2022-04-15 12:55:38,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:38,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:38,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:38,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {896#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {889#true} is VALID [2022-04-15 12:55:38,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {889#true} assume true; {889#true} is VALID [2022-04-15 12:55:38,920 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {889#true} {889#true} #94#return; {889#true} is VALID [2022-04-15 12:55:38,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {889#true} call ULTIMATE.init(); {896#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:38,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {896#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {889#true} is VALID [2022-04-15 12:55:38,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {889#true} assume true; {889#true} is VALID [2022-04-15 12:55:38,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {889#true} {889#true} #94#return; {889#true} is VALID [2022-04-15 12:55:38,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {889#true} call #t~ret17 := main(); {889#true} is VALID [2022-04-15 12:55:38,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {889#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {889#true} is VALID [2022-04-15 12:55:38,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {889#true} [102] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_3 v_main_~y~0_Out_6) (= v_main_~x~0_In_3 v_main_~x~0_Out_6)) (and (= |v_main_#t~post5_Out_6| 0) (<= v_main_~x~0_Out_6 v_main_~x~0_In_3) (= (+ v_main_~x~0_In_3 v_main_~y~0_In_3) (+ v_main_~x~0_Out_6 v_main_~y~0_Out_6)) (= 0 |v_main_#t~post6_Out_6|) (< 0 (mod (+ v_main_~x~0_Out_6 1) 4294967296)))) InVars {main_~x~0=v_main_~x~0_In_3, main_~y~0=v_main_~y~0_In_3} OutVars{main_~y~0=v_main_~y~0_Out_6, main_#t~post5=|v_main_#t~post5_Out_6|, main_~x~0=v_main_~x~0_Out_6, main_#t~post6=|v_main_#t~post6_Out_6|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {889#true} is VALID [2022-04-15 12:55:38,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {889#true} [101] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {889#true} is VALID [2022-04-15 12:55:38,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {889#true} ~z~0 := ~y~0; {889#true} is VALID [2022-04-15 12:55:38,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {889#true} assume !(~z~0 % 4294967296 > 0); {894#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:38,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {894#(<= main_~z~0 (* (div 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; {895#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:55:38,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {895#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {895#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:55:38,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {895#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {895#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:55:38,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {895#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {890#false} is VALID [2022-04-15 12:55:38,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {890#false} assume !(~y~0 % 4294967296 > 0); {890#false} is VALID [2022-04-15 12:55:38,925 INFO L272 TraceCheckUtils]: 15: Hoare triple {890#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {890#false} is VALID [2022-04-15 12:55:38,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {890#false} ~cond := #in~cond; {890#false} is VALID [2022-04-15 12:55:38,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {890#false} assume 0 == ~cond; {890#false} is VALID [2022-04-15 12:55:38,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {890#false} assume !false; {890#false} is VALID [2022-04-15 12:55:38,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:55:38,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:38,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310862312] [2022-04-15 12:55:38,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310862312] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:38,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436251067] [2022-04-15 12:55:38,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:38,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:38,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:38,929 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:55:38,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 12:55:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:38,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 12:55:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:38,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:39,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {889#true} call ULTIMATE.init(); {889#true} is VALID [2022-04-15 12:55:39,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {889#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {889#true} is VALID [2022-04-15 12:55:39,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {889#true} assume true; {889#true} is VALID [2022-04-15 12:55:39,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {889#true} {889#true} #94#return; {889#true} is VALID [2022-04-15 12:55:39,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {889#true} call #t~ret17 := main(); {889#true} is VALID [2022-04-15 12:55:39,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {889#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {889#true} is VALID [2022-04-15 12:55:39,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {889#true} [102] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_3 v_main_~y~0_Out_6) (= v_main_~x~0_In_3 v_main_~x~0_Out_6)) (and (= |v_main_#t~post5_Out_6| 0) (<= v_main_~x~0_Out_6 v_main_~x~0_In_3) (= (+ v_main_~x~0_In_3 v_main_~y~0_In_3) (+ v_main_~x~0_Out_6 v_main_~y~0_Out_6)) (= 0 |v_main_#t~post6_Out_6|) (< 0 (mod (+ v_main_~x~0_Out_6 1) 4294967296)))) InVars {main_~x~0=v_main_~x~0_In_3, main_~y~0=v_main_~y~0_In_3} OutVars{main_~y~0=v_main_~y~0_Out_6, main_#t~post5=|v_main_#t~post5_Out_6|, main_~x~0=v_main_~x~0_Out_6, main_#t~post6=|v_main_#t~post6_Out_6|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {889#true} is VALID [2022-04-15 12:55:39,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {889#true} [101] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {889#true} is VALID [2022-04-15 12:55:39,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {889#true} ~z~0 := ~y~0; {924#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:55:39,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {924#(= main_~z~0 main_~y~0)} assume !(~z~0 % 4294967296 > 0); {928#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:55:39,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {928#(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; {890#false} is VALID [2022-04-15 12:55:39,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {890#false} assume !(~y~0 % 4294967296 > 0); {890#false} is VALID [2022-04-15 12:55:39,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {890#false} assume !(~x~0 % 4294967296 > 0); {890#false} is VALID [2022-04-15 12:55:39,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {890#false} assume !(~z~0 % 4294967296 > 0); {890#false} is VALID [2022-04-15 12:55:39,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {890#false} assume !(~y~0 % 4294967296 > 0); {890#false} is VALID [2022-04-15 12:55:39,065 INFO L272 TraceCheckUtils]: 15: Hoare triple {890#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {890#false} is VALID [2022-04-15 12:55:39,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {890#false} ~cond := #in~cond; {890#false} is VALID [2022-04-15 12:55:39,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {890#false} assume 0 == ~cond; {890#false} is VALID [2022-04-15 12:55:39,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {890#false} assume !false; {890#false} is VALID [2022-04-15 12:55:39,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:55:39,065 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 12:55:39,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436251067] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:39,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 12:55:39,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-04-15 12:55:39,094 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:39,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [291553077] [2022-04-15 12:55:39,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [291553077] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:39,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:39,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:55:39,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731847892] [2022-04-15 12:55:39,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:39,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 12:55:39,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:39,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:39,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:39,146 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:55:39,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:39,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:55:39,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:55:39,146 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:39,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:39,337 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2022-04-15 12:55:39,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:55:39,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 12:55:39,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:39,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:39,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-15 12:55:39,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:39,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-15 12:55:39,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2022-04-15 12:55:39,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:39,383 INFO L225 Difference]: With dead ends: 51 [2022-04-15 12:55:39,383 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 12:55:39,383 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:55:39,384 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:39,384 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 53 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:55:39,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 12:55:39,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2022-04-15 12:55:39,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:39,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 25 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-15 12:55:39,430 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 25 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-15 12:55:39,430 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 25 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-15 12:55:39,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:39,432 INFO L93 Difference]: Finished difference Result 35 states and 50 transitions. [2022-04-15 12:55:39,432 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2022-04-15 12:55:39,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:39,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:39,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 25 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 35 states. [2022-04-15 12:55:39,433 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 25 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 35 states. [2022-04-15 12:55:39,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:39,437 INFO L93 Difference]: Finished difference Result 35 states and 50 transitions. [2022-04-15 12:55:39,437 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2022-04-15 12:55:39,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:39,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:39,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:39,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:39,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 25 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-15 12:55:39,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2022-04-15 12:55:39,439 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 19 [2022-04-15 12:55:39,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:39,439 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 42 transitions. [2022-04-15 12:55:39,439 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:39,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 42 transitions. [2022-04-15 12:55:39,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:39,490 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2022-04-15 12:55:39,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:55:39,491 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:39,491 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:39,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 12:55:39,691 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:39,691 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:39,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:39,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1955708389, now seen corresponding path program 1 times [2022-04-15 12:55:39,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:39,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1714168872] [2022-04-15 12:55:39,829 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:39,830 INFO L85 PathProgramCache]: Analyzing trace with hash 373317638, now seen corresponding path program 1 times [2022-04-15 12:55:39,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:39,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174451758] [2022-04-15 12:55:39,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:39,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:39,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:39,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {1200#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1194#true} is VALID [2022-04-15 12:55:39,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {1194#true} assume true; {1194#true} is VALID [2022-04-15 12:55:39,875 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1194#true} {1194#true} #94#return; {1194#true} is VALID [2022-04-15 12:55:39,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {1194#true} call ULTIMATE.init(); {1200#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:39,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {1200#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1194#true} is VALID [2022-04-15 12:55:39,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {1194#true} assume true; {1194#true} is VALID [2022-04-15 12:55:39,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1194#true} {1194#true} #94#return; {1194#true} is VALID [2022-04-15 12:55:39,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {1194#true} call #t~ret17 := main(); {1194#true} is VALID [2022-04-15 12:55:39,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {1194#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1194#true} is VALID [2022-04-15 12:55:39,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {1194#true} [104] L16-2-->L16-3_primed: Formula: (or (and (= 0 |v_main_#t~post6_Out_8|) (= |v_main_#t~post5_Out_8| 0) (<= v_main_~x~0_Out_8 v_main_~x~0_In_4) (< 0 (mod (+ v_main_~x~0_Out_8 1) 4294967296)) (= (+ v_main_~x~0_In_4 v_main_~y~0_In_4) (+ v_main_~x~0_Out_8 v_main_~y~0_Out_8))) (and (= v_main_~y~0_In_4 v_main_~y~0_Out_8) (= v_main_~x~0_In_4 v_main_~x~0_Out_8))) InVars {main_~x~0=v_main_~x~0_In_4, main_~y~0=v_main_~y~0_In_4} OutVars{main_~y~0=v_main_~y~0_Out_8, main_#t~post5=|v_main_#t~post5_Out_8|, main_~x~0=v_main_~x~0_Out_8, main_#t~post6=|v_main_#t~post6_Out_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1194#true} is VALID [2022-04-15 12:55:39,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {1194#true} [103] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1194#true} is VALID [2022-04-15 12:55:39,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {1194#true} ~z~0 := ~y~0; {1194#true} is VALID [2022-04-15 12:55:39,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {1194#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1194#true} is VALID [2022-04-15 12:55:39,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {1194#true} assume !(~z~0 % 4294967296 > 0); {1199#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:39,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {1199#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {1199#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:39,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {1199#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {1199#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:39,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {1199#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1195#false} is VALID [2022-04-15 12:55:39,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {1195#false} assume !(~z~0 % 4294967296 > 0); {1195#false} is VALID [2022-04-15 12:55:39,879 INFO L290 TraceCheckUtils]: 15: Hoare triple {1195#false} assume !(~y~0 % 4294967296 > 0); {1195#false} is VALID [2022-04-15 12:55:39,879 INFO L272 TraceCheckUtils]: 16: Hoare triple {1195#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1195#false} is VALID [2022-04-15 12:55:39,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {1195#false} ~cond := #in~cond; {1195#false} is VALID [2022-04-15 12:55:39,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {1195#false} assume 0 == ~cond; {1195#false} is VALID [2022-04-15 12:55:39,879 INFO L290 TraceCheckUtils]: 19: Hoare triple {1195#false} assume !false; {1195#false} is VALID [2022-04-15 12:55:39,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:55:39,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:39,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174451758] [2022-04-15 12:55:39,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174451758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:39,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:39,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:55:39,908 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:39,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1714168872] [2022-04-15 12:55:39,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1714168872] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:39,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:39,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:55:39,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503171406] [2022-04-15 12:55:39,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:39,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 12:55:39,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:39,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:39,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:39,922 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:55:39,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:39,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:55:39,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:55:39,923 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:40,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:40,138 INFO L93 Difference]: Finished difference Result 53 states and 77 transitions. [2022-04-15 12:55:40,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:55:40,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 12:55:40,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:40,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:40,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2022-04-15 12:55:40,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:40,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2022-04-15 12:55:40,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 54 transitions. [2022-04-15 12:55:40,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:40,217 INFO L225 Difference]: With dead ends: 53 [2022-04-15 12:55:40,217 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 12:55:40,217 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:55:40,218 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 37 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:40,218 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 29 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:55:40,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 12:55:40,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2022-04-15 12:55:40,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:40,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 34 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 29 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:40,270 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 34 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 29 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:40,270 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 34 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 29 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:40,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:40,271 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2022-04-15 12:55:40,272 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-15 12:55:40,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:40,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:40,272 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 29 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-15 12:55:40,272 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 29 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-15 12:55:40,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:40,274 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2022-04-15 12:55:40,274 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-15 12:55:40,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:40,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:40,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:40,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:40,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 29 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:40,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2022-04-15 12:55:40,275 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 20 [2022-04-15 12:55:40,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:40,275 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2022-04-15 12:55:40,275 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:40,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 47 transitions. [2022-04-15 12:55:40,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:40,341 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2022-04-15 12:55:40,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:55:40,342 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:40,342 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:40,342 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 12:55:40,342 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:40,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:40,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1992076293, now seen corresponding path program 1 times [2022-04-15 12:55:40,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:40,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1090748040] [2022-04-15 12:55:40,488 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:40,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1188237722, now seen corresponding path program 1 times [2022-04-15 12:55:40,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:40,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24014225] [2022-04-15 12:55:40,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:40,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:40,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:40,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {1480#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1471#true} is VALID [2022-04-15 12:55:40,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-15 12:55:40,596 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1471#true} {1471#true} #94#return; {1471#true} is VALID [2022-04-15 12:55:40,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {1471#true} call ULTIMATE.init(); {1480#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:40,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {1480#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1471#true} is VALID [2022-04-15 12:55:40,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-15 12:55:40,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1471#true} {1471#true} #94#return; {1471#true} is VALID [2022-04-15 12:55:40,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {1471#true} call #t~ret17 := main(); {1471#true} is VALID [2022-04-15 12:55:40,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {1471#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1476#(= main_~y~0 0)} is VALID [2022-04-15 12:55:40,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {1476#(= main_~y~0 0)} [106] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_10 1) 4294967296)) (= (+ v_main_~x~0_In_5 v_main_~y~0_In_5) (+ v_main_~y~0_Out_10 v_main_~x~0_Out_10)) (<= v_main_~x~0_Out_10 v_main_~x~0_In_5) (= |v_main_#t~post6_Out_10| 0) (= |v_main_#t~post5_Out_10| 0)) (and (= v_main_~y~0_In_5 v_main_~y~0_Out_10) (= v_main_~x~0_In_5 v_main_~x~0_Out_10))) InVars {main_~x~0=v_main_~x~0_In_5, main_~y~0=v_main_~y~0_In_5} OutVars{main_~y~0=v_main_~y~0_Out_10, main_#t~post5=|v_main_#t~post5_Out_10|, main_~x~0=v_main_~x~0_Out_10, main_#t~post6=|v_main_#t~post6_Out_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1477#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} is VALID [2022-04-15 12:55:40,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {1477#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} [105] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1477#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} is VALID [2022-04-15 12:55:40,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {1477#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} ~z~0 := ~y~0; {1478#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= main_~z~0 0) (<= 0 main_~z~0)))} is VALID [2022-04-15 12:55:40,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {1478#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= main_~z~0 0) (<= 0 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; {1479#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:55:40,600 INFO L290 TraceCheckUtils]: 10: Hoare triple {1479#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1479#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:55:40,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {1479#(<= (+ (* 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; {1479#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:55:40,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {1479#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1479#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:55:40,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {1479#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1472#false} is VALID [2022-04-15 12:55:40,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {1472#false} assume !(~z~0 % 4294967296 > 0); {1472#false} is VALID [2022-04-15 12:55:40,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {1472#false} assume !(~y~0 % 4294967296 > 0); {1472#false} is VALID [2022-04-15 12:55:40,601 INFO L272 TraceCheckUtils]: 16: Hoare triple {1472#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1472#false} is VALID [2022-04-15 12:55:40,601 INFO L290 TraceCheckUtils]: 17: Hoare triple {1472#false} ~cond := #in~cond; {1472#false} is VALID [2022-04-15 12:55:40,602 INFO L290 TraceCheckUtils]: 18: Hoare triple {1472#false} assume 0 == ~cond; {1472#false} is VALID [2022-04-15 12:55:40,602 INFO L290 TraceCheckUtils]: 19: Hoare triple {1472#false} assume !false; {1472#false} is VALID [2022-04-15 12:55:40,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:55:40,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:40,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24014225] [2022-04-15 12:55:40,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24014225] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:40,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966971988] [2022-04-15 12:55:40,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:40,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:40,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:40,603 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:55:40,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 12:55:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:40,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 12:55:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:40,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:40,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {1471#true} call ULTIMATE.init(); {1471#true} is VALID [2022-04-15 12:55:40,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1471#true} is VALID [2022-04-15 12:55:40,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-15 12:55:40,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1471#true} {1471#true} #94#return; {1471#true} is VALID [2022-04-15 12:55:40,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {1471#true} call #t~ret17 := main(); {1471#true} is VALID [2022-04-15 12:55:40,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {1471#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1471#true} is VALID [2022-04-15 12:55:40,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {1471#true} [106] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_10 1) 4294967296)) (= (+ v_main_~x~0_In_5 v_main_~y~0_In_5) (+ v_main_~y~0_Out_10 v_main_~x~0_Out_10)) (<= v_main_~x~0_Out_10 v_main_~x~0_In_5) (= |v_main_#t~post6_Out_10| 0) (= |v_main_#t~post5_Out_10| 0)) (and (= v_main_~y~0_In_5 v_main_~y~0_Out_10) (= v_main_~x~0_In_5 v_main_~x~0_Out_10))) InVars {main_~x~0=v_main_~x~0_In_5, main_~y~0=v_main_~y~0_In_5} OutVars{main_~y~0=v_main_~y~0_Out_10, main_#t~post5=|v_main_#t~post5_Out_10|, main_~x~0=v_main_~x~0_Out_10, main_#t~post6=|v_main_#t~post6_Out_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1471#true} is VALID [2022-04-15 12:55:40,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {1471#true} [105] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1471#true} is VALID [2022-04-15 12:55:40,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {1471#true} ~z~0 := ~y~0; {1508#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:55:40,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {1508#(= 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; {1512#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 12:55:40,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {1512#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {1512#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 12:55:40,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {1512#(= main_~y~0 (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1519#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:40,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {1519#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1519#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:40,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {1519#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1519#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:40,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {1519#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1472#false} is VALID [2022-04-15 12:55:40,713 INFO L290 TraceCheckUtils]: 15: Hoare triple {1472#false} assume !(~y~0 % 4294967296 > 0); {1472#false} is VALID [2022-04-15 12:55:40,713 INFO L272 TraceCheckUtils]: 16: Hoare triple {1472#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1472#false} is VALID [2022-04-15 12:55:40,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {1472#false} ~cond := #in~cond; {1472#false} is VALID [2022-04-15 12:55:40,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {1472#false} assume 0 == ~cond; {1472#false} is VALID [2022-04-15 12:55:40,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {1472#false} assume !false; {1472#false} is VALID [2022-04-15 12:55:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:55:40,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:55:40,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {1472#false} assume !false; {1472#false} is VALID [2022-04-15 12:55:40,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {1472#false} assume 0 == ~cond; {1472#false} is VALID [2022-04-15 12:55:40,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {1472#false} ~cond := #in~cond; {1472#false} is VALID [2022-04-15 12:55:40,806 INFO L272 TraceCheckUtils]: 16: Hoare triple {1472#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1472#false} is VALID [2022-04-15 12:55:40,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {1472#false} assume !(~y~0 % 4294967296 > 0); {1472#false} is VALID [2022-04-15 12:55:40,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {1519#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1472#false} is VALID [2022-04-15 12:55:40,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {1519#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1519#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:40,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {1519#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1519#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:40,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {1568#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1519#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:40,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {1568#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1568#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-15 12:55:40,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {1575#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1568#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-15 12:55:40,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {1471#true} ~z~0 := ~y~0; {1575#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 12:55:40,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {1471#true} [105] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1471#true} is VALID [2022-04-15 12:55:40,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {1471#true} [106] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_10 1) 4294967296)) (= (+ v_main_~x~0_In_5 v_main_~y~0_In_5) (+ v_main_~y~0_Out_10 v_main_~x~0_Out_10)) (<= v_main_~x~0_Out_10 v_main_~x~0_In_5) (= |v_main_#t~post6_Out_10| 0) (= |v_main_#t~post5_Out_10| 0)) (and (= v_main_~y~0_In_5 v_main_~y~0_Out_10) (= v_main_~x~0_In_5 v_main_~x~0_Out_10))) InVars {main_~x~0=v_main_~x~0_In_5, main_~y~0=v_main_~y~0_In_5} OutVars{main_~y~0=v_main_~y~0_Out_10, main_#t~post5=|v_main_#t~post5_Out_10|, main_~x~0=v_main_~x~0_Out_10, main_#t~post6=|v_main_#t~post6_Out_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1471#true} is VALID [2022-04-15 12:55:40,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {1471#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1471#true} is VALID [2022-04-15 12:55:40,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {1471#true} call #t~ret17 := main(); {1471#true} is VALID [2022-04-15 12:55:40,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1471#true} {1471#true} #94#return; {1471#true} is VALID [2022-04-15 12:55:40,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-15 12:55:40,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1471#true} is VALID [2022-04-15 12:55:40,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {1471#true} call ULTIMATE.init(); {1471#true} is VALID [2022-04-15 12:55:40,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:55:40,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966971988] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:55:40,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:55:40,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2022-04-15 12:55:40,879 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:40,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1090748040] [2022-04-15 12:55:40,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1090748040] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:40,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:40,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:55:40,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272139603] [2022-04-15 12:55:40,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:40,880 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-15 12:55:40,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:40,880 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-15 12:55:40,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:40,894 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:55:40,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:40,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:55:40,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:55:40,895 INFO L87 Difference]: Start difference. First operand 34 states and 47 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-15 12:55:41,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:41,390 INFO L93 Difference]: Finished difference Result 53 states and 74 transitions. [2022-04-15 12:55:41,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:55:41,391 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-15 12:55:41,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:41,391 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-15 12:55:41,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-15 12:55:41,392 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-15 12:55:41,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-15 12:55:41,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-04-15 12:55:41,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:41,434 INFO L225 Difference]: With dead ends: 53 [2022-04-15 12:55:41,434 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 12:55:41,434 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:55:41,435 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:41,435 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 44 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:55:41,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 12:55:41,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2022-04-15 12:55:41,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:41,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:41,503 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:41,503 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:41,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:41,504 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2022-04-15 12:55:41,504 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2022-04-15 12:55:41,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:41,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:41,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-15 12:55:41,504 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-15 12:55:41,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:41,506 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2022-04-15 12:55:41,506 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2022-04-15 12:55:41,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:41,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:41,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:41,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:41,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:41,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-15 12:55:41,507 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 20 [2022-04-15 12:55:41,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:41,507 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2022-04-15 12:55:41,507 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:41,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 50 transitions. [2022-04-15 12:55:41,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:41,578 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2022-04-15 12:55:41,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:55:41,579 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:41,579 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:41,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 12:55:41,779 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-04-15 12:55:41,779 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:41,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:41,780 INFO L85 PathProgramCache]: Analyzing trace with hash -673846474, now seen corresponding path program 1 times [2022-04-15 12:55:41,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:41,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1452051912] [2022-04-15 12:55:41,918 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:41,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1157116457, now seen corresponding path program 1 times [2022-04-15 12:55:41,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:41,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838544609] [2022-04-15 12:55:41,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:41,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:41,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:41,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {1893#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1885#true} is VALID [2022-04-15 12:55:41,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {1885#true} assume true; {1885#true} is VALID [2022-04-15 12:55:41,990 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1885#true} {1885#true} #94#return; {1885#true} is VALID [2022-04-15 12:55:41,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {1885#true} call ULTIMATE.init(); {1893#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:41,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {1893#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1885#true} is VALID [2022-04-15 12:55:41,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {1885#true} assume true; {1885#true} is VALID [2022-04-15 12:55:41,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1885#true} {1885#true} #94#return; {1885#true} is VALID [2022-04-15 12:55:41,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {1885#true} call #t~ret17 := main(); {1885#true} is VALID [2022-04-15 12:55:41,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {1885#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1885#true} is VALID [2022-04-15 12:55:41,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {1885#true} [108] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_6 v_main_~x~0_Out_12) (= v_main_~y~0_In_6 v_main_~y~0_Out_12)) (and (= |v_main_#t~post5_Out_12| 0) (< 0 (mod (+ v_main_~x~0_Out_12 1) 4294967296)) (= (+ v_main_~y~0_Out_12 v_main_~x~0_Out_12) (+ v_main_~x~0_In_6 v_main_~y~0_In_6)) (<= v_main_~x~0_Out_12 v_main_~x~0_In_6) (= |v_main_#t~post6_Out_12| 0))) InVars {main_~x~0=v_main_~x~0_In_6, main_~y~0=v_main_~y~0_In_6} OutVars{main_~y~0=v_main_~y~0_Out_12, main_#t~post5=|v_main_#t~post5_Out_12|, main_~x~0=v_main_~x~0_Out_12, main_#t~post6=|v_main_#t~post6_Out_12|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1885#true} is VALID [2022-04-15 12:55:41,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {1885#true} [107] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1885#true} is VALID [2022-04-15 12:55:41,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {1885#true} ~z~0 := ~y~0; {1890#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:55:41,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {1890#(= 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; {1891#(and (= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0) (<= main_~y~0 (+ 4294967295 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:55:41,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {1891#(and (= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0) (<= main_~y~0 (+ 4294967295 (* (div 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; {1892#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 2) main_~y~0)} is VALID [2022-04-15 12:55:41,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {1892#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 2) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {1892#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 2) main_~y~0)} is VALID [2022-04-15 12:55:41,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {1892#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 2) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {1886#false} is VALID [2022-04-15 12:55:41,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {1886#false} assume !(~x~0 % 4294967296 > 0); {1886#false} is VALID [2022-04-15 12:55:41,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {1886#false} assume !(~z~0 % 4294967296 > 0); {1886#false} is VALID [2022-04-15 12:55:41,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {1886#false} assume !(~y~0 % 4294967296 > 0); {1886#false} is VALID [2022-04-15 12:55:41,994 INFO L272 TraceCheckUtils]: 16: Hoare triple {1886#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1886#false} is VALID [2022-04-15 12:55:41,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {1886#false} ~cond := #in~cond; {1886#false} is VALID [2022-04-15 12:55:41,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {1886#false} assume 0 == ~cond; {1886#false} is VALID [2022-04-15 12:55:41,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {1886#false} assume !false; {1886#false} is VALID [2022-04-15 12:55:41,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:55:41,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:41,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838544609] [2022-04-15 12:55:41,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838544609] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:41,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126410462] [2022-04-15 12:55:41,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:41,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:41,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:41,996 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:55:42,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 12:55:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:42,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:55:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:42,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:42,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {1885#true} call ULTIMATE.init(); {1885#true} is VALID [2022-04-15 12:55:42,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {1885#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1885#true} is VALID [2022-04-15 12:55:42,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {1885#true} assume true; {1885#true} is VALID [2022-04-15 12:55:42,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1885#true} {1885#true} #94#return; {1885#true} is VALID [2022-04-15 12:55:42,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {1885#true} call #t~ret17 := main(); {1885#true} is VALID [2022-04-15 12:55:42,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {1885#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1885#true} is VALID [2022-04-15 12:55:42,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {1885#true} [108] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_6 v_main_~x~0_Out_12) (= v_main_~y~0_In_6 v_main_~y~0_Out_12)) (and (= |v_main_#t~post5_Out_12| 0) (< 0 (mod (+ v_main_~x~0_Out_12 1) 4294967296)) (= (+ v_main_~y~0_Out_12 v_main_~x~0_Out_12) (+ v_main_~x~0_In_6 v_main_~y~0_In_6)) (<= v_main_~x~0_Out_12 v_main_~x~0_In_6) (= |v_main_#t~post6_Out_12| 0))) InVars {main_~x~0=v_main_~x~0_In_6, main_~y~0=v_main_~y~0_In_6} OutVars{main_~y~0=v_main_~y~0_Out_12, main_#t~post5=|v_main_#t~post5_Out_12|, main_~x~0=v_main_~x~0_Out_12, main_#t~post6=|v_main_#t~post6_Out_12|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1885#true} is VALID [2022-04-15 12:55:42,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {1885#true} [107] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1885#true} is VALID [2022-04-15 12:55:42,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {1885#true} ~z~0 := ~y~0; {1890#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:55:42,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {1890#(= 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; {1924#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:55:42,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {1924#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1924#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:55:42,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {1924#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1924#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:55:42,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {1924#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1886#false} is VALID [2022-04-15 12:55:42,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {1886#false} assume !(~x~0 % 4294967296 > 0); {1886#false} is VALID [2022-04-15 12:55:42,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {1886#false} assume !(~z~0 % 4294967296 > 0); {1886#false} is VALID [2022-04-15 12:55:42,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {1886#false} assume !(~y~0 % 4294967296 > 0); {1886#false} is VALID [2022-04-15 12:55:42,098 INFO L272 TraceCheckUtils]: 16: Hoare triple {1886#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1886#false} is VALID [2022-04-15 12:55:42,098 INFO L290 TraceCheckUtils]: 17: Hoare triple {1886#false} ~cond := #in~cond; {1886#false} is VALID [2022-04-15 12:55:42,099 INFO L290 TraceCheckUtils]: 18: Hoare triple {1886#false} assume 0 == ~cond; {1886#false} is VALID [2022-04-15 12:55:42,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {1886#false} assume !false; {1886#false} is VALID [2022-04-15 12:55:42,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:55:42,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:55:42,176 INFO L290 TraceCheckUtils]: 19: Hoare triple {1886#false} assume !false; {1886#false} is VALID [2022-04-15 12:55:42,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {1886#false} assume 0 == ~cond; {1886#false} is VALID [2022-04-15 12:55:42,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {1886#false} ~cond := #in~cond; {1886#false} is VALID [2022-04-15 12:55:42,177 INFO L272 TraceCheckUtils]: 16: Hoare triple {1886#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1886#false} is VALID [2022-04-15 12:55:42,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {1886#false} assume !(~y~0 % 4294967296 > 0); {1886#false} is VALID [2022-04-15 12:55:42,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {1886#false} assume !(~z~0 % 4294967296 > 0); {1886#false} is VALID [2022-04-15 12:55:42,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {1886#false} assume !(~x~0 % 4294967296 > 0); {1886#false} is VALID [2022-04-15 12:55:42,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {1924#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1886#false} is VALID [2022-04-15 12:55:42,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {1924#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1924#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:55:42,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {1924#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1924#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:55:42,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {1985#(or (<= (mod main_~z~0 4294967296) 0) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1924#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:55:42,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {1885#true} ~z~0 := ~y~0; {1985#(or (<= (mod main_~z~0 4294967296) 0) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:55:42,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {1885#true} [107] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1885#true} is VALID [2022-04-15 12:55:42,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {1885#true} [108] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_6 v_main_~x~0_Out_12) (= v_main_~y~0_In_6 v_main_~y~0_Out_12)) (and (= |v_main_#t~post5_Out_12| 0) (< 0 (mod (+ v_main_~x~0_Out_12 1) 4294967296)) (= (+ v_main_~y~0_Out_12 v_main_~x~0_Out_12) (+ v_main_~x~0_In_6 v_main_~y~0_In_6)) (<= v_main_~x~0_Out_12 v_main_~x~0_In_6) (= |v_main_#t~post6_Out_12| 0))) InVars {main_~x~0=v_main_~x~0_In_6, main_~y~0=v_main_~y~0_In_6} OutVars{main_~y~0=v_main_~y~0_Out_12, main_#t~post5=|v_main_#t~post5_Out_12|, main_~x~0=v_main_~x~0_Out_12, main_#t~post6=|v_main_#t~post6_Out_12|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1885#true} is VALID [2022-04-15 12:55:42,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {1885#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1885#true} is VALID [2022-04-15 12:55:42,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {1885#true} call #t~ret17 := main(); {1885#true} is VALID [2022-04-15 12:55:42,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1885#true} {1885#true} #94#return; {1885#true} is VALID [2022-04-15 12:55:42,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {1885#true} assume true; {1885#true} is VALID [2022-04-15 12:55:42,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {1885#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1885#true} is VALID [2022-04-15 12:55:42,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {1885#true} call ULTIMATE.init(); {1885#true} is VALID [2022-04-15 12:55:42,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:55:42,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126410462] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:42,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:55:42,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2022-04-15 12:55:42,199 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:42,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1452051912] [2022-04-15 12:55:42,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1452051912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:42,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:42,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:55:42,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670765702] [2022-04-15 12:55:42,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:42,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 12:55:42,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:42,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:42,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:42,213 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:55:42,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:42,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:55:42,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:55:42,214 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:42,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:42,412 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-15 12:55:42,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:55:42,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 12:55:42,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:42,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:42,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-15 12:55:42,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:42,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-15 12:55:42,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2022-04-15 12:55:42,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:42,448 INFO L225 Difference]: With dead ends: 52 [2022-04-15 12:55:42,448 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 12:55:42,449 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:55:42,449 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:42,449 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 45 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:55:42,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 12:55:42,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2022-04-15 12:55:42,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:42,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:42,493 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:42,493 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:42,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:42,494 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2022-04-15 12:55:42,494 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2022-04-15 12:55:42,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:42,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:42,494 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-15 12:55:42,495 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-15 12:55:42,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:42,495 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2022-04-15 12:55:42,495 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2022-04-15 12:55:42,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:42,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:42,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:42,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:42,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:42,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-04-15 12:55:42,496 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 20 [2022-04-15 12:55:42,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:42,497 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-04-15 12:55:42,497 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:42,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 37 transitions. [2022-04-15 12:55:42,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:42,560 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-04-15 12:55:42,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:55:42,560 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:42,560 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:42,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 12:55:42,760 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:42,761 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:42,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:42,761 INFO L85 PathProgramCache]: Analyzing trace with hash -694813431, now seen corresponding path program 1 times [2022-04-15 12:55:42,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:42,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2084009209] [2022-04-15 12:55:42,898 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:42,899 INFO L85 PathProgramCache]: Analyzing trace with hash -787294648, now seen corresponding path program 1 times [2022-04-15 12:55:42,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:42,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659648929] [2022-04-15 12:55:42,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:42,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:42,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:42,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {2260#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2252#true} is VALID [2022-04-15 12:55:42,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {2252#true} assume true; {2252#true} is VALID [2022-04-15 12:55:42,982 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2252#true} {2252#true} #94#return; {2252#true} is VALID [2022-04-15 12:55:42,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {2252#true} call ULTIMATE.init(); {2260#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:42,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {2260#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2252#true} is VALID [2022-04-15 12:55:42,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {2252#true} assume true; {2252#true} is VALID [2022-04-15 12:55:42,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2252#true} {2252#true} #94#return; {2252#true} is VALID [2022-04-15 12:55:42,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {2252#true} call #t~ret17 := main(); {2252#true} is VALID [2022-04-15 12:55:42,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {2252#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2252#true} is VALID [2022-04-15 12:55:42,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {2252#true} [110] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_7 v_main_~x~0_Out_14) (= v_main_~y~0_In_7 v_main_~y~0_Out_14)) (and (= |v_main_#t~post5_Out_14| 0) (= (+ v_main_~x~0_In_7 v_main_~y~0_In_7) (+ v_main_~y~0_Out_14 v_main_~x~0_Out_14)) (< 0 (mod (+ v_main_~x~0_Out_14 1) 4294967296)) (= |v_main_#t~post6_Out_14| 0) (<= v_main_~x~0_Out_14 v_main_~x~0_In_7))) InVars {main_~x~0=v_main_~x~0_In_7, main_~y~0=v_main_~y~0_In_7} OutVars{main_~y~0=v_main_~y~0_Out_14, main_#t~post5=|v_main_#t~post5_Out_14|, main_~x~0=v_main_~x~0_Out_14, main_#t~post6=|v_main_#t~post6_Out_14|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2252#true} is VALID [2022-04-15 12:55:42,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {2252#true} [109] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2252#true} is VALID [2022-04-15 12:55:42,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {2252#true} ~z~0 := ~y~0; {2257#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:55:42,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {2257#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2258#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 12:55:42,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {2258#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {2258#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 12:55:42,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {2258#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {2259#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-15 12:55:42,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {2259#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !(~y~0 % 4294967296 > 0); {2259#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-15 12:55:42,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {2259#(<= main_~y~0 (+ (* (div main_~y~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; {2258#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 12:55:42,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {2258#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {2258#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 12:55:42,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {2258#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {2258#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 12:55:42,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {2258#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {2253#false} is VALID [2022-04-15 12:55:42,988 INFO L272 TraceCheckUtils]: 17: Hoare triple {2253#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2253#false} is VALID [2022-04-15 12:55:42,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {2253#false} ~cond := #in~cond; {2253#false} is VALID [2022-04-15 12:55:42,989 INFO L290 TraceCheckUtils]: 19: Hoare triple {2253#false} assume 0 == ~cond; {2253#false} is VALID [2022-04-15 12:55:42,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {2253#false} assume !false; {2253#false} is VALID [2022-04-15 12:55:42,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:55:42,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:42,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659648929] [2022-04-15 12:55:42,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659648929] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:42,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424902961] [2022-04-15 12:55:42,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:42,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:42,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:42,992 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:55:42,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 12:55:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:43,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:55:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:43,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:43,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {2252#true} call ULTIMATE.init(); {2252#true} is VALID [2022-04-15 12:55:43,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {2252#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2252#true} is VALID [2022-04-15 12:55:43,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {2252#true} assume true; {2252#true} is VALID [2022-04-15 12:55:43,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2252#true} {2252#true} #94#return; {2252#true} is VALID [2022-04-15 12:55:43,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {2252#true} call #t~ret17 := main(); {2252#true} is VALID [2022-04-15 12:55:43,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {2252#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2252#true} is VALID [2022-04-15 12:55:43,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {2252#true} [110] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_7 v_main_~x~0_Out_14) (= v_main_~y~0_In_7 v_main_~y~0_Out_14)) (and (= |v_main_#t~post5_Out_14| 0) (= (+ v_main_~x~0_In_7 v_main_~y~0_In_7) (+ v_main_~y~0_Out_14 v_main_~x~0_Out_14)) (< 0 (mod (+ v_main_~x~0_Out_14 1) 4294967296)) (= |v_main_#t~post6_Out_14| 0) (<= v_main_~x~0_Out_14 v_main_~x~0_In_7))) InVars {main_~x~0=v_main_~x~0_In_7, main_~y~0=v_main_~y~0_In_7} OutVars{main_~y~0=v_main_~y~0_Out_14, main_#t~post5=|v_main_#t~post5_Out_14|, main_~x~0=v_main_~x~0_Out_14, main_#t~post6=|v_main_#t~post6_Out_14|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2252#true} is VALID [2022-04-15 12:55:43,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {2252#true} [109] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2252#true} is VALID [2022-04-15 12:55:43,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {2252#true} ~z~0 := ~y~0; {2252#true} is VALID [2022-04-15 12:55:43,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {2252#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2291#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:55:43,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {2291#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2291#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:55:43,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {2291#(< 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; {2298#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:43,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {2298#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {2298#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:43,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {2298#(< 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; {2298#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:43,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {2298#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {2298#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:43,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {2298#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2253#false} is VALID [2022-04-15 12:55:43,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {2253#false} assume !(~y~0 % 4294967296 > 0); {2253#false} is VALID [2022-04-15 12:55:43,111 INFO L272 TraceCheckUtils]: 17: Hoare triple {2253#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2253#false} is VALID [2022-04-15 12:55:43,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {2253#false} ~cond := #in~cond; {2253#false} is VALID [2022-04-15 12:55:43,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {2253#false} assume 0 == ~cond; {2253#false} is VALID [2022-04-15 12:55:43,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {2253#false} assume !false; {2253#false} is VALID [2022-04-15 12:55:43,111 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-15 12:55:43,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:55:43,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {2253#false} assume !false; {2253#false} is VALID [2022-04-15 12:55:43,164 INFO L290 TraceCheckUtils]: 19: Hoare triple {2253#false} assume 0 == ~cond; {2253#false} is VALID [2022-04-15 12:55:43,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {2253#false} ~cond := #in~cond; {2253#false} is VALID [2022-04-15 12:55:43,164 INFO L272 TraceCheckUtils]: 17: Hoare triple {2253#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2253#false} is VALID [2022-04-15 12:55:43,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {2253#false} assume !(~y~0 % 4294967296 > 0); {2253#false} is VALID [2022-04-15 12:55:43,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {2298#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2253#false} is VALID [2022-04-15 12:55:43,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {2298#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {2298#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:43,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {2298#(< 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; {2298#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:43,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {2298#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {2298#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:43,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {2291#(< 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; {2298#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:43,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {2291#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2291#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:55:43,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {2252#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2291#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:55:43,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {2252#true} ~z~0 := ~y~0; {2252#true} is VALID [2022-04-15 12:55:43,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {2252#true} [109] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2252#true} is VALID [2022-04-15 12:55:43,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {2252#true} [110] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_7 v_main_~x~0_Out_14) (= v_main_~y~0_In_7 v_main_~y~0_Out_14)) (and (= |v_main_#t~post5_Out_14| 0) (= (+ v_main_~x~0_In_7 v_main_~y~0_In_7) (+ v_main_~y~0_Out_14 v_main_~x~0_Out_14)) (< 0 (mod (+ v_main_~x~0_Out_14 1) 4294967296)) (= |v_main_#t~post6_Out_14| 0) (<= v_main_~x~0_Out_14 v_main_~x~0_In_7))) InVars {main_~x~0=v_main_~x~0_In_7, main_~y~0=v_main_~y~0_In_7} OutVars{main_~y~0=v_main_~y~0_Out_14, main_#t~post5=|v_main_#t~post5_Out_14|, main_~x~0=v_main_~x~0_Out_14, main_#t~post6=|v_main_#t~post6_Out_14|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2252#true} is VALID [2022-04-15 12:55:43,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {2252#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2252#true} is VALID [2022-04-15 12:55:43,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {2252#true} call #t~ret17 := main(); {2252#true} is VALID [2022-04-15 12:55:43,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2252#true} {2252#true} #94#return; {2252#true} is VALID [2022-04-15 12:55:43,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {2252#true} assume true; {2252#true} is VALID [2022-04-15 12:55:43,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {2252#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2252#true} is VALID [2022-04-15 12:55:43,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {2252#true} call ULTIMATE.init(); {2252#true} is VALID [2022-04-15 12:55:43,173 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-15 12:55:43,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424902961] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:55:43,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:55:43,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2022-04-15 12:55:43,197 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:43,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2084009209] [2022-04-15 12:55:43,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2084009209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:43,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:43,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:55:43,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183734479] [2022-04-15 12:55:43,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:43,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 12:55:43,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:43,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:43,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:43,213 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:55:43,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:43,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:55:43,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:55:43,214 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:43,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:43,671 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2022-04-15 12:55:43,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:55:43,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 12:55:43,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:43,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:43,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-15 12:55:43,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:43,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-15 12:55:43,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 59 transitions. [2022-04-15 12:55:43,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:43,731 INFO L225 Difference]: With dead ends: 48 [2022-04-15 12:55:43,731 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 12:55:43,732 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:55:43,732 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 51 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:43,732 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 36 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:55:43,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 12:55:43,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2022-04-15 12:55:43,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:43,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 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-15 12:55:43,799 INFO L74 IsIncluded]: Start isIncluded. First operand 43 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-15 12:55:43,799 INFO L87 Difference]: Start difference. First operand 43 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-15 12:55:43,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:43,800 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2022-04-15 12:55:43,800 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-15 12:55:43,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:43,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:43,801 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 43 states. [2022-04-15 12:55:43,801 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 43 states. [2022-04-15 12:55:43,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:43,802 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2022-04-15 12:55:43,802 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-15 12:55:43,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:43,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:43,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:43,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:43,802 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-15 12:55:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2022-04-15 12:55:43,803 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 21 [2022-04-15 12:55:43,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:43,803 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2022-04-15 12:55:43,803 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:43,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 42 transitions. [2022-04-15 12:55:43,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:43,868 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-04-15 12:55:43,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:55:43,869 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:43,869 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:43,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 12:55:44,069 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:44,069 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:44,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:44,070 INFO L85 PathProgramCache]: Analyzing trace with hash 2059287207, now seen corresponding path program 2 times [2022-04-15 12:55:44,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:44,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1038946111] [2022-04-15 12:55:44,203 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:44,204 INFO L85 PathProgramCache]: Analyzing trace with hash -324174938, now seen corresponding path program 1 times [2022-04-15 12:55:44,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:44,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781156347] [2022-04-15 12:55:44,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:44,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:44,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:44,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {2659#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2650#true} is VALID [2022-04-15 12:55:44,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {2650#true} assume true; {2650#true} is VALID [2022-04-15 12:55:44,282 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2650#true} {2650#true} #94#return; {2650#true} is VALID [2022-04-15 12:55:44,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {2650#true} call ULTIMATE.init(); {2659#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:44,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {2659#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2650#true} is VALID [2022-04-15 12:55:44,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {2650#true} assume true; {2650#true} is VALID [2022-04-15 12:55:44,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2650#true} {2650#true} #94#return; {2650#true} is VALID [2022-04-15 12:55:44,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {2650#true} call #t~ret17 := main(); {2650#true} is VALID [2022-04-15 12:55:44,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {2650#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2650#true} is VALID [2022-04-15 12:55:44,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {2650#true} [112] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_16| 0) (< 0 (mod (+ v_main_~x~0_Out_16 1) 4294967296)) (= |v_main_#t~post6_Out_16| 0) (= (+ v_main_~y~0_Out_16 v_main_~x~0_Out_16) (+ v_main_~x~0_In_8 v_main_~y~0_In_8)) (<= v_main_~x~0_Out_16 v_main_~x~0_In_8)) (and (= v_main_~x~0_In_8 v_main_~x~0_Out_16) (= v_main_~y~0_In_8 v_main_~y~0_Out_16))) InVars {main_~x~0=v_main_~x~0_In_8, main_~y~0=v_main_~y~0_In_8} OutVars{main_~y~0=v_main_~y~0_Out_16, main_#t~post5=|v_main_#t~post5_Out_16|, main_~x~0=v_main_~x~0_Out_16, main_#t~post6=|v_main_#t~post6_Out_16|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2650#true} is VALID [2022-04-15 12:55:44,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {2650#true} [111] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2650#true} is VALID [2022-04-15 12:55:44,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {2650#true} ~z~0 := ~y~0; {2655#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:55:44,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {2655#(and (<= main_~y~0 main_~z~0) (<= 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; {2656#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:55:44,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {2656#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2657#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:55:44,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {2657#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2657#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:55:44,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {2657#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {2658#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:55:44,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {2658#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2651#false} is VALID [2022-04-15 12:55:44,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {2651#false} assume !(~x~0 % 4294967296 > 0); {2651#false} is VALID [2022-04-15 12:55:44,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {2651#false} assume !(~z~0 % 4294967296 > 0); {2651#false} is VALID [2022-04-15 12:55:44,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {2651#false} assume !(~y~0 % 4294967296 > 0); {2651#false} is VALID [2022-04-15 12:55:44,288 INFO L272 TraceCheckUtils]: 17: Hoare triple {2651#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2651#false} is VALID [2022-04-15 12:55:44,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {2651#false} ~cond := #in~cond; {2651#false} is VALID [2022-04-15 12:55:44,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {2651#false} assume 0 == ~cond; {2651#false} is VALID [2022-04-15 12:55:44,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {2651#false} assume !false; {2651#false} is VALID [2022-04-15 12:55:44,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:55:44,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:44,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781156347] [2022-04-15 12:55:44,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781156347] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:44,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933835073] [2022-04-15 12:55:44,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:44,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:44,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:44,289 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:55:44,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 12:55:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:44,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 12:55:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:44,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:44,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {2650#true} call ULTIMATE.init(); {2650#true} is VALID [2022-04-15 12:55:44,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {2650#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2650#true} is VALID [2022-04-15 12:55:44,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {2650#true} assume true; {2650#true} is VALID [2022-04-15 12:55:44,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2650#true} {2650#true} #94#return; {2650#true} is VALID [2022-04-15 12:55:44,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {2650#true} call #t~ret17 := main(); {2650#true} is VALID [2022-04-15 12:55:44,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {2650#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2650#true} is VALID [2022-04-15 12:55:44,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {2650#true} [112] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_16| 0) (< 0 (mod (+ v_main_~x~0_Out_16 1) 4294967296)) (= |v_main_#t~post6_Out_16| 0) (= (+ v_main_~y~0_Out_16 v_main_~x~0_Out_16) (+ v_main_~x~0_In_8 v_main_~y~0_In_8)) (<= v_main_~x~0_Out_16 v_main_~x~0_In_8)) (and (= v_main_~x~0_In_8 v_main_~x~0_Out_16) (= v_main_~y~0_In_8 v_main_~y~0_Out_16))) InVars {main_~x~0=v_main_~x~0_In_8, main_~y~0=v_main_~y~0_In_8} OutVars{main_~y~0=v_main_~y~0_Out_16, main_#t~post5=|v_main_#t~post5_Out_16|, main_~x~0=v_main_~x~0_Out_16, main_#t~post6=|v_main_#t~post6_Out_16|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2650#true} is VALID [2022-04-15 12:55:44,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {2650#true} [111] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2650#true} is VALID [2022-04-15 12:55:44,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {2650#true} ~z~0 := ~y~0; {2655#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:55:44,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {2655#(and (<= main_~y~0 main_~z~0) (<= 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; {2656#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:55:44,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {2656#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2657#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:55:44,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {2657#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2657#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:55:44,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {2657#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {2658#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:55:44,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {2658#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2651#false} is VALID [2022-04-15 12:55:44,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {2651#false} assume !(~x~0 % 4294967296 > 0); {2651#false} is VALID [2022-04-15 12:55:44,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {2651#false} assume !(~z~0 % 4294967296 > 0); {2651#false} is VALID [2022-04-15 12:55:44,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {2651#false} assume !(~y~0 % 4294967296 > 0); {2651#false} is VALID [2022-04-15 12:55:44,654 INFO L272 TraceCheckUtils]: 17: Hoare triple {2651#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2651#false} is VALID [2022-04-15 12:55:44,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {2651#false} ~cond := #in~cond; {2651#false} is VALID [2022-04-15 12:55:44,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {2651#false} assume 0 == ~cond; {2651#false} is VALID [2022-04-15 12:55:44,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {2651#false} assume !false; {2651#false} is VALID [2022-04-15 12:55:44,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:55:44,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:55:44,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {2651#false} assume !false; {2651#false} is VALID [2022-04-15 12:55:44,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {2651#false} assume 0 == ~cond; {2651#false} is VALID [2022-04-15 12:55:44,871 INFO L290 TraceCheckUtils]: 18: Hoare triple {2651#false} ~cond := #in~cond; {2651#false} is VALID [2022-04-15 12:55:44,872 INFO L272 TraceCheckUtils]: 17: Hoare triple {2651#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2651#false} is VALID [2022-04-15 12:55:44,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {2651#false} assume !(~y~0 % 4294967296 > 0); {2651#false} is VALID [2022-04-15 12:55:44,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {2651#false} assume !(~z~0 % 4294967296 > 0); {2651#false} is VALID [2022-04-15 12:55:44,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {2651#false} assume !(~x~0 % 4294967296 > 0); {2651#false} is VALID [2022-04-15 12:55:44,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {2658#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2651#false} is VALID [2022-04-15 12:55:44,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {2657#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {2658#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:55:44,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {2657#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2657#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:55:44,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {2753#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {2657#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:55:44,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {2757#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {2753#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 12:55:44,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {2650#true} ~z~0 := ~y~0; {2757#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:44,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {2650#true} [111] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2650#true} is VALID [2022-04-15 12:55:44,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {2650#true} [112] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_16| 0) (< 0 (mod (+ v_main_~x~0_Out_16 1) 4294967296)) (= |v_main_#t~post6_Out_16| 0) (= (+ v_main_~y~0_Out_16 v_main_~x~0_Out_16) (+ v_main_~x~0_In_8 v_main_~y~0_In_8)) (<= v_main_~x~0_Out_16 v_main_~x~0_In_8)) (and (= v_main_~x~0_In_8 v_main_~x~0_Out_16) (= v_main_~y~0_In_8 v_main_~y~0_Out_16))) InVars {main_~x~0=v_main_~x~0_In_8, main_~y~0=v_main_~y~0_In_8} OutVars{main_~y~0=v_main_~y~0_Out_16, main_#t~post5=|v_main_#t~post5_Out_16|, main_~x~0=v_main_~x~0_Out_16, main_#t~post6=|v_main_#t~post6_Out_16|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2650#true} is VALID [2022-04-15 12:55:44,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {2650#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2650#true} is VALID [2022-04-15 12:55:44,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {2650#true} call #t~ret17 := main(); {2650#true} is VALID [2022-04-15 12:55:44,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2650#true} {2650#true} #94#return; {2650#true} is VALID [2022-04-15 12:55:44,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {2650#true} assume true; {2650#true} is VALID [2022-04-15 12:55:44,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {2650#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2650#true} is VALID [2022-04-15 12:55:44,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {2650#true} call ULTIMATE.init(); {2650#true} is VALID [2022-04-15 12:55:44,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:55:44,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933835073] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:55:44,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:55:44,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-15 12:55:44,899 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:44,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1038946111] [2022-04-15 12:55:44,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1038946111] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:44,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:44,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:55:44,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225146170] [2022-04-15 12:55:44,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:44,900 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 12:55:44,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:44,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:44,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:44,919 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:55:44,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:44,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:55:44,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:55:44,920 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:45,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:45,478 INFO L93 Difference]: Finished difference Result 53 states and 75 transitions. [2022-04-15 12:55:45,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:55:45,478 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 12:55:45,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:45,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:45,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-15 12:55:45,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:45,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-15 12:55:45,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-15 12:55:45,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:45,532 INFO L225 Difference]: With dead ends: 53 [2022-04-15 12:55:45,532 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 12:55:45,533 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:55:45,533 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 35 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:45,533 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 46 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:55:45,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 12:55:45,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2022-04-15 12:55:45,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:45,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:45,625 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:45,626 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:45,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:45,628 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-15 12:55:45,628 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-15 12:55:45,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:45,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:45,628 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 12:55:45,628 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 12:55:45,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:45,629 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-15 12:55:45,629 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-15 12:55:45,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:45,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:45,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:45,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:45,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:45,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2022-04-15 12:55:45,631 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 21 [2022-04-15 12:55:45,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:45,631 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2022-04-15 12:55:45,631 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:45,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 43 transitions. [2022-04-15 12:55:45,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:45,721 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-15 12:55:45,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 12:55:45,721 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:45,721 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:45,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 12:55:45,921 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 12:55:45,922 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:45,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:45,922 INFO L85 PathProgramCache]: Analyzing trace with hash -29884763, now seen corresponding path program 1 times [2022-04-15 12:55:45,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:45,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1432008297] [2022-04-15 12:55:46,019 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:46,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1091268038, now seen corresponding path program 1 times [2022-04-15 12:55:46,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:46,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162153758] [2022-04-15 12:55:46,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:46,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:46,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:46,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:46,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {3059#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3052#true} is VALID [2022-04-15 12:55:46,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {3052#true} assume true; {3052#true} is VALID [2022-04-15 12:55:46,066 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3052#true} {3052#true} #94#return; {3052#true} is VALID [2022-04-15 12:55:46,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {3052#true} call ULTIMATE.init(); {3059#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:46,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {3059#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3052#true} is VALID [2022-04-15 12:55:46,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {3052#true} assume true; {3052#true} is VALID [2022-04-15 12:55:46,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3052#true} {3052#true} #94#return; {3052#true} is VALID [2022-04-15 12:55:46,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {3052#true} call #t~ret17 := main(); {3052#true} is VALID [2022-04-15 12:55:46,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {3052#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3052#true} is VALID [2022-04-15 12:55:46,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {3052#true} [114] L16-2-->L16-3_primed: Formula: (or (and (<= v_main_~x~0_Out_18 v_main_~x~0_In_9) (= |v_main_#t~post5_Out_18| 0) (= |v_main_#t~post6_Out_18| 0) (= (+ v_main_~y~0_Out_18 v_main_~x~0_Out_18) (+ v_main_~x~0_In_9 v_main_~y~0_In_9)) (< 0 (mod (+ v_main_~x~0_Out_18 1) 4294967296))) (and (= v_main_~y~0_In_9 v_main_~y~0_Out_18) (= v_main_~x~0_In_9 v_main_~x~0_Out_18))) InVars {main_~x~0=v_main_~x~0_In_9, main_~y~0=v_main_~y~0_In_9} OutVars{main_~y~0=v_main_~y~0_Out_18, main_#t~post5=|v_main_#t~post5_Out_18|, main_~x~0=v_main_~x~0_Out_18, main_#t~post6=|v_main_#t~post6_Out_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3052#true} is VALID [2022-04-15 12:55:46,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {3052#true} [113] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3052#true} is VALID [2022-04-15 12:55:46,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {3052#true} ~z~0 := ~y~0; {3052#true} is VALID [2022-04-15 12:55:46,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {3052#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3057#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:46,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {3057#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3057#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:46,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {3057#(<= main_~z~0 (+ 4294967294 (* (div 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; {3058#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:55:46,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {3058#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {3058#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:55:46,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {3058#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3058#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:55:46,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {3058#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {3058#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:55:46,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {3058#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {3053#false} is VALID [2022-04-15 12:55:46,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {3053#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; {3053#false} is VALID [2022-04-15 12:55:46,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {3053#false} assume !(~y~0 % 4294967296 > 0); {3053#false} is VALID [2022-04-15 12:55:46,071 INFO L272 TraceCheckUtils]: 18: Hoare triple {3053#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3053#false} is VALID [2022-04-15 12:55:46,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {3053#false} ~cond := #in~cond; {3053#false} is VALID [2022-04-15 12:55:46,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {3053#false} assume 0 == ~cond; {3053#false} is VALID [2022-04-15 12:55:46,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {3053#false} assume !false; {3053#false} is VALID [2022-04-15 12:55:46,072 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-15 12:55:46,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:46,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162153758] [2022-04-15 12:55:46,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162153758] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:46,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415866695] [2022-04-15 12:55:46,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:46,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:46,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:46,088 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:55:46,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 12:55:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:46,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:55:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:46,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:46,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {3052#true} call ULTIMATE.init(); {3052#true} is VALID [2022-04-15 12:55:46,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {3052#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3052#true} is VALID [2022-04-15 12:55:46,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {3052#true} assume true; {3052#true} is VALID [2022-04-15 12:55:46,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3052#true} {3052#true} #94#return; {3052#true} is VALID [2022-04-15 12:55:46,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {3052#true} call #t~ret17 := main(); {3052#true} is VALID [2022-04-15 12:55:46,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {3052#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3052#true} is VALID [2022-04-15 12:55:46,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {3052#true} [114] L16-2-->L16-3_primed: Formula: (or (and (<= v_main_~x~0_Out_18 v_main_~x~0_In_9) (= |v_main_#t~post5_Out_18| 0) (= |v_main_#t~post6_Out_18| 0) (= (+ v_main_~y~0_Out_18 v_main_~x~0_Out_18) (+ v_main_~x~0_In_9 v_main_~y~0_In_9)) (< 0 (mod (+ v_main_~x~0_Out_18 1) 4294967296))) (and (= v_main_~y~0_In_9 v_main_~y~0_Out_18) (= v_main_~x~0_In_9 v_main_~x~0_Out_18))) InVars {main_~x~0=v_main_~x~0_In_9, main_~y~0=v_main_~y~0_In_9} OutVars{main_~y~0=v_main_~y~0_Out_18, main_#t~post5=|v_main_#t~post5_Out_18|, main_~x~0=v_main_~x~0_Out_18, main_#t~post6=|v_main_#t~post6_Out_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3052#true} is VALID [2022-04-15 12:55:46,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {3052#true} [113] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3052#true} is VALID [2022-04-15 12:55:46,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {3052#true} ~z~0 := ~y~0; {3087#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:55:46,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {3087#(= 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; {3091#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 12:55:46,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {3091#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {3091#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 12:55:46,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {3091#(= main_~y~0 (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3098#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-15 12:55:46,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {3098#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {3098#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-15 12:55:46,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {3098#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3087#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:55:46,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {3087#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {3087#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:55:46,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {3087#(= main_~z~0 main_~y~0)} assume !(~z~0 % 4294967296 > 0); {3111#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:55:46,213 INFO L290 TraceCheckUtils]: 16: Hoare triple {3111#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {3053#false} is VALID [2022-04-15 12:55:46,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {3053#false} assume !(~y~0 % 4294967296 > 0); {3053#false} is VALID [2022-04-15 12:55:46,213 INFO L272 TraceCheckUtils]: 18: Hoare triple {3053#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3053#false} is VALID [2022-04-15 12:55:46,213 INFO L290 TraceCheckUtils]: 19: Hoare triple {3053#false} ~cond := #in~cond; {3053#false} is VALID [2022-04-15 12:55:46,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {3053#false} assume 0 == ~cond; {3053#false} is VALID [2022-04-15 12:55:46,213 INFO L290 TraceCheckUtils]: 21: Hoare triple {3053#false} assume !false; {3053#false} is VALID [2022-04-15 12:55:46,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:55:46,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:55:46,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {3053#false} assume !false; {3053#false} is VALID [2022-04-15 12:55:46,350 INFO L290 TraceCheckUtils]: 20: Hoare triple {3053#false} assume 0 == ~cond; {3053#false} is VALID [2022-04-15 12:55:46,350 INFO L290 TraceCheckUtils]: 19: Hoare triple {3053#false} ~cond := #in~cond; {3053#false} is VALID [2022-04-15 12:55:46,350 INFO L272 TraceCheckUtils]: 18: Hoare triple {3053#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3053#false} is VALID [2022-04-15 12:55:46,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {3053#false} assume !(~y~0 % 4294967296 > 0); {3053#false} is VALID [2022-04-15 12:55:46,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {3111#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {3053#false} is VALID [2022-04-15 12:55:46,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {3148#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3111#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:55:46,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {3148#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {3148#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 12:55:46,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {3155#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3148#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 12:55:46,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {3155#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {3155#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-15 12:55:46,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {3162#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3155#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-15 12:55:46,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {3162#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3162#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-15 12:55:46,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {3148#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3162#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-15 12:55:46,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {3052#true} ~z~0 := ~y~0; {3148#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 12:55:46,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {3052#true} [113] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3052#true} is VALID [2022-04-15 12:55:46,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {3052#true} [114] L16-2-->L16-3_primed: Formula: (or (and (<= v_main_~x~0_Out_18 v_main_~x~0_In_9) (= |v_main_#t~post5_Out_18| 0) (= |v_main_#t~post6_Out_18| 0) (= (+ v_main_~y~0_Out_18 v_main_~x~0_Out_18) (+ v_main_~x~0_In_9 v_main_~y~0_In_9)) (< 0 (mod (+ v_main_~x~0_Out_18 1) 4294967296))) (and (= v_main_~y~0_In_9 v_main_~y~0_Out_18) (= v_main_~x~0_In_9 v_main_~x~0_Out_18))) InVars {main_~x~0=v_main_~x~0_In_9, main_~y~0=v_main_~y~0_In_9} OutVars{main_~y~0=v_main_~y~0_Out_18, main_#t~post5=|v_main_#t~post5_Out_18|, main_~x~0=v_main_~x~0_Out_18, main_#t~post6=|v_main_#t~post6_Out_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3052#true} is VALID [2022-04-15 12:55:46,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {3052#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3052#true} is VALID [2022-04-15 12:55:46,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {3052#true} call #t~ret17 := main(); {3052#true} is VALID [2022-04-15 12:55:46,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3052#true} {3052#true} #94#return; {3052#true} is VALID [2022-04-15 12:55:46,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {3052#true} assume true; {3052#true} is VALID [2022-04-15 12:55:46,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {3052#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3052#true} is VALID [2022-04-15 12:55:46,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {3052#true} call ULTIMATE.init(); {3052#true} is VALID [2022-04-15 12:55:46,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:55:46,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415866695] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:55:46,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:55:46,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 12 [2022-04-15 12:55:46,386 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:46,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1432008297] [2022-04-15 12:55:46,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1432008297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:46,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:46,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:55:46,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42120263] [2022-04-15 12:55:46,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:46,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 12:55:46,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:46,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:46,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:46,406 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:55:46,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:46,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:55:46,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:55:46,406 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:46,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:46,881 INFO L93 Difference]: Finished difference Result 60 states and 84 transitions. [2022-04-15 12:55:46,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:55:46,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 12:55:46,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:46,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:46,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-15 12:55:46,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:46,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-15 12:55:46,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 58 transitions. [2022-04-15 12:55:46,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:46,952 INFO L225 Difference]: With dead ends: 60 [2022-04-15 12:55:46,953 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 12:55:46,953 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:55:46,953 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:46,954 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 37 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:55:46,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 12:55:47,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 38. [2022-04-15 12:55:47,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:47,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 38 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:47,066 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 38 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:47,066 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 38 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:47,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:47,067 INFO L93 Difference]: Finished difference Result 53 states and 75 transitions. [2022-04-15 12:55:47,067 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2022-04-15 12:55:47,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:47,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:47,067 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 12:55:47,067 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 12:55:47,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:47,068 INFO L93 Difference]: Finished difference Result 53 states and 75 transitions. [2022-04-15 12:55:47,068 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2022-04-15 12:55:47,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:47,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:47,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:47,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:47,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:47,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-15 12:55:47,069 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 22 [2022-04-15 12:55:47,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:47,069 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2022-04-15 12:55:47,069 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:47,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 52 transitions. [2022-04-15 12:55:47,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:47,174 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2022-04-15 12:55:47,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 12:55:47,175 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:47,176 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:47,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 12:55:47,387 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:47,387 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:47,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:47,388 INFO L85 PathProgramCache]: Analyzing trace with hash 887085398, now seen corresponding path program 3 times [2022-04-15 12:55:47,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:47,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1228267156] [2022-04-15 12:55:47,513 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:47,514 INFO L85 PathProgramCache]: Analyzing trace with hash -292693833, now seen corresponding path program 1 times [2022-04-15 12:55:47,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:47,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811894518] [2022-04-15 12:55:47,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:47,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:47,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:47,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {3522#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3512#true} is VALID [2022-04-15 12:55:47,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {3512#true} assume true; {3512#true} is VALID [2022-04-15 12:55:47,625 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3512#true} {3512#true} #94#return; {3512#true} is VALID [2022-04-15 12:55:47,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {3512#true} call ULTIMATE.init(); {3522#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:47,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {3522#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3512#true} is VALID [2022-04-15 12:55:47,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {3512#true} assume true; {3512#true} is VALID [2022-04-15 12:55:47,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3512#true} {3512#true} #94#return; {3512#true} is VALID [2022-04-15 12:55:47,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {3512#true} call #t~ret17 := main(); {3512#true} is VALID [2022-04-15 12:55:47,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {3512#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3517#(= main_~y~0 0)} is VALID [2022-04-15 12:55:47,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {3517#(= main_~y~0 0)} [116] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_20| 0) (< 0 (mod (+ v_main_~x~0_Out_20 1) 4294967296)) (= (+ v_main_~y~0_Out_20 v_main_~x~0_Out_20) (+ v_main_~x~0_In_10 v_main_~y~0_In_10)) (= |v_main_#t~post6_Out_20| 0) (<= v_main_~x~0_Out_20 v_main_~x~0_In_10)) (and (= v_main_~y~0_In_10 v_main_~y~0_Out_20) (= v_main_~x~0_In_10 v_main_~x~0_Out_20))) InVars {main_~x~0=v_main_~x~0_In_10, main_~y~0=v_main_~y~0_In_10} OutVars{main_~y~0=v_main_~y~0_Out_20, main_#t~post5=|v_main_#t~post5_Out_20|, main_~x~0=v_main_~x~0_Out_20, main_#t~post6=|v_main_#t~post6_Out_20|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3518#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} is VALID [2022-04-15 12:55:47,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {3518#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} [115] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3519#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:55:47,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {3519#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3519#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:55:47,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {3519#(<= 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; {3520#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-15 12:55:47,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {3520#(<= (+ (* (div (+ main_~x~0 4294967294) 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; {3521#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:55:47,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {3521#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {3521#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:55:47,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {3521#(<= (+ 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; {3521#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:55:47,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {3521#(<= (+ 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; {3521#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:55:47,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {3521#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {3521#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:55:47,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {3521#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {3513#false} is VALID [2022-04-15 12:55:47,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {3513#false} assume !(~z~0 % 4294967296 > 0); {3513#false} is VALID [2022-04-15 12:55:47,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {3513#false} assume !(~y~0 % 4294967296 > 0); {3513#false} is VALID [2022-04-15 12:55:47,634 INFO L272 TraceCheckUtils]: 18: Hoare triple {3513#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3513#false} is VALID [2022-04-15 12:55:47,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {3513#false} ~cond := #in~cond; {3513#false} is VALID [2022-04-15 12:55:47,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {3513#false} assume 0 == ~cond; {3513#false} is VALID [2022-04-15 12:55:47,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {3513#false} assume !false; {3513#false} is VALID [2022-04-15 12:55:47,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:55:47,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:47,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811894518] [2022-04-15 12:55:47,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811894518] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:47,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383574140] [2022-04-15 12:55:47,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:47,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:47,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:47,636 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:55:47,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 12:55:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:47,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 12:55:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:47,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:47,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {3512#true} call ULTIMATE.init(); {3512#true} is VALID [2022-04-15 12:55:47,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {3512#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3512#true} is VALID [2022-04-15 12:55:47,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {3512#true} assume true; {3512#true} is VALID [2022-04-15 12:55:47,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3512#true} {3512#true} #94#return; {3512#true} is VALID [2022-04-15 12:55:47,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {3512#true} call #t~ret17 := main(); {3512#true} is VALID [2022-04-15 12:55:47,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {3512#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3512#true} is VALID [2022-04-15 12:55:47,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {3512#true} [116] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_20| 0) (< 0 (mod (+ v_main_~x~0_Out_20 1) 4294967296)) (= (+ v_main_~y~0_Out_20 v_main_~x~0_Out_20) (+ v_main_~x~0_In_10 v_main_~y~0_In_10)) (= |v_main_#t~post6_Out_20| 0) (<= v_main_~x~0_Out_20 v_main_~x~0_In_10)) (and (= v_main_~y~0_In_10 v_main_~y~0_Out_20) (= v_main_~x~0_In_10 v_main_~x~0_Out_20))) InVars {main_~x~0=v_main_~x~0_In_10, main_~y~0=v_main_~y~0_In_10} OutVars{main_~y~0=v_main_~y~0_Out_20, main_#t~post5=|v_main_#t~post5_Out_20|, main_~x~0=v_main_~x~0_Out_20, main_#t~post6=|v_main_#t~post6_Out_20|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3512#true} is VALID [2022-04-15 12:55:47,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {3512#true} [115] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3512#true} is VALID [2022-04-15 12:55:47,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {3512#true} ~z~0 := ~y~0; {3512#true} is VALID [2022-04-15 12:55:47,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {3512#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3553#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:55:47,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {3553#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3557#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:55:47,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {3557#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !(~z~0 % 4294967296 > 0); {3557#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:55:47,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {3557#(< 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; {3553#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:55:47,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {3553#(< 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; {3567#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:47,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {3567#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {3567#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:47,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {3567#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {3567#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:47,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {3567#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3513#false} is VALID [2022-04-15 12:55:47,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {3513#false} assume !(~y~0 % 4294967296 > 0); {3513#false} is VALID [2022-04-15 12:55:47,777 INFO L272 TraceCheckUtils]: 18: Hoare triple {3513#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3513#false} is VALID [2022-04-15 12:55:47,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {3513#false} ~cond := #in~cond; {3513#false} is VALID [2022-04-15 12:55:47,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {3513#false} assume 0 == ~cond; {3513#false} is VALID [2022-04-15 12:55:47,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {3513#false} assume !false; {3513#false} is VALID [2022-04-15 12:55:47,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:55:47,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:55:47,833 INFO L290 TraceCheckUtils]: 21: Hoare triple {3513#false} assume !false; {3513#false} is VALID [2022-04-15 12:55:47,833 INFO L290 TraceCheckUtils]: 20: Hoare triple {3513#false} assume 0 == ~cond; {3513#false} is VALID [2022-04-15 12:55:47,833 INFO L290 TraceCheckUtils]: 19: Hoare triple {3513#false} ~cond := #in~cond; {3513#false} is VALID [2022-04-15 12:55:47,833 INFO L272 TraceCheckUtils]: 18: Hoare triple {3513#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3513#false} is VALID [2022-04-15 12:55:47,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {3513#false} assume !(~y~0 % 4294967296 > 0); {3513#false} is VALID [2022-04-15 12:55:47,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {3567#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3513#false} is VALID [2022-04-15 12:55:47,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {3567#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {3567#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:47,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {3567#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {3567#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:47,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {3553#(< 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; {3567#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:47,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {3557#(< 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; {3553#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:55:47,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {3557#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !(~z~0 % 4294967296 > 0); {3557#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:55:47,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {3553#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3557#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:55:47,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {3512#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3553#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:55:47,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {3512#true} ~z~0 := ~y~0; {3512#true} is VALID [2022-04-15 12:55:47,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {3512#true} [115] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3512#true} is VALID [2022-04-15 12:55:47,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {3512#true} [116] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_20| 0) (< 0 (mod (+ v_main_~x~0_Out_20 1) 4294967296)) (= (+ v_main_~y~0_Out_20 v_main_~x~0_Out_20) (+ v_main_~x~0_In_10 v_main_~y~0_In_10)) (= |v_main_#t~post6_Out_20| 0) (<= v_main_~x~0_Out_20 v_main_~x~0_In_10)) (and (= v_main_~y~0_In_10 v_main_~y~0_Out_20) (= v_main_~x~0_In_10 v_main_~x~0_Out_20))) InVars {main_~x~0=v_main_~x~0_In_10, main_~y~0=v_main_~y~0_In_10} OutVars{main_~y~0=v_main_~y~0_Out_20, main_#t~post5=|v_main_#t~post5_Out_20|, main_~x~0=v_main_~x~0_Out_20, main_#t~post6=|v_main_#t~post6_Out_20|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3512#true} is VALID [2022-04-15 12:55:47,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {3512#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3512#true} is VALID [2022-04-15 12:55:47,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {3512#true} call #t~ret17 := main(); {3512#true} is VALID [2022-04-15 12:55:47,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3512#true} {3512#true} #94#return; {3512#true} is VALID [2022-04-15 12:55:47,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {3512#true} assume true; {3512#true} is VALID [2022-04-15 12:55:47,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {3512#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3512#true} is VALID [2022-04-15 12:55:47,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {3512#true} call ULTIMATE.init(); {3512#true} is VALID [2022-04-15 12:55:47,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:55:47,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383574140] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:55:47,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:55:47,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 11 [2022-04-15 12:55:47,911 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:47,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1228267156] [2022-04-15 12:55:47,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1228267156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:47,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:47,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:55:47,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059662684] [2022-04-15 12:55:47,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:47,911 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 12:55:47,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:47,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:47,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:47,931 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:55:47,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:47,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:55:47,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:55:47,931 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:48,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:48,739 INFO L93 Difference]: Finished difference Result 77 states and 111 transitions. [2022-04-15 12:55:48,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:55:48,740 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 12:55:48,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:48,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:48,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 67 transitions. [2022-04-15 12:55:48,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:48,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 67 transitions. [2022-04-15 12:55:48,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 67 transitions. [2022-04-15 12:55:48,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:48,825 INFO L225 Difference]: With dead ends: 77 [2022-04-15 12:55:48,825 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 12:55:48,826 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:55:48,826 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 50 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:48,826 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 52 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:55:48,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 12:55:48,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 43. [2022-04-15 12:55:48,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:48,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 43 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:48,965 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 43 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:48,965 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 43 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:48,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:48,966 INFO L93 Difference]: Finished difference Result 65 states and 92 transitions. [2022-04-15 12:55:48,966 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 92 transitions. [2022-04-15 12:55:48,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:48,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:48,967 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-15 12:55:48,967 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-15 12:55:48,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:48,968 INFO L93 Difference]: Finished difference Result 65 states and 92 transitions. [2022-04-15 12:55:48,968 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 92 transitions. [2022-04-15 12:55:48,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:48,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:48,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:48,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:48,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:48,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2022-04-15 12:55:48,969 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 22 [2022-04-15 12:55:48,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:48,969 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2022-04-15 12:55:48,969 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:48,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 58 transitions. [2022-04-15 12:55:49,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:49,101 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2022-04-15 12:55:49,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 12:55:49,101 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:49,102 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:49,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-15 12:55:49,303 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:49,303 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:49,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:49,304 INFO L85 PathProgramCache]: Analyzing trace with hash -353925126, now seen corresponding path program 1 times [2022-04-15 12:55:49,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:49,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [93035821] [2022-04-15 12:55:49,428 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:49,429 INFO L85 PathProgramCache]: Analyzing trace with hash -881791879, now seen corresponding path program 1 times [2022-04-15 12:55:49,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:49,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34275422] [2022-04-15 12:55:49,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:49,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:49,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:49,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {4058#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4045#true} is VALID [2022-04-15 12:55:49,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {4045#true} assume true; {4045#true} is VALID [2022-04-15 12:55:49,639 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4045#true} {4045#true} #94#return; {4045#true} is VALID [2022-04-15 12:55:49,640 INFO L272 TraceCheckUtils]: 0: Hoare triple {4045#true} call ULTIMATE.init(); {4058#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:49,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {4058#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4045#true} is VALID [2022-04-15 12:55:49,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {4045#true} assume true; {4045#true} is VALID [2022-04-15 12:55:49,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4045#true} {4045#true} #94#return; {4045#true} is VALID [2022-04-15 12:55:49,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {4045#true} call #t~ret17 := main(); {4045#true} is VALID [2022-04-15 12:55:49,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {4045#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4050#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:55:49,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {4050#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [118] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~x~0_In_11 v_main_~y~0_In_11) (+ v_main_~y~0_Out_22 v_main_~x~0_Out_22)) (< 0 (mod (+ v_main_~x~0_Out_22 1) 4294967296)) (= |v_main_#t~post6_Out_22| 0) (<= v_main_~x~0_Out_22 v_main_~x~0_In_11) (= |v_main_#t~post5_Out_22| 0)) (and (= v_main_~y~0_In_11 v_main_~y~0_Out_22) (= v_main_~x~0_In_11 v_main_~x~0_Out_22))) InVars {main_~x~0=v_main_~x~0_In_11, main_~y~0=v_main_~y~0_In_11} OutVars{main_~y~0=v_main_~y~0_Out_22, main_#t~post5=|v_main_#t~post5_Out_22|, main_~x~0=v_main_~x~0_Out_22, main_#t~post6=|v_main_#t~post6_Out_22|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4051#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~n~0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))))} is VALID [2022-04-15 12:55:49,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {4051#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~n~0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))))} [117] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4052#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-15 12:55:49,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {4052#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} ~z~0 := ~y~0; {4053#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (+ main_~z~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~n~0) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-15 12:55:49,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {4053#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (+ main_~z~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~n~0) (<= main_~n~0 (+ main_~z~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; {4054#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:55:49,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {4054#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {4054#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:55:49,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {4054#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~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; {4055#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:49,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {4055#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4055#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:49,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {4055#(<= main_~n~0 (+ 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; {4055#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:49,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {4055#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {4055#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:49,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {4055#(<= main_~n~0 (+ 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; {4054#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:55:49,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {4054#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {4054#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:55:49,649 INFO L290 TraceCheckUtils]: 17: Hoare triple {4054#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 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; {4055#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:49,649 INFO L290 TraceCheckUtils]: 18: Hoare triple {4055#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4055#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:49,651 INFO L272 TraceCheckUtils]: 19: Hoare triple {4055#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4056#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:55:49,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {4056#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4057#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:55:49,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {4057#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4046#false} is VALID [2022-04-15 12:55:49,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {4046#false} assume !false; {4046#false} is VALID [2022-04-15 12:55:49,652 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:55:49,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:49,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34275422] [2022-04-15 12:55:49,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34275422] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:49,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429840801] [2022-04-15 12:55:49,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:49,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:49,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:49,653 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:55:49,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 12:55:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:49,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 12:55:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:49,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:56:03,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {4045#true} call ULTIMATE.init(); {4045#true} is VALID [2022-04-15 12:56:03,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {4045#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4045#true} is VALID [2022-04-15 12:56:03,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {4045#true} assume true; {4045#true} is VALID [2022-04-15 12:56:03,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4045#true} {4045#true} #94#return; {4045#true} is VALID [2022-04-15 12:56:03,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {4045#true} call #t~ret17 := main(); {4045#true} is VALID [2022-04-15 12:56:03,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {4045#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4050#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:56:03,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {4050#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [118] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~x~0_In_11 v_main_~y~0_In_11) (+ v_main_~y~0_Out_22 v_main_~x~0_Out_22)) (< 0 (mod (+ v_main_~x~0_Out_22 1) 4294967296)) (= |v_main_#t~post6_Out_22| 0) (<= v_main_~x~0_Out_22 v_main_~x~0_In_11) (= |v_main_#t~post5_Out_22| 0)) (and (= v_main_~y~0_In_11 v_main_~y~0_Out_22) (= v_main_~x~0_In_11 v_main_~x~0_Out_22))) InVars {main_~x~0=v_main_~x~0_In_11, main_~y~0=v_main_~y~0_In_11} OutVars{main_~y~0=v_main_~y~0_Out_22, main_#t~post5=|v_main_#t~post5_Out_22|, main_~x~0=v_main_~x~0_Out_22, main_#t~post6=|v_main_#t~post6_Out_22|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4080#(or (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~x~0 main_~n~0) (= main_~n~0 (+ main_~y~0 main_~x~0))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} is VALID [2022-04-15 12:56:03,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {4080#(or (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~x~0 main_~n~0) (= main_~n~0 (+ main_~y~0 main_~x~0))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} [117] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4084#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-15 12:56:03,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {4084#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} ~z~0 := ~y~0; {4088#(and (= main_~z~0 main_~y~0) (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-15 12:56:03,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {4088#(and (= main_~z~0 main_~y~0) (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 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; {4092#(and (= main_~n~0 (+ (- 1) main_~y~0 main_~x~0)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= main_~y~0 (+ main_~z~0 1)) (<= main_~x~0 (+ main_~n~0 1)))} is VALID [2022-04-15 12:56:03,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {4092#(and (= main_~n~0 (+ (- 1) main_~y~0 main_~x~0)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= main_~y~0 (+ main_~z~0 1)) (<= main_~x~0 (+ main_~n~0 1)))} assume !(~z~0 % 4294967296 > 0); {4092#(and (= main_~n~0 (+ (- 1) main_~y~0 main_~x~0)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= main_~y~0 (+ main_~z~0 1)) (<= main_~x~0 (+ main_~n~0 1)))} is VALID [2022-04-15 12:56:03,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {4092#(and (= main_~n~0 (+ (- 1) main_~y~0 main_~x~0)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= main_~y~0 (+ main_~z~0 1)) (<= main_~x~0 (+ main_~n~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; {4099#(and (= (+ main_~n~0 (* (- 1) main_~x~0) 1) main_~z~0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~y~0 1)) (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295) 1) 4294967296)) (<= main_~x~0 (+ main_~n~0 1)))} is VALID [2022-04-15 12:56:03,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {4099#(and (= (+ main_~n~0 (* (- 1) main_~x~0) 1) main_~z~0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~y~0 1)) (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295) 1) 4294967296)) (<= main_~x~0 (+ main_~n~0 1)))} assume !(~y~0 % 4294967296 > 0); {4099#(and (= (+ main_~n~0 (* (- 1) main_~x~0) 1) main_~z~0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~y~0 1)) (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295) 1) 4294967296)) (<= main_~x~0 (+ main_~n~0 1)))} is VALID [2022-04-15 12:56:03,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {4099#(and (= (+ main_~n~0 (* (- 1) main_~x~0) 1) main_~z~0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~y~0 1)) (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295) 1) 4294967296)) (<= main_~x~0 (+ main_~n~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4106#(and (= main_~z~0 main_~y~0) (< 0 (mod main_~z~0 4294967296)) (= (+ main_~x~0 1) (+ main_~n~0 (* (- 1) main_~z~0) 1)) (not (< 0 (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296))) (<= 0 main_~z~0))} is VALID [2022-04-15 12:56:03,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {4106#(and (= main_~z~0 main_~y~0) (< 0 (mod main_~z~0 4294967296)) (= (+ main_~x~0 1) (+ main_~n~0 (* (- 1) main_~z~0) 1)) (not (< 0 (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296))) (<= 0 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {4110#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (= main_~z~0 main_~y~0) (< 0 (mod main_~z~0 4294967296)) (<= 0 main_~z~0))} is VALID [2022-04-15 12:56:03,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {4110#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (= main_~z~0 main_~y~0) (< 0 (mod main_~z~0 4294967296)) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4114#(and (<= 0 main_~y~0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:03,575 INFO L290 TraceCheckUtils]: 16: Hoare triple {4114#(and (<= 0 main_~y~0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4114#(and (<= 0 main_~y~0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:03,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {4114#(and (<= 0 main_~y~0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {4121#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)) (= main_~z~0 (+ main_~y~0 1)) (<= 0 main_~z~0))} is VALID [2022-04-15 12:56:03,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {4121#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)) (= main_~z~0 (+ main_~y~0 1)) (<= 0 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {4125#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (<= 0 main_~z~0))} is VALID [2022-04-15 12:56:03,580 INFO L272 TraceCheckUtils]: 19: Hoare triple {4125#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (<= 0 main_~z~0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4129#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:56:03,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {4129#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4133#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:56:03,580 INFO L290 TraceCheckUtils]: 21: Hoare triple {4133#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4046#false} is VALID [2022-04-15 12:56:03,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {4046#false} assume !false; {4046#false} is VALID [2022-04-15 12:56:03,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:56:03,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:56:12,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {4046#false} assume !false; {4046#false} is VALID [2022-04-15 12:56:12,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {4133#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4046#false} is VALID [2022-04-15 12:56:12,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {4129#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4133#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:56:12,456 INFO L272 TraceCheckUtils]: 19: Hoare triple {4055#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4129#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:56:12,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {4152#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4055#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:12,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {4156#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 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; {4152#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:12,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {4156#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {4156#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:56:12,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {4163#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (< 0 (mod (+ main_~y~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; {4156#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:56:12,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {4167#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (< 0 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {4163#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:56:12,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {4171#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod main_~y~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4167#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:56:12,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {4171#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4171#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:12,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {4178#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~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; {4171#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:12,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {4178#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {4178#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:56:12,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {4185#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 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; {4178#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:56:12,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {4189#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod main_~x~0 4294967296)))} ~z~0 := ~y~0; {4185#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:56:12,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {4189#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod main_~x~0 4294967296)))} [117] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4189#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:56:12,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {4196#(or (<= (+ (div (+ (* (- 1) main_~x~0) (- 4294967296) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 main_~x~0 (* (- 1) main_~n~0)) (- 4294967296))) (+ (div (+ (- 1) main_~n~0) 4294967296) 2)) (<= (+ (div (+ (- 4294967295) (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (* (- 1) main_~x~0) (- 4294967296) (* main_~n~0 (- 4294967295)) (* (- 1) main_~y~0)) (- 4294967296))) (+ (div (+ main_~y~0 main_~x~0 4294967294) 4294967296) main_~n~0 2)))} [118] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~x~0_In_11 v_main_~y~0_In_11) (+ v_main_~y~0_Out_22 v_main_~x~0_Out_22)) (< 0 (mod (+ v_main_~x~0_Out_22 1) 4294967296)) (= |v_main_#t~post6_Out_22| 0) (<= v_main_~x~0_Out_22 v_main_~x~0_In_11) (= |v_main_#t~post5_Out_22| 0)) (and (= v_main_~y~0_In_11 v_main_~y~0_Out_22) (= v_main_~x~0_In_11 v_main_~x~0_Out_22))) InVars {main_~x~0=v_main_~x~0_In_11, main_~y~0=v_main_~y~0_In_11} OutVars{main_~y~0=v_main_~y~0_Out_22, main_#t~post5=|v_main_#t~post5_Out_22|, main_~x~0=v_main_~x~0_Out_22, main_#t~post6=|v_main_#t~post6_Out_22|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4189#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:56:12,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {4045#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4196#(or (<= (+ (div (+ (* (- 1) main_~x~0) (- 4294967296) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 main_~x~0 (* (- 1) main_~n~0)) (- 4294967296))) (+ (div (+ (- 1) main_~n~0) 4294967296) 2)) (<= (+ (div (+ (- 4294967295) (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (* (- 1) main_~x~0) (- 4294967296) (* main_~n~0 (- 4294967295)) (* (- 1) main_~y~0)) (- 4294967296))) (+ (div (+ main_~y~0 main_~x~0 4294967294) 4294967296) main_~n~0 2)))} is VALID [2022-04-15 12:56:12,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {4045#true} call #t~ret17 := main(); {4045#true} is VALID [2022-04-15 12:56:12,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4045#true} {4045#true} #94#return; {4045#true} is VALID [2022-04-15 12:56:12,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {4045#true} assume true; {4045#true} is VALID [2022-04-15 12:56:12,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {4045#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4045#true} is VALID [2022-04-15 12:56:12,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {4045#true} call ULTIMATE.init(); {4045#true} is VALID [2022-04-15 12:56:12,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:56:12,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429840801] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:56:12,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:56:12,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 14] total 32 [2022-04-15 12:56:12,703 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:56:12,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [93035821] [2022-04-15 12:56:12,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [93035821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:56:12,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:56:12,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:56:12,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143356972] [2022-04-15 12:56:12,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:56:12,704 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-15 12:56:12,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:56:12,704 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-15 12:56:12,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:12,732 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:56:12,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:12,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:56:12,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=928, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 12:56:12,733 INFO L87 Difference]: Start difference. First operand 43 states and 58 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-15 12:56:13,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:13,841 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2022-04-15 12:56:13,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:56:13,842 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-15 12:56:13,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:56:13,842 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-15 12:56:13,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 42 transitions. [2022-04-15 12:56:13,843 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-15 12:56:13,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 42 transitions. [2022-04-15 12:56:13,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 42 transitions. [2022-04-15 12:56:13,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:13,892 INFO L225 Difference]: With dead ends: 51 [2022-04-15 12:56:13,892 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 12:56:13,893 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=281, Invalid=1525, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 12:56:13,893 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 28 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:56:13,893 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 55 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:56:13,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 12:56:14,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-04-15 12:56:14,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:56:14,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 45 states, 40 states have (on average 1.425) internal successors, (57), 40 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:14,047 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 45 states, 40 states have (on average 1.425) internal successors, (57), 40 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:14,047 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 45 states, 40 states have (on average 1.425) internal successors, (57), 40 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:14,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:14,048 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2022-04-15 12:56:14,048 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2022-04-15 12:56:14,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:14,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:14,048 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.425) internal successors, (57), 40 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-15 12:56:14,048 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.425) internal successors, (57), 40 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-15 12:56:14,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:14,049 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2022-04-15 12:56:14,049 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2022-04-15 12:56:14,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:14,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:14,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:56:14,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:56:14,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.425) internal successors, (57), 40 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:14,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2022-04-15 12:56:14,050 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 23 [2022-04-15 12:56:14,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:56:14,050 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2022-04-15 12:56:14,054 INFO L479 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-15 12:56:14,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 61 transitions. [2022-04-15 12:56:14,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:14,226 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2022-04-15 12:56:14,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 12:56:14,227 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:56:14,227 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:56:14,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 12:56:14,431 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 12:56:14,433 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:56:14,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:56:14,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1894791784, now seen corresponding path program 2 times [2022-04-15 12:56:14,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:14,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [559156527] [2022-04-15 12:56:14,564 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:56:14,565 INFO L85 PathProgramCache]: Analyzing trace with hash -737107497, now seen corresponding path program 1 times [2022-04-15 12:56:14,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:56:14,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383242321] [2022-04-15 12:56:14,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:14,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:56:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:14,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:56:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:14,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {4530#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4521#true} is VALID [2022-04-15 12:56:14,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {4521#true} assume true; {4521#true} is VALID [2022-04-15 12:56:14,624 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4521#true} {4521#true} #94#return; {4521#true} is VALID [2022-04-15 12:56:14,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {4521#true} call ULTIMATE.init(); {4530#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:56:14,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {4530#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4521#true} is VALID [2022-04-15 12:56:14,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {4521#true} assume true; {4521#true} is VALID [2022-04-15 12:56:14,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4521#true} {4521#true} #94#return; {4521#true} is VALID [2022-04-15 12:56:14,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {4521#true} call #t~ret17 := main(); {4521#true} is VALID [2022-04-15 12:56:14,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {4521#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4521#true} is VALID [2022-04-15 12:56:14,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {4521#true} [120] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_12 v_main_~y~0_Out_24) (= v_main_~x~0_In_12 v_main_~x~0_Out_24)) (and (= |v_main_#t~post5_Out_24| 0) (= |v_main_#t~post6_Out_24| 0) (< 0 (mod (+ v_main_~x~0_Out_24 1) 4294967296)) (= (+ v_main_~x~0_In_12 v_main_~y~0_In_12) (+ v_main_~y~0_Out_24 v_main_~x~0_Out_24)) (<= v_main_~x~0_Out_24 v_main_~x~0_In_12))) InVars {main_~x~0=v_main_~x~0_In_12, main_~y~0=v_main_~y~0_In_12} OutVars{main_~y~0=v_main_~y~0_Out_24, main_#t~post5=|v_main_#t~post5_Out_24|, main_~x~0=v_main_~x~0_Out_24, main_#t~post6=|v_main_#t~post6_Out_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4521#true} is VALID [2022-04-15 12:56:14,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {4521#true} [119] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4521#true} is VALID [2022-04-15 12:56:14,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {4521#true} ~z~0 := ~y~0; {4526#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:56:14,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {4526#(= 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; {4527#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:56:14,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {4527#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !(~z~0 % 4294967296 > 0); {4528#(and (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-15 12:56:14,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {4528#(and (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4529#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:14,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {4529#(<= main_~y~0 (* (div main_~y~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; {4522#false} is VALID [2022-04-15 12:56:14,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {4522#false} assume !(~y~0 % 4294967296 > 0); {4522#false} is VALID [2022-04-15 12:56:14,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {4522#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; {4522#false} is VALID [2022-04-15 12:56:14,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {4522#false} assume !(~x~0 % 4294967296 > 0); {4522#false} is VALID [2022-04-15 12:56:14,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {4522#false} assume !(~z~0 % 4294967296 > 0); {4522#false} is VALID [2022-04-15 12:56:14,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {4522#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; {4522#false} is VALID [2022-04-15 12:56:14,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {4522#false} assume !(~y~0 % 4294967296 > 0); {4522#false} is VALID [2022-04-15 12:56:14,630 INFO L272 TraceCheckUtils]: 19: Hoare triple {4522#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4522#false} is VALID [2022-04-15 12:56:14,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {4522#false} ~cond := #in~cond; {4522#false} is VALID [2022-04-15 12:56:14,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {4522#false} assume 0 == ~cond; {4522#false} is VALID [2022-04-15 12:56:14,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {4522#false} assume !false; {4522#false} is VALID [2022-04-15 12:56:14,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:56:14,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:56:14,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383242321] [2022-04-15 12:56:14,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383242321] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:56:14,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878644345] [2022-04-15 12:56:14,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:14,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:56:14,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:56:14,635 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:56:14,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 12:56:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:14,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:56:14,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:14,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:56:14,868 INFO L272 TraceCheckUtils]: 0: Hoare triple {4521#true} call ULTIMATE.init(); {4521#true} is VALID [2022-04-15 12:56:14,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {4521#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4521#true} is VALID [2022-04-15 12:56:14,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {4521#true} assume true; {4521#true} is VALID [2022-04-15 12:56:14,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4521#true} {4521#true} #94#return; {4521#true} is VALID [2022-04-15 12:56:14,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {4521#true} call #t~ret17 := main(); {4521#true} is VALID [2022-04-15 12:56:14,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {4521#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4521#true} is VALID [2022-04-15 12:56:14,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {4521#true} [120] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_12 v_main_~y~0_Out_24) (= v_main_~x~0_In_12 v_main_~x~0_Out_24)) (and (= |v_main_#t~post5_Out_24| 0) (= |v_main_#t~post6_Out_24| 0) (< 0 (mod (+ v_main_~x~0_Out_24 1) 4294967296)) (= (+ v_main_~x~0_In_12 v_main_~y~0_In_12) (+ v_main_~y~0_Out_24 v_main_~x~0_Out_24)) (<= v_main_~x~0_Out_24 v_main_~x~0_In_12))) InVars {main_~x~0=v_main_~x~0_In_12, main_~y~0=v_main_~y~0_In_12} OutVars{main_~y~0=v_main_~y~0_Out_24, main_#t~post5=|v_main_#t~post5_Out_24|, main_~x~0=v_main_~x~0_Out_24, main_#t~post6=|v_main_#t~post6_Out_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4521#true} is VALID [2022-04-15 12:56:14,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {4521#true} [119] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4521#true} is VALID [2022-04-15 12:56:14,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {4521#true} ~z~0 := ~y~0; {4526#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:56:14,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {4526#(= 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; {4527#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:56:14,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {4527#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !(~z~0 % 4294967296 > 0); {4564#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:56:14,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {4564#(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; {4529#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:14,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {4529#(<= main_~y~0 (* (div main_~y~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; {4571#(<= (+ main_~y~0 1) (* (div (+ main_~y~0 1) 4294967296) 4294967296))} is VALID [2022-04-15 12:56:14,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {4571#(<= (+ main_~y~0 1) (* (div (+ main_~y~0 1) 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {4571#(<= (+ main_~y~0 1) (* (div (+ main_~y~0 1) 4294967296) 4294967296))} is VALID [2022-04-15 12:56:14,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {4571#(<= (+ main_~y~0 1) (* (div (+ main_~y~0 1) 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; {4529#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:14,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {4529#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {4529#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:14,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {4529#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4529#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:14,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {4529#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {4522#false} is VALID [2022-04-15 12:56:14,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {4522#false} assume !(~y~0 % 4294967296 > 0); {4522#false} is VALID [2022-04-15 12:56:14,882 INFO L272 TraceCheckUtils]: 19: Hoare triple {4522#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4522#false} is VALID [2022-04-15 12:56:14,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {4522#false} ~cond := #in~cond; {4522#false} is VALID [2022-04-15 12:56:14,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {4522#false} assume 0 == ~cond; {4522#false} is VALID [2022-04-15 12:56:14,882 INFO L290 TraceCheckUtils]: 22: Hoare triple {4522#false} assume !false; {4522#false} is VALID [2022-04-15 12:56:14,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:56:14,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:56:15,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {4522#false} assume !false; {4522#false} is VALID [2022-04-15 12:56:15,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {4522#false} assume 0 == ~cond; {4522#false} is VALID [2022-04-15 12:56:15,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {4522#false} ~cond := #in~cond; {4522#false} is VALID [2022-04-15 12:56:15,012 INFO L272 TraceCheckUtils]: 19: Hoare triple {4522#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4522#false} is VALID [2022-04-15 12:56:15,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {4522#false} assume !(~y~0 % 4294967296 > 0); {4522#false} is VALID [2022-04-15 12:56:15,013 INFO L290 TraceCheckUtils]: 17: Hoare triple {4529#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {4522#false} is VALID [2022-04-15 12:56:15,013 INFO L290 TraceCheckUtils]: 16: Hoare triple {4529#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4529#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:15,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {4529#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {4529#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:15,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {4571#(<= (+ main_~y~0 1) (* (div (+ main_~y~0 1) 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; {4529#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:15,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {4571#(<= (+ main_~y~0 1) (* (div (+ main_~y~0 1) 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {4571#(<= (+ main_~y~0 1) (* (div (+ main_~y~0 1) 4294967296) 4294967296))} is VALID [2022-04-15 12:56:15,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {4529#(<= main_~y~0 (* (div main_~y~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; {4571#(<= (+ main_~y~0 1) (* (div (+ main_~y~0 1) 4294967296) 4294967296))} is VALID [2022-04-15 12:56:15,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {4564#(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; {4529#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:15,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {4638#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {4564#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:56:15,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {4642#(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; {4638#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 12:56:15,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {4521#true} ~z~0 := ~y~0; {4642#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 12:56:15,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {4521#true} [119] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4521#true} is VALID [2022-04-15 12:56:15,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {4521#true} [120] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_12 v_main_~y~0_Out_24) (= v_main_~x~0_In_12 v_main_~x~0_Out_24)) (and (= |v_main_#t~post5_Out_24| 0) (= |v_main_#t~post6_Out_24| 0) (< 0 (mod (+ v_main_~x~0_Out_24 1) 4294967296)) (= (+ v_main_~x~0_In_12 v_main_~y~0_In_12) (+ v_main_~y~0_Out_24 v_main_~x~0_Out_24)) (<= v_main_~x~0_Out_24 v_main_~x~0_In_12))) InVars {main_~x~0=v_main_~x~0_In_12, main_~y~0=v_main_~y~0_In_12} OutVars{main_~y~0=v_main_~y~0_Out_24, main_#t~post5=|v_main_#t~post5_Out_24|, main_~x~0=v_main_~x~0_Out_24, main_#t~post6=|v_main_#t~post6_Out_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4521#true} is VALID [2022-04-15 12:56:15,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {4521#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4521#true} is VALID [2022-04-15 12:56:15,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {4521#true} call #t~ret17 := main(); {4521#true} is VALID [2022-04-15 12:56:15,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4521#true} {4521#true} #94#return; {4521#true} is VALID [2022-04-15 12:56:15,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {4521#true} assume true; {4521#true} is VALID [2022-04-15 12:56:15,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {4521#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4521#true} is VALID [2022-04-15 12:56:15,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {4521#true} call ULTIMATE.init(); {4521#true} is VALID [2022-04-15 12:56:15,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:56:15,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878644345] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:56:15,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:56:15,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-04-15 12:56:15,049 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:56:15,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [559156527] [2022-04-15 12:56:15,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [559156527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:56:15,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:56:15,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:56:15,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882942084] [2022-04-15 12:56:15,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:56:15,050 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 12:56:15,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:56:15,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:15,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:15,070 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:56:15,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:15,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:56:15,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:56:15,070 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:15,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:15,660 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2022-04-15 12:56:15,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:56:15,660 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 12:56:15,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:56:15,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:15,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2022-04-15 12:56:15,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:15,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2022-04-15 12:56:15,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 55 transitions. [2022-04-15 12:56:15,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:15,718 INFO L225 Difference]: With dead ends: 60 [2022-04-15 12:56:15,718 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 12:56:15,718 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:56:15,719 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:56:15,719 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 47 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:56:15,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 12:56:15,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2022-04-15 12:56:15,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:56:15,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 42 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 37 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:15,877 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 42 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 37 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:15,877 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 42 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 37 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:15,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:15,878 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2022-04-15 12:56:15,878 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 67 transitions. [2022-04-15 12:56:15,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:15,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:15,879 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 37 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-15 12:56:15,879 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 37 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-15 12:56:15,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:15,879 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2022-04-15 12:56:15,879 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 67 transitions. [2022-04-15 12:56:15,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:15,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:15,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:56:15,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:56:15,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 37 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:15,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2022-04-15 12:56:15,880 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 56 transitions. Word has length 23 [2022-04-15 12:56:15,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:56:15,880 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 56 transitions. [2022-04-15 12:56:15,881 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:15,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 56 transitions. [2022-04-15 12:56:16,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:16,018 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2022-04-15 12:56:16,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 12:56:16,019 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:56:16,019 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:56:16,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-15 12:56:16,219 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-15 12:56:16,220 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:56:16,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:56:16,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1947718100, now seen corresponding path program 2 times [2022-04-15 12:56:16,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:16,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [416852124] [2022-04-15 12:56:16,338 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:56:16,339 INFO L85 PathProgramCache]: Analyzing trace with hash -106299979, now seen corresponding path program 1 times [2022-04-15 12:56:16,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:56:16,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089023945] [2022-04-15 12:56:16,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:16,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:56:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:16,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:56:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:16,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {4999#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4989#true} is VALID [2022-04-15 12:56:16,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {4989#true} assume true; {4989#true} is VALID [2022-04-15 12:56:16,432 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4989#true} {4989#true} #94#return; {4989#true} is VALID [2022-04-15 12:56:16,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {4989#true} call ULTIMATE.init(); {4999#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:56:16,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {4999#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4989#true} is VALID [2022-04-15 12:56:16,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {4989#true} assume true; {4989#true} is VALID [2022-04-15 12:56:16,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4989#true} {4989#true} #94#return; {4989#true} is VALID [2022-04-15 12:56:16,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {4989#true} call #t~ret17 := main(); {4989#true} is VALID [2022-04-15 12:56:16,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {4989#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4989#true} is VALID [2022-04-15 12:56:16,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {4989#true} [122] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_13 v_main_~x~0_Out_26) (= v_main_~y~0_In_13 v_main_~y~0_Out_26)) (and (= |v_main_#t~post6_Out_26| 0) (< 0 (mod (+ v_main_~x~0_Out_26 1) 4294967296)) (<= v_main_~x~0_Out_26 v_main_~x~0_In_13) (= (+ v_main_~y~0_Out_26 v_main_~x~0_Out_26) (+ v_main_~x~0_In_13 v_main_~y~0_In_13)) (= |v_main_#t~post5_Out_26| 0))) InVars {main_~x~0=v_main_~x~0_In_13, main_~y~0=v_main_~y~0_In_13} OutVars{main_~y~0=v_main_~y~0_Out_26, main_#t~post5=|v_main_#t~post5_Out_26|, main_~x~0=v_main_~x~0_Out_26, main_#t~post6=|v_main_#t~post6_Out_26|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4989#true} is VALID [2022-04-15 12:56:16,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {4989#true} [121] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4989#true} is VALID [2022-04-15 12:56:16,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {4989#true} ~z~0 := ~y~0; {4994#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:56:16,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {4994#(= 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; {4995#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:56:16,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {4995#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !(~z~0 % 4294967296 > 0); {4996#(and (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-15 12:56:16,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {4996#(and (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4997#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:16,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {4997#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {4997#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:16,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {4997#(<= main_~y~0 (* (div main_~y~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; {4998#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:16,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {4998#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !(~x~0 % 4294967296 > 0); {4998#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:16,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {4998#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 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; {4998#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:16,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {4998#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !(~z~0 % 4294967296 > 0); {4998#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:16,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {4998#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 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; {4997#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:16,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {4997#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {4990#false} is VALID [2022-04-15 12:56:16,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {4990#false} assume !(~y~0 % 4294967296 > 0); {4990#false} is VALID [2022-04-15 12:56:16,462 INFO L272 TraceCheckUtils]: 20: Hoare triple {4990#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4990#false} is VALID [2022-04-15 12:56:16,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {4990#false} ~cond := #in~cond; {4990#false} is VALID [2022-04-15 12:56:16,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {4990#false} assume 0 == ~cond; {4990#false} is VALID [2022-04-15 12:56:16,462 INFO L290 TraceCheckUtils]: 23: Hoare triple {4990#false} assume !false; {4990#false} is VALID [2022-04-15 12:56:16,462 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:56:16,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:56:16,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089023945] [2022-04-15 12:56:16,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089023945] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:56:16,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706153814] [2022-04-15 12:56:16,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:16,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:56:16,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:56:16,464 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:56:16,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 12:56:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:16,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:56:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:16,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:56:16,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {4989#true} call ULTIMATE.init(); {4989#true} is VALID [2022-04-15 12:56:16,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {4989#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4989#true} is VALID [2022-04-15 12:56:16,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {4989#true} assume true; {4989#true} is VALID [2022-04-15 12:56:16,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4989#true} {4989#true} #94#return; {4989#true} is VALID [2022-04-15 12:56:16,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {4989#true} call #t~ret17 := main(); {4989#true} is VALID [2022-04-15 12:56:16,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {4989#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4989#true} is VALID [2022-04-15 12:56:16,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {4989#true} [122] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_13 v_main_~x~0_Out_26) (= v_main_~y~0_In_13 v_main_~y~0_Out_26)) (and (= |v_main_#t~post6_Out_26| 0) (< 0 (mod (+ v_main_~x~0_Out_26 1) 4294967296)) (<= v_main_~x~0_Out_26 v_main_~x~0_In_13) (= (+ v_main_~y~0_Out_26 v_main_~x~0_Out_26) (+ v_main_~x~0_In_13 v_main_~y~0_In_13)) (= |v_main_#t~post5_Out_26| 0))) InVars {main_~x~0=v_main_~x~0_In_13, main_~y~0=v_main_~y~0_In_13} OutVars{main_~y~0=v_main_~y~0_Out_26, main_#t~post5=|v_main_#t~post5_Out_26|, main_~x~0=v_main_~x~0_Out_26, main_#t~post6=|v_main_#t~post6_Out_26|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4989#true} is VALID [2022-04-15 12:56:16,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {4989#true} [121] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4989#true} is VALID [2022-04-15 12:56:16,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {4989#true} ~z~0 := ~y~0; {4989#true} is VALID [2022-04-15 12:56:16,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {4989#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4989#true} is VALID [2022-04-15 12:56:16,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {4989#true} assume !(~z~0 % 4294967296 > 0); {4989#true} is VALID [2022-04-15 12:56:16,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {4989#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4989#true} is VALID [2022-04-15 12:56:16,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {4989#true} assume !(~y~0 % 4294967296 > 0); {4997#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:16,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {4997#(<= main_~y~0 (* (div main_~y~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; {4998#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:16,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {4998#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !(~x~0 % 4294967296 > 0); {4998#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:16,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {4998#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 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; {4998#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:16,706 INFO L290 TraceCheckUtils]: 16: Hoare triple {4998#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !(~z~0 % 4294967296 > 0); {4998#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:16,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {4998#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 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; {4997#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:16,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {4997#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {4990#false} is VALID [2022-04-15 12:56:16,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {4990#false} assume !(~y~0 % 4294967296 > 0); {4990#false} is VALID [2022-04-15 12:56:16,708 INFO L272 TraceCheckUtils]: 20: Hoare triple {4990#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4990#false} is VALID [2022-04-15 12:56:16,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {4990#false} ~cond := #in~cond; {4990#false} is VALID [2022-04-15 12:56:16,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {4990#false} assume 0 == ~cond; {4990#false} is VALID [2022-04-15 12:56:16,709 INFO L290 TraceCheckUtils]: 23: Hoare triple {4990#false} assume !false; {4990#false} is VALID [2022-04-15 12:56:16,709 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:56:16,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:56:16,871 INFO L290 TraceCheckUtils]: 23: Hoare triple {4990#false} assume !false; {4990#false} is VALID [2022-04-15 12:56:16,871 INFO L290 TraceCheckUtils]: 22: Hoare triple {4990#false} assume 0 == ~cond; {4990#false} is VALID [2022-04-15 12:56:16,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {4990#false} ~cond := #in~cond; {4990#false} is VALID [2022-04-15 12:56:16,871 INFO L272 TraceCheckUtils]: 20: Hoare triple {4990#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4990#false} is VALID [2022-04-15 12:56:16,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {4990#false} assume !(~y~0 % 4294967296 > 0); {4990#false} is VALID [2022-04-15 12:56:16,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {4997#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {4990#false} is VALID [2022-04-15 12:56:16,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {4998#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 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; {4997#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:16,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {4998#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !(~z~0 % 4294967296 > 0); {4998#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:16,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {4998#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 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; {4998#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:16,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {4998#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !(~x~0 % 4294967296 > 0); {4998#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:16,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {4997#(<= main_~y~0 (* (div main_~y~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; {4998#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:16,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {4989#true} assume !(~y~0 % 4294967296 > 0); {4997#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:16,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {4989#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4989#true} is VALID [2022-04-15 12:56:16,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {4989#true} assume !(~z~0 % 4294967296 > 0); {4989#true} is VALID [2022-04-15 12:56:16,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {4989#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4989#true} is VALID [2022-04-15 12:56:16,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {4989#true} ~z~0 := ~y~0; {4989#true} is VALID [2022-04-15 12:56:16,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {4989#true} [121] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4989#true} is VALID [2022-04-15 12:56:16,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {4989#true} [122] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_13 v_main_~x~0_Out_26) (= v_main_~y~0_In_13 v_main_~y~0_Out_26)) (and (= |v_main_#t~post6_Out_26| 0) (< 0 (mod (+ v_main_~x~0_Out_26 1) 4294967296)) (<= v_main_~x~0_Out_26 v_main_~x~0_In_13) (= (+ v_main_~y~0_Out_26 v_main_~x~0_Out_26) (+ v_main_~x~0_In_13 v_main_~y~0_In_13)) (= |v_main_#t~post5_Out_26| 0))) InVars {main_~x~0=v_main_~x~0_In_13, main_~y~0=v_main_~y~0_In_13} OutVars{main_~y~0=v_main_~y~0_Out_26, main_#t~post5=|v_main_#t~post5_Out_26|, main_~x~0=v_main_~x~0_Out_26, main_#t~post6=|v_main_#t~post6_Out_26|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4989#true} is VALID [2022-04-15 12:56:16,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {4989#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4989#true} is VALID [2022-04-15 12:56:16,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {4989#true} call #t~ret17 := main(); {4989#true} is VALID [2022-04-15 12:56:16,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4989#true} {4989#true} #94#return; {4989#true} is VALID [2022-04-15 12:56:16,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {4989#true} assume true; {4989#true} is VALID [2022-04-15 12:56:16,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {4989#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4989#true} is VALID [2022-04-15 12:56:16,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {4989#true} call ULTIMATE.init(); {4989#true} is VALID [2022-04-15 12:56:16,878 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:56:16,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706153814] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:56:16,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:56:16,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 8 [2022-04-15 12:56:16,910 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:56:16,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [416852124] [2022-04-15 12:56:16,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [416852124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:56:16,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:56:16,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:56:16,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495111987] [2022-04-15 12:56:16,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:56:16,911 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 24 [2022-04-15 12:56:16,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:56:16,912 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-15 12:56:16,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:16,933 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:56:16,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:16,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:56:16,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:56:16,934 INFO L87 Difference]: Start difference. First operand 42 states and 56 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-15 12:56:17,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:17,642 INFO L93 Difference]: Finished difference Result 80 states and 113 transitions. [2022-04-15 12:56:17,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:56:17,642 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 24 [2022-04-15 12:56:17,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:56:17,643 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-15 12:56:17,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 72 transitions. [2022-04-15 12:56:17,643 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-15 12:56:17,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 72 transitions. [2022-04-15 12:56:17,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 72 transitions. [2022-04-15 12:56:17,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:17,736 INFO L225 Difference]: With dead ends: 80 [2022-04-15 12:56:17,736 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 12:56:17,737 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:56:17,737 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 49 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:56:17,737 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 42 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:56:17,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 12:56:17,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2022-04-15 12:56:17,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:56:17,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 45 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:17,915 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 45 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:17,915 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 45 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:17,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:17,916 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2022-04-15 12:56:17,916 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2022-04-15 12:56:17,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:17,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:17,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-15 12:56:17,916 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-15 12:56:17,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:17,917 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2022-04-15 12:56:17,917 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2022-04-15 12:56:17,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:17,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:17,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:56:17,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:56:17,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:17,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2022-04-15 12:56:17,918 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 24 [2022-04-15 12:56:17,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:56:17,918 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2022-04-15 12:56:17,918 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:17,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 59 transitions. [2022-04-15 12:56:18,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:18,087 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2022-04-15 12:56:18,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 12:56:18,087 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:56:18,087 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:56:18,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 12:56:18,291 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-15 12:56:18,291 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:56:18,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:56:18,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1809241787, now seen corresponding path program 3 times [2022-04-15 12:56:18,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:18,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1838426613] [2022-04-15 12:56:18,385 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:56:18,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1144182118, now seen corresponding path program 1 times [2022-04-15 12:56:18,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:56:18,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88084393] [2022-04-15 12:56:18,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:18,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:56:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:18,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:56:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:18,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {5530#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5523#true} is VALID [2022-04-15 12:56:18,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {5523#true} assume true; {5523#true} is VALID [2022-04-15 12:56:18,437 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5523#true} {5523#true} #94#return; {5523#true} is VALID [2022-04-15 12:56:18,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {5523#true} call ULTIMATE.init(); {5530#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:56:18,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {5530#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5523#true} is VALID [2022-04-15 12:56:18,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {5523#true} assume true; {5523#true} is VALID [2022-04-15 12:56:18,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5523#true} {5523#true} #94#return; {5523#true} is VALID [2022-04-15 12:56:18,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {5523#true} call #t~ret17 := main(); {5523#true} is VALID [2022-04-15 12:56:18,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {5523#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5523#true} is VALID [2022-04-15 12:56:18,438 INFO L290 TraceCheckUtils]: 6: Hoare triple {5523#true} [124] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_28| 0) (<= v_main_~x~0_Out_28 v_main_~x~0_In_14) (< 0 (mod (+ v_main_~x~0_Out_28 1) 4294967296)) (= |v_main_#t~post5_Out_28| 0) (= (+ v_main_~y~0_Out_28 v_main_~x~0_Out_28) (+ v_main_~x~0_In_14 v_main_~y~0_In_14))) (and (= v_main_~y~0_In_14 v_main_~y~0_Out_28) (= v_main_~x~0_In_14 v_main_~x~0_Out_28))) InVars {main_~x~0=v_main_~x~0_In_14, main_~y~0=v_main_~y~0_In_14} OutVars{main_~y~0=v_main_~y~0_Out_28, main_#t~post5=|v_main_#t~post5_Out_28|, main_~x~0=v_main_~x~0_Out_28, main_#t~post6=|v_main_#t~post6_Out_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5523#true} is VALID [2022-04-15 12:56:18,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {5523#true} [123] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5523#true} is VALID [2022-04-15 12:56:18,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {5523#true} ~z~0 := ~y~0; {5523#true} is VALID [2022-04-15 12:56:18,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {5523#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5523#true} is VALID [2022-04-15 12:56:18,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {5523#true} assume !(~z~0 % 4294967296 > 0); {5528#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:18,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {5528#(<= main_~z~0 (* (div 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; {5529#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:18,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {5529#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !(~y~0 % 4294967296 > 0); {5529#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:18,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {5529#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 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; {5529#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:18,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {5529#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !(~x~0 % 4294967296 > 0); {5529#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:18,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {5529#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 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; {5528#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:18,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {5528#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5524#false} is VALID [2022-04-15 12:56:18,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {5524#false} assume !(~z~0 % 4294967296 > 0); {5524#false} is VALID [2022-04-15 12:56:18,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {5524#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; {5524#false} is VALID [2022-04-15 12:56:18,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {5524#false} assume !(~y~0 % 4294967296 > 0); {5524#false} is VALID [2022-04-15 12:56:18,443 INFO L272 TraceCheckUtils]: 20: Hoare triple {5524#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5524#false} is VALID [2022-04-15 12:56:18,443 INFO L290 TraceCheckUtils]: 21: Hoare triple {5524#false} ~cond := #in~cond; {5524#false} is VALID [2022-04-15 12:56:18,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {5524#false} assume 0 == ~cond; {5524#false} is VALID [2022-04-15 12:56:18,443 INFO L290 TraceCheckUtils]: 23: Hoare triple {5524#false} assume !false; {5524#false} is VALID [2022-04-15 12:56:18,443 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:56:18,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:56:18,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88084393] [2022-04-15 12:56:18,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88084393] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:56:18,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593561082] [2022-04-15 12:56:18,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:18,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:56:18,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:56:18,445 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:56:18,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 12:56:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:18,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 12:56:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:18,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:56:18,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {5523#true} call ULTIMATE.init(); {5523#true} is VALID [2022-04-15 12:56:18,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {5523#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5523#true} is VALID [2022-04-15 12:56:18,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {5523#true} assume true; {5523#true} is VALID [2022-04-15 12:56:18,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5523#true} {5523#true} #94#return; {5523#true} is VALID [2022-04-15 12:56:18,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {5523#true} call #t~ret17 := main(); {5523#true} is VALID [2022-04-15 12:56:18,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {5523#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5523#true} is VALID [2022-04-15 12:56:18,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {5523#true} [124] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_28| 0) (<= v_main_~x~0_Out_28 v_main_~x~0_In_14) (< 0 (mod (+ v_main_~x~0_Out_28 1) 4294967296)) (= |v_main_#t~post5_Out_28| 0) (= (+ v_main_~y~0_Out_28 v_main_~x~0_Out_28) (+ v_main_~x~0_In_14 v_main_~y~0_In_14))) (and (= v_main_~y~0_In_14 v_main_~y~0_Out_28) (= v_main_~x~0_In_14 v_main_~x~0_Out_28))) InVars {main_~x~0=v_main_~x~0_In_14, main_~y~0=v_main_~y~0_In_14} OutVars{main_~y~0=v_main_~y~0_Out_28, main_#t~post5=|v_main_#t~post5_Out_28|, main_~x~0=v_main_~x~0_Out_28, main_#t~post6=|v_main_#t~post6_Out_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5523#true} is VALID [2022-04-15 12:56:18,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {5523#true} [123] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5523#true} is VALID [2022-04-15 12:56:18,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {5523#true} ~z~0 := ~y~0; {5558#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:56:18,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {5558#(= 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; {5562#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 12:56:18,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {5562#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {5562#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 12:56:18,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {5562#(= main_~y~0 (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5569#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-15 12:56:18,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {5569#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {5569#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-15 12:56:18,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {5569#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5558#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:56:18,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {5558#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {5558#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:56:18,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {5558#(= main_~z~0 main_~y~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; {5562#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 12:56:18,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {5562#(= main_~y~0 (+ 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; {5585#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 12:56:18,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {5585#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5585#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 12:56:18,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {5585#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {5592#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:56:18,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {5592#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5524#false} is VALID [2022-04-15 12:56:18,574 INFO L272 TraceCheckUtils]: 20: Hoare triple {5524#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5524#false} is VALID [2022-04-15 12:56:18,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {5524#false} ~cond := #in~cond; {5524#false} is VALID [2022-04-15 12:56:18,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {5524#false} assume 0 == ~cond; {5524#false} is VALID [2022-04-15 12:56:18,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {5524#false} assume !false; {5524#false} is VALID [2022-04-15 12:56:18,574 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:56:18,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:56:18,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {5524#false} assume !false; {5524#false} is VALID [2022-04-15 12:56:18,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {5524#false} assume 0 == ~cond; {5524#false} is VALID [2022-04-15 12:56:18,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {5524#false} ~cond := #in~cond; {5524#false} is VALID [2022-04-15 12:56:18,737 INFO L272 TraceCheckUtils]: 20: Hoare triple {5524#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5524#false} is VALID [2022-04-15 12:56:18,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {5592#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5524#false} is VALID [2022-04-15 12:56:18,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {5585#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {5592#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:56:18,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {5585#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5585#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 12:56:18,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {5629#(or (< 0 (mod (+ main_~y~0 4294967295) 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; {5585#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 12:56:18,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {5633#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~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; {5629#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 12:56:18,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {5633#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5633#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:56:18,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {5640#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5633#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:56:18,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {5640#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {5640#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:18,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {5629#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5640#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:18,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {5629#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !(~z~0 % 4294967296 > 0); {5629#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 12:56:18,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {5633#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 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; {5629#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 12:56:18,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {5523#true} ~z~0 := ~y~0; {5633#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:56:18,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {5523#true} [123] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5523#true} is VALID [2022-04-15 12:56:18,749 INFO L290 TraceCheckUtils]: 6: Hoare triple {5523#true} [124] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_28| 0) (<= v_main_~x~0_Out_28 v_main_~x~0_In_14) (< 0 (mod (+ v_main_~x~0_Out_28 1) 4294967296)) (= |v_main_#t~post5_Out_28| 0) (= (+ v_main_~y~0_Out_28 v_main_~x~0_Out_28) (+ v_main_~x~0_In_14 v_main_~y~0_In_14))) (and (= v_main_~y~0_In_14 v_main_~y~0_Out_28) (= v_main_~x~0_In_14 v_main_~x~0_Out_28))) InVars {main_~x~0=v_main_~x~0_In_14, main_~y~0=v_main_~y~0_In_14} OutVars{main_~y~0=v_main_~y~0_Out_28, main_#t~post5=|v_main_#t~post5_Out_28|, main_~x~0=v_main_~x~0_Out_28, main_#t~post6=|v_main_#t~post6_Out_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5523#true} is VALID [2022-04-15 12:56:18,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {5523#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5523#true} is VALID [2022-04-15 12:56:18,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {5523#true} call #t~ret17 := main(); {5523#true} is VALID [2022-04-15 12:56:18,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5523#true} {5523#true} #94#return; {5523#true} is VALID [2022-04-15 12:56:18,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {5523#true} assume true; {5523#true} is VALID [2022-04-15 12:56:18,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {5523#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5523#true} is VALID [2022-04-15 12:56:18,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {5523#true} call ULTIMATE.init(); {5523#true} is VALID [2022-04-15 12:56:18,749 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:56:18,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593561082] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:56:18,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:56:18,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 13 [2022-04-15 12:56:18,780 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:56:18,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1838426613] [2022-04-15 12:56:18,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1838426613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:56:18,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:56:18,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:56:18,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873674256] [2022-04-15 12:56:18,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:56:18,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 12:56:18,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:56:18,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:18,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:18,802 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:56:18,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:18,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:56:18,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:56:18,803 INFO L87 Difference]: Start difference. First operand 45 states and 59 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:19,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:19,389 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2022-04-15 12:56:19,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:56:19,389 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 12:56:19,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:56:19,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:19,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2022-04-15 12:56:19,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:19,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2022-04-15 12:56:19,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 59 transitions. [2022-04-15 12:56:19,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:19,457 INFO L225 Difference]: With dead ends: 70 [2022-04-15 12:56:19,457 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 12:56:19,457 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:56:19,458 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 41 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:56:19,458 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 36 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:56:19,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 12:56:19,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 36. [2022-04-15 12:56:19,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:56:19,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 36 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:19,568 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 36 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:19,568 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 36 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:19,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:19,569 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2022-04-15 12:56:19,569 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 73 transitions. [2022-04-15 12:56:19,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:19,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:19,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 12:56:19,570 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 12:56:19,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:19,570 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2022-04-15 12:56:19,570 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 73 transitions. [2022-04-15 12:56:19,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:19,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:19,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:56:19,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:56:19,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-15 12:56:19,571 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 24 [2022-04-15 12:56:19,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:56:19,571 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-04-15 12:56:19,572 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:19,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 48 transitions. [2022-04-15 12:56:19,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:19,721 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-15 12:56:19,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 12:56:19,721 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:56:19,721 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:56:19,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 12:56:19,923 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-15 12:56:19,923 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:56:19,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:56:19,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1824672953, now seen corresponding path program 3 times [2022-04-15 12:56:19,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:19,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1619106263] [2022-04-15 12:56:20,048 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:56:20,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1698281449, now seen corresponding path program 1 times [2022-04-15 12:56:20,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:56:20,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562336805] [2022-04-15 12:56:20,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:20,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:56:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:20,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:56:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:20,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {6022#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6012#true} is VALID [2022-04-15 12:56:20,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {6012#true} assume true; {6012#true} is VALID [2022-04-15 12:56:20,152 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6012#true} {6012#true} #94#return; {6012#true} is VALID [2022-04-15 12:56:20,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {6012#true} call ULTIMATE.init(); {6022#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:56:20,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {6022#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6012#true} is VALID [2022-04-15 12:56:20,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {6012#true} assume true; {6012#true} is VALID [2022-04-15 12:56:20,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6012#true} {6012#true} #94#return; {6012#true} is VALID [2022-04-15 12:56:20,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {6012#true} call #t~ret17 := main(); {6012#true} is VALID [2022-04-15 12:56:20,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {6012#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6017#(= main_~y~0 0)} is VALID [2022-04-15 12:56:20,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {6017#(= main_~y~0 0)} [126] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_30| 0) (= |v_main_#t~post5_Out_30| 0) (< 0 (mod (+ v_main_~x~0_Out_30 1) 4294967296)) (<= v_main_~x~0_Out_30 v_main_~x~0_In_15) (= (+ v_main_~y~0_Out_30 v_main_~x~0_Out_30) (+ v_main_~x~0_In_15 v_main_~y~0_In_15))) (and (= v_main_~y~0_In_15 v_main_~y~0_Out_30) (= v_main_~x~0_In_15 v_main_~x~0_Out_30))) InVars {main_~x~0=v_main_~x~0_In_15, main_~y~0=v_main_~y~0_In_15} OutVars{main_~y~0=v_main_~y~0_Out_30, main_#t~post5=|v_main_#t~post5_Out_30|, main_~x~0=v_main_~x~0_Out_30, main_#t~post6=|v_main_#t~post6_Out_30|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6018#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} is VALID [2022-04-15 12:56:20,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {6018#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} [125] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6018#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} is VALID [2022-04-15 12:56:20,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {6018#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} ~z~0 := ~y~0; {6019#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= main_~z~0 0) (<= 0 main_~z~0)))} is VALID [2022-04-15 12:56:20,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {6019#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= main_~z~0 0) (<= 0 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; {6020#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:20,159 INFO L290 TraceCheckUtils]: 10: Hoare triple {6020#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6021#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:20,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {6021#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6021#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:20,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {6021#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6021#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:20,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {6021#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6021#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:20,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {6021#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6021#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:20,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {6021#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6020#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:20,162 INFO L290 TraceCheckUtils]: 16: Hoare triple {6020#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {6013#false} is VALID [2022-04-15 12:56:20,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {6013#false} assume !(~z~0 % 4294967296 > 0); {6013#false} is VALID [2022-04-15 12:56:20,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {6013#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; {6013#false} is VALID [2022-04-15 12:56:20,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {6013#false} assume !(~y~0 % 4294967296 > 0); {6013#false} is VALID [2022-04-15 12:56:20,162 INFO L272 TraceCheckUtils]: 20: Hoare triple {6013#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6013#false} is VALID [2022-04-15 12:56:20,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {6013#false} ~cond := #in~cond; {6013#false} is VALID [2022-04-15 12:56:20,162 INFO L290 TraceCheckUtils]: 22: Hoare triple {6013#false} assume 0 == ~cond; {6013#false} is VALID [2022-04-15 12:56:20,162 INFO L290 TraceCheckUtils]: 23: Hoare triple {6013#false} assume !false; {6013#false} is VALID [2022-04-15 12:56:20,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 12:56:20,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:56:20,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562336805] [2022-04-15 12:56:20,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562336805] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:56:20,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406911163] [2022-04-15 12:56:20,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:20,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:56:20,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:56:20,164 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:56:20,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 12:56:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:20,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 12:56:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:20,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:56:20,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {6012#true} call ULTIMATE.init(); {6012#true} is VALID [2022-04-15 12:56:20,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {6012#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6012#true} is VALID [2022-04-15 12:56:20,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {6012#true} assume true; {6012#true} is VALID [2022-04-15 12:56:20,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6012#true} {6012#true} #94#return; {6012#true} is VALID [2022-04-15 12:56:20,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {6012#true} call #t~ret17 := main(); {6012#true} is VALID [2022-04-15 12:56:20,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {6012#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6012#true} is VALID [2022-04-15 12:56:20,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {6012#true} [126] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_30| 0) (= |v_main_#t~post5_Out_30| 0) (< 0 (mod (+ v_main_~x~0_Out_30 1) 4294967296)) (<= v_main_~x~0_Out_30 v_main_~x~0_In_15) (= (+ v_main_~y~0_Out_30 v_main_~x~0_Out_30) (+ v_main_~x~0_In_15 v_main_~y~0_In_15))) (and (= v_main_~y~0_In_15 v_main_~y~0_Out_30) (= v_main_~x~0_In_15 v_main_~x~0_Out_30))) InVars {main_~x~0=v_main_~x~0_In_15, main_~y~0=v_main_~y~0_In_15} OutVars{main_~y~0=v_main_~y~0_Out_30, main_#t~post5=|v_main_#t~post5_Out_30|, main_~x~0=v_main_~x~0_Out_30, main_#t~post6=|v_main_#t~post6_Out_30|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6012#true} is VALID [2022-04-15 12:56:20,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {6012#true} [125] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6012#true} is VALID [2022-04-15 12:56:20,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {6012#true} ~z~0 := ~y~0; {6012#true} is VALID [2022-04-15 12:56:20,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {6012#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6053#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:56:20,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {6053#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6057#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:56:20,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {6057#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !(~z~0 % 4294967296 > 0); {6057#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:56:20,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {6057#(< 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; {6053#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:56:20,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {6053#(< 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; {6067#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:20,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {6067#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {6067#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:20,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {6067#(< 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; {6067#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:20,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {6067#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {6067#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:20,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {6067#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6013#false} is VALID [2022-04-15 12:56:20,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {6013#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; {6013#false} is VALID [2022-04-15 12:56:20,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {6013#false} assume !(~y~0 % 4294967296 > 0); {6013#false} is VALID [2022-04-15 12:56:20,298 INFO L272 TraceCheckUtils]: 20: Hoare triple {6013#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6013#false} is VALID [2022-04-15 12:56:20,298 INFO L290 TraceCheckUtils]: 21: Hoare triple {6013#false} ~cond := #in~cond; {6013#false} is VALID [2022-04-15 12:56:20,298 INFO L290 TraceCheckUtils]: 22: Hoare triple {6013#false} assume 0 == ~cond; {6013#false} is VALID [2022-04-15 12:56:20,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {6013#false} assume !false; {6013#false} is VALID [2022-04-15 12:56:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:56:20,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:56:20,361 INFO L290 TraceCheckUtils]: 23: Hoare triple {6013#false} assume !false; {6013#false} is VALID [2022-04-15 12:56:20,361 INFO L290 TraceCheckUtils]: 22: Hoare triple {6013#false} assume 0 == ~cond; {6013#false} is VALID [2022-04-15 12:56:20,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {6013#false} ~cond := #in~cond; {6013#false} is VALID [2022-04-15 12:56:20,361 INFO L272 TraceCheckUtils]: 20: Hoare triple {6013#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6013#false} is VALID [2022-04-15 12:56:20,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {6013#false} assume !(~y~0 % 4294967296 > 0); {6013#false} is VALID [2022-04-15 12:56:20,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {6013#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; {6013#false} is VALID [2022-04-15 12:56:20,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {6067#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6013#false} is VALID [2022-04-15 12:56:20,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {6067#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {6067#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:20,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {6067#(< 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; {6067#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:20,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {6067#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {6067#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:20,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {6053#(< 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; {6067#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:20,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {6057#(< 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; {6053#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:56:20,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {6057#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !(~z~0 % 4294967296 > 0); {6057#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:56:20,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {6053#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6057#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:56:20,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {6012#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6053#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:56:20,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {6012#true} ~z~0 := ~y~0; {6012#true} is VALID [2022-04-15 12:56:20,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {6012#true} [125] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6012#true} is VALID [2022-04-15 12:56:20,368 INFO L290 TraceCheckUtils]: 6: Hoare triple {6012#true} [126] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_30| 0) (= |v_main_#t~post5_Out_30| 0) (< 0 (mod (+ v_main_~x~0_Out_30 1) 4294967296)) (<= v_main_~x~0_Out_30 v_main_~x~0_In_15) (= (+ v_main_~y~0_Out_30 v_main_~x~0_Out_30) (+ v_main_~x~0_In_15 v_main_~y~0_In_15))) (and (= v_main_~y~0_In_15 v_main_~y~0_Out_30) (= v_main_~x~0_In_15 v_main_~x~0_Out_30))) InVars {main_~x~0=v_main_~x~0_In_15, main_~y~0=v_main_~y~0_In_15} OutVars{main_~y~0=v_main_~y~0_Out_30, main_#t~post5=|v_main_#t~post5_Out_30|, main_~x~0=v_main_~x~0_Out_30, main_#t~post6=|v_main_#t~post6_Out_30|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6012#true} is VALID [2022-04-15 12:56:20,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {6012#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6012#true} is VALID [2022-04-15 12:56:20,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {6012#true} call #t~ret17 := main(); {6012#true} is VALID [2022-04-15 12:56:20,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6012#true} {6012#true} #94#return; {6012#true} is VALID [2022-04-15 12:56:20,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {6012#true} assume true; {6012#true} is VALID [2022-04-15 12:56:20,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {6012#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6012#true} is VALID [2022-04-15 12:56:20,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {6012#true} call ULTIMATE.init(); {6012#true} is VALID [2022-04-15 12:56:20,368 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:56:20,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406911163] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:56:20,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:56:20,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 11 [2022-04-15 12:56:20,491 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:56:20,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1619106263] [2022-04-15 12:56:20,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1619106263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:56:20,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:56:20,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:56:20,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59975410] [2022-04-15 12:56:20,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:56:20,492 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 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-15 12:56:20,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:56:20,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:20,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:20,525 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:56:20,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:20,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:56:20,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:56:20,525 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:21,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:21,651 INFO L93 Difference]: Finished difference Result 70 states and 96 transitions. [2022-04-15 12:56:21,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:56:21,652 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 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-15 12:56:21,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:56:21,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:21,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-15 12:56:21,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:21,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-15 12:56:21,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 64 transitions. [2022-04-15 12:56:21,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:21,749 INFO L225 Difference]: With dead ends: 70 [2022-04-15 12:56:21,749 INFO L226 Difference]: Without dead ends: 62 [2022-04-15 12:56:21,749 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:56:21,750 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 51 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:56:21,750 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 44 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:56:21,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-15 12:56:21,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 37. [2022-04-15 12:56:21,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:56:21,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 37 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:21,895 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 37 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:21,895 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 37 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:21,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:21,896 INFO L93 Difference]: Finished difference Result 62 states and 87 transitions. [2022-04-15 12:56:21,896 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 87 transitions. [2022-04-15 12:56:21,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:21,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:21,896 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states. [2022-04-15 12:56:21,896 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states. [2022-04-15 12:56:21,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:21,897 INFO L93 Difference]: Finished difference Result 62 states and 87 transitions. [2022-04-15 12:56:21,897 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 87 transitions. [2022-04-15 12:56:21,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:21,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:21,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:56:21,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:56:21,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:21,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2022-04-15 12:56:21,898 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 25 [2022-04-15 12:56:21,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:56:21,898 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2022-04-15 12:56:21,898 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:21,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 49 transitions. [2022-04-15 12:56:22,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:22,101 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-04-15 12:56:22,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 12:56:22,101 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:56:22,101 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:56:22,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 12:56:22,302 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-15 12:56:22,302 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:56:22,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:56:22,302 INFO L85 PathProgramCache]: Analyzing trace with hash -529458535, now seen corresponding path program 2 times [2022-04-15 12:56:22,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:22,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [187458804] [2022-04-15 12:56:22,428 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:56:22,430 INFO L85 PathProgramCache]: Analyzing trace with hash 955029047, now seen corresponding path program 1 times [2022-04-15 12:56:22,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:56:22,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515379807] [2022-04-15 12:56:22,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:22,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:56:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:22,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:56:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:22,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {6540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6530#true} is VALID [2022-04-15 12:56:22,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {6530#true} assume true; {6530#true} is VALID [2022-04-15 12:56:22,554 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6530#true} {6530#true} #94#return; {6530#true} is VALID [2022-04-15 12:56:22,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {6530#true} call ULTIMATE.init(); {6540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:56:22,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {6540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6530#true} is VALID [2022-04-15 12:56:22,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {6530#true} assume true; {6530#true} is VALID [2022-04-15 12:56:22,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6530#true} {6530#true} #94#return; {6530#true} is VALID [2022-04-15 12:56:22,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {6530#true} call #t~ret17 := main(); {6530#true} is VALID [2022-04-15 12:56:22,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {6530#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6530#true} is VALID [2022-04-15 12:56:22,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {6530#true} [128] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_32| 0) (<= v_main_~x~0_Out_32 v_main_~x~0_In_16) (< 0 (mod (+ v_main_~x~0_Out_32 1) 4294967296)) (= |v_main_#t~post6_Out_32| 0) (= (+ v_main_~y~0_Out_32 v_main_~x~0_Out_32) (+ v_main_~x~0_In_16 v_main_~y~0_In_16))) (and (= v_main_~x~0_In_16 v_main_~x~0_Out_32) (= v_main_~y~0_In_16 v_main_~y~0_Out_32))) InVars {main_~x~0=v_main_~x~0_In_16, main_~y~0=v_main_~y~0_In_16} OutVars{main_~y~0=v_main_~y~0_Out_32, main_#t~post5=|v_main_#t~post5_Out_32|, main_~x~0=v_main_~x~0_Out_32, main_#t~post6=|v_main_#t~post6_Out_32|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6530#true} is VALID [2022-04-15 12:56:22,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {6530#true} [127] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6530#true} is VALID [2022-04-15 12:56:22,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {6530#true} ~z~0 := ~y~0; {6535#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:56:22,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {6535#(and (<= main_~y~0 main_~z~0) (<= 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; {6536#(and (or (not (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= main_~y~0 (+ main_~z~0 1))) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:56:22,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {6536#(and (or (not (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= main_~y~0 (+ main_~z~0 1))) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6537#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 4294967297 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-15 12:56:22,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {6537#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 4294967297 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~z~0))} assume !(~z~0 % 4294967296 > 0); {6537#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 4294967297 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-15 12:56:22,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {6537#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 4294967297 (* (- 1) main_~y~0)) 4294967296) 4294967296) 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; {6538#(<= (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:56:22,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {6538#(<= (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 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; {6539#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:56:22,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {6539#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {6539#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:56:22,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {6539#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6539#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:56:22,562 INFO L290 TraceCheckUtils]: 16: Hoare triple {6539#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6539#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:56:22,562 INFO L290 TraceCheckUtils]: 17: Hoare triple {6539#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {6539#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:56:22,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {6539#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {6531#false} is VALID [2022-04-15 12:56:22,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {6531#false} assume !(~y~0 % 4294967296 > 0); {6531#false} is VALID [2022-04-15 12:56:22,563 INFO L272 TraceCheckUtils]: 20: Hoare triple {6531#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6531#false} is VALID [2022-04-15 12:56:22,563 INFO L290 TraceCheckUtils]: 21: Hoare triple {6531#false} ~cond := #in~cond; {6531#false} is VALID [2022-04-15 12:56:22,563 INFO L290 TraceCheckUtils]: 22: Hoare triple {6531#false} assume 0 == ~cond; {6531#false} is VALID [2022-04-15 12:56:22,563 INFO L290 TraceCheckUtils]: 23: Hoare triple {6531#false} assume !false; {6531#false} is VALID [2022-04-15 12:56:22,564 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:56:22,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:56:22,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515379807] [2022-04-15 12:56:22,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515379807] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:56:22,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014797696] [2022-04-15 12:56:22,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:22,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:56:22,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:56:22,565 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:56:22,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 12:56:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:22,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 12:56:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:22,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:56:23,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {6530#true} call ULTIMATE.init(); {6530#true} is VALID [2022-04-15 12:56:23,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {6530#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6530#true} is VALID [2022-04-15 12:56:23,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {6530#true} assume true; {6530#true} is VALID [2022-04-15 12:56:23,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6530#true} {6530#true} #94#return; {6530#true} is VALID [2022-04-15 12:56:23,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {6530#true} call #t~ret17 := main(); {6530#true} is VALID [2022-04-15 12:56:23,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {6530#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6530#true} is VALID [2022-04-15 12:56:23,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {6530#true} [128] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_32| 0) (<= v_main_~x~0_Out_32 v_main_~x~0_In_16) (< 0 (mod (+ v_main_~x~0_Out_32 1) 4294967296)) (= |v_main_#t~post6_Out_32| 0) (= (+ v_main_~y~0_Out_32 v_main_~x~0_Out_32) (+ v_main_~x~0_In_16 v_main_~y~0_In_16))) (and (= v_main_~x~0_In_16 v_main_~x~0_Out_32) (= v_main_~y~0_In_16 v_main_~y~0_Out_32))) InVars {main_~x~0=v_main_~x~0_In_16, main_~y~0=v_main_~y~0_In_16} OutVars{main_~y~0=v_main_~y~0_Out_32, main_#t~post5=|v_main_#t~post5_Out_32|, main_~x~0=v_main_~x~0_Out_32, main_#t~post6=|v_main_#t~post6_Out_32|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6530#true} is VALID [2022-04-15 12:56:23,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {6530#true} [127] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6530#true} is VALID [2022-04-15 12:56:23,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {6530#true} ~z~0 := ~y~0; {6535#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:56:23,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {6535#(and (<= main_~y~0 main_~z~0) (<= 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; {6571#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 12:56:23,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {6571#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 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; {6571#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 12:56:23,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {6571#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {6571#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 12:56:23,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {6571#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 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; {6581#(< (div (+ 4294967294 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~y~0 4294967296) 1))} is VALID [2022-04-15 12:56:23,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {6581#(< (div (+ 4294967294 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~y~0 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; {6585#(< (div (+ (* (- 1) main_~y~0) 4294967293) (- 4294967296)) (+ (div (+ main_~y~0 1) 4294967296) 1))} is VALID [2022-04-15 12:56:23,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {6585#(< (div (+ (* (- 1) main_~y~0) 4294967293) (- 4294967296)) (+ (div (+ main_~y~0 1) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {6585#(< (div (+ (* (- 1) main_~y~0) 4294967293) (- 4294967296)) (+ (div (+ main_~y~0 1) 4294967296) 1))} is VALID [2022-04-15 12:56:23,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {6585#(< (div (+ (* (- 1) main_~y~0) 4294967293) (- 4294967296)) (+ (div (+ main_~y~0 1) 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; {6581#(< (div (+ 4294967294 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~y~0 4294967296) 1))} is VALID [2022-04-15 12:56:23,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {6581#(< (div (+ 4294967294 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~y~0 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; {6571#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 12:56:23,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {6571#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} assume !(~x~0 % 4294967296 > 0); {6571#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 12:56:23,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {6571#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {6571#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 12:56:23,135 INFO L290 TraceCheckUtils]: 19: Hoare triple {6571#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {6531#false} is VALID [2022-04-15 12:56:23,135 INFO L272 TraceCheckUtils]: 20: Hoare triple {6531#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6531#false} is VALID [2022-04-15 12:56:23,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {6531#false} ~cond := #in~cond; {6531#false} is VALID [2022-04-15 12:56:23,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {6531#false} assume 0 == ~cond; {6531#false} is VALID [2022-04-15 12:56:23,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {6531#false} assume !false; {6531#false} is VALID [2022-04-15 12:56:23,135 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:56:23,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:56:23,520 INFO L290 TraceCheckUtils]: 23: Hoare triple {6531#false} assume !false; {6531#false} is VALID [2022-04-15 12:56:23,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {6531#false} assume 0 == ~cond; {6531#false} is VALID [2022-04-15 12:56:23,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {6531#false} ~cond := #in~cond; {6531#false} is VALID [2022-04-15 12:56:23,520 INFO L272 TraceCheckUtils]: 20: Hoare triple {6531#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6531#false} is VALID [2022-04-15 12:56:23,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {6571#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {6531#false} is VALID [2022-04-15 12:56:23,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {6571#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {6571#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 12:56:23,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {6571#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} assume !(~x~0 % 4294967296 > 0); {6571#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 12:56:23,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {6581#(< (div (+ 4294967294 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~y~0 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; {6571#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 12:56:23,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {6585#(< (div (+ (* (- 1) main_~y~0) 4294967293) (- 4294967296)) (+ (div (+ main_~y~0 1) 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; {6581#(< (div (+ 4294967294 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~y~0 4294967296) 1))} is VALID [2022-04-15 12:56:23,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {6585#(< (div (+ (* (- 1) main_~y~0) 4294967293) (- 4294967296)) (+ (div (+ main_~y~0 1) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {6585#(< (div (+ (* (- 1) main_~y~0) 4294967293) (- 4294967296)) (+ (div (+ main_~y~0 1) 4294967296) 1))} is VALID [2022-04-15 12:56:23,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {6581#(< (div (+ 4294967294 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~y~0 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; {6585#(< (div (+ (* (- 1) main_~y~0) 4294967293) (- 4294967296)) (+ (div (+ main_~y~0 1) 4294967296) 1))} is VALID [2022-04-15 12:56:23,528 INFO L290 TraceCheckUtils]: 12: Hoare triple {6571#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 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; {6581#(< (div (+ 4294967294 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~y~0 4294967296) 1))} is VALID [2022-04-15 12:56:23,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {6571#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {6571#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 12:56:23,529 INFO L290 TraceCheckUtils]: 10: Hoare triple {6571#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 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; {6571#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 12:56:23,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {6658#(or (< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1)) (<= (mod main_~z~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6571#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 12:56:23,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {6530#true} ~z~0 := ~y~0; {6658#(or (< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-15 12:56:23,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {6530#true} [127] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6530#true} is VALID [2022-04-15 12:56:23,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {6530#true} [128] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_32| 0) (<= v_main_~x~0_Out_32 v_main_~x~0_In_16) (< 0 (mod (+ v_main_~x~0_Out_32 1) 4294967296)) (= |v_main_#t~post6_Out_32| 0) (= (+ v_main_~y~0_Out_32 v_main_~x~0_Out_32) (+ v_main_~x~0_In_16 v_main_~y~0_In_16))) (and (= v_main_~x~0_In_16 v_main_~x~0_Out_32) (= v_main_~y~0_In_16 v_main_~y~0_Out_32))) InVars {main_~x~0=v_main_~x~0_In_16, main_~y~0=v_main_~y~0_In_16} OutVars{main_~y~0=v_main_~y~0_Out_32, main_#t~post5=|v_main_#t~post5_Out_32|, main_~x~0=v_main_~x~0_Out_32, main_#t~post6=|v_main_#t~post6_Out_32|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6530#true} is VALID [2022-04-15 12:56:23,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {6530#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6530#true} is VALID [2022-04-15 12:56:23,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {6530#true} call #t~ret17 := main(); {6530#true} is VALID [2022-04-15 12:56:23,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6530#true} {6530#true} #94#return; {6530#true} is VALID [2022-04-15 12:56:23,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {6530#true} assume true; {6530#true} is VALID [2022-04-15 12:56:23,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {6530#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6530#true} is VALID [2022-04-15 12:56:23,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {6530#true} call ULTIMATE.init(); {6530#true} is VALID [2022-04-15 12:56:23,531 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:56:23,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014797696] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:56:23,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:56:23,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2022-04-15 12:56:23,588 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:56:23,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [187458804] [2022-04-15 12:56:23,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [187458804] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:56:23,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:56:23,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:56:23,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461698242] [2022-04-15 12:56:23,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:56:23,589 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 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-15 12:56:23,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:56:23,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:23,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:23,614 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:56:23,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:23,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:56:23,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:56:23,615 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:25,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:25,110 INFO L93 Difference]: Finished difference Result 75 states and 106 transitions. [2022-04-15 12:56:25,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 12:56:25,111 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 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-15 12:56:25,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:56:25,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:25,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 74 transitions. [2022-04-15 12:56:25,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:25,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 74 transitions. [2022-04-15 12:56:25,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 74 transitions. [2022-04-15 12:56:25,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:25,225 INFO L225 Difference]: With dead ends: 75 [2022-04-15 12:56:25,225 INFO L226 Difference]: Without dead ends: 67 [2022-04-15 12:56:25,225 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2022-04-15 12:56:25,226 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 37 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:56:25,226 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 53 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:56:25,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-15 12:56:25,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2022-04-15 12:56:25,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:56:25,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 50 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:25,446 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 50 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:25,446 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 50 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:25,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:25,447 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2022-04-15 12:56:25,447 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 92 transitions. [2022-04-15 12:56:25,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:25,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:25,448 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 3 states have call successors, (3), 3 states 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-15 12:56:25,448 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 3 states have call successors, (3), 3 states 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-15 12:56:25,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:25,449 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2022-04-15 12:56:25,449 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 92 transitions. [2022-04-15 12:56:25,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:25,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:25,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:56:25,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:56:25,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:25,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-15 12:56:25,450 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 25 [2022-04-15 12:56:25,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:56:25,450 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-15 12:56:25,450 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:25,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 67 transitions. [2022-04-15 12:56:25,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:25,740 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-15 12:56:25,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 12:56:25,740 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:56:25,740 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:56:25,756 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-15 12:56:25,951 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 12:56:25,951 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:56:25,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:56:25,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1702758372, now seen corresponding path program 3 times [2022-04-15 12:56:25,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:25,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1013457705] [2022-04-15 12:56:26,089 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:56:26,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1089112006, now seen corresponding path program 1 times [2022-04-15 12:56:26,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:56:26,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031977179] [2022-04-15 12:56:26,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:26,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:56:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:26,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:56:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:26,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {7117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7106#true} is VALID [2022-04-15 12:56:26,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {7106#true} assume true; {7106#true} is VALID [2022-04-15 12:56:26,189 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7106#true} {7106#true} #94#return; {7106#true} is VALID [2022-04-15 12:56:26,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {7106#true} call ULTIMATE.init(); {7117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:56:26,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {7117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7106#true} is VALID [2022-04-15 12:56:26,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {7106#true} assume true; {7106#true} is VALID [2022-04-15 12:56:26,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7106#true} {7106#true} #94#return; {7106#true} is VALID [2022-04-15 12:56:26,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {7106#true} call #t~ret17 := main(); {7106#true} is VALID [2022-04-15 12:56:26,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {7106#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7106#true} is VALID [2022-04-15 12:56:26,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {7106#true} [130] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_34| 0) (< 0 (mod (+ v_main_~x~0_Out_34 1) 4294967296)) (<= v_main_~x~0_Out_34 v_main_~x~0_In_17) (= (+ v_main_~y~0_Out_34 v_main_~x~0_Out_34) (+ v_main_~x~0_In_17 v_main_~y~0_In_17)) (= |v_main_#t~post5_Out_34| 0)) (and (= v_main_~x~0_In_17 v_main_~x~0_Out_34) (= v_main_~y~0_In_17 v_main_~y~0_Out_34))) InVars {main_~x~0=v_main_~x~0_In_17, main_~y~0=v_main_~y~0_In_17} OutVars{main_~y~0=v_main_~y~0_Out_34, main_#t~post5=|v_main_#t~post5_Out_34|, main_~x~0=v_main_~x~0_Out_34, main_#t~post6=|v_main_#t~post6_Out_34|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7106#true} is VALID [2022-04-15 12:56:26,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {7106#true} [129] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7106#true} is VALID [2022-04-15 12:56:26,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {7106#true} ~z~0 := ~y~0; {7111#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:56:26,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {7111#(and (<= main_~y~0 main_~z~0) (<= 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; {7112#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:56:26,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {7112#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7113#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:56:26,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {7113#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {7114#(and (<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 2 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:56:26,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {7114#(and (<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 2 (* (div 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; {7115#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:26,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {7115#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 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; {7116#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:26,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {7116#(<= main_~y~0 (* (div main_~y~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; {7107#false} is VALID [2022-04-15 12:56:26,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {7107#false} assume !(~y~0 % 4294967296 > 0); {7107#false} is VALID [2022-04-15 12:56:26,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {7107#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; {7107#false} is VALID [2022-04-15 12:56:26,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {7107#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; {7107#false} is VALID [2022-04-15 12:56:26,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {7107#false} assume !(~x~0 % 4294967296 > 0); {7107#false} is VALID [2022-04-15 12:56:26,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {7107#false} assume !(~z~0 % 4294967296 > 0); {7107#false} is VALID [2022-04-15 12:56:26,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {7107#false} assume !(~y~0 % 4294967296 > 0); {7107#false} is VALID [2022-04-15 12:56:26,198 INFO L272 TraceCheckUtils]: 21: Hoare triple {7107#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7107#false} is VALID [2022-04-15 12:56:26,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {7107#false} ~cond := #in~cond; {7107#false} is VALID [2022-04-15 12:56:26,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {7107#false} assume 0 == ~cond; {7107#false} is VALID [2022-04-15 12:56:26,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {7107#false} assume !false; {7107#false} is VALID [2022-04-15 12:56:26,198 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:56:26,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:56:26,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031977179] [2022-04-15 12:56:26,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031977179] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:56:26,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74685690] [2022-04-15 12:56:26,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:26,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:56:26,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:56:26,200 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:56:26,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 12:56:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:26,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:56:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:26,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:56:26,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {7106#true} call ULTIMATE.init(); {7106#true} is VALID [2022-04-15 12:56:26,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {7106#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7106#true} is VALID [2022-04-15 12:56:26,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {7106#true} assume true; {7106#true} is VALID [2022-04-15 12:56:26,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7106#true} {7106#true} #94#return; {7106#true} is VALID [2022-04-15 12:56:26,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {7106#true} call #t~ret17 := main(); {7106#true} is VALID [2022-04-15 12:56:26,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {7106#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7106#true} is VALID [2022-04-15 12:56:26,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {7106#true} [130] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_34| 0) (< 0 (mod (+ v_main_~x~0_Out_34 1) 4294967296)) (<= v_main_~x~0_Out_34 v_main_~x~0_In_17) (= (+ v_main_~y~0_Out_34 v_main_~x~0_Out_34) (+ v_main_~x~0_In_17 v_main_~y~0_In_17)) (= |v_main_#t~post5_Out_34| 0)) (and (= v_main_~x~0_In_17 v_main_~x~0_Out_34) (= v_main_~y~0_In_17 v_main_~y~0_Out_34))) InVars {main_~x~0=v_main_~x~0_In_17, main_~y~0=v_main_~y~0_In_17} OutVars{main_~y~0=v_main_~y~0_Out_34, main_#t~post5=|v_main_#t~post5_Out_34|, main_~x~0=v_main_~x~0_Out_34, main_#t~post6=|v_main_#t~post6_Out_34|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7106#true} is VALID [2022-04-15 12:56:26,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {7106#true} [129] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7106#true} is VALID [2022-04-15 12:56:26,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {7106#true} ~z~0 := ~y~0; {7111#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:56:26,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {7111#(and (<= main_~y~0 main_~z~0) (<= 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; {7112#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:56:26,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {7112#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7113#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:56:26,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {7113#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {7154#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296))} is VALID [2022-04-15 12:56:26,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {7154#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) 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; {7115#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:26,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {7115#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 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; {7116#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:26,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {7116#(<= main_~y~0 (* (div main_~y~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; {7107#false} is VALID [2022-04-15 12:56:26,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {7107#false} assume !(~y~0 % 4294967296 > 0); {7107#false} is VALID [2022-04-15 12:56:26,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {7107#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; {7107#false} is VALID [2022-04-15 12:56:26,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {7107#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; {7107#false} is VALID [2022-04-15 12:56:26,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {7107#false} assume !(~x~0 % 4294967296 > 0); {7107#false} is VALID [2022-04-15 12:56:26,568 INFO L290 TraceCheckUtils]: 19: Hoare triple {7107#false} assume !(~z~0 % 4294967296 > 0); {7107#false} is VALID [2022-04-15 12:56:26,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {7107#false} assume !(~y~0 % 4294967296 > 0); {7107#false} is VALID [2022-04-15 12:56:26,569 INFO L272 TraceCheckUtils]: 21: Hoare triple {7107#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7107#false} is VALID [2022-04-15 12:56:26,569 INFO L290 TraceCheckUtils]: 22: Hoare triple {7107#false} ~cond := #in~cond; {7107#false} is VALID [2022-04-15 12:56:26,569 INFO L290 TraceCheckUtils]: 23: Hoare triple {7107#false} assume 0 == ~cond; {7107#false} is VALID [2022-04-15 12:56:26,569 INFO L290 TraceCheckUtils]: 24: Hoare triple {7107#false} assume !false; {7107#false} is VALID [2022-04-15 12:56:26,569 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:56:26,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:56:27,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {7107#false} assume !false; {7107#false} is VALID [2022-04-15 12:56:27,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {7107#false} assume 0 == ~cond; {7107#false} is VALID [2022-04-15 12:56:27,074 INFO L290 TraceCheckUtils]: 22: Hoare triple {7107#false} ~cond := #in~cond; {7107#false} is VALID [2022-04-15 12:56:27,074 INFO L272 TraceCheckUtils]: 21: Hoare triple {7107#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7107#false} is VALID [2022-04-15 12:56:27,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {7107#false} assume !(~y~0 % 4294967296 > 0); {7107#false} is VALID [2022-04-15 12:56:27,074 INFO L290 TraceCheckUtils]: 19: Hoare triple {7107#false} assume !(~z~0 % 4294967296 > 0); {7107#false} is VALID [2022-04-15 12:56:27,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {7107#false} assume !(~x~0 % 4294967296 > 0); {7107#false} is VALID [2022-04-15 12:56:27,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {7107#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; {7107#false} is VALID [2022-04-15 12:56:27,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {7107#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; {7107#false} is VALID [2022-04-15 12:56:27,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {7107#false} assume !(~y~0 % 4294967296 > 0); {7107#false} is VALID [2022-04-15 12:56:27,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {7116#(<= main_~y~0 (* (div main_~y~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; {7107#false} is VALID [2022-04-15 12:56:27,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {7115#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 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; {7116#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:27,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {7154#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) 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; {7115#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:27,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {7233#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7154#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296))} is VALID [2022-04-15 12:56:27,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {7237#(or (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7233#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)))} is VALID [2022-04-15 12:56:27,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {7241#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7237#(or (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:56:27,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {7106#true} ~z~0 := ~y~0; {7241#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)))} is VALID [2022-04-15 12:56:27,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {7106#true} [129] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7106#true} is VALID [2022-04-15 12:56:27,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {7106#true} [130] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_34| 0) (< 0 (mod (+ v_main_~x~0_Out_34 1) 4294967296)) (<= v_main_~x~0_Out_34 v_main_~x~0_In_17) (= (+ v_main_~y~0_Out_34 v_main_~x~0_Out_34) (+ v_main_~x~0_In_17 v_main_~y~0_In_17)) (= |v_main_#t~post5_Out_34| 0)) (and (= v_main_~x~0_In_17 v_main_~x~0_Out_34) (= v_main_~y~0_In_17 v_main_~y~0_Out_34))) InVars {main_~x~0=v_main_~x~0_In_17, main_~y~0=v_main_~y~0_In_17} OutVars{main_~y~0=v_main_~y~0_Out_34, main_#t~post5=|v_main_#t~post5_Out_34|, main_~x~0=v_main_~x~0_Out_34, main_#t~post6=|v_main_#t~post6_Out_34|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7106#true} is VALID [2022-04-15 12:56:27,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {7106#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7106#true} is VALID [2022-04-15 12:56:27,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {7106#true} call #t~ret17 := main(); {7106#true} is VALID [2022-04-15 12:56:27,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7106#true} {7106#true} #94#return; {7106#true} is VALID [2022-04-15 12:56:27,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {7106#true} assume true; {7106#true} is VALID [2022-04-15 12:56:27,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {7106#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7106#true} is VALID [2022-04-15 12:56:27,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {7106#true} call ULTIMATE.init(); {7106#true} is VALID [2022-04-15 12:56:27,086 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:56:27,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74685690] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:56:27,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:56:27,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2022-04-15 12:56:27,148 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:56:27,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1013457705] [2022-04-15 12:56:27,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1013457705] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:56:27,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:56:27,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:56:27,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398889597] [2022-04-15 12:56:27,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:56:27,149 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 12:56:27,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:56:27,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:27,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:27,174 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:56:27,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:27,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:56:27,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:56:27,174 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:28,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:28,554 INFO L93 Difference]: Finished difference Result 78 states and 107 transitions. [2022-04-15 12:56:28,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 12:56:28,554 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 12:56:28,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:56:28,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:28,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 77 transitions. [2022-04-15 12:56:28,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:28,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 77 transitions. [2022-04-15 12:56:28,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 77 transitions. [2022-04-15 12:56:28,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:28,698 INFO L225 Difference]: With dead ends: 78 [2022-04-15 12:56:28,698 INFO L226 Difference]: Without dead ends: 67 [2022-04-15 12:56:28,699 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2022-04-15 12:56:28,699 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 54 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:56:28,699 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 53 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:56:28,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-15 12:56:28,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2022-04-15 12:56:28,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:56:28,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 53 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:28,920 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 53 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:28,920 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 53 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:28,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:28,921 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2022-04-15 12:56:28,921 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 92 transitions. [2022-04-15 12:56:28,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:28,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:28,921 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 3 states have call successors, (3), 3 states 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-15 12:56:28,921 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 3 states have call successors, (3), 3 states 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-15 12:56:28,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:28,922 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2022-04-15 12:56:28,922 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 92 transitions. [2022-04-15 12:56:28,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:28,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:28,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:56:28,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:56:28,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:28,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 70 transitions. [2022-04-15 12:56:28,923 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 70 transitions. Word has length 26 [2022-04-15 12:56:28,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:56:28,923 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 70 transitions. [2022-04-15 12:56:28,923 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:28,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 70 transitions. [2022-04-15 12:56:29,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:29,493 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2022-04-15 12:56:29,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 12:56:29,494 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:56:29,494 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:56:29,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 12:56:29,694 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:56:29,694 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:56:29,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:56:29,695 INFO L85 PathProgramCache]: Analyzing trace with hash -926563420, now seen corresponding path program 4 times [2022-04-15 12:56:29,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:29,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [425208394] [2022-04-15 12:56:29,825 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:56:29,826 INFO L85 PathProgramCache]: Analyzing trace with hash -928330938, now seen corresponding path program 1 times [2022-04-15 12:56:29,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:56:29,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913120078] [2022-04-15 12:56:29,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:29,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:56:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:29,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:56:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:29,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {7710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7697#true} is VALID [2022-04-15 12:56:29,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {7697#true} assume true; {7697#true} is VALID [2022-04-15 12:56:29,976 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7697#true} {7697#true} #94#return; {7697#true} is VALID [2022-04-15 12:56:29,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {7697#true} call ULTIMATE.init(); {7710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:56:29,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {7710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7697#true} is VALID [2022-04-15 12:56:29,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {7697#true} assume true; {7697#true} is VALID [2022-04-15 12:56:29,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7697#true} {7697#true} #94#return; {7697#true} is VALID [2022-04-15 12:56:29,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {7697#true} call #t~ret17 := main(); {7697#true} is VALID [2022-04-15 12:56:29,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {7697#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7697#true} is VALID [2022-04-15 12:56:29,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {7697#true} [132] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_36| 0) (= (+ v_main_~y~0_Out_36 v_main_~x~0_Out_36) (+ v_main_~x~0_In_18 v_main_~y~0_In_18)) (<= v_main_~x~0_Out_36 v_main_~x~0_In_18) (< 0 (mod (+ v_main_~x~0_Out_36 1) 4294967296)) (= |v_main_#t~post6_Out_36| 0)) (and (= v_main_~x~0_In_18 v_main_~x~0_Out_36) (= v_main_~y~0_In_18 v_main_~y~0_Out_36))) InVars {main_~x~0=v_main_~x~0_In_18, main_~y~0=v_main_~y~0_In_18} OutVars{main_~y~0=v_main_~y~0_Out_36, main_#t~post5=|v_main_#t~post5_Out_36|, main_~x~0=v_main_~x~0_Out_36, main_#t~post6=|v_main_#t~post6_Out_36|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7697#true} is VALID [2022-04-15 12:56:29,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {7697#true} [131] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7697#true} is VALID [2022-04-15 12:56:29,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {7697#true} ~z~0 := ~y~0; {7702#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:56:29,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {7702#(and (<= main_~y~0 main_~z~0) (<= 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; {7703#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:56:29,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {7703#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7704#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:56:29,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {7704#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) 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; {7705#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:56:29,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {7705#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7706#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:56:29,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {7706#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {7706#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:56:29,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {7706#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7707#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:56:29,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {7707#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7708#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:56:29,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {7708#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {7709#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:56:29,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {7709#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {7698#false} is VALID [2022-04-15 12:56:29,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {7698#false} assume !(~x~0 % 4294967296 > 0); {7698#false} is VALID [2022-04-15 12:56:29,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {7698#false} assume !(~z~0 % 4294967296 > 0); {7698#false} is VALID [2022-04-15 12:56:29,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {7698#false} assume !(~y~0 % 4294967296 > 0); {7698#false} is VALID [2022-04-15 12:56:29,988 INFO L272 TraceCheckUtils]: 21: Hoare triple {7698#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7698#false} is VALID [2022-04-15 12:56:29,988 INFO L290 TraceCheckUtils]: 22: Hoare triple {7698#false} ~cond := #in~cond; {7698#false} is VALID [2022-04-15 12:56:29,988 INFO L290 TraceCheckUtils]: 23: Hoare triple {7698#false} assume 0 == ~cond; {7698#false} is VALID [2022-04-15 12:56:29,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {7698#false} assume !false; {7698#false} is VALID [2022-04-15 12:56:29,988 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:56:29,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:56:29,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913120078] [2022-04-15 12:56:29,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913120078] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:56:29,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098819050] [2022-04-15 12:56:29,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:29,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:56:29,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:56:29,989 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:56:29,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 12:56:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:30,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 12:56:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:30,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:56:30,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {7697#true} call ULTIMATE.init(); {7697#true} is VALID [2022-04-15 12:56:30,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {7697#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7697#true} is VALID [2022-04-15 12:56:30,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {7697#true} assume true; {7697#true} is VALID [2022-04-15 12:56:30,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7697#true} {7697#true} #94#return; {7697#true} is VALID [2022-04-15 12:56:30,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {7697#true} call #t~ret17 := main(); {7697#true} is VALID [2022-04-15 12:56:30,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {7697#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7697#true} is VALID [2022-04-15 12:56:30,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {7697#true} [132] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_36| 0) (= (+ v_main_~y~0_Out_36 v_main_~x~0_Out_36) (+ v_main_~x~0_In_18 v_main_~y~0_In_18)) (<= v_main_~x~0_Out_36 v_main_~x~0_In_18) (< 0 (mod (+ v_main_~x~0_Out_36 1) 4294967296)) (= |v_main_#t~post6_Out_36| 0)) (and (= v_main_~x~0_In_18 v_main_~x~0_Out_36) (= v_main_~y~0_In_18 v_main_~y~0_Out_36))) InVars {main_~x~0=v_main_~x~0_In_18, main_~y~0=v_main_~y~0_In_18} OutVars{main_~y~0=v_main_~y~0_Out_36, main_#t~post5=|v_main_#t~post5_Out_36|, main_~x~0=v_main_~x~0_Out_36, main_#t~post6=|v_main_#t~post6_Out_36|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7697#true} is VALID [2022-04-15 12:56:30,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {7697#true} [131] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7697#true} is VALID [2022-04-15 12:56:30,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {7697#true} ~z~0 := ~y~0; {7702#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:56:30,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {7702#(and (<= main_~y~0 main_~z~0) (<= 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; {7703#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:56:30,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {7703#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7744#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:56:30,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {7744#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) 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; {7748#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:56:30,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {7748#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7752#(and (<= main_~y~0 (+ main_~z~0 4)) (< 0 (mod (+ main_~z~0 3) 4294967296)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:56:30,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {7752#(and (<= main_~y~0 (+ main_~z~0 4)) (< 0 (mod (+ main_~z~0 3) 4294967296)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {7752#(and (<= main_~y~0 (+ main_~z~0 4)) (< 0 (mod (+ main_~z~0 3) 4294967296)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:56:30,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {7752#(and (<= main_~y~0 (+ main_~z~0 4)) (< 0 (mod (+ main_~z~0 3) 4294967296)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7759#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:56:30,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {7759#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7763#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:56:30,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {7763#(< 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; {7767#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:30,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {7767#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {7767#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:30,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {7767#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {7767#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:30,271 INFO L290 TraceCheckUtils]: 19: Hoare triple {7767#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7698#false} is VALID [2022-04-15 12:56:30,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {7698#false} assume !(~y~0 % 4294967296 > 0); {7698#false} is VALID [2022-04-15 12:56:30,271 INFO L272 TraceCheckUtils]: 21: Hoare triple {7698#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7698#false} is VALID [2022-04-15 12:56:30,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {7698#false} ~cond := #in~cond; {7698#false} is VALID [2022-04-15 12:56:30,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {7698#false} assume 0 == ~cond; {7698#false} is VALID [2022-04-15 12:56:30,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {7698#false} assume !false; {7698#false} is VALID [2022-04-15 12:56:30,272 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:56:30,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:56:30,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {7698#false} assume !false; {7698#false} is VALID [2022-04-15 12:56:30,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {7698#false} assume 0 == ~cond; {7698#false} is VALID [2022-04-15 12:56:30,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {7698#false} ~cond := #in~cond; {7698#false} is VALID [2022-04-15 12:56:30,392 INFO L272 TraceCheckUtils]: 21: Hoare triple {7698#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7698#false} is VALID [2022-04-15 12:56:30,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {7698#false} assume !(~y~0 % 4294967296 > 0); {7698#false} is VALID [2022-04-15 12:56:30,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {7767#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7698#false} is VALID [2022-04-15 12:56:30,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {7767#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {7767#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:30,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {7767#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {7767#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:30,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {7763#(< 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; {7767#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:30,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {7819#(< 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; {7763#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:56:30,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {7823#(< 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; {7819#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:56:30,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {7823#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !(~z~0 % 4294967296 > 0); {7823#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:56:30,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {7819#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7823#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:56:30,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {7763#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7819#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:56:30,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {7697#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7763#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:56:30,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {7697#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7697#true} is VALID [2022-04-15 12:56:30,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {7697#true} ~z~0 := ~y~0; {7697#true} is VALID [2022-04-15 12:56:30,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {7697#true} [131] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7697#true} is VALID [2022-04-15 12:56:30,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {7697#true} [132] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_36| 0) (= (+ v_main_~y~0_Out_36 v_main_~x~0_Out_36) (+ v_main_~x~0_In_18 v_main_~y~0_In_18)) (<= v_main_~x~0_Out_36 v_main_~x~0_In_18) (< 0 (mod (+ v_main_~x~0_Out_36 1) 4294967296)) (= |v_main_#t~post6_Out_36| 0)) (and (= v_main_~x~0_In_18 v_main_~x~0_Out_36) (= v_main_~y~0_In_18 v_main_~y~0_Out_36))) InVars {main_~x~0=v_main_~x~0_In_18, main_~y~0=v_main_~y~0_In_18} OutVars{main_~y~0=v_main_~y~0_Out_36, main_#t~post5=|v_main_#t~post5_Out_36|, main_~x~0=v_main_~x~0_Out_36, main_#t~post6=|v_main_#t~post6_Out_36|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7697#true} is VALID [2022-04-15 12:56:30,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {7697#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7697#true} is VALID [2022-04-15 12:56:30,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {7697#true} call #t~ret17 := main(); {7697#true} is VALID [2022-04-15 12:56:30,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7697#true} {7697#true} #94#return; {7697#true} is VALID [2022-04-15 12:56:30,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {7697#true} assume true; {7697#true} is VALID [2022-04-15 12:56:30,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {7697#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7697#true} is VALID [2022-04-15 12:56:30,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {7697#true} call ULTIMATE.init(); {7697#true} is VALID [2022-04-15 12:56:30,403 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:56:30,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098819050] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:56:30,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:56:30,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 6] total 19 [2022-04-15 12:56:30,485 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:56:30,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [425208394] [2022-04-15 12:56:30,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [425208394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:56:30,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:56:30,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 12:56:30,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625605843] [2022-04-15 12:56:30,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:56:30,486 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 12:56:30,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:56:30,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:30,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:30,513 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 12:56:30,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:30,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 12:56:30,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:56:30,513 INFO L87 Difference]: Start difference. First operand 53 states and 70 transitions. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:34,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:34,010 INFO L93 Difference]: Finished difference Result 121 states and 176 transitions. [2022-04-15 12:56:34,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 12:56:34,010 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 12:56:34,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:56:34,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:34,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 130 transitions. [2022-04-15 12:56:34,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:34,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 130 transitions. [2022-04-15 12:56:34,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 130 transitions. [2022-04-15 12:56:34,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:34,290 INFO L225 Difference]: With dead ends: 121 [2022-04-15 12:56:34,290 INFO L226 Difference]: Without dead ends: 90 [2022-04-15 12:56:34,291 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=443, Invalid=2749, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 12:56:34,291 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 113 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:56:34,291 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 62 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 12:56:34,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-15 12:56:34,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 63. [2022-04-15 12:56:34,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:56:34,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 63 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 58 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:34,616 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 63 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 58 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:34,616 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 63 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 58 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:34,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:34,617 INFO L93 Difference]: Finished difference Result 90 states and 127 transitions. [2022-04-15 12:56:34,617 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2022-04-15 12:56:34,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:34,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:34,618 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 58 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 90 states. [2022-04-15 12:56:34,618 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 58 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 90 states. [2022-04-15 12:56:34,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:34,619 INFO L93 Difference]: Finished difference Result 90 states and 127 transitions. [2022-04-15 12:56:34,619 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2022-04-15 12:56:34,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:34,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:34,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:56:34,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:56:34,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 58 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:34,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 84 transitions. [2022-04-15 12:56:34,620 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 84 transitions. Word has length 26 [2022-04-15 12:56:34,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:56:34,620 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 84 transitions. [2022-04-15 12:56:34,620 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:34,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 84 transitions. [2022-04-15 12:56:35,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:35,277 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 84 transitions. [2022-04-15 12:56:35,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 12:56:35,277 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:56:35,277 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:56:35,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 12:56:35,477 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:56:35,478 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:56:35,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:56:35,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1041168377, now seen corresponding path program 1 times [2022-04-15 12:56:35,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:35,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1012675315] [2022-04-15 12:56:35,598 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:56:35,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1520216873, now seen corresponding path program 1 times [2022-04-15 12:56:35,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:56:35,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586395414] [2022-04-15 12:56:35,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:35,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:56:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:35,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:56:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:35,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {8503#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8493#true} is VALID [2022-04-15 12:56:35,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {8493#true} assume true; {8493#true} is VALID [2022-04-15 12:56:35,703 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8493#true} {8493#true} #94#return; {8493#true} is VALID [2022-04-15 12:56:35,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {8493#true} call ULTIMATE.init(); {8503#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:56:35,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {8503#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8493#true} is VALID [2022-04-15 12:56:35,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {8493#true} assume true; {8493#true} is VALID [2022-04-15 12:56:35,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8493#true} {8493#true} #94#return; {8493#true} is VALID [2022-04-15 12:56:35,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {8493#true} call #t~ret17 := main(); {8493#true} is VALID [2022-04-15 12:56:35,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {8493#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8493#true} is VALID [2022-04-15 12:56:35,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {8493#true} [134] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_19 v_main_~x~0_Out_38) (= v_main_~y~0_In_19 v_main_~y~0_Out_38)) (and (= |v_main_#t~post5_Out_38| 0) (< 0 (mod (+ v_main_~x~0_Out_38 1) 4294967296)) (= |v_main_#t~post6_Out_38| 0) (= (+ v_main_~x~0_In_19 v_main_~y~0_In_19) (+ v_main_~y~0_Out_38 v_main_~x~0_Out_38)) (<= v_main_~x~0_Out_38 v_main_~x~0_In_19))) InVars {main_~x~0=v_main_~x~0_In_19, main_~y~0=v_main_~y~0_In_19} OutVars{main_~y~0=v_main_~y~0_Out_38, main_#t~post5=|v_main_#t~post5_Out_38|, main_~x~0=v_main_~x~0_Out_38, main_#t~post6=|v_main_#t~post6_Out_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8493#true} is VALID [2022-04-15 12:56:35,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {8493#true} [133] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8493#true} is VALID [2022-04-15 12:56:35,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {8493#true} ~z~0 := ~y~0; {8498#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:56:35,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {8498#(= 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; {8499#(and (= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0) (<= main_~y~0 (+ 4294967295 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:56:35,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {8499#(and (= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0) (<= main_~y~0 (+ 4294967295 (* (div 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; {8500#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:35,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {8500#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8500#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:35,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {8500#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~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; {8501#(<= main_~y~0 (+ 4294967294 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 12:56:35,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {8501#(<= main_~y~0 (+ 4294967294 (* 4294967296 (div (+ (- 1) 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; {8502#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:56:35,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {8502#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967293))} assume !(~y~0 % 4294967296 > 0); {8502#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:56:35,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {8502#(<= main_~y~0 (+ (* (div main_~y~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; {8501#(<= main_~y~0 (+ 4294967294 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 12:56:35,713 INFO L290 TraceCheckUtils]: 16: Hoare triple {8501#(<= main_~y~0 (+ 4294967294 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8500#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:35,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {8500#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {8500#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:35,713 INFO L290 TraceCheckUtils]: 18: Hoare triple {8500#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~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; {8500#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:35,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {8500#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~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; {8500#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:35,714 INFO L290 TraceCheckUtils]: 20: Hoare triple {8500#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8500#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:35,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {8500#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {8494#false} is VALID [2022-04-15 12:56:35,715 INFO L272 TraceCheckUtils]: 22: Hoare triple {8494#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8494#false} is VALID [2022-04-15 12:56:35,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {8494#false} ~cond := #in~cond; {8494#false} is VALID [2022-04-15 12:56:35,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {8494#false} assume 0 == ~cond; {8494#false} is VALID [2022-04-15 12:56:35,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {8494#false} assume !false; {8494#false} is VALID [2022-04-15 12:56:35,715 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:56:35,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:56:35,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586395414] [2022-04-15 12:56:35,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586395414] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:56:35,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308511081] [2022-04-15 12:56:35,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:35,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:56:35,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:56:35,716 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:56:35,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 12:56:35,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:35,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 12:56:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:35,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:56:35,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {8493#true} call ULTIMATE.init(); {8493#true} is VALID [2022-04-15 12:56:35,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {8493#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8493#true} is VALID [2022-04-15 12:56:35,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {8493#true} assume true; {8493#true} is VALID [2022-04-15 12:56:35,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8493#true} {8493#true} #94#return; {8493#true} is VALID [2022-04-15 12:56:35,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {8493#true} call #t~ret17 := main(); {8493#true} is VALID [2022-04-15 12:56:35,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {8493#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8493#true} is VALID [2022-04-15 12:56:35,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {8493#true} [134] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_19 v_main_~x~0_Out_38) (= v_main_~y~0_In_19 v_main_~y~0_Out_38)) (and (= |v_main_#t~post5_Out_38| 0) (< 0 (mod (+ v_main_~x~0_Out_38 1) 4294967296)) (= |v_main_#t~post6_Out_38| 0) (= (+ v_main_~x~0_In_19 v_main_~y~0_In_19) (+ v_main_~y~0_Out_38 v_main_~x~0_Out_38)) (<= v_main_~x~0_Out_38 v_main_~x~0_In_19))) InVars {main_~x~0=v_main_~x~0_In_19, main_~y~0=v_main_~y~0_In_19} OutVars{main_~y~0=v_main_~y~0_Out_38, main_#t~post5=|v_main_#t~post5_Out_38|, main_~x~0=v_main_~x~0_Out_38, main_#t~post6=|v_main_#t~post6_Out_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8493#true} is VALID [2022-04-15 12:56:35,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {8493#true} [133] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8493#true} is VALID [2022-04-15 12:56:35,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {8493#true} ~z~0 := ~y~0; {8498#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:56:35,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {8498#(= 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; {8534#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 12:56:35,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {8534#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8538#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 12:56:35,881 INFO L290 TraceCheckUtils]: 11: Hoare triple {8538#(= main_~y~0 (+ main_~z~0 2))} assume !(~z~0 % 4294967296 > 0); {8538#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 12:56:35,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {8538#(= main_~y~0 (+ main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8498#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:56:35,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {8498#(= main_~z~0 main_~y~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8548#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} is VALID [2022-04-15 12:56:35,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {8548#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {8548#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} is VALID [2022-04-15 12:56:35,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {8548#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8555#(= main_~y~0 (+ (- 1) main_~z~0))} is VALID [2022-04-15 12:56:35,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {8555#(= main_~y~0 (+ (- 1) main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8498#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:56:35,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {8498#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {8498#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:56:35,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {8498#(= main_~z~0 main_~y~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; {8565#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:56:35,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {8565#(< 0 (mod main_~y~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; {8565#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:56:35,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {8565#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {8565#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:56:35,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {8565#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {8494#false} is VALID [2022-04-15 12:56:35,887 INFO L272 TraceCheckUtils]: 22: Hoare triple {8494#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8494#false} is VALID [2022-04-15 12:56:35,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {8494#false} ~cond := #in~cond; {8494#false} is VALID [2022-04-15 12:56:35,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {8494#false} assume 0 == ~cond; {8494#false} is VALID [2022-04-15 12:56:35,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {8494#false} assume !false; {8494#false} is VALID [2022-04-15 12:56:35,888 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:56:35,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:56:36,162 INFO L290 TraceCheckUtils]: 25: Hoare triple {8494#false} assume !false; {8494#false} is VALID [2022-04-15 12:56:36,162 INFO L290 TraceCheckUtils]: 24: Hoare triple {8494#false} assume 0 == ~cond; {8494#false} is VALID [2022-04-15 12:56:36,162 INFO L290 TraceCheckUtils]: 23: Hoare triple {8494#false} ~cond := #in~cond; {8494#false} is VALID [2022-04-15 12:56:36,162 INFO L272 TraceCheckUtils]: 22: Hoare triple {8494#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8494#false} is VALID [2022-04-15 12:56:36,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {8565#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {8494#false} is VALID [2022-04-15 12:56:36,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {8565#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {8565#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:56:36,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {8565#(< 0 (mod main_~y~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; {8565#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:56:36,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {8608#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~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; {8565#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:56:36,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {8608#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {8608#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:36,165 INFO L290 TraceCheckUtils]: 16: Hoare triple {8615#(or (< 0 (mod (+ main_~y~0 1) 4294967296)) (not (< 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; {8608#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:36,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {8619#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 2) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8615#(or (< 0 (mod (+ main_~y~0 1) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 12:56:36,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {8619#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 2) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {8619#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-15 12:56:36,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {8626#(or (< 0 (mod (+ main_~y~0 1) 4294967296)) (not (< 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; {8619#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-15 12:56:36,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {8630#(or (not (< 0 (mod (+ main_~z~0 2) 4294967296))) (< 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; {8626#(or (< 0 (mod (+ main_~y~0 1) 4294967296)) (not (< 0 (mod (+ main_~z~0 1) 4294967296))))} is VALID [2022-04-15 12:56:36,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {8630#(or (not (< 0 (mod (+ main_~z~0 2) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8630#(or (not (< 0 (mod (+ main_~z~0 2) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:36,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {8637#(or (not (< 0 (mod (+ main_~z~0 1) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8630#(or (not (< 0 (mod (+ main_~z~0 2) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:36,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {8608#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8637#(or (not (< 0 (mod (+ main_~z~0 1) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:36,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {8493#true} ~z~0 := ~y~0; {8608#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:36,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {8493#true} [133] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8493#true} is VALID [2022-04-15 12:56:36,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {8493#true} [134] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_19 v_main_~x~0_Out_38) (= v_main_~y~0_In_19 v_main_~y~0_Out_38)) (and (= |v_main_#t~post5_Out_38| 0) (< 0 (mod (+ v_main_~x~0_Out_38 1) 4294967296)) (= |v_main_#t~post6_Out_38| 0) (= (+ v_main_~x~0_In_19 v_main_~y~0_In_19) (+ v_main_~y~0_Out_38 v_main_~x~0_Out_38)) (<= v_main_~x~0_Out_38 v_main_~x~0_In_19))) InVars {main_~x~0=v_main_~x~0_In_19, main_~y~0=v_main_~y~0_In_19} OutVars{main_~y~0=v_main_~y~0_Out_38, main_#t~post5=|v_main_#t~post5_Out_38|, main_~x~0=v_main_~x~0_Out_38, main_#t~post6=|v_main_#t~post6_Out_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8493#true} is VALID [2022-04-15 12:56:36,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {8493#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8493#true} is VALID [2022-04-15 12:56:36,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {8493#true} call #t~ret17 := main(); {8493#true} is VALID [2022-04-15 12:56:36,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8493#true} {8493#true} #94#return; {8493#true} is VALID [2022-04-15 12:56:36,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {8493#true} assume true; {8493#true} is VALID [2022-04-15 12:56:36,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {8493#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8493#true} is VALID [2022-04-15 12:56:36,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {8493#true} call ULTIMATE.init(); {8493#true} is VALID [2022-04-15 12:56:36,173 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:56:36,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308511081] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:56:36,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:56:36,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 19 [2022-04-15 12:56:36,266 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:56:36,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1012675315] [2022-04-15 12:56:36,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1012675315] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:56:36,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:56:36,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:56:36,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005680197] [2022-04-15 12:56:36,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:56:36,266 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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 27 [2022-04-15 12:56:36,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:56:36,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:36,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:36,299 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:56:36,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:36,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:56:36,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:56:36,300 INFO L87 Difference]: Start difference. First operand 63 states and 84 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:38,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:38,276 INFO L93 Difference]: Finished difference Result 95 states and 134 transitions. [2022-04-15 12:56:38,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 12:56:38,277 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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 27 [2022-04-15 12:56:38,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:56:38,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:38,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 90 transitions. [2022-04-15 12:56:38,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:38,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 90 transitions. [2022-04-15 12:56:38,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 90 transitions. [2022-04-15 12:56:38,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:38,440 INFO L225 Difference]: With dead ends: 95 [2022-04-15 12:56:38,440 INFO L226 Difference]: Without dead ends: 90 [2022-04-15 12:56:38,440 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=1027, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 12:56:38,440 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 71 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:56:38,441 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 48 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:56:38,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-15 12:56:38,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 63. [2022-04-15 12:56:38,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:56:38,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 63 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:38,779 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 63 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:38,779 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 63 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:38,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:38,780 INFO L93 Difference]: Finished difference Result 90 states and 124 transitions. [2022-04-15 12:56:38,780 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 124 transitions. [2022-04-15 12:56:38,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:38,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:38,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 90 states. [2022-04-15 12:56:38,781 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 90 states. [2022-04-15 12:56:38,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:38,782 INFO L93 Difference]: Finished difference Result 90 states and 124 transitions. [2022-04-15 12:56:38,782 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 124 transitions. [2022-04-15 12:56:38,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:38,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:38,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:56:38,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:56:38,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:38,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2022-04-15 12:56:38,783 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 27 [2022-04-15 12:56:38,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:56:38,783 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2022-04-15 12:56:38,783 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:38,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 82 transitions. [2022-04-15 12:56:39,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:39,391 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2022-04-15 12:56:39,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 12:56:39,391 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:56:39,391 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:56:39,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-15 12:56:39,591 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:56:39,592 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:56:39,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:56:39,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1479970823, now seen corresponding path program 5 times [2022-04-15 12:56:39,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:39,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [207472373] [2022-04-15 12:56:39,727 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:56:39,728 INFO L85 PathProgramCache]: Analyzing trace with hash 2041986327, now seen corresponding path program 1 times [2022-04-15 12:56:39,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:56:39,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652649736] [2022-04-15 12:56:39,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:39,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:56:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:39,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:56:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:39,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {9211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9201#true} is VALID [2022-04-15 12:56:39,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {9201#true} assume true; {9201#true} is VALID [2022-04-15 12:56:39,848 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9201#true} {9201#true} #94#return; {9201#true} is VALID [2022-04-15 12:56:39,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {9201#true} call ULTIMATE.init(); {9211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:56:39,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {9211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9201#true} is VALID [2022-04-15 12:56:39,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {9201#true} assume true; {9201#true} is VALID [2022-04-15 12:56:39,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9201#true} {9201#true} #94#return; {9201#true} is VALID [2022-04-15 12:56:39,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {9201#true} call #t~ret17 := main(); {9201#true} is VALID [2022-04-15 12:56:39,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {9201#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9201#true} is VALID [2022-04-15 12:56:39,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {9201#true} [136] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_20 v_main_~x~0_Out_40) (= v_main_~y~0_In_20 v_main_~y~0_Out_40)) (and (= |v_main_#t~post5_Out_40| 0) (= (+ v_main_~y~0_Out_40 v_main_~x~0_Out_40) (+ v_main_~x~0_In_20 v_main_~y~0_In_20)) (< 0 (mod (+ v_main_~x~0_Out_40 1) 4294967296)) (<= v_main_~x~0_Out_40 v_main_~x~0_In_20) (= |v_main_#t~post6_Out_40| 0))) InVars {main_~x~0=v_main_~x~0_In_20, main_~y~0=v_main_~y~0_In_20} OutVars{main_~y~0=v_main_~y~0_Out_40, main_#t~post5=|v_main_#t~post5_Out_40|, main_~x~0=v_main_~x~0_Out_40, main_#t~post6=|v_main_#t~post6_Out_40|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9201#true} is VALID [2022-04-15 12:56:39,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {9201#true} [135] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9206#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:56:39,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {9206#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {9206#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:56:39,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {9206#(<= 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; {9207#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:56:39,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {9207#(<= 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; {9208#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:39,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {9208#(<= 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; {9209#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:39,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {9209#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9210#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:56:39,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {9210#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {9210#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:56:39,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {9210#(<= (+ 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; {9210#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:56:39,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {9210#(<= (+ 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; {9210#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:56:39,865 INFO L290 TraceCheckUtils]: 16: Hoare triple {9210#(<= (+ 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; {9210#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:56:39,865 INFO L290 TraceCheckUtils]: 17: Hoare triple {9210#(<= (+ 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; {9210#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:56:39,865 INFO L290 TraceCheckUtils]: 18: Hoare triple {9210#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {9210#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:56:39,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {9210#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {9202#false} is VALID [2022-04-15 12:56:39,867 INFO L290 TraceCheckUtils]: 20: Hoare triple {9202#false} assume !(~z~0 % 4294967296 > 0); {9202#false} is VALID [2022-04-15 12:56:39,867 INFO L290 TraceCheckUtils]: 21: Hoare triple {9202#false} assume !(~y~0 % 4294967296 > 0); {9202#false} is VALID [2022-04-15 12:56:39,867 INFO L272 TraceCheckUtils]: 22: Hoare triple {9202#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9202#false} is VALID [2022-04-15 12:56:39,867 INFO L290 TraceCheckUtils]: 23: Hoare triple {9202#false} ~cond := #in~cond; {9202#false} is VALID [2022-04-15 12:56:39,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {9202#false} assume 0 == ~cond; {9202#false} is VALID [2022-04-15 12:56:39,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {9202#false} assume !false; {9202#false} is VALID [2022-04-15 12:56:39,868 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:56:39,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:56:39,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652649736] [2022-04-15 12:56:39,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652649736] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:56:39,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952685879] [2022-04-15 12:56:39,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:39,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:56:39,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:56:39,869 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:56:39,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 12:56:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:39,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 12:56:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:39,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:56:40,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {9201#true} call ULTIMATE.init(); {9201#true} is VALID [2022-04-15 12:56:40,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {9201#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9201#true} is VALID [2022-04-15 12:56:40,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {9201#true} assume true; {9201#true} is VALID [2022-04-15 12:56:40,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9201#true} {9201#true} #94#return; {9201#true} is VALID [2022-04-15 12:56:40,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {9201#true} call #t~ret17 := main(); {9201#true} is VALID [2022-04-15 12:56:40,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {9201#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9201#true} is VALID [2022-04-15 12:56:40,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {9201#true} [136] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_20 v_main_~x~0_Out_40) (= v_main_~y~0_In_20 v_main_~y~0_Out_40)) (and (= |v_main_#t~post5_Out_40| 0) (= (+ v_main_~y~0_Out_40 v_main_~x~0_Out_40) (+ v_main_~x~0_In_20 v_main_~y~0_In_20)) (< 0 (mod (+ v_main_~x~0_Out_40 1) 4294967296)) (<= v_main_~x~0_Out_40 v_main_~x~0_In_20) (= |v_main_#t~post6_Out_40| 0))) InVars {main_~x~0=v_main_~x~0_In_20, main_~y~0=v_main_~y~0_In_20} OutVars{main_~y~0=v_main_~y~0_Out_40, main_#t~post5=|v_main_#t~post5_Out_40|, main_~x~0=v_main_~x~0_Out_40, main_#t~post6=|v_main_#t~post6_Out_40|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9201#true} is VALID [2022-04-15 12:56:40,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {9201#true} [135] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9201#true} is VALID [2022-04-15 12:56:40,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {9201#true} ~z~0 := ~y~0; {9239#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:56:40,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {9239#(= 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; {9243#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:40,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {9243#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9247#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:40,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {9247#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9251#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:40,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {9251#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9255#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:40,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {9255#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9255#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:40,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {9255#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (< 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; {9262#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= (+ (- 2) main_~y~0) main_~z~0))} is VALID [2022-04-15 12:56:40,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {9262#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= (+ (- 2) main_~y~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; {9266#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:56:40,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {9266#(< 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; {9270#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:56:40,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {9270#(< 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; {9274#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:40,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {9274#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {9274#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:40,228 INFO L290 TraceCheckUtils]: 19: Hoare triple {9274#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {9274#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:40,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {9274#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {9202#false} is VALID [2022-04-15 12:56:40,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {9202#false} assume !(~y~0 % 4294967296 > 0); {9202#false} is VALID [2022-04-15 12:56:40,229 INFO L272 TraceCheckUtils]: 22: Hoare triple {9202#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9202#false} is VALID [2022-04-15 12:56:40,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {9202#false} ~cond := #in~cond; {9202#false} is VALID [2022-04-15 12:56:40,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {9202#false} assume 0 == ~cond; {9202#false} is VALID [2022-04-15 12:56:40,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {9202#false} assume !false; {9202#false} is VALID [2022-04-15 12:56:40,229 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:56:40,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:56:40,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {9202#false} assume !false; {9202#false} is VALID [2022-04-15 12:56:40,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {9202#false} assume 0 == ~cond; {9202#false} is VALID [2022-04-15 12:56:40,368 INFO L290 TraceCheckUtils]: 23: Hoare triple {9202#false} ~cond := #in~cond; {9202#false} is VALID [2022-04-15 12:56:40,368 INFO L272 TraceCheckUtils]: 22: Hoare triple {9202#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9202#false} is VALID [2022-04-15 12:56:40,368 INFO L290 TraceCheckUtils]: 21: Hoare triple {9202#false} assume !(~y~0 % 4294967296 > 0); {9202#false} is VALID [2022-04-15 12:56:40,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {9274#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {9202#false} is VALID [2022-04-15 12:56:40,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {9274#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {9274#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:40,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {9274#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {9274#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:40,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {9270#(< 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; {9274#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:40,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {9266#(< 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; {9270#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:56:40,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {9329#(< 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; {9266#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:56:40,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {9333#(< 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; {9329#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:56:40,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {9333#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !(~z~0 % 4294967296 > 0); {9333#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:56:40,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {9329#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9333#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:56:40,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {9266#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9329#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:56:40,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {9270#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9266#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:56:40,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {9201#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9270#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:56:40,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {9201#true} ~z~0 := ~y~0; {9201#true} is VALID [2022-04-15 12:56:40,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {9201#true} [135] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9201#true} is VALID [2022-04-15 12:56:40,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {9201#true} [136] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_20 v_main_~x~0_Out_40) (= v_main_~y~0_In_20 v_main_~y~0_Out_40)) (and (= |v_main_#t~post5_Out_40| 0) (= (+ v_main_~y~0_Out_40 v_main_~x~0_Out_40) (+ v_main_~x~0_In_20 v_main_~y~0_In_20)) (< 0 (mod (+ v_main_~x~0_Out_40 1) 4294967296)) (<= v_main_~x~0_Out_40 v_main_~x~0_In_20) (= |v_main_#t~post6_Out_40| 0))) InVars {main_~x~0=v_main_~x~0_In_20, main_~y~0=v_main_~y~0_In_20} OutVars{main_~y~0=v_main_~y~0_Out_40, main_#t~post5=|v_main_#t~post5_Out_40|, main_~x~0=v_main_~x~0_Out_40, main_#t~post6=|v_main_#t~post6_Out_40|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9201#true} is VALID [2022-04-15 12:56:40,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {9201#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9201#true} is VALID [2022-04-15 12:56:40,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {9201#true} call #t~ret17 := main(); {9201#true} is VALID [2022-04-15 12:56:40,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9201#true} {9201#true} #94#return; {9201#true} is VALID [2022-04-15 12:56:40,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {9201#true} assume true; {9201#true} is VALID [2022-04-15 12:56:40,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {9201#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9201#true} is VALID [2022-04-15 12:56:40,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {9201#true} call ULTIMATE.init(); {9201#true} is VALID [2022-04-15 12:56:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:56:40,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952685879] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:56:40,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:56:40,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 7] total 19 [2022-04-15 12:56:40,492 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:56:40,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [207472373] [2022-04-15 12:56:40,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [207472373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:56:40,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:56:40,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:56:40,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841645860] [2022-04-15 12:56:40,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:56:40,493 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 12:56:40,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:56:40,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:40,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:40,522 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:56:40,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:40,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:56:40,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:56:40,522 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:43,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:43,210 INFO L93 Difference]: Finished difference Result 186 states and 264 transitions. [2022-04-15 12:56:43,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:56:43,210 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 12:56:43,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:56:43,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 108 transitions. [2022-04-15 12:56:43,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:43,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 108 transitions. [2022-04-15 12:56:43,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 108 transitions. [2022-04-15 12:56:43,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:43,378 INFO L225 Difference]: With dead ends: 186 [2022-04-15 12:56:43,379 INFO L226 Difference]: Without dead ends: 168 [2022-04-15 12:56:43,379 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:56:43,380 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 98 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:56:43,380 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 77 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:56:43,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-04-15 12:56:43,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 71. [2022-04-15 12:56:43,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:56:43,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand has 71 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 66 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:43,780 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand has 71 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 66 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:43,780 INFO L87 Difference]: Start difference. First operand 168 states. Second operand has 71 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 66 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:43,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:43,782 INFO L93 Difference]: Finished difference Result 168 states and 234 transitions. [2022-04-15 12:56:43,782 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 234 transitions. [2022-04-15 12:56:43,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:43,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:43,782 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 66 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 168 states. [2022-04-15 12:56:43,782 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 66 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 168 states. [2022-04-15 12:56:43,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:43,784 INFO L93 Difference]: Finished difference Result 168 states and 234 transitions. [2022-04-15 12:56:43,784 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 234 transitions. [2022-04-15 12:56:43,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:43,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:43,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:56:43,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:56:43,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 66 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:43,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2022-04-15 12:56:43,786 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 27 [2022-04-15 12:56:43,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:56:43,786 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2022-04-15 12:56:43,786 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:43,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 92 transitions. [2022-04-15 12:56:45,074 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-15 12:56:45,075 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2022-04-15 12:56:45,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 12:56:45,075 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:56:45,075 INFO L499 BasicCegarLoop]: 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-15 12:56:45,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 12:56:45,278 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:56:45,278 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:56:45,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:56:45,279 INFO L85 PathProgramCache]: Analyzing trace with hash 939274105, now seen corresponding path program 4 times [2022-04-15 12:56:45,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:45,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [455815864] [2022-04-15 12:56:45,401 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:56:45,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1747422551, now seen corresponding path program 1 times [2022-04-15 12:56:45,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:56:45,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766703800] [2022-04-15 12:56:45,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:45,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:56:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:45,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:56:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:45,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {10265#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10248#true} is VALID [2022-04-15 12:56:45,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {10248#true} assume true; {10248#true} is VALID [2022-04-15 12:56:45,783 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10248#true} {10248#true} #94#return; {10248#true} is VALID [2022-04-15 12:56:45,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {10248#true} call ULTIMATE.init(); {10265#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:56:45,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {10265#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10248#true} is VALID [2022-04-15 12:56:45,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {10248#true} assume true; {10248#true} is VALID [2022-04-15 12:56:45,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10248#true} {10248#true} #94#return; {10248#true} is VALID [2022-04-15 12:56:45,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {10248#true} call #t~ret17 := main(); {10248#true} is VALID [2022-04-15 12:56:45,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {10248#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10253#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:56:45,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {10253#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [138] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_21 v_main_~y~0_Out_42) (= v_main_~x~0_In_21 v_main_~x~0_Out_42)) (and (<= v_main_~x~0_Out_42 v_main_~x~0_In_21) (= |v_main_#t~post6_Out_42| 0) (< 0 (mod (+ v_main_~x~0_Out_42 1) 4294967296)) (= |v_main_#t~post5_Out_42| 0) (= (+ v_main_~y~0_Out_42 v_main_~x~0_Out_42) (+ v_main_~x~0_In_21 v_main_~y~0_In_21)))) InVars {main_~x~0=v_main_~x~0_In_21, main_~y~0=v_main_~y~0_In_21} OutVars{main_~y~0=v_main_~y~0_Out_42, main_#t~post5=|v_main_#t~post5_Out_42|, main_~x~0=v_main_~x~0_Out_42, main_#t~post6=|v_main_#t~post6_Out_42|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10254#(or (and (<= (+ main_~y~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~n~0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:56:45,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {10254#(or (and (<= (+ main_~y~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~n~0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} [137] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10255#(or (and (<= (+ main_~y~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))) (= main_~y~0 0))} is VALID [2022-04-15 12:56:45,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {10255#(or (and (<= (+ main_~y~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))) (= main_~y~0 0))} ~z~0 := ~y~0; {10256#(and (= main_~z~0 main_~y~0) (or (and (<= (+ main_~y~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))) (= main_~y~0 0)))} is VALID [2022-04-15 12:56:45,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {10256#(and (= main_~z~0 main_~y~0) (or (and (<= (+ main_~y~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))) (= main_~y~0 0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10257#(and (or (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (= main_~y~0 0)) (= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0))} is VALID [2022-04-15 12:56:45,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {10257#(and (or (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (= main_~y~0 0)) (= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10258#(and (or (not (= main_~y~0 0)) (and (<= (+ (div main_~z~0 4294967296) 1) 0) (<= main_~y~0 (+ main_~z~0 2)))) (or (= main_~y~0 0) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:56:45,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {10258#(and (or (not (= main_~y~0 0)) (and (<= (+ (div main_~z~0 4294967296) 1) 0) (<= main_~y~0 (+ main_~z~0 2)))) (or (= main_~y~0 0) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))))} assume !(~z~0 % 4294967296 > 0); {10259#(and (not (= main_~y~0 0)) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:56:45,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {10259#(and (not (= main_~y~0 0)) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) 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; {10260#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:56:45,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {10260#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~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; {10261#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:45,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {10261#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10261#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:45,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {10261#(<= main_~n~0 (+ 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; {10261#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:45,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {10261#(<= main_~n~0 (+ 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; {10261#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:45,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {10261#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {10261#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:45,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {10261#(<= main_~n~0 (+ 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; {10260#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:56:45,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {10260#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10262#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:45,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {10262#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10262#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:45,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {10262#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) 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; {10260#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:56:45,801 INFO L290 TraceCheckUtils]: 22: Hoare triple {10260#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 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; {10261#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:45,801 INFO L290 TraceCheckUtils]: 23: Hoare triple {10261#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10261#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:45,803 INFO L272 TraceCheckUtils]: 24: Hoare triple {10261#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10263#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:56:45,803 INFO L290 TraceCheckUtils]: 25: Hoare triple {10263#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {10264#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:56:45,803 INFO L290 TraceCheckUtils]: 26: Hoare triple {10264#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {10249#false} is VALID [2022-04-15 12:56:45,803 INFO L290 TraceCheckUtils]: 27: Hoare triple {10249#false} assume !false; {10249#false} is VALID [2022-04-15 12:56:45,804 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:56:45,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:56:45,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766703800] [2022-04-15 12:56:45,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766703800] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:56:45,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419632664] [2022-04-15 12:56:45,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:45,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:56:45,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:56:45,805 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:56:45,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 12:56:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:45,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-15 12:56:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:45,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:56:57,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {10248#true} call ULTIMATE.init(); {10248#true} is VALID [2022-04-15 12:56:57,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {10248#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10248#true} is VALID [2022-04-15 12:56:57,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {10248#true} assume true; {10248#true} is VALID [2022-04-15 12:56:57,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10248#true} {10248#true} #94#return; {10248#true} is VALID [2022-04-15 12:56:57,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {10248#true} call #t~ret17 := main(); {10248#true} is VALID [2022-04-15 12:56:57,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {10248#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10253#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:56:57,299 INFO L290 TraceCheckUtils]: 6: Hoare triple {10253#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [138] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_21 v_main_~y~0_Out_42) (= v_main_~x~0_In_21 v_main_~x~0_Out_42)) (and (<= v_main_~x~0_Out_42 v_main_~x~0_In_21) (= |v_main_#t~post6_Out_42| 0) (< 0 (mod (+ v_main_~x~0_Out_42 1) 4294967296)) (= |v_main_#t~post5_Out_42| 0) (= (+ v_main_~y~0_Out_42 v_main_~x~0_Out_42) (+ v_main_~x~0_In_21 v_main_~y~0_In_21)))) InVars {main_~x~0=v_main_~x~0_In_21, main_~y~0=v_main_~y~0_In_21} OutVars{main_~y~0=v_main_~y~0_Out_42, main_#t~post5=|v_main_#t~post5_Out_42|, main_~x~0=v_main_~x~0_Out_42, main_#t~post6=|v_main_#t~post6_Out_42|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10287#(or (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~x~0 main_~n~0) (= main_~n~0 (+ main_~y~0 main_~x~0))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} is VALID [2022-04-15 12:56:57,300 INFO L290 TraceCheckUtils]: 7: Hoare triple {10287#(or (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~x~0 main_~n~0) (= main_~n~0 (+ main_~y~0 main_~x~0))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} [137] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10291#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-15 12:56:57,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {10291#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} ~z~0 := ~y~0; {10295#(and (= main_~z~0 main_~y~0) (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-15 12:56:57,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {10295#(and (= main_~z~0 main_~y~0) (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 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; {10299#(and (= (+ main_~n~0 (* (- 1) main_~y~0) 1) main_~x~0) (<= 0 main_~y~0) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:57,304 INFO L290 TraceCheckUtils]: 10: Hoare triple {10299#(and (= (+ main_~n~0 (* (- 1) main_~y~0) 1) main_~x~0) (<= 0 main_~y~0) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10303#(and (<= 0 main_~y~0) (= (+ (- 1) main_~x~0) (+ main_~n~0 (* (- 1) main_~y~0) 1)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= main_~y~0 (+ main_~z~0 2)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:57,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {10303#(and (<= 0 main_~y~0) (= (+ (- 1) main_~x~0) (+ main_~n~0 (* (- 1) main_~y~0) 1)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= main_~y~0 (+ main_~z~0 2)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10307#(and (<= 0 main_~y~0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (= main_~y~0 (+ main_~z~0 2)) (= (+ main_~n~0 2) (+ main_~y~0 main_~x~0)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-15 12:56:57,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {10307#(and (<= 0 main_~y~0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (= main_~y~0 (+ main_~z~0 2)) (= (+ main_~n~0 2) (+ main_~y~0 main_~x~0)) (<= (mod main_~z~0 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10311#(and (= (+ main_~z~0 1) (+ main_~n~0 2 (* (- 1) main_~x~0))) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (= (+ main_~y~0 1) (+ main_~n~0 2 (* (- 1) main_~x~0))) (<= main_~x~0 (+ main_~n~0 2)))} is VALID [2022-04-15 12:56:57,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {10311#(and (= (+ main_~z~0 1) (+ main_~n~0 2 (* (- 1) main_~x~0))) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (= (+ main_~y~0 1) (+ main_~n~0 2 (* (- 1) main_~x~0))) (<= main_~x~0 (+ main_~n~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; {10315#(and (= main_~z~0 (+ main_~n~0 2 (* (- 1) main_~x~0))) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 2)) (= (+ main_~y~0 2) (+ main_~n~0 2 (* (- 1) main_~x~0))))} is VALID [2022-04-15 12:56:57,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {10315#(and (= main_~z~0 (+ main_~n~0 2 (* (- 1) main_~x~0))) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 2)) (= (+ main_~y~0 2) (+ main_~n~0 2 (* (- 1) main_~x~0))))} assume !(~y~0 % 4294967296 > 0); {10319#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (= (+ main_~n~0 2) (+ main_~z~0 main_~x~0)) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 2)))} is VALID [2022-04-15 12:56:57,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {10319#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (= (+ main_~n~0 2) (+ main_~z~0 main_~x~0)) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= main_~x~0 (+ main_~n~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; {10323#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (= (+ main_~x~0 1) (+ main_~n~0 2 (* (- 1) main_~z~0))) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= 0 main_~z~0))} is VALID [2022-04-15 12:56:57,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {10323#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (= (+ main_~x~0 1) (+ main_~n~0 2 (* (- 1) main_~z~0))) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= 0 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10327#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (= (+ main_~x~0 1) (+ main_~n~0 (* (- 1) main_~z~0) 1)) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= 0 main_~z~0))} is VALID [2022-04-15 12:56:57,314 INFO L290 TraceCheckUtils]: 17: Hoare triple {10327#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (= (+ main_~x~0 1) (+ main_~n~0 (* (- 1) main_~z~0) 1)) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= 0 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {10331#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= 0 main_~z~0))} is VALID [2022-04-15 12:56:57,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {10331#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10335#(and (<= 0 (+ main_~z~0 1)) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (<= (mod (+ main_~n~0 4294967295 (* main_~z~0 4294967295)) 4294967296) 0))} is VALID [2022-04-15 12:56:57,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {10335#(and (<= 0 (+ main_~z~0 1)) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (<= (mod (+ main_~n~0 4294967295 (* main_~z~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; {10339#(and (<= 0 (+ main_~z~0 2)) (<= (mod (+ main_~n~0 4294967294 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-15 12:56:57,320 INFO L290 TraceCheckUtils]: 20: Hoare triple {10339#(and (<= 0 (+ main_~z~0 2)) (<= (mod (+ main_~n~0 4294967294 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {10339#(and (<= 0 (+ main_~z~0 2)) (<= (mod (+ main_~n~0 4294967294 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-15 12:56:57,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {10339#(and (<= 0 (+ main_~z~0 2)) (<= (mod (+ main_~n~0 4294967294 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod main_~z~0 4294967296) 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; {10335#(and (<= 0 (+ main_~z~0 1)) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (<= (mod (+ main_~n~0 4294967295 (* main_~z~0 4294967295)) 4294967296) 0))} is VALID [2022-04-15 12:56:57,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {10335#(and (<= 0 (+ main_~z~0 1)) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (<= (mod (+ main_~n~0 4294967295 (* main_~z~0 4294967295)) 4294967296) 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; {10331#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= 0 main_~z~0))} is VALID [2022-04-15 12:56:57,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {10331#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= 0 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {10331#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= 0 main_~z~0))} is VALID [2022-04-15 12:56:57,326 INFO L272 TraceCheckUtils]: 24: Hoare triple {10331#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= 0 main_~z~0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10355#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:56:57,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {10355#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10359#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:56:57,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {10359#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10249#false} is VALID [2022-04-15 12:56:57,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {10249#false} assume !false; {10249#false} is VALID [2022-04-15 12:56:57,327 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:56:57,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:56:59,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {10249#false} assume !false; {10249#false} is VALID [2022-04-15 12:56:59,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {10359#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10249#false} is VALID [2022-04-15 12:56:59,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {10355#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10359#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:56:59,907 INFO L272 TraceCheckUtils]: 24: Hoare triple {10261#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10355#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:56:59,907 INFO L290 TraceCheckUtils]: 23: Hoare triple {10261#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10261#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:59,909 INFO L290 TraceCheckUtils]: 22: Hoare triple {10260#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 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; {10261#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:59,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {10262#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) 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; {10260#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:56:59,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {10387#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {10262#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:59,913 INFO L290 TraceCheckUtils]: 19: Hoare triple {10391#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10387#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:56:59,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {10395#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10391#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:56:59,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {10399#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (< 0 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {10395#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-15 12:56:59,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {10403#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ main_~z~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; {10399#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:56:59,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {10407#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 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; {10403#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-15 12:56:59,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {10411#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10407#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-15 12:56:59,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {10415#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~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; {10411#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:59,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {10419#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) 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; {10415#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:56:59,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {10419#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {10419#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:56:59,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {10426#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~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; {10419#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:56:59,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {10430#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 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; {10426#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:56:59,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {10434#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod main_~x~0 4294967296)))} ~z~0 := ~y~0; {10430#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:56:59,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {10434#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod main_~x~0 4294967296)))} [137] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10434#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:56:59,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {10441#(or (< (div (+ (* (- 1) main_~x~0) (- 4294967295) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 main_~x~0 4294967293) 4294967296))) (<= (div (+ (- 4294967294) (* (- 1) main_~n~0)) (- 4294967296)) (+ (div (+ main_~n~0 (* (- 1) main_~x~0) (- 4294967296) (* (- 1) main_~y~0)) 4294967296) 2 (div (+ main_~y~0 main_~x~0 4294967293) 4294967296))))} [138] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_21 v_main_~y~0_Out_42) (= v_main_~x~0_In_21 v_main_~x~0_Out_42)) (and (<= v_main_~x~0_Out_42 v_main_~x~0_In_21) (= |v_main_#t~post6_Out_42| 0) (< 0 (mod (+ v_main_~x~0_Out_42 1) 4294967296)) (= |v_main_#t~post5_Out_42| 0) (= (+ v_main_~y~0_Out_42 v_main_~x~0_Out_42) (+ v_main_~x~0_In_21 v_main_~y~0_In_21)))) InVars {main_~x~0=v_main_~x~0_In_21, main_~y~0=v_main_~y~0_In_21} OutVars{main_~y~0=v_main_~y~0_Out_42, main_#t~post5=|v_main_#t~post5_Out_42|, main_~x~0=v_main_~x~0_Out_42, main_#t~post6=|v_main_#t~post6_Out_42|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10434#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:56:59,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {10248#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10441#(or (< (div (+ (* (- 1) main_~x~0) (- 4294967295) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 main_~x~0 4294967293) 4294967296))) (<= (div (+ (- 4294967294) (* (- 1) main_~n~0)) (- 4294967296)) (+ (div (+ main_~n~0 (* (- 1) main_~x~0) (- 4294967296) (* (- 1) main_~y~0)) 4294967296) 2 (div (+ main_~y~0 main_~x~0 4294967293) 4294967296))))} is VALID [2022-04-15 12:56:59,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {10248#true} call #t~ret17 := main(); {10248#true} is VALID [2022-04-15 12:56:59,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10248#true} {10248#true} #94#return; {10248#true} is VALID [2022-04-15 12:56:59,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {10248#true} assume true; {10248#true} is VALID [2022-04-15 12:56:59,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {10248#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10248#true} is VALID [2022-04-15 12:56:59,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {10248#true} call ULTIMATE.init(); {10248#true} is VALID [2022-04-15 12:56:59,943 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:56:59,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419632664] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:56:59,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:56:59,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 20] total 44 [2022-04-15 12:57:00,222 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:57:00,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [455815864] [2022-04-15 12:57:00,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [455815864] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:57:00,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:57:00,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 12:57:00,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50606935] [2022-04-15 12:57:00,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:57:00,223 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 14 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 12:57:00,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:57:00,223 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), 14 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:00,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:00,277 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 12:57:00,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:00,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 12:57:00,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=1785, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 12:57:00,278 INFO L87 Difference]: Start difference. First operand 71 states and 92 transitions. Second operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 14 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:02,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:02,374 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-15 12:57:02,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 12:57:02,374 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 14 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 12:57:02,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:57:02,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 14 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:02,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 46 transitions. [2022-04-15 12:57:02,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 14 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:02,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 46 transitions. [2022-04-15 12:57:02,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 46 transitions. [2022-04-15 12:57:02,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:02,473 INFO L225 Difference]: With dead ends: 80 [2022-04-15 12:57:02,473 INFO L226 Difference]: Without dead ends: 75 [2022-04-15 12:57:02,474 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1149 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=526, Invalid=3014, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 12:57:02,474 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 31 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:57:02,475 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 65 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:57:02,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-15 12:57:02,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-15 12:57:02,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:57:02,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 70 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:02,904 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 70 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:02,904 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 70 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:02,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:02,905 INFO L93 Difference]: Finished difference Result 75 states and 97 transitions. [2022-04-15 12:57:02,905 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2022-04-15 12:57:02,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:02,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:02,905 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 70 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-15 12:57:02,905 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 70 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-15 12:57:02,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:02,906 INFO L93 Difference]: Finished difference Result 75 states and 97 transitions. [2022-04-15 12:57:02,906 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2022-04-15 12:57:02,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:02,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:02,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:57:02,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:57:02,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 70 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:02,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 97 transitions. [2022-04-15 12:57:02,908 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 97 transitions. Word has length 29 [2022-04-15 12:57:02,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:57:02,908 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 97 transitions. [2022-04-15 12:57:02,908 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 14 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:02,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 97 transitions. [2022-04-15 12:57:04,085 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-15 12:57:04,085 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2022-04-15 12:57:04,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 12:57:04,086 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:57:04,086 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:57:04,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-15 12:57:04,286 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:57:04,286 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:57:04,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:57:04,287 INFO L85 PathProgramCache]: Analyzing trace with hash 522425753, now seen corresponding path program 4 times [2022-04-15 12:57:04,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:04,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1977291736] [2022-04-15 12:57:04,409 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:57:04,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1972130743, now seen corresponding path program 1 times [2022-04-15 12:57:04,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:57:04,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531354118] [2022-04-15 12:57:04,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:57:04,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:57:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:04,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:57:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:04,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {10962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10951#true} is VALID [2022-04-15 12:57:04,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {10951#true} assume true; {10951#true} is VALID [2022-04-15 12:57:04,542 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10951#true} {10951#true} #94#return; {10951#true} is VALID [2022-04-15 12:57:04,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {10951#true} call ULTIMATE.init(); {10962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:57:04,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {10962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10951#true} is VALID [2022-04-15 12:57:04,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {10951#true} assume true; {10951#true} is VALID [2022-04-15 12:57:04,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10951#true} {10951#true} #94#return; {10951#true} is VALID [2022-04-15 12:57:04,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {10951#true} call #t~ret17 := main(); {10951#true} is VALID [2022-04-15 12:57:04,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {10951#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10951#true} is VALID [2022-04-15 12:57:04,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {10951#true} [140] L16-2-->L16-3_primed: Formula: (or (and (<= v_main_~x~0_Out_44 v_main_~x~0_In_22) (= |v_main_#t~post6_Out_44| 0) (= |v_main_#t~post5_Out_44| 0) (= (+ v_main_~x~0_In_22 v_main_~y~0_In_22) (+ v_main_~y~0_Out_44 v_main_~x~0_Out_44)) (< 0 (mod (+ v_main_~x~0_Out_44 1) 4294967296))) (and (= v_main_~y~0_In_22 v_main_~y~0_Out_44) (= v_main_~x~0_In_22 v_main_~x~0_Out_44))) InVars {main_~x~0=v_main_~x~0_In_22, main_~y~0=v_main_~y~0_In_22} OutVars{main_~y~0=v_main_~y~0_Out_44, main_#t~post5=|v_main_#t~post5_Out_44|, main_~x~0=v_main_~x~0_Out_44, main_#t~post6=|v_main_#t~post6_Out_44|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10951#true} is VALID [2022-04-15 12:57:04,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {10951#true} [139] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10956#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:57:04,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {10956#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {10956#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:57:04,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {10956#(<= 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; {10957#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:57:04,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {10957#(<= 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; {10958#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:04,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {10958#(<= 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; {10959#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:04,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {10959#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10960#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:04,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {10960#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10960#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:04,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {10960#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10960#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:04,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {10960#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10960#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:04,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {10960#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10960#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:04,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {10960#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10960#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:04,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {10960#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10960#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:04,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {10960#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10961#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:57:04,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {10961#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {10952#false} is VALID [2022-04-15 12:57:04,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {10952#false} assume !(~z~0 % 4294967296 > 0); {10952#false} is VALID [2022-04-15 12:57:04,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {10952#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; {10952#false} is VALID [2022-04-15 12:57:04,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {10952#false} assume !(~y~0 % 4294967296 > 0); {10952#false} is VALID [2022-04-15 12:57:04,559 INFO L272 TraceCheckUtils]: 24: Hoare triple {10952#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10952#false} is VALID [2022-04-15 12:57:04,559 INFO L290 TraceCheckUtils]: 25: Hoare triple {10952#false} ~cond := #in~cond; {10952#false} is VALID [2022-04-15 12:57:04,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {10952#false} assume 0 == ~cond; {10952#false} is VALID [2022-04-15 12:57:04,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {10952#false} assume !false; {10952#false} is VALID [2022-04-15 12:57:04,560 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-15 12:57:04,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:57:04,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531354118] [2022-04-15 12:57:04,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531354118] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:57:04,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918696276] [2022-04-15 12:57:04,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:57:04,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:57:04,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:57:04,561 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:57:04,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 12:57:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:04,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 12:57:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:04,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:57:04,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {10951#true} call ULTIMATE.init(); {10951#true} is VALID [2022-04-15 12:57:04,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {10951#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10951#true} is VALID [2022-04-15 12:57:04,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {10951#true} assume true; {10951#true} is VALID [2022-04-15 12:57:04,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10951#true} {10951#true} #94#return; {10951#true} is VALID [2022-04-15 12:57:04,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {10951#true} call #t~ret17 := main(); {10951#true} is VALID [2022-04-15 12:57:04,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {10951#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10951#true} is VALID [2022-04-15 12:57:04,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {10951#true} [140] L16-2-->L16-3_primed: Formula: (or (and (<= v_main_~x~0_Out_44 v_main_~x~0_In_22) (= |v_main_#t~post6_Out_44| 0) (= |v_main_#t~post5_Out_44| 0) (= (+ v_main_~x~0_In_22 v_main_~y~0_In_22) (+ v_main_~y~0_Out_44 v_main_~x~0_Out_44)) (< 0 (mod (+ v_main_~x~0_Out_44 1) 4294967296))) (and (= v_main_~y~0_In_22 v_main_~y~0_Out_44) (= v_main_~x~0_In_22 v_main_~x~0_Out_44))) InVars {main_~x~0=v_main_~x~0_In_22, main_~y~0=v_main_~y~0_In_22} OutVars{main_~y~0=v_main_~y~0_Out_44, main_#t~post5=|v_main_#t~post5_Out_44|, main_~x~0=v_main_~x~0_Out_44, main_#t~post6=|v_main_#t~post6_Out_44|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10951#true} is VALID [2022-04-15 12:57:04,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {10951#true} [139] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10951#true} is VALID [2022-04-15 12:57:04,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {10951#true} ~z~0 := ~y~0; {10990#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:57:04,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {10990#(= 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; {10994#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 12:57:04,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {10994#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10998#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-15 12:57:04,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {10998#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11002#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-15 12:57:04,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {11002#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11006#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-15 12:57:04,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {11006#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} assume !(~z~0 % 4294967296 > 0); {11006#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-15 12:57:04,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {11006#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11013#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:57:04,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {11013#(< 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; {11017#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:57:04,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {11017#(< 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; {11021#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:57:04,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {11021#(< 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; {11025#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:04,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {11025#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {11025#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:04,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {11025#(< 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; {11025#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:04,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {11025#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {11025#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:04,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {11025#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10952#false} is VALID [2022-04-15 12:57:04,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {10952#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; {10952#false} is VALID [2022-04-15 12:57:04,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {10952#false} assume !(~y~0 % 4294967296 > 0); {10952#false} is VALID [2022-04-15 12:57:04,889 INFO L272 TraceCheckUtils]: 24: Hoare triple {10952#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10952#false} is VALID [2022-04-15 12:57:04,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {10952#false} ~cond := #in~cond; {10952#false} is VALID [2022-04-15 12:57:04,889 INFO L290 TraceCheckUtils]: 26: Hoare triple {10952#false} assume 0 == ~cond; {10952#false} is VALID [2022-04-15 12:57:04,889 INFO L290 TraceCheckUtils]: 27: Hoare triple {10952#false} assume !false; {10952#false} is VALID [2022-04-15 12:57:04,889 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:57:04,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:57:05,182 INFO L290 TraceCheckUtils]: 27: Hoare triple {10952#false} assume !false; {10952#false} is VALID [2022-04-15 12:57:05,182 INFO L290 TraceCheckUtils]: 26: Hoare triple {10952#false} assume 0 == ~cond; {10952#false} is VALID [2022-04-15 12:57:05,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {10952#false} ~cond := #in~cond; {10952#false} is VALID [2022-04-15 12:57:05,182 INFO L272 TraceCheckUtils]: 24: Hoare triple {10952#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10952#false} is VALID [2022-04-15 12:57:05,182 INFO L290 TraceCheckUtils]: 23: Hoare triple {10952#false} assume !(~y~0 % 4294967296 > 0); {10952#false} is VALID [2022-04-15 12:57:05,182 INFO L290 TraceCheckUtils]: 22: Hoare triple {10952#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; {10952#false} is VALID [2022-04-15 12:57:05,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {11025#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10952#false} is VALID [2022-04-15 12:57:05,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {11025#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {11025#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:05,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {11025#(< 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; {11025#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:05,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {11025#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {11025#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:05,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {11021#(< 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; {11025#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:05,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {11017#(< 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; {11021#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:57:05,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {11013#(< 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; {11017#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:57:05,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {11095#(or (not (< 0 (mod main_~y~0 4294967296))) (< 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; {11013#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:57:05,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {11095#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 4) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {11095#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-15 12:57:05,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {11102#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 3) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11095#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-15 12:57:05,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {11106#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (not (< 0 (mod main_~y~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11102#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-15 12:57:05,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {11110#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11106#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (not (< 0 (mod main_~y~0 4294967296))))} is VALID [2022-04-15 12:57:05,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {11114#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11110#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-15 12:57:05,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {10951#true} ~z~0 := ~y~0; {11114#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 12:57:05,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {10951#true} [139] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10951#true} is VALID [2022-04-15 12:57:05,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {10951#true} [140] L16-2-->L16-3_primed: Formula: (or (and (<= v_main_~x~0_Out_44 v_main_~x~0_In_22) (= |v_main_#t~post6_Out_44| 0) (= |v_main_#t~post5_Out_44| 0) (= (+ v_main_~x~0_In_22 v_main_~y~0_In_22) (+ v_main_~y~0_Out_44 v_main_~x~0_Out_44)) (< 0 (mod (+ v_main_~x~0_Out_44 1) 4294967296))) (and (= v_main_~y~0_In_22 v_main_~y~0_Out_44) (= v_main_~x~0_In_22 v_main_~x~0_Out_44))) InVars {main_~x~0=v_main_~x~0_In_22, main_~y~0=v_main_~y~0_In_22} OutVars{main_~y~0=v_main_~y~0_Out_44, main_#t~post5=|v_main_#t~post5_Out_44|, main_~x~0=v_main_~x~0_Out_44, main_#t~post6=|v_main_#t~post6_Out_44|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10951#true} is VALID [2022-04-15 12:57:05,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {10951#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10951#true} is VALID [2022-04-15 12:57:05,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {10951#true} call #t~ret17 := main(); {10951#true} is VALID [2022-04-15 12:57:05,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10951#true} {10951#true} #94#return; {10951#true} is VALID [2022-04-15 12:57:05,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {10951#true} assume true; {10951#true} is VALID [2022-04-15 12:57:05,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {10951#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10951#true} is VALID [2022-04-15 12:57:05,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {10951#true} call ULTIMATE.init(); {10951#true} is VALID [2022-04-15 12:57:05,195 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:57:05,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918696276] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:57:05,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:57:05,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 23 [2022-04-15 12:57:05,322 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:57:05,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1977291736] [2022-04-15 12:57:05,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1977291736] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:57:05,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:57:05,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:57:05,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777434233] [2022-04-15 12:57:05,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:57:05,323 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 29 [2022-04-15 12:57:05,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:57:05,323 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-15 12:57:05,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:05,356 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:57:05,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:05,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:57:05,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2022-04-15 12:57:05,357 INFO L87 Difference]: Start difference. First operand 75 states and 97 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-15 12:57:08,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:08,701 INFO L93 Difference]: Finished difference Result 212 states and 298 transitions. [2022-04-15 12:57:08,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:57:08,702 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 29 [2022-04-15 12:57:08,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:57:08,702 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-15 12:57:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 118 transitions. [2022-04-15 12:57:08,703 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-15 12:57:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 118 transitions. [2022-04-15 12:57:08,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 118 transitions. [2022-04-15 12:57:08,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:08,948 INFO L225 Difference]: With dead ends: 212 [2022-04-15 12:57:08,948 INFO L226 Difference]: Without dead ends: 195 [2022-04-15 12:57:08,948 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 12:57:08,949 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 154 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:57:08,949 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 67 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:57:08,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-04-15 12:57:09,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 82. [2022-04-15 12:57:09,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:57:09,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 195 states. Second operand has 82 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 77 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:09,446 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states. Second operand has 82 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 77 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:09,447 INFO L87 Difference]: Start difference. First operand 195 states. Second operand has 82 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 77 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:09,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:09,449 INFO L93 Difference]: Finished difference Result 195 states and 270 transitions. [2022-04-15 12:57:09,449 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 270 transitions. [2022-04-15 12:57:09,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:09,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:09,450 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 77 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 195 states. [2022-04-15 12:57:09,450 INFO L87 Difference]: Start difference. First operand has 82 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 77 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 195 states. [2022-04-15 12:57:09,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:09,452 INFO L93 Difference]: Finished difference Result 195 states and 270 transitions. [2022-04-15 12:57:09,452 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 270 transitions. [2022-04-15 12:57:09,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:09,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:09,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:57:09,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:57:09,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 77 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:09,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 106 transitions. [2022-04-15 12:57:09,453 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 106 transitions. Word has length 29 [2022-04-15 12:57:09,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:57:09,454 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 106 transitions. [2022-04-15 12:57:09,454 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:09,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 106 transitions. [2022-04-15 12:57:12,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:12,670 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2022-04-15 12:57:12,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 12:57:12,670 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:57:12,670 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:57:12,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-15 12:57:12,870 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:57:12,871 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:57:12,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:57:12,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1093480841, now seen corresponding path program 4 times [2022-04-15 12:57:12,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:12,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1392720397] [2022-04-15 12:57:12,999 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:57:13,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1919690776, now seen corresponding path program 1 times [2022-04-15 12:57:13,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:57:13,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593357355] [2022-04-15 12:57:13,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:57:13,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:57:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:13,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:57:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:13,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {12156#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12144#true} is VALID [2022-04-15 12:57:13,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {12144#true} assume true; {12144#true} is VALID [2022-04-15 12:57:13,127 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12144#true} {12144#true} #94#return; {12144#true} is VALID [2022-04-15 12:57:13,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {12144#true} call ULTIMATE.init(); {12156#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:57:13,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {12156#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12144#true} is VALID [2022-04-15 12:57:13,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {12144#true} assume true; {12144#true} is VALID [2022-04-15 12:57:13,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12144#true} {12144#true} #94#return; {12144#true} is VALID [2022-04-15 12:57:13,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {12144#true} call #t~ret17 := main(); {12144#true} is VALID [2022-04-15 12:57:13,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {12144#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12144#true} is VALID [2022-04-15 12:57:13,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {12144#true} [142] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_23 v_main_~x~0_Out_46) (= v_main_~y~0_In_23 v_main_~y~0_Out_46)) (and (= |v_main_#t~post5_Out_46| 0) (= (+ v_main_~y~0_Out_46 v_main_~x~0_Out_46) (+ v_main_~x~0_In_23 v_main_~y~0_In_23)) (< 0 (mod (+ v_main_~x~0_Out_46 1) 4294967296)) (= |v_main_#t~post6_Out_46| 0) (<= v_main_~x~0_Out_46 v_main_~x~0_In_23))) InVars {main_~x~0=v_main_~x~0_In_23, main_~y~0=v_main_~y~0_In_23} OutVars{main_~y~0=v_main_~y~0_Out_46, main_#t~post5=|v_main_#t~post5_Out_46|, main_~x~0=v_main_~x~0_Out_46, main_#t~post6=|v_main_#t~post6_Out_46|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12144#true} is VALID [2022-04-15 12:57:13,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {12144#true} [141] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {12144#true} is VALID [2022-04-15 12:57:13,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {12144#true} ~z~0 := ~y~0; {12149#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:57:13,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {12149#(= 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; {12150#(and (= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0) (<= main_~y~0 (+ 4294967295 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:57:13,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {12150#(and (= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0) (<= main_~y~0 (+ 4294967295 (* (div 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; {12151#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:57:13,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {12151#(<= main_~z~0 (+ (* (div main_~z~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; {12152#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:13,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {12152#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {12152#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:13,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {12152#(<= main_~z~0 (+ 4294967292 (* (div 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; {12153#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 4294967293))} is VALID [2022-04-15 12:57:13,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {12153#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12154#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967294))} is VALID [2022-04-15 12:57:13,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {12154#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967294))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12155#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:57:13,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {12155#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {12155#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:57:13,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {12155#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12155#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:57:13,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {12155#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12155#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:57:13,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {12155#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12155#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:57:13,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {12155#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {12155#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:57:13,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {12155#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {12145#false} is VALID [2022-04-15 12:57:13,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {12145#false} assume !(~y~0 % 4294967296 > 0); {12145#false} is VALID [2022-04-15 12:57:13,142 INFO L272 TraceCheckUtils]: 23: Hoare triple {12145#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12145#false} is VALID [2022-04-15 12:57:13,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {12145#false} ~cond := #in~cond; {12145#false} is VALID [2022-04-15 12:57:13,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {12145#false} assume 0 == ~cond; {12145#false} is VALID [2022-04-15 12:57:13,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {12145#false} assume !false; {12145#false} is VALID [2022-04-15 12:57:13,142 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:57:13,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:57:13,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593357355] [2022-04-15 12:57:13,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593357355] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:57:13,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569857373] [2022-04-15 12:57:13,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:57:13,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:57:13,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:57:13,143 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:57:13,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 12:57:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:13,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 12:57:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:13,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:57:13,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {12144#true} call ULTIMATE.init(); {12144#true} is VALID [2022-04-15 12:57:13,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {12144#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12144#true} is VALID [2022-04-15 12:57:13,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {12144#true} assume true; {12144#true} is VALID [2022-04-15 12:57:13,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12144#true} {12144#true} #94#return; {12144#true} is VALID [2022-04-15 12:57:13,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {12144#true} call #t~ret17 := main(); {12144#true} is VALID [2022-04-15 12:57:13,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {12144#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12144#true} is VALID [2022-04-15 12:57:13,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {12144#true} [142] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_23 v_main_~x~0_Out_46) (= v_main_~y~0_In_23 v_main_~y~0_Out_46)) (and (= |v_main_#t~post5_Out_46| 0) (= (+ v_main_~y~0_Out_46 v_main_~x~0_Out_46) (+ v_main_~x~0_In_23 v_main_~y~0_In_23)) (< 0 (mod (+ v_main_~x~0_Out_46 1) 4294967296)) (= |v_main_#t~post6_Out_46| 0) (<= v_main_~x~0_Out_46 v_main_~x~0_In_23))) InVars {main_~x~0=v_main_~x~0_In_23, main_~y~0=v_main_~y~0_In_23} OutVars{main_~y~0=v_main_~y~0_Out_46, main_#t~post5=|v_main_#t~post5_Out_46|, main_~x~0=v_main_~x~0_Out_46, main_#t~post6=|v_main_#t~post6_Out_46|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12144#true} is VALID [2022-04-15 12:57:13,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {12144#true} [141] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {12144#true} is VALID [2022-04-15 12:57:13,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {12144#true} ~z~0 := ~y~0; {12144#true} is VALID [2022-04-15 12:57:13,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {12144#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12144#true} is VALID [2022-04-15 12:57:13,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {12144#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12144#true} is VALID [2022-04-15 12:57:13,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {12144#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12144#true} is VALID [2022-04-15 12:57:13,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {12144#true} assume !(~z~0 % 4294967296 > 0); {12144#true} is VALID [2022-04-15 12:57:13,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {12144#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12199#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 12:57:13,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {12199#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12203#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 12:57:13,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {12203#(< 0 (mod (+ main_~y~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; {12207#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 12:57:13,346 INFO L290 TraceCheckUtils]: 16: Hoare triple {12207#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !(~y~0 % 4294967296 > 0); {12207#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 12:57:13,347 INFO L290 TraceCheckUtils]: 17: Hoare triple {12207#(< 0 (mod (+ main_~y~0 3) 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; {12203#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 12:57:13,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {12203#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12199#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 12:57:13,350 INFO L290 TraceCheckUtils]: 19: Hoare triple {12199#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12220#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:57:13,350 INFO L290 TraceCheckUtils]: 20: Hoare triple {12220#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {12220#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:57:13,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {12220#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {12220#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:57:13,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {12220#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {12145#false} is VALID [2022-04-15 12:57:13,351 INFO L272 TraceCheckUtils]: 23: Hoare triple {12145#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12145#false} is VALID [2022-04-15 12:57:13,351 INFO L290 TraceCheckUtils]: 24: Hoare triple {12145#false} ~cond := #in~cond; {12145#false} is VALID [2022-04-15 12:57:13,351 INFO L290 TraceCheckUtils]: 25: Hoare triple {12145#false} assume 0 == ~cond; {12145#false} is VALID [2022-04-15 12:57:13,351 INFO L290 TraceCheckUtils]: 26: Hoare triple {12145#false} assume !false; {12145#false} is VALID [2022-04-15 12:57:13,351 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-15 12:57:13,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:57:13,423 INFO L290 TraceCheckUtils]: 26: Hoare triple {12145#false} assume !false; {12145#false} is VALID [2022-04-15 12:57:13,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {12145#false} assume 0 == ~cond; {12145#false} is VALID [2022-04-15 12:57:13,424 INFO L290 TraceCheckUtils]: 24: Hoare triple {12145#false} ~cond := #in~cond; {12145#false} is VALID [2022-04-15 12:57:13,424 INFO L272 TraceCheckUtils]: 23: Hoare triple {12145#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12145#false} is VALID [2022-04-15 12:57:13,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {12220#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {12145#false} is VALID [2022-04-15 12:57:13,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {12220#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {12220#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:57:13,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {12220#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {12220#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:57:13,427 INFO L290 TraceCheckUtils]: 19: Hoare triple {12199#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12220#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:57:13,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {12203#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12199#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 12:57:13,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {12207#(< 0 (mod (+ main_~y~0 3) 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; {12203#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 12:57:13,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {12207#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !(~y~0 % 4294967296 > 0); {12207#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 12:57:13,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {12203#(< 0 (mod (+ main_~y~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; {12207#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 12:57:13,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {12199#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12203#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 12:57:13,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {12144#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12199#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 12:57:13,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {12144#true} assume !(~z~0 % 4294967296 > 0); {12144#true} is VALID [2022-04-15 12:57:13,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {12144#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12144#true} is VALID [2022-04-15 12:57:13,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {12144#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12144#true} is VALID [2022-04-15 12:57:13,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {12144#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12144#true} is VALID [2022-04-15 12:57:13,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {12144#true} ~z~0 := ~y~0; {12144#true} is VALID [2022-04-15 12:57:13,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {12144#true} [141] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {12144#true} is VALID [2022-04-15 12:57:13,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {12144#true} [142] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_23 v_main_~x~0_Out_46) (= v_main_~y~0_In_23 v_main_~y~0_Out_46)) (and (= |v_main_#t~post5_Out_46| 0) (= (+ v_main_~y~0_Out_46 v_main_~x~0_Out_46) (+ v_main_~x~0_In_23 v_main_~y~0_In_23)) (< 0 (mod (+ v_main_~x~0_Out_46 1) 4294967296)) (= |v_main_#t~post6_Out_46| 0) (<= v_main_~x~0_Out_46 v_main_~x~0_In_23))) InVars {main_~x~0=v_main_~x~0_In_23, main_~y~0=v_main_~y~0_In_23} OutVars{main_~y~0=v_main_~y~0_Out_46, main_#t~post5=|v_main_#t~post5_Out_46|, main_~x~0=v_main_~x~0_Out_46, main_#t~post6=|v_main_#t~post6_Out_46|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12144#true} is VALID [2022-04-15 12:57:13,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {12144#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12144#true} is VALID [2022-04-15 12:57:13,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {12144#true} call #t~ret17 := main(); {12144#true} is VALID [2022-04-15 12:57:13,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12144#true} {12144#true} #94#return; {12144#true} is VALID [2022-04-15 12:57:13,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {12144#true} assume true; {12144#true} is VALID [2022-04-15 12:57:13,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {12144#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12144#true} is VALID [2022-04-15 12:57:13,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {12144#true} call ULTIMATE.init(); {12144#true} is VALID [2022-04-15 12:57:13,436 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-15 12:57:13,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569857373] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:57:13,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:57:13,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 14 [2022-04-15 12:57:13,596 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:57:13,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1392720397] [2022-04-15 12:57:13,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1392720397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:57:13,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:57:13,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 12:57:13,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579912174] [2022-04-15 12:57:13,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:57:13,597 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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 29 [2022-04-15 12:57:13,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:57:13,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:13,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:13,634 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 12:57:13,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:13,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 12:57:13,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:57:13,634 INFO L87 Difference]: Start difference. First operand 82 states and 106 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:18,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:18,332 INFO L93 Difference]: Finished difference Result 173 states and 237 transitions. [2022-04-15 12:57:18,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 12:57:18,332 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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 29 [2022-04-15 12:57:18,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:57:18,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:18,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 133 transitions. [2022-04-15 12:57:18,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 133 transitions. [2022-04-15 12:57:18,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 133 transitions. [2022-04-15 12:57:18,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:18,637 INFO L225 Difference]: With dead ends: 173 [2022-04-15 12:57:18,637 INFO L226 Difference]: Without dead ends: 167 [2022-04-15 12:57:18,637 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=230, Invalid=1252, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:57:18,637 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 80 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:57:18,638 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 67 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 12:57:18,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-15 12:57:19,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 90. [2022-04-15 12:57:19,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:57:19,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 90 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 85 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:19,217 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 90 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 85 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:19,217 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 90 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 85 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:19,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:19,219 INFO L93 Difference]: Finished difference Result 167 states and 228 transitions. [2022-04-15 12:57:19,219 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 228 transitions. [2022-04-15 12:57:19,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:19,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:19,220 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 85 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states. [2022-04-15 12:57:19,220 INFO L87 Difference]: Start difference. First operand has 90 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 85 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states. [2022-04-15 12:57:19,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:19,222 INFO L93 Difference]: Finished difference Result 167 states and 228 transitions. [2022-04-15 12:57:19,222 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 228 transitions. [2022-04-15 12:57:19,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:19,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:19,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:57:19,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:57:19,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 85 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:19,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2022-04-15 12:57:19,223 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 115 transitions. Word has length 29 [2022-04-15 12:57:19,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:57:19,224 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 115 transitions. [2022-04-15 12:57:19,224 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:19,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 115 transitions. [2022-04-15 12:57:20,519 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-15 12:57:20,520 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2022-04-15 12:57:20,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 12:57:20,520 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:57:20,520 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:57:20,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-15 12:57:20,720 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-15 12:57:20,720 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:57:20,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:57:20,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1414418204, now seen corresponding path program 5 times [2022-04-15 12:57:20,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:20,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1785503150] [2022-04-15 12:57:20,850 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:57:20,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1698563590, now seen corresponding path program 1 times [2022-04-15 12:57:20,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:57:20,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927241545] [2022-04-15 12:57:20,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:57:20,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:57:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:20,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:57:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:20,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {13238#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13230#true} is VALID [2022-04-15 12:57:20,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {13230#true} assume true; {13230#true} is VALID [2022-04-15 12:57:20,957 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13230#true} {13230#true} #94#return; {13230#true} is VALID [2022-04-15 12:57:20,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {13230#true} call ULTIMATE.init(); {13238#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:57:20,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {13238#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13230#true} is VALID [2022-04-15 12:57:20,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {13230#true} assume true; {13230#true} is VALID [2022-04-15 12:57:20,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13230#true} {13230#true} #94#return; {13230#true} is VALID [2022-04-15 12:57:20,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {13230#true} call #t~ret17 := main(); {13230#true} is VALID [2022-04-15 12:57:20,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {13230#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13230#true} is VALID [2022-04-15 12:57:20,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {13230#true} [144] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_24 v_main_~x~0_Out_48) (= v_main_~y~0_In_24 v_main_~y~0_Out_48)) (and (= (+ v_main_~x~0_In_24 v_main_~y~0_In_24) (+ v_main_~y~0_Out_48 v_main_~x~0_Out_48)) (<= v_main_~x~0_Out_48 v_main_~x~0_In_24) (< 0 (mod (+ v_main_~x~0_Out_48 1) 4294967296)) (= |v_main_#t~post6_Out_48| 0) (= |v_main_#t~post5_Out_48| 0))) InVars {main_~x~0=v_main_~x~0_In_24, main_~y~0=v_main_~y~0_In_24} OutVars{main_~y~0=v_main_~y~0_Out_48, main_#t~post5=|v_main_#t~post5_Out_48|, main_~x~0=v_main_~x~0_Out_48, main_#t~post6=|v_main_#t~post6_Out_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13230#true} is VALID [2022-04-15 12:57:20,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {13230#true} [143] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {13230#true} is VALID [2022-04-15 12:57:20,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {13230#true} ~z~0 := ~y~0; {13230#true} is VALID [2022-04-15 12:57:20,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {13230#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13230#true} is VALID [2022-04-15 12:57:20,959 INFO L290 TraceCheckUtils]: 10: Hoare triple {13230#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13230#true} is VALID [2022-04-15 12:57:20,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {13230#true} assume !(~z~0 % 4294967296 > 0); {13235#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:57:20,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {13235#(<= main_~z~0 (* (div 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; {13236#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:57:20,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {13236#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 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; {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:57:20,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~y~0 % 4294967296 > 0); {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:57:20,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:57:20,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:57:20,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~x~0 % 4294967296 > 0); {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:57:20,969 INFO L290 TraceCheckUtils]: 18: Hoare triple {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {13236#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:57:20,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {13236#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 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; {13235#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:57:20,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {13235#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13231#false} is VALID [2022-04-15 12:57:20,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {13231#false} assume !(~z~0 % 4294967296 > 0); {13231#false} is VALID [2022-04-15 12:57:20,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {13231#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; {13231#false} is VALID [2022-04-15 12:57:20,973 INFO L290 TraceCheckUtils]: 23: Hoare triple {13231#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; {13231#false} is VALID [2022-04-15 12:57:20,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {13231#false} assume !(~y~0 % 4294967296 > 0); {13231#false} is VALID [2022-04-15 12:57:20,973 INFO L272 TraceCheckUtils]: 25: Hoare triple {13231#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13231#false} is VALID [2022-04-15 12:57:20,973 INFO L290 TraceCheckUtils]: 26: Hoare triple {13231#false} ~cond := #in~cond; {13231#false} is VALID [2022-04-15 12:57:20,973 INFO L290 TraceCheckUtils]: 27: Hoare triple {13231#false} assume 0 == ~cond; {13231#false} is VALID [2022-04-15 12:57:20,974 INFO L290 TraceCheckUtils]: 28: Hoare triple {13231#false} assume !false; {13231#false} is VALID [2022-04-15 12:57:20,974 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 12:57:20,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:57:20,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927241545] [2022-04-15 12:57:20,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927241545] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:57:20,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207476588] [2022-04-15 12:57:20,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:57:20,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:57:20,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:57:20,975 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:57:20,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 12:57:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:21,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 12:57:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:21,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:57:21,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {13230#true} call ULTIMATE.init(); {13230#true} is VALID [2022-04-15 12:57:21,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {13230#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13230#true} is VALID [2022-04-15 12:57:21,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {13230#true} assume true; {13230#true} is VALID [2022-04-15 12:57:21,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13230#true} {13230#true} #94#return; {13230#true} is VALID [2022-04-15 12:57:21,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {13230#true} call #t~ret17 := main(); {13230#true} is VALID [2022-04-15 12:57:21,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {13230#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13230#true} is VALID [2022-04-15 12:57:21,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {13230#true} [144] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_24 v_main_~x~0_Out_48) (= v_main_~y~0_In_24 v_main_~y~0_Out_48)) (and (= (+ v_main_~x~0_In_24 v_main_~y~0_In_24) (+ v_main_~y~0_Out_48 v_main_~x~0_Out_48)) (<= v_main_~x~0_Out_48 v_main_~x~0_In_24) (< 0 (mod (+ v_main_~x~0_Out_48 1) 4294967296)) (= |v_main_#t~post6_Out_48| 0) (= |v_main_#t~post5_Out_48| 0))) InVars {main_~x~0=v_main_~x~0_In_24, main_~y~0=v_main_~y~0_In_24} OutVars{main_~y~0=v_main_~y~0_Out_48, main_#t~post5=|v_main_#t~post5_Out_48|, main_~x~0=v_main_~x~0_Out_48, main_#t~post6=|v_main_#t~post6_Out_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13230#true} is VALID [2022-04-15 12:57:21,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {13230#true} [143] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {13230#true} is VALID [2022-04-15 12:57:21,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {13230#true} ~z~0 := ~y~0; {13230#true} is VALID [2022-04-15 12:57:21,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {13230#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13230#true} is VALID [2022-04-15 12:57:21,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {13230#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13230#true} is VALID [2022-04-15 12:57:21,239 INFO L290 TraceCheckUtils]: 11: Hoare triple {13230#true} assume !(~z~0 % 4294967296 > 0); {13235#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:57:21,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {13235#(<= main_~z~0 (* (div 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; {13236#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:57:21,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {13236#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 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; {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:57:21,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~y~0 % 4294967296 > 0); {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:57:21,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:57:21,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:57:21,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~x~0 % 4294967296 > 0); {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:57:21,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {13236#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:57:21,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {13236#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 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; {13235#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:57:21,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {13235#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13231#false} is VALID [2022-04-15 12:57:21,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {13231#false} assume !(~z~0 % 4294967296 > 0); {13231#false} is VALID [2022-04-15 12:57:21,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {13231#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; {13231#false} is VALID [2022-04-15 12:57:21,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {13231#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; {13231#false} is VALID [2022-04-15 12:57:21,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {13231#false} assume !(~y~0 % 4294967296 > 0); {13231#false} is VALID [2022-04-15 12:57:21,252 INFO L272 TraceCheckUtils]: 25: Hoare triple {13231#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13231#false} is VALID [2022-04-15 12:57:21,252 INFO L290 TraceCheckUtils]: 26: Hoare triple {13231#false} ~cond := #in~cond; {13231#false} is VALID [2022-04-15 12:57:21,252 INFO L290 TraceCheckUtils]: 27: Hoare triple {13231#false} assume 0 == ~cond; {13231#false} is VALID [2022-04-15 12:57:21,252 INFO L290 TraceCheckUtils]: 28: Hoare triple {13231#false} assume !false; {13231#false} is VALID [2022-04-15 12:57:21,253 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 12:57:21,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:57:21,506 INFO L290 TraceCheckUtils]: 28: Hoare triple {13231#false} assume !false; {13231#false} is VALID [2022-04-15 12:57:21,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {13231#false} assume 0 == ~cond; {13231#false} is VALID [2022-04-15 12:57:21,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {13231#false} ~cond := #in~cond; {13231#false} is VALID [2022-04-15 12:57:21,507 INFO L272 TraceCheckUtils]: 25: Hoare triple {13231#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13231#false} is VALID [2022-04-15 12:57:21,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {13231#false} assume !(~y~0 % 4294967296 > 0); {13231#false} is VALID [2022-04-15 12:57:21,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {13231#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; {13231#false} is VALID [2022-04-15 12:57:21,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {13231#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; {13231#false} is VALID [2022-04-15 12:57:21,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {13231#false} assume !(~z~0 % 4294967296 > 0); {13231#false} is VALID [2022-04-15 12:57:21,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {13235#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13231#false} is VALID [2022-04-15 12:57:21,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {13236#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 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; {13235#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:57:21,516 INFO L290 TraceCheckUtils]: 18: Hoare triple {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {13236#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:57:21,516 INFO L290 TraceCheckUtils]: 17: Hoare triple {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~x~0 % 4294967296 > 0); {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:57:21,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:57:21,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:57:21,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~y~0 % 4294967296 > 0); {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:57:21,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {13236#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 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; {13237#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:57:21,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {13235#(<= main_~z~0 (* (div 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; {13236#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:57:21,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {13230#true} assume !(~z~0 % 4294967296 > 0); {13235#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:57:21,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {13230#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13230#true} is VALID [2022-04-15 12:57:21,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {13230#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13230#true} is VALID [2022-04-15 12:57:21,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {13230#true} ~z~0 := ~y~0; {13230#true} is VALID [2022-04-15 12:57:21,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {13230#true} [143] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {13230#true} is VALID [2022-04-15 12:57:21,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {13230#true} [144] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_24 v_main_~x~0_Out_48) (= v_main_~y~0_In_24 v_main_~y~0_Out_48)) (and (= (+ v_main_~x~0_In_24 v_main_~y~0_In_24) (+ v_main_~y~0_Out_48 v_main_~x~0_Out_48)) (<= v_main_~x~0_Out_48 v_main_~x~0_In_24) (< 0 (mod (+ v_main_~x~0_Out_48 1) 4294967296)) (= |v_main_#t~post6_Out_48| 0) (= |v_main_#t~post5_Out_48| 0))) InVars {main_~x~0=v_main_~x~0_In_24, main_~y~0=v_main_~y~0_In_24} OutVars{main_~y~0=v_main_~y~0_Out_48, main_#t~post5=|v_main_#t~post5_Out_48|, main_~x~0=v_main_~x~0_Out_48, main_#t~post6=|v_main_#t~post6_Out_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13230#true} is VALID [2022-04-15 12:57:21,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {13230#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13230#true} is VALID [2022-04-15 12:57:21,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {13230#true} call #t~ret17 := main(); {13230#true} is VALID [2022-04-15 12:57:21,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13230#true} {13230#true} #94#return; {13230#true} is VALID [2022-04-15 12:57:21,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {13230#true} assume true; {13230#true} is VALID [2022-04-15 12:57:21,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {13230#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13230#true} is VALID [2022-04-15 12:57:21,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {13230#true} call ULTIMATE.init(); {13230#true} is VALID [2022-04-15 12:57:21,525 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 12:57:21,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207476588] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:57:21,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:57:21,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-04-15 12:57:21,594 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:57:21,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1785503150] [2022-04-15 12:57:21,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1785503150] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:57:21,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:57:21,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:57:21,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537239116] [2022-04-15 12:57:21,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:57:21,595 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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 30 [2022-04-15 12:57:21,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:57:21,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:21,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:21,644 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:57:21,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:21,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:57:21,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:57:21,644 INFO L87 Difference]: Start difference. First operand 90 states and 115 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:24,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:24,099 INFO L93 Difference]: Finished difference Result 148 states and 196 transitions. [2022-04-15 12:57:24,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 12:57:24,099 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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 30 [2022-04-15 12:57:24,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:57:24,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:24,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 87 transitions. [2022-04-15 12:57:24,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:24,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 87 transitions. [2022-04-15 12:57:24,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 87 transitions. [2022-04-15 12:57:24,265 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-15 12:57:24,266 INFO L225 Difference]: With dead ends: 148 [2022-04-15 12:57:24,266 INFO L226 Difference]: Without dead ends: 137 [2022-04-15 12:57:24,267 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:57:24,267 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 51 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:57:24,267 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 48 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:57:24,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-15 12:57:24,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 90. [2022-04-15 12:57:24,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:57:24,862 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:24,862 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:24,862 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:24,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:24,864 INFO L93 Difference]: Finished difference Result 137 states and 182 transitions. [2022-04-15 12:57:24,864 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 182 transitions. [2022-04-15 12:57:24,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:24,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:24,864 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 137 states. [2022-04-15 12:57:24,865 INFO L87 Difference]: Start difference. First operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 137 states. [2022-04-15 12:57:24,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:24,866 INFO L93 Difference]: Finished difference Result 137 states and 182 transitions. [2022-04-15 12:57:24,866 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 182 transitions. [2022-04-15 12:57:24,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:24,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:24,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:57:24,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:57:24,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:24,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 114 transitions. [2022-04-15 12:57:24,867 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 114 transitions. Word has length 30 [2022-04-15 12:57:24,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:57:24,868 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 114 transitions. [2022-04-15 12:57:24,868 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:24,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 114 transitions. [2022-04-15 12:57:26,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:26,159 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2022-04-15 12:57:26,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 12:57:26,159 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:57:26,159 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:57:26,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-15 12:57:26,360 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-15 12:57:26,360 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:57:26,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:57:26,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1097440363, now seen corresponding path program 5 times [2022-04-15 12:57:26,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:26,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1506814613] [2022-04-15 12:57:26,452 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:57:26,454 INFO L85 PathProgramCache]: Analyzing trace with hash 428957815, now seen corresponding path program 1 times [2022-04-15 12:57:26,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:57:26,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880130240] [2022-04-15 12:57:26,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:57:26,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:57:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:26,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:57:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:26,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {14203#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14188#true} is VALID [2022-04-15 12:57:26,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {14188#true} assume true; {14188#true} is VALID [2022-04-15 12:57:26,677 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14188#true} {14188#true} #94#return; {14188#true} is VALID [2022-04-15 12:57:26,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {14188#true} call ULTIMATE.init(); {14203#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:57:26,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {14203#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14188#true} is VALID [2022-04-15 12:57:26,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {14188#true} assume true; {14188#true} is VALID [2022-04-15 12:57:26,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14188#true} {14188#true} #94#return; {14188#true} is VALID [2022-04-15 12:57:26,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {14188#true} call #t~ret17 := main(); {14188#true} is VALID [2022-04-15 12:57:26,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {14188#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14188#true} is VALID [2022-04-15 12:57:26,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {14188#true} [146] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_50| 0) (= (+ v_main_~x~0_In_25 v_main_~y~0_In_25) (+ v_main_~y~0_Out_50 v_main_~x~0_Out_50)) (<= v_main_~x~0_Out_50 v_main_~x~0_In_25) (< 0 (mod (+ v_main_~x~0_Out_50 1) 4294967296)) (= |v_main_#t~post6_Out_50| 0)) (and (= v_main_~y~0_In_25 v_main_~y~0_Out_50) (= v_main_~x~0_In_25 v_main_~x~0_Out_50))) InVars {main_~x~0=v_main_~x~0_In_25, main_~y~0=v_main_~y~0_In_25} OutVars{main_~y~0=v_main_~y~0_Out_50, main_#t~post5=|v_main_#t~post5_Out_50|, main_~x~0=v_main_~x~0_Out_50, main_#t~post6=|v_main_#t~post6_Out_50|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14188#true} is VALID [2022-04-15 12:57:26,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {14188#true} [145] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {14188#true} is VALID [2022-04-15 12:57:26,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {14188#true} ~z~0 := ~y~0; {14193#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:57:26,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {14193#(and (<= main_~y~0 main_~z~0) (<= 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; {14194#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:57:26,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {14194#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14195#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:57:26,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {14195#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) 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; {14196#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:57:26,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {14196#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14197#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:57:26,686 INFO L290 TraceCheckUtils]: 13: Hoare triple {14197#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14198#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:57:26,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {14198#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {14198#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:57:26,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {14198#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14199#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:57:26,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {14199#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14200#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:57:26,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {14200#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14201#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:57:26,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {14201#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {14202#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:57:26,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {14202#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {14189#false} is VALID [2022-04-15 12:57:26,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {14189#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; {14189#false} is VALID [2022-04-15 12:57:26,699 INFO L290 TraceCheckUtils]: 21: Hoare triple {14189#false} assume !(~x~0 % 4294967296 > 0); {14189#false} is VALID [2022-04-15 12:57:26,699 INFO L290 TraceCheckUtils]: 22: Hoare triple {14189#false} assume !(~z~0 % 4294967296 > 0); {14189#false} is VALID [2022-04-15 12:57:26,699 INFO L290 TraceCheckUtils]: 23: Hoare triple {14189#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; {14189#false} is VALID [2022-04-15 12:57:26,699 INFO L290 TraceCheckUtils]: 24: Hoare triple {14189#false} assume !(~y~0 % 4294967296 > 0); {14189#false} is VALID [2022-04-15 12:57:26,699 INFO L272 TraceCheckUtils]: 25: Hoare triple {14189#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14189#false} is VALID [2022-04-15 12:57:26,700 INFO L290 TraceCheckUtils]: 26: Hoare triple {14189#false} ~cond := #in~cond; {14189#false} is VALID [2022-04-15 12:57:26,700 INFO L290 TraceCheckUtils]: 27: Hoare triple {14189#false} assume 0 == ~cond; {14189#false} is VALID [2022-04-15 12:57:26,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {14189#false} assume !false; {14189#false} is VALID [2022-04-15 12:57:26,700 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:57:26,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:57:26,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880130240] [2022-04-15 12:57:26,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880130240] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:57:26,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371221960] [2022-04-15 12:57:26,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:57:26,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:57:26,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:57:26,701 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:57:26,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-15 12:57:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:26,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 12:57:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:26,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:57:27,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {14188#true} call ULTIMATE.init(); {14188#true} is VALID [2022-04-15 12:57:27,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {14188#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14188#true} is VALID [2022-04-15 12:57:27,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {14188#true} assume true; {14188#true} is VALID [2022-04-15 12:57:27,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14188#true} {14188#true} #94#return; {14188#true} is VALID [2022-04-15 12:57:27,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {14188#true} call #t~ret17 := main(); {14188#true} is VALID [2022-04-15 12:57:27,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {14188#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14188#true} is VALID [2022-04-15 12:57:27,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {14188#true} [146] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_50| 0) (= (+ v_main_~x~0_In_25 v_main_~y~0_In_25) (+ v_main_~y~0_Out_50 v_main_~x~0_Out_50)) (<= v_main_~x~0_Out_50 v_main_~x~0_In_25) (< 0 (mod (+ v_main_~x~0_Out_50 1) 4294967296)) (= |v_main_#t~post6_Out_50| 0)) (and (= v_main_~y~0_In_25 v_main_~y~0_Out_50) (= v_main_~x~0_In_25 v_main_~x~0_Out_50))) InVars {main_~x~0=v_main_~x~0_In_25, main_~y~0=v_main_~y~0_In_25} OutVars{main_~y~0=v_main_~y~0_Out_50, main_#t~post5=|v_main_#t~post5_Out_50|, main_~x~0=v_main_~x~0_Out_50, main_#t~post6=|v_main_#t~post6_Out_50|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14188#true} is VALID [2022-04-15 12:57:27,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {14188#true} [145] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {14188#true} is VALID [2022-04-15 12:57:27,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {14188#true} ~z~0 := ~y~0; {14193#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:57:27,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {14193#(and (<= main_~y~0 main_~z~0) (<= 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; {14194#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:57:27,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {14194#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14195#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:57:27,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {14195#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) 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; {14196#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:57:27,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {14196#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14197#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:57:27,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {14197#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14198#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:57:27,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {14198#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {14198#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:57:27,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {14198#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14199#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:57:27,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {14199#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14200#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:57:27,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {14200#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14201#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:57:27,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {14201#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {14202#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:57:27,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {14202#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {14202#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:57:27,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {14202#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14201#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:57:27,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {14201#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {14201#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:57:27,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {14201#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {14201#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:57:27,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {14201#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {14202#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:57:27,196 INFO L290 TraceCheckUtils]: 24: Hoare triple {14202#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {14189#false} is VALID [2022-04-15 12:57:27,196 INFO L272 TraceCheckUtils]: 25: Hoare triple {14189#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14189#false} is VALID [2022-04-15 12:57:27,196 INFO L290 TraceCheckUtils]: 26: Hoare triple {14189#false} ~cond := #in~cond; {14189#false} is VALID [2022-04-15 12:57:27,196 INFO L290 TraceCheckUtils]: 27: Hoare triple {14189#false} assume 0 == ~cond; {14189#false} is VALID [2022-04-15 12:57:27,196 INFO L290 TraceCheckUtils]: 28: Hoare triple {14189#false} assume !false; {14189#false} is VALID [2022-04-15 12:57:27,196 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:57:27,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:57:27,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {14189#false} assume !false; {14189#false} is VALID [2022-04-15 12:57:27,685 INFO L290 TraceCheckUtils]: 27: Hoare triple {14189#false} assume 0 == ~cond; {14189#false} is VALID [2022-04-15 12:57:27,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {14189#false} ~cond := #in~cond; {14189#false} is VALID [2022-04-15 12:57:27,685 INFO L272 TraceCheckUtils]: 25: Hoare triple {14189#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14189#false} is VALID [2022-04-15 12:57:27,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {14202#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {14189#false} is VALID [2022-04-15 12:57:27,691 INFO L290 TraceCheckUtils]: 23: Hoare triple {14201#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {14202#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:57:27,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {14201#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {14201#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:57:27,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {14201#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {14201#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:57:27,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {14202#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14201#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:57:27,694 INFO L290 TraceCheckUtils]: 19: Hoare triple {14202#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {14202#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:57:27,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {14201#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {14202#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:57:27,697 INFO L290 TraceCheckUtils]: 17: Hoare triple {14200#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14201#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:57:27,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {14199#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14200#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:57:27,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {14198#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14199#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:57:27,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {14198#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {14198#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:57:27,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {14336#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (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; {14198#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:57:27,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {14340#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14336#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 12:57:27,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {14344#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 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; {14340#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)))} is VALID [2022-04-15 12:57:27,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {14348#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14344#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 12:57:27,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {14352#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14348#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} is VALID [2022-04-15 12:57:27,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {14188#true} ~z~0 := ~y~0; {14352#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-15 12:57:27,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {14188#true} [145] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {14188#true} is VALID [2022-04-15 12:57:27,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {14188#true} [146] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_50| 0) (= (+ v_main_~x~0_In_25 v_main_~y~0_In_25) (+ v_main_~y~0_Out_50 v_main_~x~0_Out_50)) (<= v_main_~x~0_Out_50 v_main_~x~0_In_25) (< 0 (mod (+ v_main_~x~0_Out_50 1) 4294967296)) (= |v_main_#t~post6_Out_50| 0)) (and (= v_main_~y~0_In_25 v_main_~y~0_Out_50) (= v_main_~x~0_In_25 v_main_~x~0_Out_50))) InVars {main_~x~0=v_main_~x~0_In_25, main_~y~0=v_main_~y~0_In_25} OutVars{main_~y~0=v_main_~y~0_Out_50, main_#t~post5=|v_main_#t~post5_Out_50|, main_~x~0=v_main_~x~0_Out_50, main_#t~post6=|v_main_#t~post6_Out_50|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14188#true} is VALID [2022-04-15 12:57:27,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {14188#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14188#true} is VALID [2022-04-15 12:57:27,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {14188#true} call #t~ret17 := main(); {14188#true} is VALID [2022-04-15 12:57:27,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14188#true} {14188#true} #94#return; {14188#true} is VALID [2022-04-15 12:57:27,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {14188#true} assume true; {14188#true} is VALID [2022-04-15 12:57:27,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {14188#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14188#true} is VALID [2022-04-15 12:57:27,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {14188#true} call ULTIMATE.init(); {14188#true} is VALID [2022-04-15 12:57:27,716 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:57:27,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371221960] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:57:27,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:57:27,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 18 [2022-04-15 12:57:27,845 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:57:27,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1506814613] [2022-04-15 12:57:27,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1506814613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:57:27,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:57:27,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 12:57:27,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177851689] [2022-04-15 12:57:27,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:57:27,846 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 30 [2022-04-15 12:57:27,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:57:27,846 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-15 12:57:27,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:27,889 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 12:57:27,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:27,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 12:57:27,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:57:27,890 INFO L87 Difference]: Start difference. First operand 90 states and 114 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-15 12:57:37,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:37,200 INFO L93 Difference]: Finished difference Result 181 states and 253 transitions. [2022-04-15 12:57:37,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-15 12:57:37,200 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 30 [2022-04-15 12:57:37,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:57:37,200 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-15 12:57:37,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 177 transitions. [2022-04-15 12:57:37,202 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-15 12:57:37,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 177 transitions. [2022-04-15 12:57:37,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 177 transitions. [2022-04-15 12:57:37,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:37,942 INFO L225 Difference]: With dead ends: 181 [2022-04-15 12:57:37,942 INFO L226 Difference]: Without dead ends: 150 [2022-04-15 12:57:37,944 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 59 SyntacticMatches, 10 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1857 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=953, Invalid=5367, Unknown=0, NotChecked=0, Total=6320 [2022-04-15 12:57:37,944 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 138 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:57:37,944 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 77 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-15 12:57:37,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-15 12:57:38,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 111. [2022-04-15 12:57:38,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:57:38,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 111 states, 106 states have (on average 1.320754716981132) internal successors, (140), 106 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:38,756 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 111 states, 106 states have (on average 1.320754716981132) internal successors, (140), 106 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:38,756 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 111 states, 106 states have (on average 1.320754716981132) internal successors, (140), 106 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:38,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:38,757 INFO L93 Difference]: Finished difference Result 150 states and 205 transitions. [2022-04-15 12:57:38,757 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 205 transitions. [2022-04-15 12:57:38,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:38,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:38,758 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 106 states have (on average 1.320754716981132) internal successors, (140), 106 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 150 states. [2022-04-15 12:57:38,758 INFO L87 Difference]: Start difference. First operand has 111 states, 106 states have (on average 1.320754716981132) internal successors, (140), 106 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 150 states. [2022-04-15 12:57:38,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:38,759 INFO L93 Difference]: Finished difference Result 150 states and 205 transitions. [2022-04-15 12:57:38,759 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 205 transitions. [2022-04-15 12:57:38,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:38,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:38,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:57:38,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:57:38,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.320754716981132) internal successors, (140), 106 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:38,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 144 transitions. [2022-04-15 12:57:38,761 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 144 transitions. Word has length 30 [2022-04-15 12:57:38,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:57:38,761 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 144 transitions. [2022-04-15 12:57:38,761 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:38,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 144 transitions. [2022-04-15 12:57:44,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:44,863 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 144 transitions. [2022-04-15 12:57:44,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 12:57:44,863 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:57:44,863 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:57:44,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-15 12:57:45,064 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-15 12:57:45,064 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:57:45,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:57:45,064 INFO L85 PathProgramCache]: Analyzing trace with hash -629277016, now seen corresponding path program 6 times [2022-04-15 12:57:45,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:45,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1274925466] [2022-04-15 12:57:45,194 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:57:45,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1799941702, now seen corresponding path program 1 times [2022-04-15 12:57:45,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:57:45,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182095988] [2022-04-15 12:57:45,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:57:45,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:57:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:45,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:57:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:45,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {15404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15392#true} is VALID [2022-04-15 12:57:45,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {15392#true} assume true; {15392#true} is VALID [2022-04-15 12:57:45,370 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15392#true} {15392#true} #94#return; {15392#true} is VALID [2022-04-15 12:57:45,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {15392#true} call ULTIMATE.init(); {15404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:57:45,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {15404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15392#true} is VALID [2022-04-15 12:57:45,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {15392#true} assume true; {15392#true} is VALID [2022-04-15 12:57:45,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15392#true} {15392#true} #94#return; {15392#true} is VALID [2022-04-15 12:57:45,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {15392#true} call #t~ret17 := main(); {15392#true} is VALID [2022-04-15 12:57:45,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {15392#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15392#true} is VALID [2022-04-15 12:57:45,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {15392#true} [148] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_26 v_main_~x~0_Out_52) (= v_main_~y~0_In_26 v_main_~y~0_Out_52)) (and (< 0 (mod (+ v_main_~x~0_Out_52 1) 4294967296)) (= |v_main_#t~post6_Out_52| 0) (<= v_main_~x~0_Out_52 v_main_~x~0_In_26) (= (+ v_main_~x~0_In_26 v_main_~y~0_In_26) (+ v_main_~y~0_Out_52 v_main_~x~0_Out_52)) (= |v_main_#t~post5_Out_52| 0))) InVars {main_~x~0=v_main_~x~0_In_26, main_~y~0=v_main_~y~0_In_26} OutVars{main_~y~0=v_main_~y~0_Out_52, main_#t~post5=|v_main_#t~post5_Out_52|, main_~x~0=v_main_~x~0_Out_52, main_#t~post6=|v_main_#t~post6_Out_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15392#true} is VALID [2022-04-15 12:57:45,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {15392#true} [147] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {15397#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:57:45,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {15397#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {15397#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:57:45,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {15397#(<= 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; {15398#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:57:45,378 INFO L290 TraceCheckUtils]: 10: Hoare triple {15398#(<= 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; {15399#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:45,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {15399#(<= 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; {15400#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:45,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {15400#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15401#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:45,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {15401#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15402#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:57:45,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {15402#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {15402#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:57:45,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {15402#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15402#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:57:45,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {15402#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15402#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:57:45,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {15402#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15402#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:57:45,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {15402#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15402#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:57:45,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {15402#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15402#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:57:45,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {15402#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~y~0 % 4294967296 > 0); {15402#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:57:45,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {15402#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15403#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:57:45,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {15403#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {15393#false} is VALID [2022-04-15 12:57:45,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {15393#false} assume !(~z~0 % 4294967296 > 0); {15393#false} is VALID [2022-04-15 12:57:45,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {15393#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; {15393#false} is VALID [2022-04-15 12:57:45,393 INFO L290 TraceCheckUtils]: 25: Hoare triple {15393#false} assume !(~y~0 % 4294967296 > 0); {15393#false} is VALID [2022-04-15 12:57:45,393 INFO L272 TraceCheckUtils]: 26: Hoare triple {15393#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15393#false} is VALID [2022-04-15 12:57:45,393 INFO L290 TraceCheckUtils]: 27: Hoare triple {15393#false} ~cond := #in~cond; {15393#false} is VALID [2022-04-15 12:57:45,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {15393#false} assume 0 == ~cond; {15393#false} is VALID [2022-04-15 12:57:45,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {15393#false} assume !false; {15393#false} is VALID [2022-04-15 12:57:45,393 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 12:57:45,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:57:45,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182095988] [2022-04-15 12:57:45,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182095988] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:57:45,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113508347] [2022-04-15 12:57:45,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:57:45,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:57:45,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:57:45,395 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:57:45,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-15 12:57:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:45,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 12:57:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:45,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:57:45,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {15392#true} call ULTIMATE.init(); {15392#true} is VALID [2022-04-15 12:57:45,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {15392#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15392#true} is VALID [2022-04-15 12:57:45,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {15392#true} assume true; {15392#true} is VALID [2022-04-15 12:57:45,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15392#true} {15392#true} #94#return; {15392#true} is VALID [2022-04-15 12:57:45,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {15392#true} call #t~ret17 := main(); {15392#true} is VALID [2022-04-15 12:57:45,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {15392#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15392#true} is VALID [2022-04-15 12:57:45,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {15392#true} [148] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_26 v_main_~x~0_Out_52) (= v_main_~y~0_In_26 v_main_~y~0_Out_52)) (and (< 0 (mod (+ v_main_~x~0_Out_52 1) 4294967296)) (= |v_main_#t~post6_Out_52| 0) (<= v_main_~x~0_Out_52 v_main_~x~0_In_26) (= (+ v_main_~x~0_In_26 v_main_~y~0_In_26) (+ v_main_~y~0_Out_52 v_main_~x~0_Out_52)) (= |v_main_#t~post5_Out_52| 0))) InVars {main_~x~0=v_main_~x~0_In_26, main_~y~0=v_main_~y~0_In_26} OutVars{main_~y~0=v_main_~y~0_Out_52, main_#t~post5=|v_main_#t~post5_Out_52|, main_~x~0=v_main_~x~0_Out_52, main_#t~post6=|v_main_#t~post6_Out_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15392#true} is VALID [2022-04-15 12:57:45,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {15392#true} [147] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {15392#true} is VALID [2022-04-15 12:57:45,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {15392#true} ~z~0 := ~y~0; {15432#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:57:45,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {15432#(= 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; {15436#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 12:57:45,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {15436#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15440#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 12:57:45,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {15440#(= main_~y~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; {15444#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-15 12:57:45,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {15444#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15448#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-15 12:57:45,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {15448#(= (+ (- 2) main_~y~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; {15452#(= (+ (- 2) main_~y~0) (+ main_~z~0 3))} is VALID [2022-04-15 12:57:45,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {15452#(= (+ (- 2) main_~y~0) (+ main_~z~0 3))} assume !(~z~0 % 4294967296 > 0); {15452#(= (+ (- 2) main_~y~0) (+ main_~z~0 3))} is VALID [2022-04-15 12:57:45,888 INFO L290 TraceCheckUtils]: 15: Hoare triple {15452#(= (+ (- 2) main_~y~0) (+ main_~z~0 3))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15459#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:57:45,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {15459#(< 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; {15463#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:57:45,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {15463#(< 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; {15467#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:57:45,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {15467#(< 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; {15471#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:57:45,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {15471#(< 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; {15475#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:45,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {15475#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {15475#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:45,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {15475#(< 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; {15475#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:45,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {15475#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {15475#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:45,896 INFO L290 TraceCheckUtils]: 23: Hoare triple {15475#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {15393#false} is VALID [2022-04-15 12:57:45,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {15393#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; {15393#false} is VALID [2022-04-15 12:57:45,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {15393#false} assume !(~y~0 % 4294967296 > 0); {15393#false} is VALID [2022-04-15 12:57:45,896 INFO L272 TraceCheckUtils]: 26: Hoare triple {15393#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15393#false} is VALID [2022-04-15 12:57:45,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {15393#false} ~cond := #in~cond; {15393#false} is VALID [2022-04-15 12:57:45,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {15393#false} assume 0 == ~cond; {15393#false} is VALID [2022-04-15 12:57:45,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {15393#false} assume !false; {15393#false} is VALID [2022-04-15 12:57:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:57:45,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:57:46,343 INFO L290 TraceCheckUtils]: 29: Hoare triple {15393#false} assume !false; {15393#false} is VALID [2022-04-15 12:57:46,343 INFO L290 TraceCheckUtils]: 28: Hoare triple {15393#false} assume 0 == ~cond; {15393#false} is VALID [2022-04-15 12:57:46,343 INFO L290 TraceCheckUtils]: 27: Hoare triple {15393#false} ~cond := #in~cond; {15393#false} is VALID [2022-04-15 12:57:46,343 INFO L272 TraceCheckUtils]: 26: Hoare triple {15393#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15393#false} is VALID [2022-04-15 12:57:46,343 INFO L290 TraceCheckUtils]: 25: Hoare triple {15393#false} assume !(~y~0 % 4294967296 > 0); {15393#false} is VALID [2022-04-15 12:57:46,343 INFO L290 TraceCheckUtils]: 24: Hoare triple {15393#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; {15393#false} is VALID [2022-04-15 12:57:46,343 INFO L290 TraceCheckUtils]: 23: Hoare triple {15475#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {15393#false} is VALID [2022-04-15 12:57:46,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {15475#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {15475#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:46,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {15475#(< 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; {15475#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:46,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {15475#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {15475#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:46,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {15471#(< 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; {15475#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:46,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {15467#(< 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; {15471#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:57:46,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {15463#(< 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; {15467#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:57:46,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {15459#(< 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; {15463#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:57:46,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {15548#(or (not (< 0 (mod main_~y~0 4294967296))) (< 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; {15459#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:57:46,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {15548#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {15548#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} is VALID [2022-04-15 12:57:46,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {15555#(or (not (< 0 (mod main_~y~0 4294967296))) (< 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; {15548#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} is VALID [2022-04-15 12:57:46,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {15559#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 3) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15555#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-15 12:57:46,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {15563#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (not (< 0 (mod main_~y~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15559#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-15 12:57:46,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {15567#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15563#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (not (< 0 (mod main_~y~0 4294967296))))} is VALID [2022-04-15 12:57:46,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {15571#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15567#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-15 12:57:46,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {15392#true} ~z~0 := ~y~0; {15571#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 12:57:46,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {15392#true} [147] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {15392#true} is VALID [2022-04-15 12:57:46,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {15392#true} [148] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_26 v_main_~x~0_Out_52) (= v_main_~y~0_In_26 v_main_~y~0_Out_52)) (and (< 0 (mod (+ v_main_~x~0_Out_52 1) 4294967296)) (= |v_main_#t~post6_Out_52| 0) (<= v_main_~x~0_Out_52 v_main_~x~0_In_26) (= (+ v_main_~x~0_In_26 v_main_~y~0_In_26) (+ v_main_~y~0_Out_52 v_main_~x~0_Out_52)) (= |v_main_#t~post5_Out_52| 0))) InVars {main_~x~0=v_main_~x~0_In_26, main_~y~0=v_main_~y~0_In_26} OutVars{main_~y~0=v_main_~y~0_Out_52, main_#t~post5=|v_main_#t~post5_Out_52|, main_~x~0=v_main_~x~0_Out_52, main_#t~post6=|v_main_#t~post6_Out_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15392#true} is VALID [2022-04-15 12:57:46,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {15392#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15392#true} is VALID [2022-04-15 12:57:46,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {15392#true} call #t~ret17 := main(); {15392#true} is VALID [2022-04-15 12:57:46,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15392#true} {15392#true} #94#return; {15392#true} is VALID [2022-04-15 12:57:46,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {15392#true} assume true; {15392#true} is VALID [2022-04-15 12:57:46,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {15392#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15392#true} is VALID [2022-04-15 12:57:46,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {15392#true} call ULTIMATE.init(); {15392#true} is VALID [2022-04-15 12:57:46,361 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:57:46,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113508347] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:57:46,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:57:46,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 27 [2022-04-15 12:57:46,561 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:57:46,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1274925466] [2022-04-15 12:57:46,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1274925466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:57:46,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:57:46,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:57:46,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061118651] [2022-04-15 12:57:46,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:57:46,562 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 31 [2022-04-15 12:57:46,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:57:46,562 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-15 12:57:46,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:46,607 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:57:46,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:46,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:57:46,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2022-04-15 12:57:46,608 INFO L87 Difference]: Start difference. First operand 111 states and 144 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-15 12:57:52,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:52,870 INFO L93 Difference]: Finished difference Result 324 states and 478 transitions. [2022-04-15 12:57:52,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 12:57:52,870 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 31 [2022-04-15 12:57:52,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:57:52,871 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-15 12:57:52,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 129 transitions. [2022-04-15 12:57:52,872 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-15 12:57:52,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 129 transitions. [2022-04-15 12:57:52,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 129 transitions. [2022-04-15 12:57:53,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:53,160 INFO L225 Difference]: With dead ends: 324 [2022-04-15 12:57:53,161 INFO L226 Difference]: Without dead ends: 301 [2022-04-15 12:57:53,161 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=168, Invalid=1392, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 12:57:53,161 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 169 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:57:53,161 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 74 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 12:57:53,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-04-15 12:57:54,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 119. [2022-04-15 12:57:54,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:57:54,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 301 states. Second operand has 119 states, 114 states have (on average 1.3157894736842106) internal successors, (150), 114 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:54,023 INFO L74 IsIncluded]: Start isIncluded. First operand 301 states. Second operand has 119 states, 114 states have (on average 1.3157894736842106) internal successors, (150), 114 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:54,023 INFO L87 Difference]: Start difference. First operand 301 states. Second operand has 119 states, 114 states have (on average 1.3157894736842106) internal successors, (150), 114 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:54,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:54,027 INFO L93 Difference]: Finished difference Result 301 states and 438 transitions. [2022-04-15 12:57:54,027 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 438 transitions. [2022-04-15 12:57:54,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:54,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:54,027 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 114 states have (on average 1.3157894736842106) internal successors, (150), 114 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 301 states. [2022-04-15 12:57:54,027 INFO L87 Difference]: Start difference. First operand has 119 states, 114 states have (on average 1.3157894736842106) internal successors, (150), 114 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 301 states. [2022-04-15 12:57:54,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:54,031 INFO L93 Difference]: Finished difference Result 301 states and 438 transitions. [2022-04-15 12:57:54,031 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 438 transitions. [2022-04-15 12:57:54,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:54,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:54,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:57:54,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:57:54,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.3157894736842106) internal successors, (150), 114 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:54,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 154 transitions. [2022-04-15 12:57:54,033 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 154 transitions. Word has length 31 [2022-04-15 12:57:54,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:57:54,033 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 154 transitions. [2022-04-15 12:57:54,033 INFO L479 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-15 12:57:54,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 154 transitions. [2022-04-15 12:57:58,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:58,280 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 154 transitions. [2022-04-15 12:57:58,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 12:57:58,280 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:57:58,280 INFO L499 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:57:58,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-15 12:57:58,481 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:57:58,481 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:57:58,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:57:58,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1527963433, now seen corresponding path program 5 times [2022-04-15 12:57:58,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:58,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [677039272] [2022-04-15 12:57:58,620 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:57:58,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1373370168, now seen corresponding path program 1 times [2022-04-15 12:57:58,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:57:58,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918722675] [2022-04-15 12:57:58,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:57:58,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:57:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:58,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:57:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:58,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {17126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17113#true} is VALID [2022-04-15 12:57:58,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {17113#true} assume true; {17113#true} is VALID [2022-04-15 12:57:58,828 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17113#true} {17113#true} #94#return; {17113#true} is VALID [2022-04-15 12:57:58,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {17113#true} call ULTIMATE.init(); {17126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:57:58,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {17126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17113#true} is VALID [2022-04-15 12:57:58,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {17113#true} assume true; {17113#true} is VALID [2022-04-15 12:57:58,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17113#true} {17113#true} #94#return; {17113#true} is VALID [2022-04-15 12:57:58,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {17113#true} call #t~ret17 := main(); {17113#true} is VALID [2022-04-15 12:57:58,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {17113#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17113#true} is VALID [2022-04-15 12:57:58,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {17113#true} [150] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_54 1) 4294967296)) (<= v_main_~x~0_Out_54 v_main_~x~0_In_27) (= |v_main_#t~post5_Out_54| 0) (= (+ v_main_~y~0_Out_54 v_main_~x~0_Out_54) (+ v_main_~x~0_In_27 v_main_~y~0_In_27)) (= |v_main_#t~post6_Out_54| 0)) (and (= v_main_~y~0_In_27 v_main_~y~0_Out_54) (= v_main_~x~0_In_27 v_main_~x~0_Out_54))) InVars {main_~x~0=v_main_~x~0_In_27, main_~y~0=v_main_~y~0_In_27} OutVars{main_~y~0=v_main_~y~0_Out_54, main_#t~post5=|v_main_#t~post5_Out_54|, main_~x~0=v_main_~x~0_Out_54, main_#t~post6=|v_main_#t~post6_Out_54|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17113#true} is VALID [2022-04-15 12:57:58,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {17113#true} [149] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {17113#true} is VALID [2022-04-15 12:57:58,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {17113#true} ~z~0 := ~y~0; {17118#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:57:58,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {17118#(and (<= main_~y~0 main_~z~0) (<= 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; {17119#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:57:58,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {17119#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17120#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:57:58,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {17120#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) 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; {17121#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:57:58,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {17121#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {17122#(and (<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 3 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:57:58,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {17122#(and (<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 3 (* (div 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; {17123#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:58,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {17123#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~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; {17124#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:57:58,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {17124#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 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; {17125#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:57:58,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {17125#(<= main_~y~0 (* (div main_~y~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; {17114#false} is VALID [2022-04-15 12:57:58,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {17114#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17114#false} is VALID [2022-04-15 12:57:58,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {17114#false} assume !(~y~0 % 4294967296 > 0); {17114#false} is VALID [2022-04-15 12:57:58,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {17114#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; {17114#false} is VALID [2022-04-15 12:57:58,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {17114#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; {17114#false} is VALID [2022-04-15 12:57:58,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {17114#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; {17114#false} is VALID [2022-04-15 12:57:58,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {17114#false} assume !(~x~0 % 4294967296 > 0); {17114#false} is VALID [2022-04-15 12:57:58,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {17114#false} assume !(~z~0 % 4294967296 > 0); {17114#false} is VALID [2022-04-15 12:57:58,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {17114#false} assume !(~y~0 % 4294967296 > 0); {17114#false} is VALID [2022-04-15 12:57:58,847 INFO L272 TraceCheckUtils]: 25: Hoare triple {17114#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17114#false} is VALID [2022-04-15 12:57:58,847 INFO L290 TraceCheckUtils]: 26: Hoare triple {17114#false} ~cond := #in~cond; {17114#false} is VALID [2022-04-15 12:57:58,847 INFO L290 TraceCheckUtils]: 27: Hoare triple {17114#false} assume 0 == ~cond; {17114#false} is VALID [2022-04-15 12:57:58,847 INFO L290 TraceCheckUtils]: 28: Hoare triple {17114#false} assume !false; {17114#false} is VALID [2022-04-15 12:57:58,848 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:57:58,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:57:58,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918722675] [2022-04-15 12:57:58,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918722675] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:57:58,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392280268] [2022-04-15 12:57:58,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:57:58,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:57:58,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:57:58,849 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:57:58,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-15 12:57:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:58,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 12:57:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:58,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:57:59,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {17113#true} call ULTIMATE.init(); {17113#true} is VALID [2022-04-15 12:57:59,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {17113#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17113#true} is VALID [2022-04-15 12:57:59,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {17113#true} assume true; {17113#true} is VALID [2022-04-15 12:57:59,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17113#true} {17113#true} #94#return; {17113#true} is VALID [2022-04-15 12:57:59,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {17113#true} call #t~ret17 := main(); {17113#true} is VALID [2022-04-15 12:57:59,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {17113#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17113#true} is VALID [2022-04-15 12:57:59,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {17113#true} [150] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_54 1) 4294967296)) (<= v_main_~x~0_Out_54 v_main_~x~0_In_27) (= |v_main_#t~post5_Out_54| 0) (= (+ v_main_~y~0_Out_54 v_main_~x~0_Out_54) (+ v_main_~x~0_In_27 v_main_~y~0_In_27)) (= |v_main_#t~post6_Out_54| 0)) (and (= v_main_~y~0_In_27 v_main_~y~0_Out_54) (= v_main_~x~0_In_27 v_main_~x~0_Out_54))) InVars {main_~x~0=v_main_~x~0_In_27, main_~y~0=v_main_~y~0_In_27} OutVars{main_~y~0=v_main_~y~0_Out_54, main_#t~post5=|v_main_#t~post5_Out_54|, main_~x~0=v_main_~x~0_Out_54, main_#t~post6=|v_main_#t~post6_Out_54|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17113#true} is VALID [2022-04-15 12:57:59,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {17113#true} [149] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {17113#true} is VALID [2022-04-15 12:57:59,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {17113#true} ~z~0 := ~y~0; {17113#true} is VALID [2022-04-15 12:57:59,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {17113#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17113#true} is VALID [2022-04-15 12:57:59,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {17113#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17113#true} is VALID [2022-04-15 12:57:59,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {17113#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17113#true} is VALID [2022-04-15 12:57:59,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {17113#true} assume !(~z~0 % 4294967296 > 0); {17113#true} is VALID [2022-04-15 12:57:59,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {17113#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17113#true} is VALID [2022-04-15 12:57:59,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {17113#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17113#true} is VALID [2022-04-15 12:57:59,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {17113#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17175#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 12:57:59,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {17175#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17179#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 12:57:59,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {17179#(< 0 (mod (+ main_~y~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; {17183#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 12:57:59,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {17183#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !(~y~0 % 4294967296 > 0); {17183#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 12:57:59,107 INFO L290 TraceCheckUtils]: 19: Hoare triple {17183#(< 0 (mod (+ main_~y~0 3) 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; {17179#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 12:57:59,108 INFO L290 TraceCheckUtils]: 20: Hoare triple {17179#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17175#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 12:57:59,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {17175#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17196#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:57:59,110 INFO L290 TraceCheckUtils]: 22: Hoare triple {17196#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {17196#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:57:59,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {17196#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {17196#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:57:59,111 INFO L290 TraceCheckUtils]: 24: Hoare triple {17196#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {17114#false} is VALID [2022-04-15 12:57:59,111 INFO L272 TraceCheckUtils]: 25: Hoare triple {17114#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17114#false} is VALID [2022-04-15 12:57:59,111 INFO L290 TraceCheckUtils]: 26: Hoare triple {17114#false} ~cond := #in~cond; {17114#false} is VALID [2022-04-15 12:57:59,111 INFO L290 TraceCheckUtils]: 27: Hoare triple {17114#false} assume 0 == ~cond; {17114#false} is VALID [2022-04-15 12:57:59,111 INFO L290 TraceCheckUtils]: 28: Hoare triple {17114#false} assume !false; {17114#false} is VALID [2022-04-15 12:57:59,111 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 12:57:59,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:57:59,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {17114#false} assume !false; {17114#false} is VALID [2022-04-15 12:57:59,189 INFO L290 TraceCheckUtils]: 27: Hoare triple {17114#false} assume 0 == ~cond; {17114#false} is VALID [2022-04-15 12:57:59,189 INFO L290 TraceCheckUtils]: 26: Hoare triple {17114#false} ~cond := #in~cond; {17114#false} is VALID [2022-04-15 12:57:59,189 INFO L272 TraceCheckUtils]: 25: Hoare triple {17114#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17114#false} is VALID [2022-04-15 12:57:59,189 INFO L290 TraceCheckUtils]: 24: Hoare triple {17196#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {17114#false} is VALID [2022-04-15 12:57:59,190 INFO L290 TraceCheckUtils]: 23: Hoare triple {17196#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {17196#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:57:59,190 INFO L290 TraceCheckUtils]: 22: Hoare triple {17196#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {17196#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:57:59,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {17175#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17196#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:57:59,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {17179#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17175#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 12:57:59,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {17183#(< 0 (mod (+ main_~y~0 3) 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; {17179#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 12:57:59,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {17183#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !(~y~0 % 4294967296 > 0); {17183#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 12:57:59,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {17179#(< 0 (mod (+ main_~y~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; {17183#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 12:57:59,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {17175#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17179#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 12:57:59,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {17113#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17175#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 12:57:59,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {17113#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17113#true} is VALID [2022-04-15 12:57:59,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {17113#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17113#true} is VALID [2022-04-15 12:57:59,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {17113#true} assume !(~z~0 % 4294967296 > 0); {17113#true} is VALID [2022-04-15 12:57:59,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {17113#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17113#true} is VALID [2022-04-15 12:57:59,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {17113#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17113#true} is VALID [2022-04-15 12:57:59,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {17113#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17113#true} is VALID [2022-04-15 12:57:59,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {17113#true} ~z~0 := ~y~0; {17113#true} is VALID [2022-04-15 12:57:59,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {17113#true} [149] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {17113#true} is VALID [2022-04-15 12:57:59,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {17113#true} [150] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_54 1) 4294967296)) (<= v_main_~x~0_Out_54 v_main_~x~0_In_27) (= |v_main_#t~post5_Out_54| 0) (= (+ v_main_~y~0_Out_54 v_main_~x~0_Out_54) (+ v_main_~x~0_In_27 v_main_~y~0_In_27)) (= |v_main_#t~post6_Out_54| 0)) (and (= v_main_~y~0_In_27 v_main_~y~0_Out_54) (= v_main_~x~0_In_27 v_main_~x~0_Out_54))) InVars {main_~x~0=v_main_~x~0_In_27, main_~y~0=v_main_~y~0_In_27} OutVars{main_~y~0=v_main_~y~0_Out_54, main_#t~post5=|v_main_#t~post5_Out_54|, main_~x~0=v_main_~x~0_Out_54, main_#t~post6=|v_main_#t~post6_Out_54|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17113#true} is VALID [2022-04-15 12:57:59,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {17113#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17113#true} is VALID [2022-04-15 12:57:59,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {17113#true} call #t~ret17 := main(); {17113#true} is VALID [2022-04-15 12:57:59,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17113#true} {17113#true} #94#return; {17113#true} is VALID [2022-04-15 12:57:59,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {17113#true} assume true; {17113#true} is VALID [2022-04-15 12:57:59,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {17113#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17113#true} is VALID [2022-04-15 12:57:59,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {17113#true} call ULTIMATE.init(); {17113#true} is VALID [2022-04-15 12:57:59,205 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 12:57:59,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392280268] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:57:59,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:57:59,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 15 [2022-04-15 12:57:59,413 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:57:59,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [677039272] [2022-04-15 12:57:59,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [677039272] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:57:59,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:57:59,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:57:59,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320200381] [2022-04-15 12:57:59,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:57:59,413 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 31 [2022-04-15 12:57:59,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:57:59,414 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-15 12:57:59,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:59,465 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:57:59,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:59,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:57:59,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:57:59,465 INFO L87 Difference]: Start difference. First operand 119 states and 154 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-15 12:58:05,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:05,725 INFO L93 Difference]: Finished difference Result 230 states and 321 transitions. [2022-04-15 12:58:05,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 12:58:05,726 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 31 [2022-04-15 12:58:05,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:58:05,726 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-15 12:58:05,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 124 transitions. [2022-04-15 12:58:05,727 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-15 12:58:05,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 124 transitions. [2022-04-15 12:58:05,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 124 transitions. [2022-04-15 12:58:06,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:06,130 INFO L225 Difference]: With dead ends: 230 [2022-04-15 12:58:06,130 INFO L226 Difference]: Without dead ends: 149 [2022-04-15 12:58:06,131 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=328, Invalid=1478, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 12:58:06,131 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 78 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:58:06,131 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 74 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 12:58:06,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-15 12:58:06,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 93. [2022-04-15 12:58:06,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:58:06,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 93 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:06,751 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 93 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:06,751 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 93 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:06,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:06,752 INFO L93 Difference]: Finished difference Result 149 states and 207 transitions. [2022-04-15 12:58:06,752 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 207 transitions. [2022-04-15 12:58:06,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:06,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:06,753 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 149 states. [2022-04-15 12:58:06,753 INFO L87 Difference]: Start difference. First operand has 93 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 149 states. [2022-04-15 12:58:06,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:06,754 INFO L93 Difference]: Finished difference Result 149 states and 207 transitions. [2022-04-15 12:58:06,754 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 207 transitions. [2022-04-15 12:58:06,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:06,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:06,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:58:06,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:58:06,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:06,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 121 transitions. [2022-04-15 12:58:06,756 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 121 transitions. Word has length 31 [2022-04-15 12:58:06,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:58:06,756 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 121 transitions. [2022-04-15 12:58:06,756 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:06,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 121 transitions. [2022-04-15 12:58:08,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:08,875 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 121 transitions. [2022-04-15 12:58:08,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 12:58:08,875 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:58:08,878 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:58:08,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-15 12:58:09,091 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-15 12:58:09,091 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:58:09,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:58:09,092 INFO L85 PathProgramCache]: Analyzing trace with hash -106095820, now seen corresponding path program 2 times [2022-04-15 12:58:09,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:09,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1755089994] [2022-04-15 12:58:09,222 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:58:09,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1792576075, now seen corresponding path program 1 times [2022-04-15 12:58:09,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:58:09,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763718035] [2022-04-15 12:58:09,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:58:09,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:58:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:09,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:58:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:09,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {18315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18303#true} is VALID [2022-04-15 12:58:09,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {18303#true} assume true; {18303#true} is VALID [2022-04-15 12:58:09,425 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18303#true} {18303#true} #94#return; {18303#true} is VALID [2022-04-15 12:58:09,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {18303#true} call ULTIMATE.init(); {18315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:58:09,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {18315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18303#true} is VALID [2022-04-15 12:58:09,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {18303#true} assume true; {18303#true} is VALID [2022-04-15 12:58:09,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18303#true} {18303#true} #94#return; {18303#true} is VALID [2022-04-15 12:58:09,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {18303#true} call #t~ret17 := main(); {18303#true} is VALID [2022-04-15 12:58:09,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {18303#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18303#true} is VALID [2022-04-15 12:58:09,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {18303#true} [152] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_28 v_main_~x~0_Out_56) (= v_main_~y~0_In_28 v_main_~y~0_Out_56)) (and (= |v_main_#t~post5_Out_56| 0) (= (+ v_main_~x~0_In_28 v_main_~y~0_In_28) (+ v_main_~y~0_Out_56 v_main_~x~0_Out_56)) (< 0 (mod (+ v_main_~x~0_Out_56 1) 4294967296)) (<= v_main_~x~0_Out_56 v_main_~x~0_In_28) (= |v_main_#t~post6_Out_56| 0))) InVars {main_~x~0=v_main_~x~0_In_28, main_~y~0=v_main_~y~0_In_28} OutVars{main_~y~0=v_main_~y~0_Out_56, main_#t~post5=|v_main_#t~post5_Out_56|, main_~x~0=v_main_~x~0_Out_56, main_#t~post6=|v_main_#t~post6_Out_56|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18303#true} is VALID [2022-04-15 12:58:09,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {18303#true} [151] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {18303#true} is VALID [2022-04-15 12:58:09,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {18303#true} ~z~0 := ~y~0; {18308#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:58:09,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {18308#(= 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; {18309#(and (= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0) (<= main_~y~0 (+ 4294967295 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:58:09,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {18309#(and (= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0) (<= main_~y~0 (+ 4294967295 (* (div 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; {18310#(and (<= (+ main_~z~0 2) main_~y~0) (<= main_~y~0 (+ 4294967295 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:58:09,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {18310#(and (<= (+ main_~z~0 2) main_~y~0) (<= main_~y~0 (+ 4294967295 (* (div 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; {18311#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:09,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {18311#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {18311#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:09,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {18311#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~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; {18312#(<= main_~y~0 (+ 4294967294 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:09,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {18312#(<= main_~y~0 (+ 4294967294 (* (div (+ (- 2) main_~y~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; {18313#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 4294967293))} is VALID [2022-04-15 12:58:09,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {18313#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18314#(<= main_~y~0 (+ 4294967292 (* (div main_~y~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:09,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {18314#(<= main_~y~0 (+ 4294967292 (* (div main_~y~0 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {18314#(<= main_~y~0 (+ 4294967292 (* (div main_~y~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:09,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {18314#(<= main_~y~0 (+ 4294967292 (* (div main_~y~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; {18313#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 4294967293))} is VALID [2022-04-15 12:58:09,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {18313#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 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; {18312#(<= main_~y~0 (+ 4294967294 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:09,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {18312#(<= main_~y~0 (+ 4294967294 (* (div (+ (- 2) main_~y~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; {18311#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:09,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {18311#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {18311#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:09,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {18311#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~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; {18311#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:09,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {18311#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~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; {18311#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:09,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {18311#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~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; {18311#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:09,457 INFO L290 TraceCheckUtils]: 24: Hoare triple {18311#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {18311#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:09,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {18311#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {18304#false} is VALID [2022-04-15 12:58:09,459 INFO L272 TraceCheckUtils]: 26: Hoare triple {18304#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18304#false} is VALID [2022-04-15 12:58:09,459 INFO L290 TraceCheckUtils]: 27: Hoare triple {18304#false} ~cond := #in~cond; {18304#false} is VALID [2022-04-15 12:58:09,459 INFO L290 TraceCheckUtils]: 28: Hoare triple {18304#false} assume 0 == ~cond; {18304#false} is VALID [2022-04-15 12:58:09,459 INFO L290 TraceCheckUtils]: 29: Hoare triple {18304#false} assume !false; {18304#false} is VALID [2022-04-15 12:58:09,459 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:58:09,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:58:09,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763718035] [2022-04-15 12:58:09,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763718035] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:58:09,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78172981] [2022-04-15 12:58:09,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:58:09,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:58:09,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:58:09,461 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:58:09,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-15 12:58:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:09,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 12:58:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:09,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:58:09,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {18303#true} call ULTIMATE.init(); {18303#true} is VALID [2022-04-15 12:58:09,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {18303#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18303#true} is VALID [2022-04-15 12:58:09,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {18303#true} assume true; {18303#true} is VALID [2022-04-15 12:58:09,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18303#true} {18303#true} #94#return; {18303#true} is VALID [2022-04-15 12:58:09,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {18303#true} call #t~ret17 := main(); {18303#true} is VALID [2022-04-15 12:58:09,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {18303#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18303#true} is VALID [2022-04-15 12:58:09,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {18303#true} [152] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_28 v_main_~x~0_Out_56) (= v_main_~y~0_In_28 v_main_~y~0_Out_56)) (and (= |v_main_#t~post5_Out_56| 0) (= (+ v_main_~x~0_In_28 v_main_~y~0_In_28) (+ v_main_~y~0_Out_56 v_main_~x~0_Out_56)) (< 0 (mod (+ v_main_~x~0_Out_56 1) 4294967296)) (<= v_main_~x~0_Out_56 v_main_~x~0_In_28) (= |v_main_#t~post6_Out_56| 0))) InVars {main_~x~0=v_main_~x~0_In_28, main_~y~0=v_main_~y~0_In_28} OutVars{main_~y~0=v_main_~y~0_Out_56, main_#t~post5=|v_main_#t~post5_Out_56|, main_~x~0=v_main_~x~0_Out_56, main_#t~post6=|v_main_#t~post6_Out_56|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18303#true} is VALID [2022-04-15 12:58:09,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {18303#true} [151] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {18303#true} is VALID [2022-04-15 12:58:09,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {18303#true} ~z~0 := ~y~0; {18303#true} is VALID [2022-04-15 12:58:09,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {18303#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18303#true} is VALID [2022-04-15 12:58:09,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {18303#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18303#true} is VALID [2022-04-15 12:58:09,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {18303#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18303#true} is VALID [2022-04-15 12:58:09,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {18303#true} assume !(~z~0 % 4294967296 > 0); {18303#true} is VALID [2022-04-15 12:58:09,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {18303#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18358#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 12:58:09,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {18358#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18362#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 12:58:09,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {18362#(< 0 (mod (+ main_~y~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; {18366#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 12:58:09,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {18366#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !(~y~0 % 4294967296 > 0); {18366#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 12:58:09,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {18366#(< 0 (mod (+ main_~y~0 3) 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; {18362#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 12:58:09,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {18362#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {18358#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 12:58:09,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {18358#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {18379#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:58:09,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {18379#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {18379#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:58:09,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {18379#(< 0 (mod main_~y~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; {18379#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:58:09,777 INFO L290 TraceCheckUtils]: 22: Hoare triple {18379#(< 0 (mod main_~y~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; {18379#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:58:09,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {18379#(< 0 (mod main_~y~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; {18379#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:58:09,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {18379#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {18379#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:58:09,778 INFO L290 TraceCheckUtils]: 25: Hoare triple {18379#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {18304#false} is VALID [2022-04-15 12:58:09,778 INFO L272 TraceCheckUtils]: 26: Hoare triple {18304#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18304#false} is VALID [2022-04-15 12:58:09,778 INFO L290 TraceCheckUtils]: 27: Hoare triple {18304#false} ~cond := #in~cond; {18304#false} is VALID [2022-04-15 12:58:09,778 INFO L290 TraceCheckUtils]: 28: Hoare triple {18304#false} assume 0 == ~cond; {18304#false} is VALID [2022-04-15 12:58:09,778 INFO L290 TraceCheckUtils]: 29: Hoare triple {18304#false} assume !false; {18304#false} is VALID [2022-04-15 12:58:09,778 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-15 12:58:09,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:58:09,869 INFO L290 TraceCheckUtils]: 29: Hoare triple {18304#false} assume !false; {18304#false} is VALID [2022-04-15 12:58:09,869 INFO L290 TraceCheckUtils]: 28: Hoare triple {18304#false} assume 0 == ~cond; {18304#false} is VALID [2022-04-15 12:58:09,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {18304#false} ~cond := #in~cond; {18304#false} is VALID [2022-04-15 12:58:09,869 INFO L272 TraceCheckUtils]: 26: Hoare triple {18304#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18304#false} is VALID [2022-04-15 12:58:09,870 INFO L290 TraceCheckUtils]: 25: Hoare triple {18379#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {18304#false} is VALID [2022-04-15 12:58:09,870 INFO L290 TraceCheckUtils]: 24: Hoare triple {18379#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {18379#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:58:09,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {18379#(< 0 (mod main_~y~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; {18379#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:58:09,871 INFO L290 TraceCheckUtils]: 22: Hoare triple {18379#(< 0 (mod main_~y~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; {18379#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:58:09,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {18379#(< 0 (mod main_~y~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; {18379#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:58:09,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {18379#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {18379#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:58:09,875 INFO L290 TraceCheckUtils]: 19: Hoare triple {18358#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {18379#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:58:09,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {18362#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {18358#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 12:58:09,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {18366#(< 0 (mod (+ main_~y~0 3) 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; {18362#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 12:58:09,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {18366#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !(~y~0 % 4294967296 > 0); {18366#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 12:58:09,882 INFO L290 TraceCheckUtils]: 15: Hoare triple {18362#(< 0 (mod (+ main_~y~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; {18366#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 12:58:09,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {18358#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18362#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 12:58:09,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {18303#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18358#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 12:58:09,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {18303#true} assume !(~z~0 % 4294967296 > 0); {18303#true} is VALID [2022-04-15 12:58:09,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {18303#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18303#true} is VALID [2022-04-15 12:58:09,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {18303#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18303#true} is VALID [2022-04-15 12:58:09,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {18303#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18303#true} is VALID [2022-04-15 12:58:09,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {18303#true} ~z~0 := ~y~0; {18303#true} is VALID [2022-04-15 12:58:09,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {18303#true} [151] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {18303#true} is VALID [2022-04-15 12:58:09,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {18303#true} [152] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_28 v_main_~x~0_Out_56) (= v_main_~y~0_In_28 v_main_~y~0_Out_56)) (and (= |v_main_#t~post5_Out_56| 0) (= (+ v_main_~x~0_In_28 v_main_~y~0_In_28) (+ v_main_~y~0_Out_56 v_main_~x~0_Out_56)) (< 0 (mod (+ v_main_~x~0_Out_56 1) 4294967296)) (<= v_main_~x~0_Out_56 v_main_~x~0_In_28) (= |v_main_#t~post6_Out_56| 0))) InVars {main_~x~0=v_main_~x~0_In_28, main_~y~0=v_main_~y~0_In_28} OutVars{main_~y~0=v_main_~y~0_Out_56, main_#t~post5=|v_main_#t~post5_Out_56|, main_~x~0=v_main_~x~0_Out_56, main_#t~post6=|v_main_#t~post6_Out_56|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18303#true} is VALID [2022-04-15 12:58:09,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {18303#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18303#true} is VALID [2022-04-15 12:58:09,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {18303#true} call #t~ret17 := main(); {18303#true} is VALID [2022-04-15 12:58:09,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18303#true} {18303#true} #94#return; {18303#true} is VALID [2022-04-15 12:58:09,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {18303#true} assume true; {18303#true} is VALID [2022-04-15 12:58:09,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {18303#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18303#true} is VALID [2022-04-15 12:58:09,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {18303#true} call ULTIMATE.init(); {18303#true} is VALID [2022-04-15 12:58:09,887 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-15 12:58:09,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78172981] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:58:09,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:58:09,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 14 [2022-04-15 12:58:10,114 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:58:10,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1755089994] [2022-04-15 12:58:10,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1755089994] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:58:10,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:58:10,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 12:58:10,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463263501] [2022-04-15 12:58:10,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:58:10,115 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 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 32 [2022-04-15 12:58:10,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:58:10,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:10,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:10,190 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 12:58:10,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:10,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 12:58:10,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:58:10,191 INFO L87 Difference]: Start difference. First operand 93 states and 121 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:16,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:16,639 INFO L93 Difference]: Finished difference Result 151 states and 212 transitions. [2022-04-15 12:58:16,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 12:58:16,639 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 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 32 [2022-04-15 12:58:16,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:58:16,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:16,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 129 transitions. [2022-04-15 12:58:16,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:16,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 129 transitions. [2022-04-15 12:58:16,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 129 transitions. [2022-04-15 12:58:17,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:17,130 INFO L225 Difference]: With dead ends: 151 [2022-04-15 12:58:17,130 INFO L226 Difference]: Without dead ends: 146 [2022-04-15 12:58:17,131 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=311, Invalid=1495, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 12:58:17,132 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 91 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:58:17,132 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 68 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-15 12:58:17,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-15 12:58:17,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 93. [2022-04-15 12:58:17,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:58:17,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 93 states, 88 states have (on average 1.2954545454545454) internal successors, (114), 88 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:17,795 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 93 states, 88 states have (on average 1.2954545454545454) internal successors, (114), 88 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:17,795 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 93 states, 88 states have (on average 1.2954545454545454) internal successors, (114), 88 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:17,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:17,797 INFO L93 Difference]: Finished difference Result 146 states and 196 transitions. [2022-04-15 12:58:17,797 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 196 transitions. [2022-04-15 12:58:17,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:17,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:17,797 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 88 states have (on average 1.2954545454545454) internal successors, (114), 88 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 146 states. [2022-04-15 12:58:17,797 INFO L87 Difference]: Start difference. First operand has 93 states, 88 states have (on average 1.2954545454545454) internal successors, (114), 88 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 146 states. [2022-04-15 12:58:17,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:17,799 INFO L93 Difference]: Finished difference Result 146 states and 196 transitions. [2022-04-15 12:58:17,799 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 196 transitions. [2022-04-15 12:58:17,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:17,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:17,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:58:17,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:58:17,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.2954545454545454) internal successors, (114), 88 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:17,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 118 transitions. [2022-04-15 12:58:17,800 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 118 transitions. Word has length 32 [2022-04-15 12:58:17,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:58:17,800 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 118 transitions. [2022-04-15 12:58:17,800 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:17,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 118 transitions. [2022-04-15 12:58:21,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:21,004 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions. [2022-04-15 12:58:21,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 12:58:21,004 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:58:21,004 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:58:21,020 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-15 12:58:21,206 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:58:21,206 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:58:21,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:58:21,207 INFO L85 PathProgramCache]: Analyzing trace with hash 503233447, now seen corresponding path program 7 times [2022-04-15 12:58:21,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:21,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [532701246] [2022-04-15 12:58:21,339 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:58:21,340 INFO L85 PathProgramCache]: Analyzing trace with hash -231511802, now seen corresponding path program 1 times [2022-04-15 12:58:21,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:58:21,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453139874] [2022-04-15 12:58:21,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:58:21,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:58:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:21,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:58:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:21,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {19354#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19337#true} is VALID [2022-04-15 12:58:21,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {19337#true} assume true; {19337#true} is VALID [2022-04-15 12:58:21,660 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19337#true} {19337#true} #94#return; {19337#true} is VALID [2022-04-15 12:58:21,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {19337#true} call ULTIMATE.init(); {19354#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:58:21,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {19354#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19337#true} is VALID [2022-04-15 12:58:21,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {19337#true} assume true; {19337#true} is VALID [2022-04-15 12:58:21,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19337#true} {19337#true} #94#return; {19337#true} is VALID [2022-04-15 12:58:21,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {19337#true} call #t~ret17 := main(); {19337#true} is VALID [2022-04-15 12:58:21,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {19337#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19337#true} is VALID [2022-04-15 12:58:21,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {19337#true} [154] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_29 v_main_~x~0_Out_58) (= v_main_~y~0_In_29 v_main_~y~0_Out_58)) (and (= (+ v_main_~y~0_Out_58 v_main_~x~0_Out_58) (+ v_main_~x~0_In_29 v_main_~y~0_In_29)) (< 0 (mod (+ v_main_~x~0_Out_58 1) 4294967296)) (<= v_main_~x~0_Out_58 v_main_~x~0_In_29) (= |v_main_#t~post5_Out_58| 0) (= |v_main_#t~post6_Out_58| 0))) InVars {main_~x~0=v_main_~x~0_In_29, main_~y~0=v_main_~y~0_In_29} OutVars{main_~y~0=v_main_~y~0_Out_58, main_#t~post5=|v_main_#t~post5_Out_58|, main_~x~0=v_main_~x~0_Out_58, main_#t~post6=|v_main_#t~post6_Out_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19337#true} is VALID [2022-04-15 12:58:21,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {19337#true} [153] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {19337#true} is VALID [2022-04-15 12:58:21,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {19337#true} ~z~0 := ~y~0; {19342#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:58:21,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {19342#(= 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; {19343#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:58:21,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {19343#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19344#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:58:21,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {19344#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) 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; {19345#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:58:21,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {19345#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19346#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:58:21,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {19346#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19347#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:58:21,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {19347#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 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; {19348#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:58:21,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {19348#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {19348#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:58:21,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {19348#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19349#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:58:21,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {19349#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19350#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:58:21,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {19350#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19351#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:58:21,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {19351#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19352#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:58:21,687 INFO L290 TraceCheckUtils]: 20: Hoare triple {19352#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {19353#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:58:21,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {19353#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {19338#false} is VALID [2022-04-15 12:58:21,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {19338#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; {19338#false} is VALID [2022-04-15 12:58:21,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {19338#false} assume !(~x~0 % 4294967296 > 0); {19338#false} is VALID [2022-04-15 12:58:21,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {19338#false} assume !(~z~0 % 4294967296 > 0); {19338#false} is VALID [2022-04-15 12:58:21,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {19338#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; {19338#false} is VALID [2022-04-15 12:58:21,689 INFO L290 TraceCheckUtils]: 26: Hoare triple {19338#false} assume !(~y~0 % 4294967296 > 0); {19338#false} is VALID [2022-04-15 12:58:21,689 INFO L272 TraceCheckUtils]: 27: Hoare triple {19338#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19338#false} is VALID [2022-04-15 12:58:21,690 INFO L290 TraceCheckUtils]: 28: Hoare triple {19338#false} ~cond := #in~cond; {19338#false} is VALID [2022-04-15 12:58:21,690 INFO L290 TraceCheckUtils]: 29: Hoare triple {19338#false} assume 0 == ~cond; {19338#false} is VALID [2022-04-15 12:58:21,690 INFO L290 TraceCheckUtils]: 30: Hoare triple {19338#false} assume !false; {19338#false} is VALID [2022-04-15 12:58:21,690 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:58:21,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:58:21,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453139874] [2022-04-15 12:58:21,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453139874] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:58:21,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176276591] [2022-04-15 12:58:21,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:58:21,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:58:21,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:58:21,691 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:58:21,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-15 12:58:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:21,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 12:58:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:21,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:58:22,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {19337#true} call ULTIMATE.init(); {19337#true} is VALID [2022-04-15 12:58:22,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {19337#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19337#true} is VALID [2022-04-15 12:58:22,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {19337#true} assume true; {19337#true} is VALID [2022-04-15 12:58:22,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19337#true} {19337#true} #94#return; {19337#true} is VALID [2022-04-15 12:58:22,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {19337#true} call #t~ret17 := main(); {19337#true} is VALID [2022-04-15 12:58:22,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {19337#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19337#true} is VALID [2022-04-15 12:58:22,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {19337#true} [154] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_29 v_main_~x~0_Out_58) (= v_main_~y~0_In_29 v_main_~y~0_Out_58)) (and (= (+ v_main_~y~0_Out_58 v_main_~x~0_Out_58) (+ v_main_~x~0_In_29 v_main_~y~0_In_29)) (< 0 (mod (+ v_main_~x~0_Out_58 1) 4294967296)) (<= v_main_~x~0_Out_58 v_main_~x~0_In_29) (= |v_main_#t~post5_Out_58| 0) (= |v_main_#t~post6_Out_58| 0))) InVars {main_~x~0=v_main_~x~0_In_29, main_~y~0=v_main_~y~0_In_29} OutVars{main_~y~0=v_main_~y~0_Out_58, main_#t~post5=|v_main_#t~post5_Out_58|, main_~x~0=v_main_~x~0_Out_58, main_#t~post6=|v_main_#t~post6_Out_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19337#true} is VALID [2022-04-15 12:58:22,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {19337#true} [153] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {19337#true} is VALID [2022-04-15 12:58:22,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {19337#true} ~z~0 := ~y~0; {19342#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:58:22,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {19342#(= 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; {19343#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:58:22,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {19343#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19388#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (+ (- 2) main_~y~0 (* (- 1) main_~z~0)) 0))} is VALID [2022-04-15 12:58:22,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {19388#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (+ (- 2) main_~y~0 (* (- 1) main_~z~0)) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19392#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= (+ main_~y~0 (* (- 1) main_~z~0) (- 3)) 0))} is VALID [2022-04-15 12:58:22,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {19392#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= (+ main_~y~0 (* (- 1) main_~z~0) (- 3)) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19396#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:58:22,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {19396#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (< 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; {19400#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} is VALID [2022-04-15 12:58:22,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {19400#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~y~0 (- 3)) (+ 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; {19404#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)))} is VALID [2022-04-15 12:58:22,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {19404#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {19404#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)))} is VALID [2022-04-15 12:58:22,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {19404#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19411#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 2)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:58:22,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {19411#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 2)) (< 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; {19415#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:58:22,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {19415#(< 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; {19419#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:58:22,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {19419#(< 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; {19423#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:58:22,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {19423#(< 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; {19427#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:58:22,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {19427#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {19427#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:58:22,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {19427#(< 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; {19427#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:58:22,455 INFO L290 TraceCheckUtils]: 23: Hoare triple {19427#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {19427#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:58:22,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {19427#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {19338#false} is VALID [2022-04-15 12:58:22,455 INFO L290 TraceCheckUtils]: 25: Hoare triple {19338#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; {19338#false} is VALID [2022-04-15 12:58:22,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {19338#false} assume !(~y~0 % 4294967296 > 0); {19338#false} is VALID [2022-04-15 12:58:22,455 INFO L272 TraceCheckUtils]: 27: Hoare triple {19338#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19338#false} is VALID [2022-04-15 12:58:22,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {19338#false} ~cond := #in~cond; {19338#false} is VALID [2022-04-15 12:58:22,455 INFO L290 TraceCheckUtils]: 29: Hoare triple {19338#false} assume 0 == ~cond; {19338#false} is VALID [2022-04-15 12:58:22,455 INFO L290 TraceCheckUtils]: 30: Hoare triple {19338#false} assume !false; {19338#false} is VALID [2022-04-15 12:58:22,456 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:58:22,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:58:22,699 INFO L290 TraceCheckUtils]: 30: Hoare triple {19338#false} assume !false; {19338#false} is VALID [2022-04-15 12:58:22,700 INFO L290 TraceCheckUtils]: 29: Hoare triple {19338#false} assume 0 == ~cond; {19338#false} is VALID [2022-04-15 12:58:22,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {19338#false} ~cond := #in~cond; {19338#false} is VALID [2022-04-15 12:58:22,700 INFO L272 TraceCheckUtils]: 27: Hoare triple {19338#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19338#false} is VALID [2022-04-15 12:58:22,700 INFO L290 TraceCheckUtils]: 26: Hoare triple {19338#false} assume !(~y~0 % 4294967296 > 0); {19338#false} is VALID [2022-04-15 12:58:22,700 INFO L290 TraceCheckUtils]: 25: Hoare triple {19338#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; {19338#false} is VALID [2022-04-15 12:58:22,700 INFO L290 TraceCheckUtils]: 24: Hoare triple {19427#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {19338#false} is VALID [2022-04-15 12:58:22,700 INFO L290 TraceCheckUtils]: 23: Hoare triple {19427#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {19427#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:58:22,701 INFO L290 TraceCheckUtils]: 22: Hoare triple {19427#(< 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; {19427#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:58:22,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {19427#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {19427#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:58:22,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {19423#(< 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; {19427#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:58:22,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {19419#(< 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; {19423#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:58:22,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {19415#(< 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; {19419#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:58:22,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {19497#(< 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; {19415#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:58:22,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {19501#(< 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; {19497#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:58:22,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {19501#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {19501#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 12:58:22,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {19497#(< 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; {19501#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 12:58:22,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {19415#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19497#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:58:22,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {19419#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19415#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:58:22,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {19423#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19419#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:58:22,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {19337#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19423#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:58:22,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {19337#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19337#true} is VALID [2022-04-15 12:58:22,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {19337#true} ~z~0 := ~y~0; {19337#true} is VALID [2022-04-15 12:58:22,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {19337#true} [153] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {19337#true} is VALID [2022-04-15 12:58:22,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {19337#true} [154] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_29 v_main_~x~0_Out_58) (= v_main_~y~0_In_29 v_main_~y~0_Out_58)) (and (= (+ v_main_~y~0_Out_58 v_main_~x~0_Out_58) (+ v_main_~x~0_In_29 v_main_~y~0_In_29)) (< 0 (mod (+ v_main_~x~0_Out_58 1) 4294967296)) (<= v_main_~x~0_Out_58 v_main_~x~0_In_29) (= |v_main_#t~post5_Out_58| 0) (= |v_main_#t~post6_Out_58| 0))) InVars {main_~x~0=v_main_~x~0_In_29, main_~y~0=v_main_~y~0_In_29} OutVars{main_~y~0=v_main_~y~0_Out_58, main_#t~post5=|v_main_#t~post5_Out_58|, main_~x~0=v_main_~x~0_Out_58, main_#t~post6=|v_main_#t~post6_Out_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19337#true} is VALID [2022-04-15 12:58:22,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {19337#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19337#true} is VALID [2022-04-15 12:58:22,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {19337#true} call #t~ret17 := main(); {19337#true} is VALID [2022-04-15 12:58:22,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19337#true} {19337#true} #94#return; {19337#true} is VALID [2022-04-15 12:58:22,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {19337#true} assume true; {19337#true} is VALID [2022-04-15 12:58:22,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {19337#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19337#true} is VALID [2022-04-15 12:58:22,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {19337#true} call ULTIMATE.init(); {19337#true} is VALID [2022-04-15 12:58:22,725 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:58:22,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176276591] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:58:22,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:58:22,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 8] total 27 [2022-04-15 12:58:23,108 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:58:23,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [532701246] [2022-04-15 12:58:23,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [532701246] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:58:23,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:58:23,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 12:58:23,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042867380] [2022-04-15 12:58:23,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:58:23,108 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 12:58:23,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:58:23,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:23,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:23,180 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 12:58:23,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:23,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 12:58:23,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:58:23,181 INFO L87 Difference]: Start difference. First operand 93 states and 118 transitions. Second operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:48,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:48,139 INFO L93 Difference]: Finished difference Result 233 states and 328 transitions. [2022-04-15 12:58:48,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-04-15 12:58:48,139 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 12:58:48,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:58:48,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:48,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 249 transitions. [2022-04-15 12:58:48,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:48,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 249 transitions. [2022-04-15 12:58:48,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 249 transitions. [2022-04-15 12:58:50,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:50,177 INFO L225 Difference]: With dead ends: 233 [2022-04-15 12:58:50,177 INFO L226 Difference]: Without dead ends: 196 [2022-04-15 12:58:50,180 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5794 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=1928, Invalid=14584, Unknown=0, NotChecked=0, Total=16512 [2022-04-15 12:58:50,180 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 230 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:58:50,180 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 87 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-04-15 12:58:50,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-04-15 12:58:51,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 118. [2022-04-15 12:58:51,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:58:51,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand has 118 states, 113 states have (on average 1.3274336283185841) internal successors, (150), 113 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:51,142 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand has 118 states, 113 states have (on average 1.3274336283185841) internal successors, (150), 113 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:51,142 INFO L87 Difference]: Start difference. First operand 196 states. Second operand has 118 states, 113 states have (on average 1.3274336283185841) internal successors, (150), 113 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:51,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:51,144 INFO L93 Difference]: Finished difference Result 196 states and 271 transitions. [2022-04-15 12:58:51,145 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 271 transitions. [2022-04-15 12:58:51,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:51,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:51,145 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 113 states have (on average 1.3274336283185841) internal successors, (150), 113 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 196 states. [2022-04-15 12:58:51,145 INFO L87 Difference]: Start difference. First operand has 118 states, 113 states have (on average 1.3274336283185841) internal successors, (150), 113 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 196 states. [2022-04-15 12:58:51,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:51,147 INFO L93 Difference]: Finished difference Result 196 states and 271 transitions. [2022-04-15 12:58:51,147 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 271 transitions. [2022-04-15 12:58:51,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:51,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:51,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:58:51,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:58:51,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.3274336283185841) internal successors, (150), 113 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:51,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 154 transitions. [2022-04-15 12:58:51,149 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 154 transitions. Word has length 33 [2022-04-15 12:58:51,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:58:51,149 INFO L478 AbstractCegarLoop]: Abstraction has 118 states and 154 transitions. [2022-04-15 12:58:51,149 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:51,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 154 transitions. [2022-04-15 12:58:59,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 153 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:59,432 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 154 transitions. [2022-04-15 12:58:59,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 12:58:59,432 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:58:59,432 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:58:59,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-15 12:58:59,640 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-15 12:58:59,641 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:58:59,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:58:59,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1559024999, now seen corresponding path program 6 times [2022-04-15 12:58:59,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:59,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2133622237] [2022-04-15 12:58:59,736 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:58:59,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1580161129, now seen corresponding path program 1 times [2022-04-15 12:58:59,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:58:59,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396048863] [2022-04-15 12:58:59,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:58:59,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:58:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:59,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:58:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:59,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {20865#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20851#true} is VALID [2022-04-15 12:58:59,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {20851#true} assume true; {20851#true} is VALID [2022-04-15 12:58:59,995 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20851#true} {20851#true} #94#return; {20851#true} is VALID [2022-04-15 12:58:59,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {20851#true} call ULTIMATE.init(); {20865#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:58:59,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {20865#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20851#true} is VALID [2022-04-15 12:58:59,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {20851#true} assume true; {20851#true} is VALID [2022-04-15 12:58:59,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20851#true} {20851#true} #94#return; {20851#true} is VALID [2022-04-15 12:58:59,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {20851#true} call #t~ret17 := main(); {20851#true} is VALID [2022-04-15 12:58:59,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {20851#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20851#true} is VALID [2022-04-15 12:58:59,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {20851#true} [156] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_30 v_main_~y~0_Out_60) (= v_main_~x~0_In_30 v_main_~x~0_Out_60)) (and (= (+ v_main_~x~0_In_30 v_main_~y~0_In_30) (+ v_main_~y~0_Out_60 v_main_~x~0_Out_60)) (< 0 (mod (+ v_main_~x~0_Out_60 1) 4294967296)) (= |v_main_#t~post5_Out_60| 0) (<= v_main_~x~0_Out_60 v_main_~x~0_In_30) (= |v_main_#t~post6_Out_60| 0))) InVars {main_~x~0=v_main_~x~0_In_30, main_~y~0=v_main_~y~0_In_30} OutVars{main_~y~0=v_main_~y~0_Out_60, main_#t~post5=|v_main_#t~post5_Out_60|, main_~x~0=v_main_~x~0_Out_60, main_#t~post6=|v_main_#t~post6_Out_60|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20851#true} is VALID [2022-04-15 12:58:59,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {20851#true} [155] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {20851#true} is VALID [2022-04-15 12:58:59,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {20851#true} ~z~0 := ~y~0; {20856#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:58:59,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {20856#(= 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; {20857#(and (= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0) (<= main_~y~0 (+ 4294967295 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:59:00,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {20857#(and (= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0) (<= main_~y~0 (+ 4294967295 (* (div 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; {20858#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:59:00,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {20858#(<= main_~z~0 (+ (* (div main_~z~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; {20859#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:00,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {20859#(<= main_~z~0 (+ 4294967292 (* (div 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; {20860#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:00,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {20860#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {20860#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:00,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {20860#(<= main_~z~0 (+ 4294967291 (* (div 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; {20861#(<= main_~z~0 (+ 4294967292 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:59:00,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {20861#(<= main_~z~0 (+ 4294967292 (* 4294967296 (div (+ (- 1) 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; {20862#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967293))} is VALID [2022-04-15 12:59:00,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {20862#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20863#(<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:00,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {20863#(<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~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; {20864#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-15 12:59:00,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {20864#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {20864#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-15 12:59:00,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {20864#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20864#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-15 12:59:00,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {20864#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20864#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-15 12:59:00,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {20864#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20864#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-15 12:59:00,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {20864#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20864#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-15 12:59:00,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {20864#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {20864#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-15 12:59:00,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {20864#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {20852#false} is VALID [2022-04-15 12:59:00,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {20852#false} assume !(~y~0 % 4294967296 > 0); {20852#false} is VALID [2022-04-15 12:59:00,030 INFO L272 TraceCheckUtils]: 26: Hoare triple {20852#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20852#false} is VALID [2022-04-15 12:59:00,030 INFO L290 TraceCheckUtils]: 27: Hoare triple {20852#false} ~cond := #in~cond; {20852#false} is VALID [2022-04-15 12:59:00,030 INFO L290 TraceCheckUtils]: 28: Hoare triple {20852#false} assume 0 == ~cond; {20852#false} is VALID [2022-04-15 12:59:00,030 INFO L290 TraceCheckUtils]: 29: Hoare triple {20852#false} assume !false; {20852#false} is VALID [2022-04-15 12:59:00,030 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:59:00,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:59:00,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396048863] [2022-04-15 12:59:00,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396048863] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:59:00,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119958987] [2022-04-15 12:59:00,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:59:00,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:59:00,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:59:00,031 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:59:00,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-15 12:59:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:00,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 12:59:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:00,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:59:00,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {20851#true} call ULTIMATE.init(); {20851#true} is VALID [2022-04-15 12:59:00,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {20851#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20851#true} is VALID [2022-04-15 12:59:00,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {20851#true} assume true; {20851#true} is VALID [2022-04-15 12:59:00,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20851#true} {20851#true} #94#return; {20851#true} is VALID [2022-04-15 12:59:00,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {20851#true} call #t~ret17 := main(); {20851#true} is VALID [2022-04-15 12:59:00,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {20851#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20851#true} is VALID [2022-04-15 12:59:00,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {20851#true} [156] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_30 v_main_~y~0_Out_60) (= v_main_~x~0_In_30 v_main_~x~0_Out_60)) (and (= (+ v_main_~x~0_In_30 v_main_~y~0_In_30) (+ v_main_~y~0_Out_60 v_main_~x~0_Out_60)) (< 0 (mod (+ v_main_~x~0_Out_60 1) 4294967296)) (= |v_main_#t~post5_Out_60| 0) (<= v_main_~x~0_Out_60 v_main_~x~0_In_30) (= |v_main_#t~post6_Out_60| 0))) InVars {main_~x~0=v_main_~x~0_In_30, main_~y~0=v_main_~y~0_In_30} OutVars{main_~y~0=v_main_~y~0_Out_60, main_#t~post5=|v_main_#t~post5_Out_60|, main_~x~0=v_main_~x~0_Out_60, main_#t~post6=|v_main_#t~post6_Out_60|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20851#true} is VALID [2022-04-15 12:59:00,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {20851#true} [155] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {20851#true} is VALID [2022-04-15 12:59:00,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {20851#true} ~z~0 := ~y~0; {20851#true} is VALID [2022-04-15 12:59:00,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {20851#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20851#true} is VALID [2022-04-15 12:59:00,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {20851#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20851#true} is VALID [2022-04-15 12:59:00,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {20851#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20851#true} is VALID [2022-04-15 12:59:00,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {20851#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20851#true} is VALID [2022-04-15 12:59:00,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {20851#true} assume !(~z~0 % 4294967296 > 0); {20851#true} is VALID [2022-04-15 12:59:00,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {20851#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20911#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 12:59:00,420 INFO L290 TraceCheckUtils]: 15: Hoare triple {20911#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20915#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 12:59:00,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {20915#(< 0 (mod (+ main_~y~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; {20919#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 12:59:00,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {20919#(< 0 (mod (+ main_~y~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; {20923#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-15 12:59:00,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {20923#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !(~y~0 % 4294967296 > 0); {20923#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-15 12:59:00,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {20923#(< 0 (mod (+ main_~y~0 4) 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; {20919#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 12:59:00,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {20919#(< 0 (mod (+ main_~y~0 3) 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; {20915#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 12:59:00,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {20915#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20911#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 12:59:00,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {20911#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20939#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:59:00,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {20939#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {20939#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:59:00,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {20939#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {20939#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:59:00,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {20939#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {20852#false} is VALID [2022-04-15 12:59:00,442 INFO L272 TraceCheckUtils]: 26: Hoare triple {20852#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20852#false} is VALID [2022-04-15 12:59:00,442 INFO L290 TraceCheckUtils]: 27: Hoare triple {20852#false} ~cond := #in~cond; {20852#false} is VALID [2022-04-15 12:59:00,442 INFO L290 TraceCheckUtils]: 28: Hoare triple {20852#false} assume 0 == ~cond; {20852#false} is VALID [2022-04-15 12:59:00,442 INFO L290 TraceCheckUtils]: 29: Hoare triple {20852#false} assume !false; {20852#false} is VALID [2022-04-15 12:59:00,442 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-15 12:59:00,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:59:00,537 INFO L290 TraceCheckUtils]: 29: Hoare triple {20852#false} assume !false; {20852#false} is VALID [2022-04-15 12:59:00,537 INFO L290 TraceCheckUtils]: 28: Hoare triple {20852#false} assume 0 == ~cond; {20852#false} is VALID [2022-04-15 12:59:00,537 INFO L290 TraceCheckUtils]: 27: Hoare triple {20852#false} ~cond := #in~cond; {20852#false} is VALID [2022-04-15 12:59:00,537 INFO L272 TraceCheckUtils]: 26: Hoare triple {20852#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20852#false} is VALID [2022-04-15 12:59:00,538 INFO L290 TraceCheckUtils]: 25: Hoare triple {20939#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {20852#false} is VALID [2022-04-15 12:59:00,538 INFO L290 TraceCheckUtils]: 24: Hoare triple {20939#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {20939#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:59:00,538 INFO L290 TraceCheckUtils]: 23: Hoare triple {20939#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {20939#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:59:00,543 INFO L290 TraceCheckUtils]: 22: Hoare triple {20911#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20939#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:59:00,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {20915#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20911#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 12:59:00,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {20919#(< 0 (mod (+ main_~y~0 3) 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; {20915#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 12:59:00,553 INFO L290 TraceCheckUtils]: 19: Hoare triple {20923#(< 0 (mod (+ main_~y~0 4) 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; {20919#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 12:59:00,553 INFO L290 TraceCheckUtils]: 18: Hoare triple {20923#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !(~y~0 % 4294967296 > 0); {20923#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-15 12:59:00,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {20919#(< 0 (mod (+ main_~y~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; {20923#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-15 12:59:00,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {20915#(< 0 (mod (+ main_~y~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; {20919#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 12:59:00,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {20911#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20915#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 12:59:00,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {20851#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20911#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 12:59:00,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {20851#true} assume !(~z~0 % 4294967296 > 0); {20851#true} is VALID [2022-04-15 12:59:00,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {20851#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20851#true} is VALID [2022-04-15 12:59:00,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {20851#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20851#true} is VALID [2022-04-15 12:59:00,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {20851#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20851#true} is VALID [2022-04-15 12:59:00,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {20851#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20851#true} is VALID [2022-04-15 12:59:00,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {20851#true} ~z~0 := ~y~0; {20851#true} is VALID [2022-04-15 12:59:00,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {20851#true} [155] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {20851#true} is VALID [2022-04-15 12:59:00,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {20851#true} [156] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_30 v_main_~y~0_Out_60) (= v_main_~x~0_In_30 v_main_~x~0_Out_60)) (and (= (+ v_main_~x~0_In_30 v_main_~y~0_In_30) (+ v_main_~y~0_Out_60 v_main_~x~0_Out_60)) (< 0 (mod (+ v_main_~x~0_Out_60 1) 4294967296)) (= |v_main_#t~post5_Out_60| 0) (<= v_main_~x~0_Out_60 v_main_~x~0_In_30) (= |v_main_#t~post6_Out_60| 0))) InVars {main_~x~0=v_main_~x~0_In_30, main_~y~0=v_main_~y~0_In_30} OutVars{main_~y~0=v_main_~y~0_Out_60, main_#t~post5=|v_main_#t~post5_Out_60|, main_~x~0=v_main_~x~0_Out_60, main_#t~post6=|v_main_#t~post6_Out_60|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20851#true} is VALID [2022-04-15 12:59:00,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {20851#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20851#true} is VALID [2022-04-15 12:59:00,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {20851#true} call #t~ret17 := main(); {20851#true} is VALID [2022-04-15 12:59:00,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20851#true} {20851#true} #94#return; {20851#true} is VALID [2022-04-15 12:59:00,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {20851#true} assume true; {20851#true} is VALID [2022-04-15 12:59:00,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {20851#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20851#true} is VALID [2022-04-15 12:59:00,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {20851#true} call ULTIMATE.init(); {20851#true} is VALID [2022-04-15 12:59:00,564 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-15 12:59:00,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119958987] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:59:00,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:59:00,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 17 [2022-04-15 12:59:01,014 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:59:01,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2133622237] [2022-04-15 12:59:01,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2133622237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:59:01,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:59:01,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 12:59:01,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296830373] [2022-04-15 12:59:01,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:59:01,015 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 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 33 [2022-04-15 12:59:01,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:59:01,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:01,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:59:01,103 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 12:59:01,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:59:01,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 12:59:01,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:59:01,104 INFO L87 Difference]: Start difference. First operand 118 states and 154 transitions. Second operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:15,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:15,287 INFO L93 Difference]: Finished difference Result 295 states and 420 transitions. [2022-04-15 12:59:15,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 12:59:15,288 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 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 33 [2022-04-15 12:59:15,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:59:15,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:15,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 176 transitions. [2022-04-15 12:59:15,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:15,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 176 transitions. [2022-04-15 12:59:15,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 176 transitions. [2022-04-15 12:59:16,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:59:16,159 INFO L225 Difference]: With dead ends: 295 [2022-04-15 12:59:16,159 INFO L226 Difference]: Without dead ends: 283 [2022-04-15 12:59:16,160 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=410, Invalid=2452, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 12:59:16,160 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 152 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:59:16,160 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 59 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-15 12:59:16,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-04-15 12:59:17,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 127. [2022-04-15 12:59:17,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:59:17,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 283 states. Second operand has 127 states, 122 states have (on average 1.3032786885245902) internal successors, (159), 122 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:17,267 INFO L74 IsIncluded]: Start isIncluded. First operand 283 states. Second operand has 127 states, 122 states have (on average 1.3032786885245902) internal successors, (159), 122 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:17,267 INFO L87 Difference]: Start difference. First operand 283 states. Second operand has 127 states, 122 states have (on average 1.3032786885245902) internal successors, (159), 122 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:17,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:17,270 INFO L93 Difference]: Finished difference Result 283 states and 399 transitions. [2022-04-15 12:59:17,270 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 399 transitions. [2022-04-15 12:59:17,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:59:17,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:59:17,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 122 states have (on average 1.3032786885245902) internal successors, (159), 122 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 283 states. [2022-04-15 12:59:17,271 INFO L87 Difference]: Start difference. First operand has 127 states, 122 states have (on average 1.3032786885245902) internal successors, (159), 122 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 283 states. [2022-04-15 12:59:17,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:17,274 INFO L93 Difference]: Finished difference Result 283 states and 399 transitions. [2022-04-15 12:59:17,274 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 399 transitions. [2022-04-15 12:59:17,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:59:17,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:59:17,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:59:17,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:59:17,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.3032786885245902) internal successors, (159), 122 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:17,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 163 transitions. [2022-04-15 12:59:17,276 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 163 transitions. Word has length 33 [2022-04-15 12:59:17,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:59:17,276 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 163 transitions. [2022-04-15 12:59:17,276 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:17,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 163 transitions. [2022-04-15 12:59:23,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:59:23,089 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 163 transitions. [2022-04-15 12:59:23,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 12:59:23,090 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:59:23,090 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:59:23,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-15 12:59:23,295 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:59:23,295 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:59:23,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:59:23,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1746970838, now seen corresponding path program 8 times [2022-04-15 12:59:23,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:59:23,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1154062211] [2022-04-15 12:59:23,433 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:59:23,434 INFO L85 PathProgramCache]: Analyzing trace with hash 849881047, now seen corresponding path program 1 times [2022-04-15 12:59:23,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:59:23,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070302724] [2022-04-15 12:59:23,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:59:23,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:59:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:23,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:59:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:23,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {22544#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22531#true} is VALID [2022-04-15 12:59:23,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {22531#true} assume true; {22531#true} is VALID [2022-04-15 12:59:23,701 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22531#true} {22531#true} #94#return; {22531#true} is VALID [2022-04-15 12:59:23,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {22531#true} call ULTIMATE.init(); {22544#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:59:23,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {22544#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22531#true} is VALID [2022-04-15 12:59:23,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {22531#true} assume true; {22531#true} is VALID [2022-04-15 12:59:23,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22531#true} {22531#true} #94#return; {22531#true} is VALID [2022-04-15 12:59:23,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {22531#true} call #t~ret17 := main(); {22531#true} is VALID [2022-04-15 12:59:23,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {22531#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22531#true} is VALID [2022-04-15 12:59:23,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {22531#true} [158] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_62| 0) (= |v_main_#t~post5_Out_62| 0) (< 0 (mod (+ v_main_~x~0_Out_62 1) 4294967296)) (<= v_main_~x~0_Out_62 v_main_~x~0_In_31) (= (+ v_main_~y~0_Out_62 v_main_~x~0_Out_62) (+ v_main_~x~0_In_31 v_main_~y~0_In_31))) (and (= v_main_~y~0_In_31 v_main_~y~0_Out_62) (= v_main_~x~0_In_31 v_main_~x~0_Out_62))) InVars {main_~x~0=v_main_~x~0_In_31, main_~y~0=v_main_~y~0_In_31} OutVars{main_~y~0=v_main_~y~0_Out_62, main_#t~post5=|v_main_#t~post5_Out_62|, main_~x~0=v_main_~x~0_Out_62, main_#t~post6=|v_main_#t~post6_Out_62|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22531#true} is VALID [2022-04-15 12:59:23,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {22531#true} [157] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {22536#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:59:23,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {22536#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {22536#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:59:23,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {22536#(<= 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; {22537#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:59:23,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {22537#(<= 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; {22538#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:23,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {22538#(<= 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; {22539#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:23,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {22539#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22540#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:23,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {22540#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22541#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:59:23,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {22541#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22542#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:23,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {22542#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {22542#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:23,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {22542#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {22542#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:23,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {22542#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {22542#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:23,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {22542#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {22542#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:23,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {22542#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {22542#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:23,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {22542#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {22542#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:23,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {22542#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {22542#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:23,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {22542#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {22542#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:23,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {22542#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {22543#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:59:23,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {22543#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {22532#false} is VALID [2022-04-15 12:59:23,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {22532#false} assume !(~z~0 % 4294967296 > 0); {22532#false} is VALID [2022-04-15 12:59:23,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {22532#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; {22532#false} is VALID [2022-04-15 12:59:23,736 INFO L290 TraceCheckUtils]: 27: Hoare triple {22532#false} assume !(~y~0 % 4294967296 > 0); {22532#false} is VALID [2022-04-15 12:59:23,736 INFO L272 TraceCheckUtils]: 28: Hoare triple {22532#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {22532#false} is VALID [2022-04-15 12:59:23,736 INFO L290 TraceCheckUtils]: 29: Hoare triple {22532#false} ~cond := #in~cond; {22532#false} is VALID [2022-04-15 12:59:23,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {22532#false} assume 0 == ~cond; {22532#false} is VALID [2022-04-15 12:59:23,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {22532#false} assume !false; {22532#false} is VALID [2022-04-15 12:59:23,737 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-15 12:59:23,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:59:23,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070302724] [2022-04-15 12:59:23,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070302724] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:59:23,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263981527] [2022-04-15 12:59:23,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:59:23,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:59:23,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:59:23,738 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:59:23,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-15 12:59:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:23,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 12:59:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:23,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:59:24,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {22531#true} call ULTIMATE.init(); {22531#true} is VALID [2022-04-15 12:59:24,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {22531#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22531#true} is VALID [2022-04-15 12:59:24,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {22531#true} assume true; {22531#true} is VALID [2022-04-15 12:59:24,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22531#true} {22531#true} #94#return; {22531#true} is VALID [2022-04-15 12:59:24,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {22531#true} call #t~ret17 := main(); {22531#true} is VALID [2022-04-15 12:59:24,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {22531#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22531#true} is VALID [2022-04-15 12:59:24,900 INFO L290 TraceCheckUtils]: 6: Hoare triple {22531#true} [158] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_62| 0) (= |v_main_#t~post5_Out_62| 0) (< 0 (mod (+ v_main_~x~0_Out_62 1) 4294967296)) (<= v_main_~x~0_Out_62 v_main_~x~0_In_31) (= (+ v_main_~y~0_Out_62 v_main_~x~0_Out_62) (+ v_main_~x~0_In_31 v_main_~y~0_In_31))) (and (= v_main_~y~0_In_31 v_main_~y~0_Out_62) (= v_main_~x~0_In_31 v_main_~x~0_Out_62))) InVars {main_~x~0=v_main_~x~0_In_31, main_~y~0=v_main_~y~0_In_31} OutVars{main_~y~0=v_main_~y~0_Out_62, main_#t~post5=|v_main_#t~post5_Out_62|, main_~x~0=v_main_~x~0_Out_62, main_#t~post6=|v_main_#t~post6_Out_62|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22531#true} is VALID [2022-04-15 12:59:24,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {22531#true} [157] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {22531#true} is VALID [2022-04-15 12:59:24,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {22531#true} ~z~0 := ~y~0; {22572#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:59:24,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {22572#(= 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; {22576#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-15 12:59:24,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {22576#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22580#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:59:24,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {22580#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22584#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:59:24,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {22584#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22588#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:59:24,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {22588#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22592#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:59:24,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {22592#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22596#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:59:24,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {22596#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {22596#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:59:24,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {22596#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (< 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; {22603#(and (= (+ 5 main_~z~0) (+ main_~y~0 1)) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} is VALID [2022-04-15 12:59:24,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {22603#(and (= (+ 5 main_~z~0) (+ main_~y~0 1)) (< 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; {22607#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:59:24,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {22607#(< 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; {22611#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:59:24,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {22611#(< 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; {22615#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:59:24,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {22615#(< 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; {22619#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:59:24,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {22619#(< 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; {22623#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:59:24,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {22623#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {22623#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:59:24,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {22623#(< 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; {22623#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:59:24,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {22623#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {22623#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:59:24,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {22623#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {22532#false} is VALID [2022-04-15 12:59:24,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {22532#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; {22532#false} is VALID [2022-04-15 12:59:24,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {22532#false} assume !(~y~0 % 4294967296 > 0); {22532#false} is VALID [2022-04-15 12:59:24,933 INFO L272 TraceCheckUtils]: 28: Hoare triple {22532#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {22532#false} is VALID [2022-04-15 12:59:24,933 INFO L290 TraceCheckUtils]: 29: Hoare triple {22532#false} ~cond := #in~cond; {22532#false} is VALID [2022-04-15 12:59:24,933 INFO L290 TraceCheckUtils]: 30: Hoare triple {22532#false} assume 0 == ~cond; {22532#false} is VALID [2022-04-15 12:59:24,933 INFO L290 TraceCheckUtils]: 31: Hoare triple {22532#false} assume !false; {22532#false} is VALID [2022-04-15 12:59:24,933 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:59:24,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:59:25,230 INFO L290 TraceCheckUtils]: 31: Hoare triple {22532#false} assume !false; {22532#false} is VALID [2022-04-15 12:59:25,231 INFO L290 TraceCheckUtils]: 30: Hoare triple {22532#false} assume 0 == ~cond; {22532#false} is VALID [2022-04-15 12:59:25,231 INFO L290 TraceCheckUtils]: 29: Hoare triple {22532#false} ~cond := #in~cond; {22532#false} is VALID [2022-04-15 12:59:25,231 INFO L272 TraceCheckUtils]: 28: Hoare triple {22532#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {22532#false} is VALID [2022-04-15 12:59:25,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {22532#false} assume !(~y~0 % 4294967296 > 0); {22532#false} is VALID [2022-04-15 12:59:25,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {22532#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; {22532#false} is VALID [2022-04-15 12:59:25,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {22623#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {22532#false} is VALID [2022-04-15 12:59:25,231 INFO L290 TraceCheckUtils]: 24: Hoare triple {22623#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {22623#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:59:25,232 INFO L290 TraceCheckUtils]: 23: Hoare triple {22623#(< 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; {22623#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:59:25,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {22623#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {22623#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:59:25,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {22619#(< 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; {22623#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:59:25,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {22615#(< 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; {22619#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:59:25,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {22611#(< 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; {22615#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:59:25,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {22607#(< 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; {22611#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:59:25,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {22696#(< 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; {22607#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:59:25,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {22700#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22696#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 12:59:25,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {22700#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !(~z~0 % 4294967296 > 0); {22700#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 12:59:25,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {22696#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22700#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 12:59:25,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {22607#(< 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; {22696#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 12:59:25,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {22611#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22607#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:59:25,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {22615#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22611#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:59:25,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {22619#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22615#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:59:25,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {22531#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22619#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:59:25,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {22531#true} ~z~0 := ~y~0; {22531#true} is VALID [2022-04-15 12:59:25,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {22531#true} [157] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {22531#true} is VALID [2022-04-15 12:59:25,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {22531#true} [158] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_62| 0) (= |v_main_#t~post5_Out_62| 0) (< 0 (mod (+ v_main_~x~0_Out_62 1) 4294967296)) (<= v_main_~x~0_Out_62 v_main_~x~0_In_31) (= (+ v_main_~y~0_Out_62 v_main_~x~0_Out_62) (+ v_main_~x~0_In_31 v_main_~y~0_In_31))) (and (= v_main_~y~0_In_31 v_main_~y~0_Out_62) (= v_main_~x~0_In_31 v_main_~x~0_Out_62))) InVars {main_~x~0=v_main_~x~0_In_31, main_~y~0=v_main_~y~0_In_31} OutVars{main_~y~0=v_main_~y~0_Out_62, main_#t~post5=|v_main_#t~post5_Out_62|, main_~x~0=v_main_~x~0_Out_62, main_#t~post6=|v_main_#t~post6_Out_62|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22531#true} is VALID [2022-04-15 12:59:25,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {22531#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22531#true} is VALID [2022-04-15 12:59:25,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {22531#true} call #t~ret17 := main(); {22531#true} is VALID [2022-04-15 12:59:25,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22531#true} {22531#true} #94#return; {22531#true} is VALID [2022-04-15 12:59:25,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {22531#true} assume true; {22531#true} is VALID [2022-04-15 12:59:25,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {22531#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22531#true} is VALID [2022-04-15 12:59:25,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {22531#true} call ULTIMATE.init(); {22531#true} is VALID [2022-04-15 12:59:25,265 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:59:25,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263981527] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:59:25,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:59:25,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 9] total 26 [2022-04-15 12:59:25,966 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:59:25,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1154062211] [2022-04-15 12:59:25,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1154062211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:59:25,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:59:25,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:59:25,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50780736] [2022-04-15 12:59:25,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:59:25,966 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 34 [2022-04-15 12:59:25,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:59:25,967 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-15 12:59:26,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:59:26,053 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:59:26,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:59:26,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:59:26,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2022-04-15 12:59:26,054 INFO L87 Difference]: Start difference. First operand 127 states and 163 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-15 12:59:38,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:38,047 INFO L93 Difference]: Finished difference Result 439 states and 648 transitions. [2022-04-15 12:59:38,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 12:59:38,047 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 34 [2022-04-15 12:59:38,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:59:38,048 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-15 12:59:38,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 151 transitions. [2022-04-15 12:59:38,049 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-15 12:59:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 151 transitions. [2022-04-15 12:59:38,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 151 transitions. [2022-04-15 12:59:38,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:59:38,615 INFO L225 Difference]: With dead ends: 439 [2022-04-15 12:59:38,615 INFO L226 Difference]: Without dead ends: 412 [2022-04-15 12:59:38,615 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=220, Invalid=1586, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 12:59:38,615 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 197 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:59:38,616 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 73 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 12:59:38,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2022-04-15 12:59:39,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 137. [2022-04-15 12:59:39,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:59:39,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 412 states. Second operand has 137 states, 132 states have (on average 1.303030303030303) internal successors, (172), 132 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:39,825 INFO L74 IsIncluded]: Start isIncluded. First operand 412 states. Second operand has 137 states, 132 states have (on average 1.303030303030303) internal successors, (172), 132 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:39,825 INFO L87 Difference]: Start difference. First operand 412 states. Second operand has 137 states, 132 states have (on average 1.303030303030303) internal successors, (172), 132 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:39,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:39,831 INFO L93 Difference]: Finished difference Result 412 states and 600 transitions. [2022-04-15 12:59:39,831 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 600 transitions. [2022-04-15 12:59:39,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:59:39,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:59:39,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 132 states have (on average 1.303030303030303) internal successors, (172), 132 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 412 states. [2022-04-15 12:59:39,832 INFO L87 Difference]: Start difference. First operand has 137 states, 132 states have (on average 1.303030303030303) internal successors, (172), 132 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 412 states. [2022-04-15 12:59:39,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:39,838 INFO L93 Difference]: Finished difference Result 412 states and 600 transitions. [2022-04-15 12:59:39,838 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 600 transitions. [2022-04-15 12:59:39,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:59:39,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:59:39,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:59:39,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:59:39,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.303030303030303) internal successors, (172), 132 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:39,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 176 transitions. [2022-04-15 12:59:39,840 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 176 transitions. Word has length 34 [2022-04-15 12:59:39,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:59:39,840 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 176 transitions. [2022-04-15 12:59:39,840 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:39,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 176 transitions. [2022-04-15 12:59:45,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:59:45,962 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 176 transitions. [2022-04-15 12:59:45,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 12:59:45,962 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:59:45,962 INFO L499 BasicCegarLoop]: 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-15 12:59:45,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-15 12:59:46,163 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:59:46,163 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:59:46,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:59:46,163 INFO L85 PathProgramCache]: Analyzing trace with hash 289270042, now seen corresponding path program 6 times [2022-04-15 12:59:46,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:59:46,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [444215081] [2022-04-15 12:59:46,292 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:59:46,293 INFO L85 PathProgramCache]: Analyzing trace with hash 234557945, now seen corresponding path program 1 times [2022-04-15 12:59:46,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:59:46,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802521703] [2022-04-15 12:59:46,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:59:46,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:59:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:47,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:59:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:47,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {24782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24758#true} is VALID [2022-04-15 12:59:47,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {24758#true} assume true; {24758#true} is VALID [2022-04-15 12:59:47,786 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24758#true} {24758#true} #94#return; {24758#true} is VALID [2022-04-15 12:59:47,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {24758#true} call ULTIMATE.init(); {24782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:59:47,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {24782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24758#true} is VALID [2022-04-15 12:59:47,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {24758#true} assume true; {24758#true} is VALID [2022-04-15 12:59:47,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24758#true} {24758#true} #94#return; {24758#true} is VALID [2022-04-15 12:59:47,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {24758#true} call #t~ret17 := main(); {24758#true} is VALID [2022-04-15 12:59:47,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {24758#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24763#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:59:47,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {24763#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [160] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_64 1) 4294967296)) (<= v_main_~x~0_Out_64 v_main_~x~0_In_32) (= (+ v_main_~x~0_In_32 v_main_~y~0_In_32) (+ v_main_~y~0_Out_64 v_main_~x~0_Out_64)) (= |v_main_#t~post6_Out_64| 0) (= |v_main_#t~post5_Out_64| 0)) (and (= v_main_~x~0_In_32 v_main_~x~0_Out_64) (= v_main_~y~0_In_32 v_main_~y~0_Out_64))) InVars {main_~x~0=v_main_~x~0_In_32, main_~y~0=v_main_~y~0_In_32} OutVars{main_~y~0=v_main_~y~0_Out_64, main_#t~post5=|v_main_#t~post5_Out_64|, main_~x~0=v_main_~x~0_Out_64, main_#t~post6=|v_main_#t~post6_Out_64|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {24764#(or (and (<= (+ main_~y~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} is VALID [2022-04-15 12:59:47,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {24764#(or (and (<= (+ main_~y~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} [159] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {24765#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-15 12:59:47,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {24765#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} ~z~0 := ~y~0; {24766#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (+ main_~z~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~n~0) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-15 12:59:47,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {24766#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (+ main_~z~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~n~0) (<= main_~n~0 (+ main_~z~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; {24767#(and (<= (+ (* (div (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) (- 4294967296)) main_~n~0 (* (- 1) main_~z~0) 4294967294 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 1) main_~x~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294 (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ (* (- 8589934592) main_~z~0) (* main_~n~0 4294967296) 18446744060824649728 (* 18446744073709551616 (div main_~z~0 4294967296))) 18446744073709551616) (- 4294967296))) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-15 12:59:47,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {24767#(and (<= (+ (* (div (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) (- 4294967296)) main_~n~0 (* (- 1) main_~z~0) 4294967294 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 1) main_~x~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294 (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ (* (- 8589934592) main_~z~0) (* main_~n~0 4294967296) 18446744060824649728 (* 18446744073709551616 (div main_~z~0 4294967296))) 18446744073709551616) (- 4294967296))) 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; {24768#(<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) (- 4294967296)) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 4294967293) 4294967296)) 2) main_~x~0)} is VALID [2022-04-15 12:59:47,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {24768#(<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) (- 4294967296)) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 4294967293) 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; {24769#(<= (+ (* 4294967296 (div (+ 4294967292 main_~n~0 (* (- 4294967296) (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296)) (* (- 1) main_~z~0) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)) 4294967296)) 3) main_~x~0)} is VALID [2022-04-15 12:59:47,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {24769#(<= (+ (* 4294967296 (div (+ 4294967292 main_~n~0 (* (- 4294967296) (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296)) (* (- 1) main_~z~0) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)) 4294967296)) 3) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {24770#(and (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (div (+ (* (- 1) main_~z~0) (* (div main_~n~0 4294967296) 4294967296)) 4294967296) (- 4294967296))) 4294967296) 4294967296) 3) main_~x~0) (<= (+ (* 4294967296 (div (+ 4294967292 main_~n~0 (* (- 4294967296) (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296)) (* (- 1) main_~z~0) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)) 4294967296)) 3) main_~x~0))} is VALID [2022-04-15 12:59:47,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {24770#(and (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (div (+ (* (- 1) main_~z~0) (* (div main_~n~0 4294967296) 4294967296)) 4294967296) (- 4294967296))) 4294967296) 4294967296) 3) main_~x~0) (<= (+ (* 4294967296 (div (+ 4294967292 main_~n~0 (* (- 4294967296) (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296)) (* (- 1) main_~z~0) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)) 4294967296)) 3) 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; {24771#(and (<= (+ (* (div (+ (* (div (+ (* (- 1) main_~z~0) (* (div main_~n~0 4294967296) 4294967296) 1) 4294967296) (- 4294967296)) main_~n~0 (* (- 1) main_~z~0) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) 4294967293) 4294967296) 4294967296) 3) main_~x~0) (<= (+ 3 (* (div (+ main_~n~0 (* (- 1) main_~z~0) (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) (- 4294967296)) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) 4294967293) 4294967296) 4294967296)) main_~x~0))} is VALID [2022-04-15 12:59:47,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {24771#(and (<= (+ (* (div (+ (* (div (+ (* (- 1) main_~z~0) (* (div main_~n~0 4294967296) 4294967296) 1) 4294967296) (- 4294967296)) main_~n~0 (* (- 1) main_~z~0) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) 4294967293) 4294967296) 4294967296) 3) main_~x~0) (<= (+ 3 (* (div (+ main_~n~0 (* (- 1) main_~z~0) (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) (- 4294967296)) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) 4294967293) 4294967296) 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; {24772#(and (<= (+ (* (div (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) (- 4294967296)) main_~n~0 (* (- 1) main_~z~0) 4294967294 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)) 4294967296) 4294967296) 3) main_~x~0) (<= (+ 3 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294 (* (- 4294967296) (div (+ 2 (* (- 1) main_~z~0) (* (div main_~n~0 4294967296) 4294967296)) 4294967296)) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)) 4294967296) 4294967296)) main_~x~0))} is VALID [2022-04-15 12:59:47,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {24772#(and (<= (+ (* (div (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) (- 4294967296)) main_~n~0 (* (- 1) main_~z~0) 4294967294 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)) 4294967296) 4294967296) 3) main_~x~0) (<= (+ 3 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294 (* (- 4294967296) (div (+ 2 (* (- 1) main_~z~0) (* (div main_~n~0 4294967296) 4294967296)) 4294967296)) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)) 4294967296) 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; {24773#(and (<= (+ (* (div (+ (* (div (+ (* (- 1) main_~z~0) 3 (* (div main_~n~0 4294967296) 4294967296)) 4294967296) (- 4294967296)) main_~n~0 (* (- 1) main_~z~0) 4294967295 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)) 4294967296) 4294967296) 3) main_~x~0) (<= (+ 3 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) (- 4294967296)) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)) 4294967296) 4294967296)) main_~x~0))} is VALID [2022-04-15 12:59:47,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {24773#(and (<= (+ (* (div (+ (* (div (+ (* (- 1) main_~z~0) 3 (* (div main_~n~0 4294967296) 4294967296)) 4294967296) (- 4294967296)) main_~n~0 (* (- 1) main_~z~0) 4294967295 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)) 4294967296) 4294967296) 3) main_~x~0) (<= (+ 3 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) (- 4294967296)) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)) 4294967296) 4294967296)) main_~x~0))} assume !(~y~0 % 4294967296 > 0); {24773#(and (<= (+ (* (div (+ (* (div (+ (* (- 1) main_~z~0) 3 (* (div main_~n~0 4294967296) 4294967296)) 4294967296) (- 4294967296)) main_~n~0 (* (- 1) main_~z~0) 4294967295 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)) 4294967296) 4294967296) 3) main_~x~0) (<= (+ 3 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) (- 4294967296)) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)) 4294967296) 4294967296)) main_~x~0))} is VALID [2022-04-15 12:59:47,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {24773#(and (<= (+ (* (div (+ (* (div (+ (* (- 1) main_~z~0) 3 (* (div main_~n~0 4294967296) 4294967296)) 4294967296) (- 4294967296)) main_~n~0 (* (- 1) main_~z~0) 4294967295 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)) 4294967296) 4294967296) 3) main_~x~0) (<= (+ 3 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) (- 4294967296)) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)) 4294967296) 4294967296)) main_~x~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24774#(or (and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (<= main_~n~0 (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) 3 (* (div main_~n~0 4294967296) 4294967296)) 4294967296) 4294967296)))) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 12:59:48,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {24774#(or (and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (<= main_~n~0 (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) 3 (* (div main_~n~0 4294967296) 4294967296)) 4294967296) 4294967296)))) (<= 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; {24775#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (<= main_~n~0 (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) 3 (* (div main_~n~0 4294967296) 4294967296)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:59:48,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {24775#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (<= main_~n~0 (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) 3 (* (div main_~n~0 4294967296) 4294967296)) 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; {24775#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (<= main_~n~0 (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) 3 (* (div main_~n~0 4294967296) 4294967296)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:59:48,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {24775#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (<= main_~n~0 (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) 3 (* (div main_~n~0 4294967296) 4294967296)) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {24775#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (<= main_~n~0 (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) 3 (* (div main_~n~0 4294967296) 4294967296)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:59:48,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {24775#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (<= main_~n~0 (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) 3 (* (div main_~n~0 4294967296) 4294967296)) 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; {24776#(and (<= main_~n~0 (+ (* 4294967296 (div (+ 2 (* (- 1) main_~z~0) (* (div main_~n~0 4294967296) 4294967296)) 4294967296)) main_~z~0 1)) (<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:59:48,008 INFO L290 TraceCheckUtils]: 22: Hoare triple {24776#(and (<= main_~n~0 (+ (* 4294967296 (div (+ 2 (* (- 1) main_~z~0) (* (div main_~n~0 4294967296) 4294967296)) 4294967296)) main_~z~0 1)) (<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (* (- 1) main_~z~0) (* (div main_~n~0 4294967296) 4294967296) 1) 4294967296) 4294967296))) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:59:48,012 INFO L290 TraceCheckUtils]: 23: Hoare triple {24777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (* (- 1) main_~z~0) (* (div main_~n~0 4294967296) 4294967296) 1) 4294967296) 4294967296))) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) 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; {24778#(and (<= main_~n~0 (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* (div main_~n~0 4294967296) 4294967296)) 4294967296) 4294967296))) (<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296)))))} is VALID [2022-04-15 12:59:48,013 INFO L290 TraceCheckUtils]: 24: Hoare triple {24778#(and (<= main_~n~0 (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* (div main_~n~0 4294967296) 4294967296)) 4294967296) 4294967296))) (<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296)))))} assume !(~z~0 % 4294967296 > 0); {24778#(and (<= main_~n~0 (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* (div main_~n~0 4294967296) 4294967296)) 4294967296) 4294967296))) (<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296)))))} is VALID [2022-04-15 12:59:48,017 INFO L290 TraceCheckUtils]: 25: Hoare triple {24778#(and (<= main_~n~0 (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* (div main_~n~0 4294967296) 4294967296)) 4294967296) 4294967296))) (<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) 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; {24777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (* (- 1) main_~z~0) (* (div main_~n~0 4294967296) 4294967296) 1) 4294967296) 4294967296))) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:59:48,020 INFO L290 TraceCheckUtils]: 26: Hoare triple {24777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (* (- 1) main_~z~0) (* (div main_~n~0 4294967296) 4294967296) 1) 4294967296) 4294967296))) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) 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; {24776#(and (<= main_~n~0 (+ (* 4294967296 (div (+ 2 (* (- 1) main_~z~0) (* (div main_~n~0 4294967296) 4294967296)) 4294967296)) main_~z~0 1)) (<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:59:48,023 INFO L290 TraceCheckUtils]: 27: Hoare triple {24776#(and (<= main_~n~0 (+ (* 4294967296 (div (+ 2 (* (- 1) main_~z~0) (* (div main_~n~0 4294967296) 4294967296)) 4294967296)) main_~z~0 1)) (<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 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; {24779#(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-15 12:59:48,023 INFO L290 TraceCheckUtils]: 28: Hoare triple {24779#(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); {24779#(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-15 12:59:48,025 INFO L272 TraceCheckUtils]: 29: Hoare triple {24779#(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)); {24780#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:59:48,025 INFO L290 TraceCheckUtils]: 30: Hoare triple {24780#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {24781#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:59:48,025 INFO L290 TraceCheckUtils]: 31: Hoare triple {24781#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24759#false} is VALID [2022-04-15 12:59:48,025 INFO L290 TraceCheckUtils]: 32: Hoare triple {24759#false} assume !false; {24759#false} is VALID [2022-04-15 12:59:48,026 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:59:48,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:59:48,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802521703] [2022-04-15 12:59:48,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802521703] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:59:48,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627764405] [2022-04-15 12:59:48,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:59:48,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:59:48,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:59:48,027 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:59:48,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-15 12:59:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:48,237 WARN L261 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 69 conjunts are in the unsatisfiable core [2022-04-15 12:59:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:48,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:00:04,178 INFO L272 TraceCheckUtils]: 0: Hoare triple {24758#true} call ULTIMATE.init(); {24758#true} is VALID [2022-04-15 13:00:04,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {24758#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24758#true} is VALID [2022-04-15 13:00:04,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {24758#true} assume true; {24758#true} is VALID [2022-04-15 13:00:04,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24758#true} {24758#true} #94#return; {24758#true} is VALID [2022-04-15 13:00:04,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {24758#true} call #t~ret17 := main(); {24758#true} is VALID [2022-04-15 13:00:04,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {24758#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24763#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 13:00:04,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {24763#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [160] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_64 1) 4294967296)) (<= v_main_~x~0_Out_64 v_main_~x~0_In_32) (= (+ v_main_~x~0_In_32 v_main_~y~0_In_32) (+ v_main_~y~0_Out_64 v_main_~x~0_Out_64)) (= |v_main_#t~post6_Out_64| 0) (= |v_main_#t~post5_Out_64| 0)) (and (= v_main_~x~0_In_32 v_main_~x~0_Out_64) (= v_main_~y~0_In_32 v_main_~y~0_Out_64))) InVars {main_~x~0=v_main_~x~0_In_32, main_~y~0=v_main_~y~0_In_32} OutVars{main_~y~0=v_main_~y~0_Out_64, main_#t~post5=|v_main_#t~post5_Out_64|, main_~x~0=v_main_~x~0_Out_64, main_#t~post6=|v_main_#t~post6_Out_64|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {24804#(or (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~x~0 main_~n~0) (= main_~n~0 (+ main_~y~0 main_~x~0))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} is VALID [2022-04-15 13:00:04,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {24804#(or (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~x~0 main_~n~0) (= main_~n~0 (+ main_~y~0 main_~x~0))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} [159] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {24808#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-15 13:00:04,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {24808#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} ~z~0 := ~y~0; {24812#(and (= main_~z~0 main_~y~0) (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-15 13:00:04,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {24812#(and (= main_~z~0 main_~y~0) (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 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; {24816#(and (= main_~n~0 (+ (- 1) main_~y~0 main_~x~0)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= main_~y~0 (+ main_~z~0 1)) (<= main_~x~0 (+ main_~n~0 1)))} is VALID [2022-04-15 13:00:04,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {24816#(and (= main_~n~0 (+ (- 1) main_~y~0 main_~x~0)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= main_~y~0 (+ main_~z~0 1)) (<= main_~x~0 (+ main_~n~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; {24820#(and (= main_~y~0 (+ main_~z~0 2)) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~x~0 (+ main_~n~0 2)) (= main_~n~0 (+ (- 2) main_~y~0 main_~x~0)))} is VALID [2022-04-15 13:00:04,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {24820#(and (= main_~y~0 (+ main_~z~0 2)) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~x~0 (+ main_~n~0 2)) (= main_~n~0 (+ (- 2) main_~y~0 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; {24824#(and (<= main_~x~0 (+ main_~n~0 3)) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0 (- 3))) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 13:00:04,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {24824#(and (<= main_~x~0 (+ main_~n~0 3)) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0 (- 3))) (= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {24824#(and (<= main_~x~0 (+ main_~n~0 3)) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0 (- 3))) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 13:00:04,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {24824#(and (<= main_~x~0 (+ main_~n~0 3)) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0 (- 3))) (= main_~y~0 (+ main_~z~0 3)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24831#(and (<= main_~x~0 (+ main_~n~0 3)) (< 0 (mod (+ main_~y~0 1) 4294967296)) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (= main_~z~0 (+ (- 1) main_~y~0)) (= main_~n~0 (+ (- 2) main_~y~0 main_~x~0)))} is VALID [2022-04-15 13:00:04,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {24831#(and (<= main_~x~0 (+ main_~n~0 3)) (< 0 (mod (+ main_~y~0 1) 4294967296)) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (= main_~z~0 (+ (- 1) main_~y~0)) (= main_~n~0 (+ (- 2) main_~y~0 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; {24835#(and (<= main_~x~0 (+ main_~n~0 3)) (= main_~n~0 (+ (- 1) main_~y~0 main_~x~0)) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (= main_~z~0 (+ main_~y~0 1)) (< 0 (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-15 13:00:04,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {24835#(and (<= main_~x~0 (+ main_~n~0 3)) (= main_~n~0 (+ (- 1) main_~y~0 main_~x~0)) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (= main_~z~0 (+ main_~y~0 1)) (< 0 (mod (+ main_~y~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; {24839#(and (<= main_~x~0 (+ main_~n~0 3)) (< 0 (mod (+ main_~n~0 3 (* main_~x~0 4294967295)) 4294967296)) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (= main_~z~0 (+ main_~n~0 3 (* (- 1) main_~x~0))) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~y~0 1)))} is VALID [2022-04-15 13:00:04,213 INFO L290 TraceCheckUtils]: 16: Hoare triple {24839#(and (<= main_~x~0 (+ main_~n~0 3)) (< 0 (mod (+ main_~n~0 3 (* main_~x~0 4294967295)) 4294967296)) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (= main_~z~0 (+ main_~n~0 3 (* (- 1) main_~x~0))) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~y~0 1)))} assume !(~y~0 % 4294967296 > 0); {24843#(and (<= main_~x~0 (+ main_~n~0 3)) (= (+ main_~z~0 main_~x~0) (+ main_~n~0 3)) (<= (mod main_~y~0 4294967296) 0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-15 13:00:04,219 INFO L290 TraceCheckUtils]: 17: Hoare triple {24843#(and (<= main_~x~0 (+ main_~n~0 3)) (= (+ main_~z~0 main_~x~0) (+ main_~n~0 3)) (<= (mod main_~y~0 4294967296) 0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (= main_~n~0 (+ main_~y~0 main_~x~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24847#(and (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (= (+ main_~z~0 main_~x~0 1) (+ main_~n~0 3)) (<= main_~x~0 (+ main_~n~0 2)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0))))} is VALID [2022-04-15 13:00:04,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {24847#(and (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (= (+ main_~z~0 main_~x~0 1) (+ main_~n~0 3)) (<= main_~x~0 (+ main_~n~0 2)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24851#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (= main_~y~0 (+ (- 1) main_~z~0)) (= (+ main_~x~0 1) (+ main_~n~0 2 (* (- 1) main_~z~0))) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= 0 main_~z~0))} is VALID [2022-04-15 13:00:04,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {24851#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (= main_~y~0 (+ (- 1) main_~z~0)) (= (+ main_~x~0 1) (+ main_~n~0 2 (* (- 1) main_~z~0))) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= 0 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24855#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (= (+ (- 1) main_~z~0) (+ (- 1) main_~y~0)) (= (+ main_~x~0 2) (+ main_~n~0 2 (* (- 1) main_~z~0))) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= 0 main_~z~0))} is VALID [2022-04-15 13:00:04,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {24855#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (= (+ (- 1) main_~z~0) (+ (- 1) main_~y~0)) (= (+ main_~x~0 2) (+ main_~n~0 2 (* (- 1) main_~z~0))) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= 0 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {24859#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (= main_~z~0 main_~y~0) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= 0 main_~z~0))} is VALID [2022-04-15 13:00:04,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {24859#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (= main_~z~0 main_~y~0) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24863#(and (<= 0 main_~y~0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-15 13:00:04,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {24863#(and (<= 0 main_~y~0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (= main_~y~0 (+ 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; {24867#(and (<= 0 main_~y~0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (= main_~y~0 (+ main_~z~0 2)) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-15 13:00:04,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {24867#(and (<= 0 main_~y~0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (= main_~y~0 (+ main_~z~0 2)) (<= (mod (+ main_~y~0 4294967293) 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; {24871#(and (<= 0 main_~y~0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 13:00:04,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {24871#(and (<= 0 main_~y~0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {24871#(and (<= 0 main_~y~0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 13:00:04,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {24871#(and (<= 0 main_~y~0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (= main_~y~0 (+ main_~z~0 3)))} 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; {24878#(and (<= (mod (+ main_~n~0 4294967295 (* main_~y~0 4294967295)) 4294967296) 0) (= main_~z~0 (+ (- 1) main_~y~0)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-15 13:00:04,244 INFO L290 TraceCheckUtils]: 26: Hoare triple {24878#(and (<= (mod (+ main_~n~0 4294967295 (* main_~y~0 4294967295)) 4294967296) 0) (= main_~z~0 (+ (- 1) main_~y~0)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (<= 0 (+ main_~y~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; {24882#(and (<= 0 (+ main_~y~0 2)) (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (= main_~z~0 (+ main_~y~0 1)) (<= (mod (+ main_~n~0 4294967294 (* main_~y~0 4294967295)) 4294967296) 0))} is VALID [2022-04-15 13:00:04,247 INFO L290 TraceCheckUtils]: 27: Hoare triple {24882#(and (<= 0 (+ main_~y~0 2)) (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (= main_~z~0 (+ main_~y~0 1)) (<= (mod (+ main_~n~0 4294967294 (* main_~y~0 4294967295)) 4294967296) 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; {24886#(and (<= 0 (+ main_~y~0 3)) (= (+ main_~y~0 2) (+ (- 1) main_~z~0)) (<= (mod main_~y~0 4294967296) 0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295) 4294967293) 4294967296) 0))} is VALID [2022-04-15 13:00:04,250 INFO L290 TraceCheckUtils]: 28: Hoare triple {24886#(and (<= 0 (+ main_~y~0 3)) (= (+ main_~y~0 2) (+ (- 1) main_~z~0)) (<= (mod main_~y~0 4294967296) 0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295) 4294967293) 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {24890#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= 0 main_~z~0))} is VALID [2022-04-15 13:00:04,253 INFO L272 TraceCheckUtils]: 29: Hoare triple {24890#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= 0 main_~z~0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24894#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:00:04,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {24894#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24898#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:00:04,254 INFO L290 TraceCheckUtils]: 31: Hoare triple {24898#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24759#false} is VALID [2022-04-15 13:00:04,254 INFO L290 TraceCheckUtils]: 32: Hoare triple {24759#false} assume !false; {24759#false} is VALID [2022-04-15 13:00:04,254 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-15 13:00:04,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:00:13,677 INFO L290 TraceCheckUtils]: 32: Hoare triple {24759#false} assume !false; {24759#false} is VALID [2022-04-15 13:00:13,677 INFO L290 TraceCheckUtils]: 31: Hoare triple {24898#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24759#false} is VALID [2022-04-15 13:00:13,677 INFO L290 TraceCheckUtils]: 30: Hoare triple {24894#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24898#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:00:13,678 INFO L272 TraceCheckUtils]: 29: Hoare triple {24779#(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)); {24894#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:00:13,679 INFO L290 TraceCheckUtils]: 28: Hoare triple {24917#(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_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {24779#(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-15 13:00:13,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {24921#(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)))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {24917#(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_~y~0 4294967296)))} is VALID [2022-04-15 13:00:13,690 INFO L290 TraceCheckUtils]: 26: Hoare triple {24925#(or (< 0 (mod (+ main_~y~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~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {24921#(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)))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 13:00:13,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {24929#(or (and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967293) 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; {24925#(or (< 0 (mod (+ main_~y~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-15 13:00:13,694 INFO L290 TraceCheckUtils]: 24: Hoare triple {24929#(or (and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {24929#(or (and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 13:00:13,699 INFO L290 TraceCheckUtils]: 23: Hoare triple {24936#(or (< 0 (mod (+ main_~y~0 4294967293) 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);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24929#(or (and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 13:00:13,707 INFO L290 TraceCheckUtils]: 22: Hoare triple {24940#(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)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24936#(or (< 0 (mod (+ main_~y~0 4294967293) 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-15 13:00:13,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {24944#(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_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24940#(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)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 13:00:13,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {24948#(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 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {24944#(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_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 13:00:13,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {24952#(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)))) (< 0 (mod (+ main_~y~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; {24948#(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 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 13:00:13,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {24956#(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_~y~0 4294967295) 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; {24952#(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)))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-15 13:00:13,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {24960#(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 4294967293) 4294967296)) (< 0 (mod main_~y~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24956#(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_~y~0 4294967295) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-15 13:00:13,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {24960#(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 4294967293) 4294967296)) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {24960#(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 4294967293) 4294967296)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 13:00:13,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {24967#(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)))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 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; {24960#(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 4294967293) 4294967296)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 13:00:13,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {24971#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod (+ main_~y~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; {24967#(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)))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 13:00:13,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {24975#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24971#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod (+ main_~y~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-15 13:00:13,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {24975#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {24975#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 13:00:13,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {24982#(or (< 0 (mod (+ main_~y~0 4294967293) 4294967296)) (< 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);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24975#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 13:00:13,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {24986#(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)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24982#(or (< 0 (mod (+ main_~y~0 4294967293) 4294967296)) (< 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-15 13:00:13,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {24948#(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 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24986#(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)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 13:00:13,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {24993#(or (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 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; {24948#(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 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 13:00:13,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {24993#(or (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 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))))} [159] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {24993#(or (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 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-15 13:00:15,773 WARN L290 TraceCheckUtils]: 6: Hoare triple {25000#(and (or (< (div (+ (* (- 1) main_~x~0) (* (- 1) main_~y~0) (- 4294967294)) (- 4294967296)) (+ (div (+ 4294967292 main_~y~0 main_~x~0) 4294967296) 2)) (< (div (+ (- 1) (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296)) (+ (* (div main_~n~0 4294967296) 2) (div (+ main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) (div (+ (- 4294967293) (* (- 1) main_~n~0)) 4294967296) 4))) (or (< (div (+ (* (- 1) main_~x~0) (* (- 1) main_~y~0) (- 4294967294)) (- 4294967296)) (+ (div (+ 4294967292 main_~y~0 main_~x~0) 4294967296) 2)) (<= (+ (* (div main_~n~0 4294967296) 2) (div (+ main_~n~0 4294967293) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296))) (+ (div (+ main_~y~0 main_~x~0 (- 4294967296)) 4294967296) 1))))} [160] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_64 1) 4294967296)) (<= v_main_~x~0_Out_64 v_main_~x~0_In_32) (= (+ v_main_~x~0_In_32 v_main_~y~0_In_32) (+ v_main_~y~0_Out_64 v_main_~x~0_Out_64)) (= |v_main_#t~post6_Out_64| 0) (= |v_main_#t~post5_Out_64| 0)) (and (= v_main_~x~0_In_32 v_main_~x~0_Out_64) (= v_main_~y~0_In_32 v_main_~y~0_Out_64))) InVars {main_~x~0=v_main_~x~0_In_32, main_~y~0=v_main_~y~0_In_32} OutVars{main_~y~0=v_main_~y~0_Out_64, main_#t~post5=|v_main_#t~post5_Out_64|, main_~x~0=v_main_~x~0_Out_64, main_#t~post6=|v_main_#t~post6_Out_64|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {24993#(or (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 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 UNKNOWN [2022-04-15 13:00:15,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {24758#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25000#(and (or (< (div (+ (* (- 1) main_~x~0) (* (- 1) main_~y~0) (- 4294967294)) (- 4294967296)) (+ (div (+ 4294967292 main_~y~0 main_~x~0) 4294967296) 2)) (< (div (+ (- 1) (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296)) (+ (* (div main_~n~0 4294967296) 2) (div (+ main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) (div (+ (- 4294967293) (* (- 1) main_~n~0)) 4294967296) 4))) (or (< (div (+ (* (- 1) main_~x~0) (* (- 1) main_~y~0) (- 4294967294)) (- 4294967296)) (+ (div (+ 4294967292 main_~y~0 main_~x~0) 4294967296) 2)) (<= (+ (* (div main_~n~0 4294967296) 2) (div (+ main_~n~0 4294967293) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296))) (+ (div (+ main_~y~0 main_~x~0 (- 4294967296)) 4294967296) 1))))} is VALID [2022-04-15 13:00:15,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {24758#true} call #t~ret17 := main(); {24758#true} is VALID [2022-04-15 13:00:15,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24758#true} {24758#true} #94#return; {24758#true} is VALID [2022-04-15 13:00:15,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {24758#true} assume true; {24758#true} is VALID [2022-04-15 13:00:15,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {24758#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24758#true} is VALID [2022-04-15 13:00:15,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {24758#true} call ULTIMATE.init(); {24758#true} is VALID [2022-04-15 13:00:15,780 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-15 13:00:15,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627764405] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:00:15,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:00:15,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26, 23] total 63 [2022-04-15 13:00:17,389 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:00:17,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [444215081] [2022-04-15 13:00:17,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [444215081] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:00:17,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:00:17,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 13:00:17,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433551394] [2022-04-15 13:00:17,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:00:17,390 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2916666666666667) 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-15 13:00:17,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:00:17,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.2916666666666667) 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-15 13:00:17,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:17,955 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 13:00:17,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:17,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 13:00:17,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=3823, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 13:00:17,956 INFO L87 Difference]: Start difference. First operand 137 states and 176 transitions. Second operand has 24 states, 24 states have (on average 1.2916666666666667) 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-15 13:00:32,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:32,624 INFO L93 Difference]: Finished difference Result 160 states and 208 transitions. [2022-04-15 13:00:32,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 13:00:32,624 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2916666666666667) 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-15 13:00:32,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:00:32,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2916666666666667) 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-15 13:00:32,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 57 transitions. [2022-04-15 13:00:32,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2916666666666667) 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-15 13:00:32,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 57 transitions. [2022-04-15 13:00:32,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 57 transitions. [2022-04-15 13:00:33,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:33,182 INFO L225 Difference]: With dead ends: 160 [2022-04-15 13:00:33,182 INFO L226 Difference]: Without dead ends: 155 [2022-04-15 13:00:33,183 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2470 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=834, Invalid=6648, Unknown=0, NotChecked=0, Total=7482 [2022-04-15 13:00:33,183 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 36 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-15 13:00:33,183 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 104 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-15 13:00:33,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-15 13:00:34,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 142. [2022-04-15 13:00:34,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:00:34,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 142 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 137 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:34,582 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 142 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 137 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:34,583 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 142 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 137 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:34,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:34,584 INFO L93 Difference]: Finished difference Result 155 states and 203 transitions. [2022-04-15 13:00:34,584 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 203 transitions. [2022-04-15 13:00:34,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:34,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:34,586 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 137 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 155 states. [2022-04-15 13:00:34,586 INFO L87 Difference]: Start difference. First operand has 142 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 137 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 155 states. [2022-04-15 13:00:34,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:34,588 INFO L93 Difference]: Finished difference Result 155 states and 203 transitions. [2022-04-15 13:00:34,588 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 203 transitions. [2022-04-15 13:00:34,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:34,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:34,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:00:34,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:00:34,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 137 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:34,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 182 transitions. [2022-04-15 13:00:34,589 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 182 transitions. Word has length 35 [2022-04-15 13:00:34,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:00:34,590 INFO L478 AbstractCegarLoop]: Abstraction has 142 states and 182 transitions. [2022-04-15 13:00:34,590 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.2916666666666667) 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-15 13:00:34,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 142 states and 182 transitions. [2022-04-15 13:00:45,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:45,982 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 182 transitions. [2022-04-15 13:00:45,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 13:00:45,982 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:00:45,982 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:00:45,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-15 13:00:46,185 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:00:46,185 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:00:46,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:00:46,185 INFO L85 PathProgramCache]: Analyzing trace with hash -759177288, now seen corresponding path program 9 times [2022-04-15 13:00:46,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:46,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1880773984] [2022-04-15 13:00:46,319 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:00:46,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1171378263, now seen corresponding path program 1 times [2022-04-15 13:00:46,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:00:46,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801280945] [2022-04-15 13:00:46,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:00:46,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:00:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:46,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:00:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:46,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {25998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25979#true} is VALID [2022-04-15 13:00:46,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {25979#true} assume true; {25979#true} is VALID [2022-04-15 13:00:46,896 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25979#true} {25979#true} #94#return; {25979#true} is VALID [2022-04-15 13:00:46,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {25979#true} call ULTIMATE.init(); {25998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:00:46,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {25998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25979#true} is VALID [2022-04-15 13:00:46,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {25979#true} assume true; {25979#true} is VALID [2022-04-15 13:00:46,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25979#true} {25979#true} #94#return; {25979#true} is VALID [2022-04-15 13:00:46,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {25979#true} call #t~ret17 := main(); {25979#true} is VALID [2022-04-15 13:00:46,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {25979#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25979#true} is VALID [2022-04-15 13:00:46,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {25979#true} [162] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_66 1) 4294967296)) (= (+ v_main_~x~0_In_33 v_main_~y~0_In_33) (+ v_main_~y~0_Out_66 v_main_~x~0_Out_66)) (= |v_main_#t~post5_Out_66| 0) (<= v_main_~x~0_Out_66 v_main_~x~0_In_33) (= |v_main_#t~post6_Out_66| 0)) (and (= v_main_~y~0_In_33 v_main_~y~0_Out_66) (= v_main_~x~0_In_33 v_main_~x~0_Out_66))) InVars {main_~x~0=v_main_~x~0_In_33, main_~y~0=v_main_~y~0_In_33} OutVars{main_~y~0=v_main_~y~0_Out_66, main_#t~post5=|v_main_#t~post5_Out_66|, main_~x~0=v_main_~x~0_Out_66, main_#t~post6=|v_main_#t~post6_Out_66|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25979#true} is VALID [2022-04-15 13:00:46,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {25979#true} [161] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {25979#true} is VALID [2022-04-15 13:00:46,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {25979#true} ~z~0 := ~y~0; {25984#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 13:00:46,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {25984#(and (<= main_~y~0 main_~z~0) (<= 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; {25985#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 13:00:46,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {25985#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25986#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 13:00:46,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {25986#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) 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; {25987#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 13:00:46,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {25987#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25988#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 13:00:46,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {25988#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25989#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 13:00:46,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {25989#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 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; {25990#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 13:00:46,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {25990#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25991#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 13:00:46,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {25991#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !(~z~0 % 4294967296 > 0); {25991#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 13:00:46,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {25991#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25992#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 13:00:46,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {25992#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25993#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 13:00:46,939 INFO L290 TraceCheckUtils]: 19: Hoare triple {25993#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25994#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 13:00:46,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {25994#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25995#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 13:00:46,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {25995#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25996#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 13:00:46,963 INFO L290 TraceCheckUtils]: 22: Hoare triple {25996#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {25997#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 13:00:46,966 INFO L290 TraceCheckUtils]: 23: Hoare triple {25997#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {25980#false} is VALID [2022-04-15 13:00:46,966 INFO L290 TraceCheckUtils]: 24: Hoare triple {25980#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; {25980#false} is VALID [2022-04-15 13:00:46,966 INFO L290 TraceCheckUtils]: 25: Hoare triple {25980#false} assume !(~x~0 % 4294967296 > 0); {25980#false} is VALID [2022-04-15 13:00:46,966 INFO L290 TraceCheckUtils]: 26: Hoare triple {25980#false} assume !(~z~0 % 4294967296 > 0); {25980#false} is VALID [2022-04-15 13:00:46,966 INFO L290 TraceCheckUtils]: 27: Hoare triple {25980#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; {25980#false} is VALID [2022-04-15 13:00:46,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {25980#false} assume !(~y~0 % 4294967296 > 0); {25980#false} is VALID [2022-04-15 13:00:46,966 INFO L272 TraceCheckUtils]: 29: Hoare triple {25980#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25980#false} is VALID [2022-04-15 13:00:46,966 INFO L290 TraceCheckUtils]: 30: Hoare triple {25980#false} ~cond := #in~cond; {25980#false} is VALID [2022-04-15 13:00:46,966 INFO L290 TraceCheckUtils]: 31: Hoare triple {25980#false} assume 0 == ~cond; {25980#false} is VALID [2022-04-15 13:00:46,966 INFO L290 TraceCheckUtils]: 32: Hoare triple {25980#false} assume !false; {25980#false} is VALID [2022-04-15 13:00:46,967 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 13:00:46,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:00:46,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801280945] [2022-04-15 13:00:46,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801280945] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:00:46,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787774705] [2022-04-15 13:00:46,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:00:46,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:00:46,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:00:46,968 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:00:46,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-15 13:00:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:47,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 13:00:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:47,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:00:47,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {25979#true} call ULTIMATE.init(); {25979#true} is VALID [2022-04-15 13:00:47,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {25979#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25979#true} is VALID [2022-04-15 13:00:47,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {25979#true} assume true; {25979#true} is VALID [2022-04-15 13:00:47,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25979#true} {25979#true} #94#return; {25979#true} is VALID [2022-04-15 13:00:47,617 INFO L272 TraceCheckUtils]: 4: Hoare triple {25979#true} call #t~ret17 := main(); {25979#true} is VALID [2022-04-15 13:00:47,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {25979#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25979#true} is VALID [2022-04-15 13:00:47,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {25979#true} [162] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_66 1) 4294967296)) (= (+ v_main_~x~0_In_33 v_main_~y~0_In_33) (+ v_main_~y~0_Out_66 v_main_~x~0_Out_66)) (= |v_main_#t~post5_Out_66| 0) (<= v_main_~x~0_Out_66 v_main_~x~0_In_33) (= |v_main_#t~post6_Out_66| 0)) (and (= v_main_~y~0_In_33 v_main_~y~0_Out_66) (= v_main_~x~0_In_33 v_main_~x~0_Out_66))) InVars {main_~x~0=v_main_~x~0_In_33, main_~y~0=v_main_~y~0_In_33} OutVars{main_~y~0=v_main_~y~0_Out_66, main_#t~post5=|v_main_#t~post5_Out_66|, main_~x~0=v_main_~x~0_Out_66, main_#t~post6=|v_main_#t~post6_Out_66|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25979#true} is VALID [2022-04-15 13:00:47,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {25979#true} [161] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {25979#true} is VALID [2022-04-15 13:00:47,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {25979#true} ~z~0 := ~y~0; {25984#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 13:00:47,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {25984#(and (<= main_~y~0 main_~z~0) (<= 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; {25985#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 13:00:47,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {25985#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25986#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 13:00:47,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {25986#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) 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; {25987#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 13:00:47,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {25987#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25988#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 13:00:47,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {25988#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25989#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 13:00:47,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {25989#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 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; {25990#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 13:00:47,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {25990#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25991#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 13:00:47,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {25991#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !(~z~0 % 4294967296 > 0); {25991#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 13:00:47,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {25991#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25992#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 13:00:47,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {25992#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25993#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 13:00:47,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {25993#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25994#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 13:00:47,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {25994#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25995#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 13:00:47,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {25995#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25996#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 13:00:47,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {25996#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {25997#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 13:00:47,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {25997#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {25997#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 13:00:47,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {25997#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25996#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 13:00:47,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {25996#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {25996#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 13:00:47,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {25996#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {25996#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 13:00:47,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {25996#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {25997#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 13:00:47,679 INFO L290 TraceCheckUtils]: 28: Hoare triple {25997#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {25980#false} is VALID [2022-04-15 13:00:47,679 INFO L272 TraceCheckUtils]: 29: Hoare triple {25980#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25980#false} is VALID [2022-04-15 13:00:47,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {25980#false} ~cond := #in~cond; {25980#false} is VALID [2022-04-15 13:00:47,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {25980#false} assume 0 == ~cond; {25980#false} is VALID [2022-04-15 13:00:47,679 INFO L290 TraceCheckUtils]: 32: Hoare triple {25980#false} assume !false; {25980#false} is VALID [2022-04-15 13:00:47,680 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:47,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:00:48,999 INFO L290 TraceCheckUtils]: 32: Hoare triple {25980#false} assume !false; {25980#false} is VALID [2022-04-15 13:00:49,000 INFO L290 TraceCheckUtils]: 31: Hoare triple {25980#false} assume 0 == ~cond; {25980#false} is VALID [2022-04-15 13:00:49,000 INFO L290 TraceCheckUtils]: 30: Hoare triple {25980#false} ~cond := #in~cond; {25980#false} is VALID [2022-04-15 13:00:49,000 INFO L272 TraceCheckUtils]: 29: Hoare triple {25980#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25980#false} is VALID [2022-04-15 13:00:49,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {25997#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {25980#false} is VALID [2022-04-15 13:00:49,011 INFO L290 TraceCheckUtils]: 27: Hoare triple {25996#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {25997#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 13:00:49,012 INFO L290 TraceCheckUtils]: 26: Hoare triple {25996#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {25996#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 13:00:49,012 INFO L290 TraceCheckUtils]: 25: Hoare triple {25996#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {25996#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 13:00:49,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {25997#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25996#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 13:00:49,017 INFO L290 TraceCheckUtils]: 23: Hoare triple {25997#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {25997#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 13:00:49,020 INFO L290 TraceCheckUtils]: 22: Hoare triple {25996#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {25997#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 13:00:49,025 INFO L290 TraceCheckUtils]: 21: Hoare triple {25995#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25996#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 13:00:49,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {25994#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25995#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 13:00:49,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {25993#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25994#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 13:00:49,038 INFO L290 TraceCheckUtils]: 18: Hoare triple {25992#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25993#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 13:00:49,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {25991#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25992#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 13:00:49,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {25991#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !(~z~0 % 4294967296 > 0); {25991#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 13:00:49,043 INFO L290 TraceCheckUtils]: 15: Hoare triple {26149#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25991#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 13:00:49,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {26153#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26149#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} is VALID [2022-04-15 13:00:49,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {26157#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 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; {26153#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} is VALID [2022-04-15 13:00:49,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {26161#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26157#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 13:00:49,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {26165#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26161#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} is VALID [2022-04-15 13:00:49,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {26169#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26165#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} is VALID [2022-04-15 13:00:49,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {26173#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ 4294967290 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; {26169#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-15 13:00:49,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {25979#true} ~z~0 := ~y~0; {26173#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-15 13:00:49,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {25979#true} [161] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {25979#true} is VALID [2022-04-15 13:00:49,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {25979#true} [162] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_66 1) 4294967296)) (= (+ v_main_~x~0_In_33 v_main_~y~0_In_33) (+ v_main_~y~0_Out_66 v_main_~x~0_Out_66)) (= |v_main_#t~post5_Out_66| 0) (<= v_main_~x~0_Out_66 v_main_~x~0_In_33) (= |v_main_#t~post6_Out_66| 0)) (and (= v_main_~y~0_In_33 v_main_~y~0_Out_66) (= v_main_~x~0_In_33 v_main_~x~0_Out_66))) InVars {main_~x~0=v_main_~x~0_In_33, main_~y~0=v_main_~y~0_In_33} OutVars{main_~y~0=v_main_~y~0_Out_66, main_#t~post5=|v_main_#t~post5_Out_66|, main_~x~0=v_main_~x~0_Out_66, main_#t~post6=|v_main_#t~post6_Out_66|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25979#true} is VALID [2022-04-15 13:00:49,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {25979#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25979#true} is VALID [2022-04-15 13:00:49,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {25979#true} call #t~ret17 := main(); {25979#true} is VALID [2022-04-15 13:00:49,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25979#true} {25979#true} #94#return; {25979#true} is VALID [2022-04-15 13:00:49,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {25979#true} assume true; {25979#true} is VALID [2022-04-15 13:00:49,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {25979#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25979#true} is VALID [2022-04-15 13:00:49,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {25979#true} call ULTIMATE.init(); {25979#true} is VALID [2022-04-15 13:00:49,074 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 7 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:49,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787774705] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:00:49,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:00:49,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 24 [2022-04-15 13:00:49,955 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:00:49,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1880773984] [2022-04-15 13:00:49,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1880773984] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:00:49,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:00:49,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 13:00:49,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862556224] [2022-04-15 13:00:49,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:00:49,956 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 13:00:49,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:00:49,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:50,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:50,103 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 13:00:50,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:50,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 13:00:50,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2022-04-15 13:00:50,104 INFO L87 Difference]: Start difference. First operand 142 states and 182 transitions. Second operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:09,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:09,610 INFO L93 Difference]: Finished difference Result 325 states and 466 transitions. [2022-04-15 13:02:09,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2022-04-15 13:02:09,610 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 13:02:09,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:02:09,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:09,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 335 transitions. [2022-04-15 13:02:09,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:09,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 335 transitions. [2022-04-15 13:02:09,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 143 states and 335 transitions. [2022-04-15 13:02:18,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 335 edges. 334 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 13:02:18,403 INFO L225 Difference]: With dead ends: 325 [2022-04-15 13:02:18,404 INFO L226 Difference]: Without dead ends: 273 [2022-04-15 13:02:18,406 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 66 SyntacticMatches, 10 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10426 ImplicationChecksByTransitivity, 43.0s TimeCoverageRelationStatistics Valid=3465, Invalid=24257, Unknown=0, NotChecked=0, Total=27722 [2022-04-15 13:02:18,406 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 308 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 474 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 474 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2022-04-15 13:02:18,406 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 98 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [474 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 13.6s Time] [2022-04-15 13:02:18,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-04-15 13:02:20,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 171. [2022-04-15 13:02:20,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:02:20,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 273 states. Second operand has 171 states, 166 states have (on average 1.3253012048192772) internal successors, (220), 166 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:20,138 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand has 171 states, 166 states have (on average 1.3253012048192772) internal successors, (220), 166 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:20,138 INFO L87 Difference]: Start difference. First operand 273 states. Second operand has 171 states, 166 states have (on average 1.3253012048192772) internal successors, (220), 166 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:20,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:20,141 INFO L93 Difference]: Finished difference Result 273 states and 386 transitions. [2022-04-15 13:02:20,141 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 386 transitions. [2022-04-15 13:02:20,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:02:20,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:02:20,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 166 states have (on average 1.3253012048192772) internal successors, (220), 166 states have internal predecessors, (220), 3 states have call successors, (3), 3 states 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-15 13:02:20,142 INFO L87 Difference]: Start difference. First operand has 171 states, 166 states have (on average 1.3253012048192772) internal successors, (220), 166 states have internal predecessors, (220), 3 states have call successors, (3), 3 states 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-15 13:02:20,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:20,145 INFO L93 Difference]: Finished difference Result 273 states and 386 transitions. [2022-04-15 13:02:20,145 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 386 transitions. [2022-04-15 13:02:20,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:02:20,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:02:20,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:02:20,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:02:20,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 166 states have (on average 1.3253012048192772) internal successors, (220), 166 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:20,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 224 transitions. [2022-04-15 13:02:20,147 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 224 transitions. Word has length 35 [2022-04-15 13:02:20,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:02:20,147 INFO L478 AbstractCegarLoop]: Abstraction has 171 states and 224 transitions. [2022-04-15 13:02:20,147 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:20,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 171 states and 224 transitions. [2022-04-15 13:02:42,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 221 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 13:02:42,763 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 224 transitions. [2022-04-15 13:02:42,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 13:02:42,763 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:02:42,763 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:02:42,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-04-15 13:02:42,970 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-15 13:02:42,970 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:02:42,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:02:42,971 INFO L85 PathProgramCache]: Analyzing trace with hash 2040976357, now seen corresponding path program 7 times [2022-04-15 13:02:42,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:02:42,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1765861253] [2022-04-15 13:02:43,117 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:02:43,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1122556058, now seen corresponding path program 1 times [2022-04-15 13:02:43,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:02:43,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047776366] [2022-04-15 13:02:43,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:02:43,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:02:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:43,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:02:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:43,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {28038#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28029#true} is VALID [2022-04-15 13:02:43,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {28029#true} assume true; {28029#true} is VALID [2022-04-15 13:02:43,351 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28029#true} {28029#true} #94#return; {28029#true} is VALID [2022-04-15 13:02:43,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {28029#true} call ULTIMATE.init(); {28038#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:02:43,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {28038#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28029#true} is VALID [2022-04-15 13:02:43,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {28029#true} assume true; {28029#true} is VALID [2022-04-15 13:02:43,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28029#true} {28029#true} #94#return; {28029#true} is VALID [2022-04-15 13:02:43,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {28029#true} call #t~ret17 := main(); {28029#true} is VALID [2022-04-15 13:02:43,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {28029#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28029#true} is VALID [2022-04-15 13:02:43,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {28029#true} [164] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_34 v_main_~y~0_Out_68) (= v_main_~x~0_In_34 v_main_~x~0_Out_68)) (and (= |v_main_#t~post6_Out_68| 0) (<= v_main_~x~0_Out_68 v_main_~x~0_In_34) (= (+ v_main_~y~0_Out_68 v_main_~x~0_Out_68) (+ v_main_~x~0_In_34 v_main_~y~0_In_34)) (= |v_main_#t~post5_Out_68| 0) (< 0 (mod (+ v_main_~x~0_Out_68 1) 4294967296)))) InVars {main_~x~0=v_main_~x~0_In_34, main_~y~0=v_main_~y~0_In_34} OutVars{main_~y~0=v_main_~y~0_Out_68, main_#t~post5=|v_main_#t~post5_Out_68|, main_~x~0=v_main_~x~0_Out_68, main_#t~post6=|v_main_#t~post6_Out_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {28029#true} is VALID [2022-04-15 13:02:43,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {28029#true} [163] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {28029#true} is VALID [2022-04-15 13:02:43,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {28029#true} ~z~0 := ~y~0; {28029#true} is VALID [2022-04-15 13:02:43,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {28029#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28029#true} is VALID [2022-04-15 13:02:43,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {28029#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28029#true} is VALID [2022-04-15 13:02:43,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {28029#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28029#true} is VALID [2022-04-15 13:02:43,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {28029#true} assume !(~z~0 % 4294967296 > 0); {28034#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 13:02:43,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {28034#(<= main_~z~0 (* (div 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; {28035#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 13:02:43,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {28035#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 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; {28036#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 13:02:43,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {28036#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:43,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:43,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~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; {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:43,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~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; {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:43,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~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; {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:43,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:43,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~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; {28036#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 13:02:43,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {28036#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {28035#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 13:02:43,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {28035#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 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; {28034#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 13:02:43,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {28034#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28030#false} is VALID [2022-04-15 13:02:43,408 INFO L290 TraceCheckUtils]: 25: Hoare triple {28030#false} assume !(~z~0 % 4294967296 > 0); {28030#false} is VALID [2022-04-15 13:02:43,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {28030#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; {28030#false} is VALID [2022-04-15 13:02:43,408 INFO L290 TraceCheckUtils]: 27: Hoare triple {28030#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; {28030#false} is VALID [2022-04-15 13:02:43,408 INFO L290 TraceCheckUtils]: 28: Hoare triple {28030#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; {28030#false} is VALID [2022-04-15 13:02:43,408 INFO L290 TraceCheckUtils]: 29: Hoare triple {28030#false} assume !(~y~0 % 4294967296 > 0); {28030#false} is VALID [2022-04-15 13:02:43,408 INFO L272 TraceCheckUtils]: 30: Hoare triple {28030#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28030#false} is VALID [2022-04-15 13:02:43,408 INFO L290 TraceCheckUtils]: 31: Hoare triple {28030#false} ~cond := #in~cond; {28030#false} is VALID [2022-04-15 13:02:43,408 INFO L290 TraceCheckUtils]: 32: Hoare triple {28030#false} assume 0 == ~cond; {28030#false} is VALID [2022-04-15 13:02:43,408 INFO L290 TraceCheckUtils]: 33: Hoare triple {28030#false} assume !false; {28030#false} is VALID [2022-04-15 13:02:43,408 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-15 13:02:43,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:02:43,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047776366] [2022-04-15 13:02:43,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047776366] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:02:43,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928540719] [2022-04-15 13:02:43,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:02:43,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:02:43,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:02:43,410 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:02:43,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-15 13:02:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:43,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 13:02:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:43,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:02:44,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {28029#true} call ULTIMATE.init(); {28029#true} is VALID [2022-04-15 13:02:44,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {28029#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28029#true} is VALID [2022-04-15 13:02:44,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {28029#true} assume true; {28029#true} is VALID [2022-04-15 13:02:44,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28029#true} {28029#true} #94#return; {28029#true} is VALID [2022-04-15 13:02:44,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {28029#true} call #t~ret17 := main(); {28029#true} is VALID [2022-04-15 13:02:44,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {28029#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28029#true} is VALID [2022-04-15 13:02:44,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {28029#true} [164] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_34 v_main_~y~0_Out_68) (= v_main_~x~0_In_34 v_main_~x~0_Out_68)) (and (= |v_main_#t~post6_Out_68| 0) (<= v_main_~x~0_Out_68 v_main_~x~0_In_34) (= (+ v_main_~y~0_Out_68 v_main_~x~0_Out_68) (+ v_main_~x~0_In_34 v_main_~y~0_In_34)) (= |v_main_#t~post5_Out_68| 0) (< 0 (mod (+ v_main_~x~0_Out_68 1) 4294967296)))) InVars {main_~x~0=v_main_~x~0_In_34, main_~y~0=v_main_~y~0_In_34} OutVars{main_~y~0=v_main_~y~0_Out_68, main_#t~post5=|v_main_#t~post5_Out_68|, main_~x~0=v_main_~x~0_Out_68, main_#t~post6=|v_main_#t~post6_Out_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {28029#true} is VALID [2022-04-15 13:02:44,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {28029#true} [163] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {28029#true} is VALID [2022-04-15 13:02:44,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {28029#true} ~z~0 := ~y~0; {28066#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 13:02:44,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {28066#(= 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; {28070#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 13:02:44,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {28070#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28074#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-15 13:02:44,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {28074#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28078#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} is VALID [2022-04-15 13:02:44,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {28078#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {28082#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 13:02:44,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {28082#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28086#(and (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (= main_~z~0 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 13:02:44,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {28086#(and (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (= main_~z~0 (+ (- 1) main_~y~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28090#(and (= main_~y~0 (+ (- 1) main_~z~0)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 13:02:44,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {28090#(and (= main_~y~0 (+ (- 1) main_~z~0)) (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; {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:44,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:44,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~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; {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:44,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~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; {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:44,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~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; {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:44,144 INFO L290 TraceCheckUtils]: 20: Hoare triple {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:44,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~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; {28036#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 13:02:44,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {28036#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {28035#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 13:02:44,166 INFO L290 TraceCheckUtils]: 23: Hoare triple {28035#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 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; {28034#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 13:02:44,169 INFO L290 TraceCheckUtils]: 24: Hoare triple {28034#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28030#false} is VALID [2022-04-15 13:02:44,170 INFO L290 TraceCheckUtils]: 25: Hoare triple {28030#false} assume !(~z~0 % 4294967296 > 0); {28030#false} is VALID [2022-04-15 13:02:44,170 INFO L290 TraceCheckUtils]: 26: Hoare triple {28030#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; {28030#false} is VALID [2022-04-15 13:02:44,170 INFO L290 TraceCheckUtils]: 27: Hoare triple {28030#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; {28030#false} is VALID [2022-04-15 13:02:44,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {28030#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; {28030#false} is VALID [2022-04-15 13:02:44,170 INFO L290 TraceCheckUtils]: 29: Hoare triple {28030#false} assume !(~y~0 % 4294967296 > 0); {28030#false} is VALID [2022-04-15 13:02:44,170 INFO L272 TraceCheckUtils]: 30: Hoare triple {28030#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28030#false} is VALID [2022-04-15 13:02:44,170 INFO L290 TraceCheckUtils]: 31: Hoare triple {28030#false} ~cond := #in~cond; {28030#false} is VALID [2022-04-15 13:02:44,170 INFO L290 TraceCheckUtils]: 32: Hoare triple {28030#false} assume 0 == ~cond; {28030#false} is VALID [2022-04-15 13:02:44,170 INFO L290 TraceCheckUtils]: 33: Hoare triple {28030#false} assume !false; {28030#false} is VALID [2022-04-15 13:02:44,171 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 13:02:44,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:02:44,331 INFO L290 TraceCheckUtils]: 33: Hoare triple {28030#false} assume !false; {28030#false} is VALID [2022-04-15 13:02:44,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {28030#false} assume 0 == ~cond; {28030#false} is VALID [2022-04-15 13:02:44,331 INFO L290 TraceCheckUtils]: 31: Hoare triple {28030#false} ~cond := #in~cond; {28030#false} is VALID [2022-04-15 13:02:44,331 INFO L272 TraceCheckUtils]: 30: Hoare triple {28030#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28030#false} is VALID [2022-04-15 13:02:44,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {28030#false} assume !(~y~0 % 4294967296 > 0); {28030#false} is VALID [2022-04-15 13:02:44,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {28030#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; {28030#false} is VALID [2022-04-15 13:02:44,332 INFO L290 TraceCheckUtils]: 27: Hoare triple {28030#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; {28030#false} is VALID [2022-04-15 13:02:44,332 INFO L290 TraceCheckUtils]: 26: Hoare triple {28030#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; {28030#false} is VALID [2022-04-15 13:02:44,332 INFO L290 TraceCheckUtils]: 25: Hoare triple {28030#false} assume !(~z~0 % 4294967296 > 0); {28030#false} is VALID [2022-04-15 13:02:44,337 INFO L290 TraceCheckUtils]: 24: Hoare triple {28034#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28030#false} is VALID [2022-04-15 13:02:44,343 INFO L290 TraceCheckUtils]: 23: Hoare triple {28035#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 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; {28034#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 13:02:44,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {28036#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {28035#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 13:02:44,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~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; {28036#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 13:02:44,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:44,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~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; {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:44,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~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; {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:44,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~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; {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:44,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:44,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {28036#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {28037#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:44,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {28035#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 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; {28036#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 13:02:44,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {28034#(<= main_~z~0 (* (div 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; {28035#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 13:02:44,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {28029#true} assume !(~z~0 % 4294967296 > 0); {28034#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 13:02:44,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {28029#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28029#true} is VALID [2022-04-15 13:02:44,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {28029#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28029#true} is VALID [2022-04-15 13:02:44,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {28029#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28029#true} is VALID [2022-04-15 13:02:44,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {28029#true} ~z~0 := ~y~0; {28029#true} is VALID [2022-04-15 13:02:44,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {28029#true} [163] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {28029#true} is VALID [2022-04-15 13:02:44,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {28029#true} [164] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_34 v_main_~y~0_Out_68) (= v_main_~x~0_In_34 v_main_~x~0_Out_68)) (and (= |v_main_#t~post6_Out_68| 0) (<= v_main_~x~0_Out_68 v_main_~x~0_In_34) (= (+ v_main_~y~0_Out_68 v_main_~x~0_Out_68) (+ v_main_~x~0_In_34 v_main_~y~0_In_34)) (= |v_main_#t~post5_Out_68| 0) (< 0 (mod (+ v_main_~x~0_Out_68 1) 4294967296)))) InVars {main_~x~0=v_main_~x~0_In_34, main_~y~0=v_main_~y~0_In_34} OutVars{main_~y~0=v_main_~y~0_Out_68, main_#t~post5=|v_main_#t~post5_Out_68|, main_~x~0=v_main_~x~0_Out_68, main_#t~post6=|v_main_#t~post6_Out_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {28029#true} is VALID [2022-04-15 13:02:44,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {28029#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28029#true} is VALID [2022-04-15 13:02:44,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {28029#true} call #t~ret17 := main(); {28029#true} is VALID [2022-04-15 13:02:44,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28029#true} {28029#true} #94#return; {28029#true} is VALID [2022-04-15 13:02:44,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {28029#true} assume true; {28029#true} is VALID [2022-04-15 13:02:44,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {28029#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28029#true} is VALID [2022-04-15 13:02:44,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {28029#true} call ULTIMATE.init(); {28029#true} is VALID [2022-04-15 13:02:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-15 13:02:44,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928540719] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:02:44,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:02:44,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 6] total 14 [2022-04-15 13:02:45,024 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:02:45,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1765861253] [2022-04-15 13:02:45,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1765861253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:02:45,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:02:45,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 13:02:45,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876606272] [2022-04-15 13:02:45,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:02:45,025 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 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-15 13:02:45,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:02:45,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:45,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:02:45,198 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 13:02:45,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:02:45,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 13:02:45,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2022-04-15 13:02:45,199 INFO L87 Difference]: Start difference. First operand 171 states and 224 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:58,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:58,124 INFO L93 Difference]: Finished difference Result 319 states and 450 transitions. [2022-04-15 13:02:58,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 13:02:58,125 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 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-15 13:02:58,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:02:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:58,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 120 transitions. [2022-04-15 13:02:58,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 120 transitions. [2022-04-15 13:02:58,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 120 transitions. [2022-04-15 13:02:58,904 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-15 13:02:58,908 INFO L225 Difference]: With dead ends: 319 [2022-04-15 13:02:58,908 INFO L226 Difference]: Without dead ends: 305 [2022-04-15 13:02:58,908 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=193, Invalid=1067, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 13:02:58,909 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 89 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:02:58,909 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 50 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-15 13:02:58,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-04-15 13:03:00,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 171. [2022-04-15 13:03:00,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:03:00,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 305 states. Second operand has 171 states, 166 states have (on average 1.319277108433735) internal successors, (219), 166 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:00,674 INFO L74 IsIncluded]: Start isIncluded. First operand 305 states. Second operand has 171 states, 166 states have (on average 1.319277108433735) internal successors, (219), 166 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:00,675 INFO L87 Difference]: Start difference. First operand 305 states. Second operand has 171 states, 166 states have (on average 1.319277108433735) internal successors, (219), 166 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:00,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:03:00,678 INFO L93 Difference]: Finished difference Result 305 states and 433 transitions. [2022-04-15 13:03:00,678 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 433 transitions. [2022-04-15 13:03:00,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:03:00,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:03:00,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 166 states have (on average 1.319277108433735) internal successors, (219), 166 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 305 states. [2022-04-15 13:03:00,679 INFO L87 Difference]: Start difference. First operand has 171 states, 166 states have (on average 1.319277108433735) internal successors, (219), 166 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 305 states. [2022-04-15 13:03:00,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:03:00,682 INFO L93 Difference]: Finished difference Result 305 states and 433 transitions. [2022-04-15 13:03:00,682 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 433 transitions. [2022-04-15 13:03:00,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:03:00,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:03:00,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:03:00,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:03:00,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 166 states have (on average 1.319277108433735) internal successors, (219), 166 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:00,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2022-04-15 13:03:00,685 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 36 [2022-04-15 13:03:00,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:03:00,685 INFO L478 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2022-04-15 13:03:00,685 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:00,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 171 states and 223 transitions. [2022-04-15 13:03:21,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 220 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 13:03:21,761 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2022-04-15 13:03:21,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 13:03:21,762 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:03:21,762 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:03:21,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-15 13:03:21,962 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-15 13:03:21,962 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:03:21,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:03:21,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1266943717, now seen corresponding path program 10 times [2022-04-15 13:03:21,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:03:21,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [638075030] [2022-04-15 13:03:22,065 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:03:22,066 INFO L85 PathProgramCache]: Analyzing trace with hash -482833754, now seen corresponding path program 1 times [2022-04-15 13:03:22,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:03:22,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442497355] [2022-04-15 13:03:22,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:03:22,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:03:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:22,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:03:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:22,674 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); {29883#true} is VALID [2022-04-15 13:03:22,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {29883#true} assume true; {29883#true} is VALID [2022-04-15 13:03:22,674 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29883#true} {29883#true} #94#return; {29883#true} is VALID [2022-04-15 13:03:22,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {29883#true} call ULTIMATE.init(); {29897#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:03:22,674 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); {29883#true} is VALID [2022-04-15 13:03:22,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {29883#true} assume true; {29883#true} is VALID [2022-04-15 13:03:22,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29883#true} {29883#true} #94#return; {29883#true} is VALID [2022-04-15 13:03:22,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {29883#true} call #t~ret17 := main(); {29883#true} is VALID [2022-04-15 13:03:22,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {29883#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29883#true} is VALID [2022-04-15 13:03:22,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {29883#true} [166] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~x~0_In_35 v_main_~y~0_In_35) (+ v_main_~y~0_Out_70 v_main_~x~0_Out_70)) (= |v_main_#t~post5_Out_70| 0) (< 0 (mod (+ v_main_~x~0_Out_70 1) 4294967296)) (= |v_main_#t~post6_Out_70| 0) (<= v_main_~x~0_Out_70 v_main_~x~0_In_35)) (and (= v_main_~y~0_In_35 v_main_~y~0_Out_70) (= v_main_~x~0_In_35 v_main_~x~0_Out_70))) InVars {main_~x~0=v_main_~x~0_In_35, main_~y~0=v_main_~y~0_In_35} OutVars{main_~y~0=v_main_~y~0_Out_70, main_#t~post5=|v_main_#t~post5_Out_70|, main_~x~0=v_main_~x~0_Out_70, main_#t~post6=|v_main_#t~post6_Out_70|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {29883#true} is VALID [2022-04-15 13:03:22,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {29883#true} [165] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {29888#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 13:03:22,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {29888#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {29888#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 13:03:22,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {29888#(<= 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; {29889#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 13:03:22,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {29889#(<= 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; {29890#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:22,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {29890#(<= 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; {29891#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:22,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {29891#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29892#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:22,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {29892#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29893#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 13:03:22,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {29893#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29894#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:22,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {29894#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {29895#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:22,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {29895#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {29895#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:22,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {29895#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {29895#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:22,726 INFO L290 TraceCheckUtils]: 18: Hoare triple {29895#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {29895#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:22,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {29895#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {29895#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:22,726 INFO L290 TraceCheckUtils]: 20: Hoare triple {29895#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {29895#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:22,727 INFO L290 TraceCheckUtils]: 21: Hoare triple {29895#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {29895#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:22,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {29895#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {29895#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:22,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {29895#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {29895#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:22,728 INFO L290 TraceCheckUtils]: 24: Hoare triple {29895#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {29895#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:22,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {29895#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {29896#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 13:03:22,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {29896#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {29884#false} is VALID [2022-04-15 13:03:22,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {29884#false} assume !(~z~0 % 4294967296 > 0); {29884#false} is VALID [2022-04-15 13:03:22,740 INFO L290 TraceCheckUtils]: 28: Hoare triple {29884#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; {29884#false} is VALID [2022-04-15 13:03:22,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {29884#false} assume !(~y~0 % 4294967296 > 0); {29884#false} is VALID [2022-04-15 13:03:22,740 INFO L272 TraceCheckUtils]: 30: Hoare triple {29884#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29884#false} is VALID [2022-04-15 13:03:22,740 INFO L290 TraceCheckUtils]: 31: Hoare triple {29884#false} ~cond := #in~cond; {29884#false} is VALID [2022-04-15 13:03:22,740 INFO L290 TraceCheckUtils]: 32: Hoare triple {29884#false} assume 0 == ~cond; {29884#false} is VALID [2022-04-15 13:03:22,740 INFO L290 TraceCheckUtils]: 33: Hoare triple {29884#false} assume !false; {29884#false} is VALID [2022-04-15 13:03:22,740 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-15 13:03:22,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:03:22,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442497355] [2022-04-15 13:03:22,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442497355] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:03:22,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871553279] [2022-04-15 13:03:22,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:03:22,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:03:22,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:03:22,742 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:03:22,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-15 13:03:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:22,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 13:03:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:22,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:03:24,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {29883#true} call ULTIMATE.init(); {29883#true} is VALID [2022-04-15 13:03:24,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {29883#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29883#true} is VALID [2022-04-15 13:03:24,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {29883#true} assume true; {29883#true} is VALID [2022-04-15 13:03:24,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29883#true} {29883#true} #94#return; {29883#true} is VALID [2022-04-15 13:03:24,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {29883#true} call #t~ret17 := main(); {29883#true} is VALID [2022-04-15 13:03:24,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {29883#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29883#true} is VALID [2022-04-15 13:03:24,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {29883#true} [166] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~x~0_In_35 v_main_~y~0_In_35) (+ v_main_~y~0_Out_70 v_main_~x~0_Out_70)) (= |v_main_#t~post5_Out_70| 0) (< 0 (mod (+ v_main_~x~0_Out_70 1) 4294967296)) (= |v_main_#t~post6_Out_70| 0) (<= v_main_~x~0_Out_70 v_main_~x~0_In_35)) (and (= v_main_~y~0_In_35 v_main_~y~0_Out_70) (= v_main_~x~0_In_35 v_main_~x~0_Out_70))) InVars {main_~x~0=v_main_~x~0_In_35, main_~y~0=v_main_~y~0_In_35} OutVars{main_~y~0=v_main_~y~0_Out_70, main_#t~post5=|v_main_#t~post5_Out_70|, main_~x~0=v_main_~x~0_Out_70, main_#t~post6=|v_main_#t~post6_Out_70|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {29883#true} is VALID [2022-04-15 13:03:24,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {29883#true} [165] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {29883#true} is VALID [2022-04-15 13:03:24,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {29883#true} ~z~0 := ~y~0; {29925#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 13:03:24,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {29925#(= 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; {29929#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 13:03:24,527 INFO L290 TraceCheckUtils]: 10: Hoare triple {29929#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29933#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-15 13:03:24,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {29933#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29937#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-15 13:03:24,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {29937#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29941#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-15 13:03:24,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {29941#(= (+ (- 2) main_~y~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; {29945#(= (+ (- 2) main_~y~0) (+ main_~z~0 3))} is VALID [2022-04-15 13:03:24,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {29945#(= (+ (- 2) main_~y~0) (+ main_~z~0 3))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29949#(= (+ main_~y~0 (- 5)) (+ main_~z~0 1))} is VALID [2022-04-15 13:03:24,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {29949#(= (+ main_~y~0 (- 5)) (+ 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; {29953#(= (+ main_~y~0 (- 6)) (+ main_~z~0 1))} is VALID [2022-04-15 13:03:24,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {29953#(= (+ main_~y~0 (- 6)) (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {29953#(= (+ main_~y~0 (- 6)) (+ main_~z~0 1))} is VALID [2022-04-15 13:03:24,549 INFO L290 TraceCheckUtils]: 17: Hoare triple {29953#(= (+ main_~y~0 (- 6)) (+ 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; {29960#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 13:03:24,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {29960#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29964#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 13:03:24,553 INFO L290 TraceCheckUtils]: 19: Hoare triple {29964#(< 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; {29968#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 13:03:24,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {29968#(< 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; {29972#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 13:03:24,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {29972#(< 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; {29976#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 13:03:24,561 INFO L290 TraceCheckUtils]: 22: Hoare triple {29976#(< 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; {29980#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 13:03:24,565 INFO L290 TraceCheckUtils]: 23: Hoare triple {29980#(< 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; {29984#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:03:24,565 INFO L290 TraceCheckUtils]: 24: Hoare triple {29984#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {29984#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:03:24,565 INFO L290 TraceCheckUtils]: 25: Hoare triple {29984#(< 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; {29984#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:03:24,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {29984#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {29984#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:03:24,566 INFO L290 TraceCheckUtils]: 27: Hoare triple {29984#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {29884#false} is VALID [2022-04-15 13:03:24,566 INFO L290 TraceCheckUtils]: 28: Hoare triple {29884#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; {29884#false} is VALID [2022-04-15 13:03:24,566 INFO L290 TraceCheckUtils]: 29: Hoare triple {29884#false} assume !(~y~0 % 4294967296 > 0); {29884#false} is VALID [2022-04-15 13:03:24,566 INFO L272 TraceCheckUtils]: 30: Hoare triple {29884#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29884#false} is VALID [2022-04-15 13:03:24,566 INFO L290 TraceCheckUtils]: 31: Hoare triple {29884#false} ~cond := #in~cond; {29884#false} is VALID [2022-04-15 13:03:24,566 INFO L290 TraceCheckUtils]: 32: Hoare triple {29884#false} assume 0 == ~cond; {29884#false} is VALID [2022-04-15 13:03:24,566 INFO L290 TraceCheckUtils]: 33: Hoare triple {29884#false} assume !false; {29884#false} is VALID [2022-04-15 13:03:24,567 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 13:03:24,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:03:26,179 INFO L290 TraceCheckUtils]: 33: Hoare triple {29884#false} assume !false; {29884#false} is VALID [2022-04-15 13:03:26,179 INFO L290 TraceCheckUtils]: 32: Hoare triple {29884#false} assume 0 == ~cond; {29884#false} is VALID [2022-04-15 13:03:26,180 INFO L290 TraceCheckUtils]: 31: Hoare triple {29884#false} ~cond := #in~cond; {29884#false} is VALID [2022-04-15 13:03:26,180 INFO L272 TraceCheckUtils]: 30: Hoare triple {29884#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29884#false} is VALID [2022-04-15 13:03:26,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {29884#false} assume !(~y~0 % 4294967296 > 0); {29884#false} is VALID [2022-04-15 13:03:26,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {29884#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; {29884#false} is VALID [2022-04-15 13:03:26,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {29984#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {29884#false} is VALID [2022-04-15 13:03:26,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {29984#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {29984#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:03:26,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {29984#(< 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; {29984#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:03:26,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {29984#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {29984#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:03:26,186 INFO L290 TraceCheckUtils]: 23: Hoare triple {29980#(< 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; {29984#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:03:26,188 INFO L290 TraceCheckUtils]: 22: Hoare triple {29976#(< 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; {29980#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 13:03:26,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {29972#(< 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; {29976#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 13:03:26,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {29968#(< 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; {29972#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 13:03:26,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {29964#(< 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; {29968#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 13:03:26,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {29960#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29964#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 13:03:26,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {30063#(or (< 0 (mod (+ 7 main_~z~0) 4294967296)) (not (< 0 (mod main_~y~0 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29960#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 13:03:26,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {30063#(or (< 0 (mod (+ 7 main_~z~0) 4294967296)) (not (< 0 (mod main_~y~0 4294967296))))} assume !(~z~0 % 4294967296 > 0); {30063#(or (< 0 (mod (+ 7 main_~z~0) 4294967296)) (not (< 0 (mod main_~y~0 4294967296))))} is VALID [2022-04-15 13:03:26,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {30070#(or (< 0 (mod (+ main_~z~0 6) 4294967296)) (not (< 0 (mod main_~y~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30063#(or (< 0 (mod (+ 7 main_~z~0) 4294967296)) (not (< 0 (mod main_~y~0 4294967296))))} is VALID [2022-04-15 13:03:26,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {30074#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30070#(or (< 0 (mod (+ main_~z~0 6) 4294967296)) (not (< 0 (mod main_~y~0 4294967296))))} is VALID [2022-04-15 13:03:26,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {30078#(or (not (< 0 (mod main_~y~0 4294967296))) (< 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; {30074#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} is VALID [2022-04-15 13:03:26,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {30082#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 3) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30078#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-15 13:03:26,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {30086#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (not (< 0 (mod main_~y~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30082#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-15 13:03:26,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {30090#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30086#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (not (< 0 (mod main_~y~0 4294967296))))} is VALID [2022-04-15 13:03:26,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {30094#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30090#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-15 13:03:26,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {29883#true} ~z~0 := ~y~0; {30094#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 13:03:26,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {29883#true} [165] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {29883#true} is VALID [2022-04-15 13:03:26,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {29883#true} [166] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~x~0_In_35 v_main_~y~0_In_35) (+ v_main_~y~0_Out_70 v_main_~x~0_Out_70)) (= |v_main_#t~post5_Out_70| 0) (< 0 (mod (+ v_main_~x~0_Out_70 1) 4294967296)) (= |v_main_#t~post6_Out_70| 0) (<= v_main_~x~0_Out_70 v_main_~x~0_In_35)) (and (= v_main_~y~0_In_35 v_main_~y~0_Out_70) (= v_main_~x~0_In_35 v_main_~x~0_Out_70))) InVars {main_~x~0=v_main_~x~0_In_35, main_~y~0=v_main_~y~0_In_35} OutVars{main_~y~0=v_main_~y~0_Out_70, main_#t~post5=|v_main_#t~post5_Out_70|, main_~x~0=v_main_~x~0_Out_70, main_#t~post6=|v_main_#t~post6_Out_70|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {29883#true} is VALID [2022-04-15 13:03:26,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {29883#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29883#true} is VALID [2022-04-15 13:03:26,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {29883#true} call #t~ret17 := main(); {29883#true} is VALID [2022-04-15 13:03:26,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29883#true} {29883#true} #94#return; {29883#true} is VALID [2022-04-15 13:03:26,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {29883#true} assume true; {29883#true} is VALID [2022-04-15 13:03:26,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {29883#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29883#true} is VALID [2022-04-15 13:03:26,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {29883#true} call ULTIMATE.init(); {29883#true} is VALID [2022-04-15 13:03:26,228 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 13:03:26,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871553279] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:03:26,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:03:26,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 17] total 35 [2022-04-15 13:03:27,789 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:03:27,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [638075030] [2022-04-15 13:03:27,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [638075030] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:03:27,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:03:27,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 13:03:27,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098729079] [2022-04-15 13:03:27,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:03:27,790 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 36 [2022-04-15 13:03:27,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:03:27,790 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-15 13:03:27,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:03:27,945 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 13:03:27,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:03:27,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 13:03:27,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1289, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 13:03:27,946 INFO L87 Difference]: Start difference. First operand 171 states and 223 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-15 13:03:53,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:03:53,002 INFO L93 Difference]: Finished difference Result 613 states and 941 transitions. [2022-04-15 13:03:53,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 13:03:53,002 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 36 [2022-04-15 13:03:53,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:03:53,002 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-15 13:03:53,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 161 transitions. [2022-04-15 13:03:53,003 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-15 13:03:53,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 161 transitions. [2022-04-15 13:03:53,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 161 transitions. [2022-04-15 13:03:54,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:03:54,122 INFO L225 Difference]: With dead ends: 613 [2022-04-15 13:03:54,122 INFO L226 Difference]: Without dead ends: 578 [2022-04-15 13:03:54,122 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=259, Invalid=2497, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 13:03:54,123 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 203 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-15 13:03:54,123 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 95 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-15 13:03:54,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2022-04-15 13:03:55,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 181. [2022-04-15 13:03:55,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:03:55,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 578 states. Second operand has 181 states, 176 states have (on average 1.3125) internal successors, (231), 176 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:55,985 INFO L74 IsIncluded]: Start isIncluded. First operand 578 states. Second operand has 181 states, 176 states have (on average 1.3125) internal successors, (231), 176 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:55,985 INFO L87 Difference]: Start difference. First operand 578 states. Second operand has 181 states, 176 states have (on average 1.3125) internal successors, (231), 176 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:55,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:03:55,995 INFO L93 Difference]: Finished difference Result 578 states and 878 transitions. [2022-04-15 13:03:55,995 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 878 transitions. [2022-04-15 13:03:55,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:03:55,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:03:55,995 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 176 states have (on average 1.3125) internal successors, (231), 176 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 578 states. [2022-04-15 13:03:55,996 INFO L87 Difference]: Start difference. First operand has 181 states, 176 states have (on average 1.3125) internal successors, (231), 176 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 578 states. [2022-04-15 13:03:56,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:03:56,006 INFO L93 Difference]: Finished difference Result 578 states and 878 transitions. [2022-04-15 13:03:56,006 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 878 transitions. [2022-04-15 13:03:56,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:03:56,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:03:56,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:03:56,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:03:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.3125) internal successors, (231), 176 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:56,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 235 transitions. [2022-04-15 13:03:56,008 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 235 transitions. Word has length 36 [2022-04-15 13:03:56,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:03:56,009 INFO L478 AbstractCegarLoop]: Abstraction has 181 states and 235 transitions. [2022-04-15 13:03:56,009 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:56,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 181 states and 235 transitions. [2022-04-15 13:04:15,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 234 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:15,934 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 235 transitions. [2022-04-15 13:04:15,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 13:04:15,934 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:15,934 INFO L499 BasicCegarLoop]: trace histogram [7, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:15,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-15 13:04:16,134 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:16,135 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:16,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:16,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1101820612, now seen corresponding path program 7 times [2022-04-15 13:04:16,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:16,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [523708915] [2022-04-15 13:04:16,238 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:16,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1822268294, now seen corresponding path program 1 times [2022-04-15 13:04:16,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:16,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450841649] [2022-04-15 13:04:16,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:16,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:16,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:16,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {32916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32901#true} is VALID [2022-04-15 13:04:16,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {32901#true} assume true; {32901#true} is VALID [2022-04-15 13:04:16,712 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32901#true} {32901#true} #94#return; {32901#true} is VALID [2022-04-15 13:04:16,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {32901#true} call ULTIMATE.init(); {32916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:16,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {32916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32901#true} is VALID [2022-04-15 13:04:16,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {32901#true} assume true; {32901#true} is VALID [2022-04-15 13:04:16,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32901#true} {32901#true} #94#return; {32901#true} is VALID [2022-04-15 13:04:16,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {32901#true} call #t~ret17 := main(); {32901#true} is VALID [2022-04-15 13:04:16,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {32901#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32901#true} is VALID [2022-04-15 13:04:16,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {32901#true} [168] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_72| 0) (= (+ v_main_~y~0_Out_72 v_main_~x~0_Out_72) (+ v_main_~x~0_In_36 v_main_~y~0_In_36)) (<= v_main_~x~0_Out_72 v_main_~x~0_In_36) (= |v_main_#t~post5_Out_72| 0) (< 0 (mod (+ v_main_~x~0_Out_72 1) 4294967296))) (and (= v_main_~x~0_In_36 v_main_~x~0_Out_72) (= v_main_~y~0_In_36 v_main_~y~0_Out_72))) InVars {main_~x~0=v_main_~x~0_In_36, main_~y~0=v_main_~y~0_In_36} OutVars{main_~y~0=v_main_~y~0_Out_72, main_#t~post5=|v_main_#t~post5_Out_72|, main_~x~0=v_main_~x~0_Out_72, main_#t~post6=|v_main_#t~post6_Out_72|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {32901#true} is VALID [2022-04-15 13:04:16,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {32901#true} [167] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {32901#true} is VALID [2022-04-15 13:04:16,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {32901#true} ~z~0 := ~y~0; {32906#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 13:04:16,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {32906#(and (<= main_~y~0 main_~z~0) (<= 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; {32907#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 13:04:16,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {32907#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32908#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 13:04:16,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {32908#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) 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; {32909#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 13:04:16,729 INFO L290 TraceCheckUtils]: 12: Hoare triple {32909#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32910#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 13:04:16,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {32910#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {32911#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~y~0))} is VALID [2022-04-15 13:04:16,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {32911#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32912#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:04:16,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {32912#(<= main_~y~0 (+ 3 (* (div (+ main_~y~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; {32913#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 13:04:16,746 INFO L290 TraceCheckUtils]: 16: Hoare triple {32913#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~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; {32914#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 13:04:16,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {32914#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 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; {32915#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 13:04:16,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {32915#(<= main_~y~0 (* (div main_~y~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; {32902#false} is VALID [2022-04-15 13:04:16,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {32902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32902#false} is VALID [2022-04-15 13:04:16,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {32902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32902#false} is VALID [2022-04-15 13:04:16,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {32902#false} assume !(~y~0 % 4294967296 > 0); {32902#false} is VALID [2022-04-15 13:04:16,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {32902#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; {32902#false} is VALID [2022-04-15 13:04:16,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {32902#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; {32902#false} is VALID [2022-04-15 13:04:16,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {32902#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; {32902#false} is VALID [2022-04-15 13:04:16,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {32902#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; {32902#false} is VALID [2022-04-15 13:04:16,754 INFO L290 TraceCheckUtils]: 26: Hoare triple {32902#false} assume !(~x~0 % 4294967296 > 0); {32902#false} is VALID [2022-04-15 13:04:16,754 INFO L290 TraceCheckUtils]: 27: Hoare triple {32902#false} assume !(~z~0 % 4294967296 > 0); {32902#false} is VALID [2022-04-15 13:04:16,754 INFO L290 TraceCheckUtils]: 28: Hoare triple {32902#false} assume !(~y~0 % 4294967296 > 0); {32902#false} is VALID [2022-04-15 13:04:16,754 INFO L272 TraceCheckUtils]: 29: Hoare triple {32902#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32902#false} is VALID [2022-04-15 13:04:16,754 INFO L290 TraceCheckUtils]: 30: Hoare triple {32902#false} ~cond := #in~cond; {32902#false} is VALID [2022-04-15 13:04:16,754 INFO L290 TraceCheckUtils]: 31: Hoare triple {32902#false} assume 0 == ~cond; {32902#false} is VALID [2022-04-15 13:04:16,754 INFO L290 TraceCheckUtils]: 32: Hoare triple {32902#false} assume !false; {32902#false} is VALID [2022-04-15 13:04:16,754 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-15 13:04:16,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:16,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450841649] [2022-04-15 13:04:16,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450841649] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:04:16,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312272862] [2022-04-15 13:04:16,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:16,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:16,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:04:16,756 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:04:16,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-15 13:04:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:16,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 13:04:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:16,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:04:17,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {32901#true} call ULTIMATE.init(); {32901#true} is VALID [2022-04-15 13:04:17,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {32901#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32901#true} is VALID [2022-04-15 13:04:17,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {32901#true} assume true; {32901#true} is VALID [2022-04-15 13:04:17,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32901#true} {32901#true} #94#return; {32901#true} is VALID [2022-04-15 13:04:17,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {32901#true} call #t~ret17 := main(); {32901#true} is VALID [2022-04-15 13:04:17,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {32901#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32901#true} is VALID [2022-04-15 13:04:17,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {32901#true} [168] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_72| 0) (= (+ v_main_~y~0_Out_72 v_main_~x~0_Out_72) (+ v_main_~x~0_In_36 v_main_~y~0_In_36)) (<= v_main_~x~0_Out_72 v_main_~x~0_In_36) (= |v_main_#t~post5_Out_72| 0) (< 0 (mod (+ v_main_~x~0_Out_72 1) 4294967296))) (and (= v_main_~x~0_In_36 v_main_~x~0_Out_72) (= v_main_~y~0_In_36 v_main_~y~0_Out_72))) InVars {main_~x~0=v_main_~x~0_In_36, main_~y~0=v_main_~y~0_In_36} OutVars{main_~y~0=v_main_~y~0_Out_72, main_#t~post5=|v_main_#t~post5_Out_72|, main_~x~0=v_main_~x~0_Out_72, main_#t~post6=|v_main_#t~post6_Out_72|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {32901#true} is VALID [2022-04-15 13:04:17,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {32901#true} [167] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {32901#true} is VALID [2022-04-15 13:04:17,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {32901#true} ~z~0 := ~y~0; {32901#true} is VALID [2022-04-15 13:04:17,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {32901#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32901#true} is VALID [2022-04-15 13:04:17,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {32901#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32901#true} is VALID [2022-04-15 13:04:17,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {32901#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32901#true} is VALID [2022-04-15 13:04:17,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {32901#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32901#true} is VALID [2022-04-15 13:04:17,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {32901#true} assume !(~z~0 % 4294967296 > 0); {32901#true} is VALID [2022-04-15 13:04:17,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {32901#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32901#true} is VALID [2022-04-15 13:04:17,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {32901#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32901#true} is VALID [2022-04-15 13:04:17,429 INFO L290 TraceCheckUtils]: 16: Hoare triple {32901#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32901#true} is VALID [2022-04-15 13:04:17,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {32901#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32971#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 13:04:17,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {32971#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32975#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 13:04:17,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {32975#(< 0 (mod (+ main_~y~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; {32979#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 13:04:17,448 INFO L290 TraceCheckUtils]: 20: Hoare triple {32979#(< 0 (mod (+ main_~y~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; {32983#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-15 13:04:17,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {32983#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !(~y~0 % 4294967296 > 0); {32983#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-15 13:04:17,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {32983#(< 0 (mod (+ main_~y~0 4) 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; {32979#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 13:04:17,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {32979#(< 0 (mod (+ main_~y~0 3) 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; {32975#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 13:04:17,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {32975#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32971#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 13:04:17,471 INFO L290 TraceCheckUtils]: 25: Hoare triple {32971#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32999#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:04:17,471 INFO L290 TraceCheckUtils]: 26: Hoare triple {32999#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {32999#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:04:17,471 INFO L290 TraceCheckUtils]: 27: Hoare triple {32999#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {32999#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:04:17,471 INFO L290 TraceCheckUtils]: 28: Hoare triple {32999#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {32902#false} is VALID [2022-04-15 13:04:17,472 INFO L272 TraceCheckUtils]: 29: Hoare triple {32902#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32902#false} is VALID [2022-04-15 13:04:17,472 INFO L290 TraceCheckUtils]: 30: Hoare triple {32902#false} ~cond := #in~cond; {32902#false} is VALID [2022-04-15 13:04:17,472 INFO L290 TraceCheckUtils]: 31: Hoare triple {32902#false} assume 0 == ~cond; {32902#false} is VALID [2022-04-15 13:04:17,472 INFO L290 TraceCheckUtils]: 32: Hoare triple {32902#false} assume !false; {32902#false} is VALID [2022-04-15 13:04:17,472 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 13:04:17,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:04:17,589 INFO L290 TraceCheckUtils]: 32: Hoare triple {32902#false} assume !false; {32902#false} is VALID [2022-04-15 13:04:17,589 INFO L290 TraceCheckUtils]: 31: Hoare triple {32902#false} assume 0 == ~cond; {32902#false} is VALID [2022-04-15 13:04:17,589 INFO L290 TraceCheckUtils]: 30: Hoare triple {32902#false} ~cond := #in~cond; {32902#false} is VALID [2022-04-15 13:04:17,589 INFO L272 TraceCheckUtils]: 29: Hoare triple {32902#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32902#false} is VALID [2022-04-15 13:04:17,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {32999#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {32902#false} is VALID [2022-04-15 13:04:17,589 INFO L290 TraceCheckUtils]: 27: Hoare triple {32999#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {32999#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:04:17,590 INFO L290 TraceCheckUtils]: 26: Hoare triple {32999#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {32999#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:04:17,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {32971#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32999#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:04:17,603 INFO L290 TraceCheckUtils]: 24: Hoare triple {32975#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32971#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 13:04:17,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {32979#(< 0 (mod (+ main_~y~0 3) 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; {32975#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 13:04:17,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {32983#(< 0 (mod (+ main_~y~0 4) 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; {32979#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 13:04:17,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {32983#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !(~y~0 % 4294967296 > 0); {32983#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-15 13:04:17,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {32979#(< 0 (mod (+ main_~y~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; {32983#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-15 13:04:17,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {32975#(< 0 (mod (+ main_~y~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; {32979#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 13:04:17,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {32971#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32975#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 13:04:17,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {32901#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32971#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 13:04:17,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {32901#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32901#true} is VALID [2022-04-15 13:04:17,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {32901#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32901#true} is VALID [2022-04-15 13:04:17,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {32901#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32901#true} is VALID [2022-04-15 13:04:17,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {32901#true} assume !(~z~0 % 4294967296 > 0); {32901#true} is VALID [2022-04-15 13:04:17,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {32901#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32901#true} is VALID [2022-04-15 13:04:17,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {32901#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32901#true} is VALID [2022-04-15 13:04:17,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {32901#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32901#true} is VALID [2022-04-15 13:04:17,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {32901#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32901#true} is VALID [2022-04-15 13:04:17,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {32901#true} ~z~0 := ~y~0; {32901#true} is VALID [2022-04-15 13:04:17,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {32901#true} [167] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {32901#true} is VALID [2022-04-15 13:04:17,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {32901#true} [168] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_72| 0) (= (+ v_main_~y~0_Out_72 v_main_~x~0_Out_72) (+ v_main_~x~0_In_36 v_main_~y~0_In_36)) (<= v_main_~x~0_Out_72 v_main_~x~0_In_36) (= |v_main_#t~post5_Out_72| 0) (< 0 (mod (+ v_main_~x~0_Out_72 1) 4294967296))) (and (= v_main_~x~0_In_36 v_main_~x~0_Out_72) (= v_main_~y~0_In_36 v_main_~y~0_Out_72))) InVars {main_~x~0=v_main_~x~0_In_36, main_~y~0=v_main_~y~0_In_36} OutVars{main_~y~0=v_main_~y~0_Out_72, main_#t~post5=|v_main_#t~post5_Out_72|, main_~x~0=v_main_~x~0_Out_72, main_#t~post6=|v_main_#t~post6_Out_72|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {32901#true} is VALID [2022-04-15 13:04:17,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {32901#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32901#true} is VALID [2022-04-15 13:04:17,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {32901#true} call #t~ret17 := main(); {32901#true} is VALID [2022-04-15 13:04:17,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32901#true} {32901#true} #94#return; {32901#true} is VALID [2022-04-15 13:04:17,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {32901#true} assume true; {32901#true} is VALID [2022-04-15 13:04:17,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {32901#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32901#true} is VALID [2022-04-15 13:04:17,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {32901#true} call ULTIMATE.init(); {32901#true} is VALID [2022-04-15 13:04:17,634 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 13:04:17,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312272862] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:04:17,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:04:17,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 18 [2022-04-15 13:04:18,970 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:18,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [523708915] [2022-04-15 13:04:18,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [523708915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:18,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:18,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 13:04:18,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141599413] [2022-04-15 13:04:18,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:18,971 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-15 13:04:18,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:18,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:19,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:19,132 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 13:04:19,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:19,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 13:04:19,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2022-04-15 13:04:19,133 INFO L87 Difference]: Start difference. First operand 181 states and 235 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:49,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:49,508 INFO L93 Difference]: Finished difference Result 382 states and 551 transitions. [2022-04-15 13:04:49,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 13:04:49,508 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-15 13:04:49,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:49,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:49,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 162 transitions. [2022-04-15 13:04:49,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:49,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 162 transitions. [2022-04-15 13:04:49,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 162 transitions. [2022-04-15 13:04:51,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:51,109 INFO L225 Difference]: With dead ends: 382 [2022-04-15 13:04:51,109 INFO L226 Difference]: Without dead ends: 270 [2022-04-15 13:04:51,110 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=560, Invalid=2862, Unknown=0, NotChecked=0, Total=3422 [2022-04-15 13:04:51,110 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 102 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:51,110 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 81 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-04-15 13:04:51,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-04-15 13:04:52,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 147. [2022-04-15 13:04:52,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:52,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 270 states. Second operand has 147 states, 142 states have (on average 1.3309859154929577) internal successors, (189), 142 states have internal predecessors, (189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:52,556 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states. Second operand has 147 states, 142 states have (on average 1.3309859154929577) internal successors, (189), 142 states have internal predecessors, (189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:52,557 INFO L87 Difference]: Start difference. First operand 270 states. Second operand has 147 states, 142 states have (on average 1.3309859154929577) internal successors, (189), 142 states have internal predecessors, (189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:52,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:52,560 INFO L93 Difference]: Finished difference Result 270 states and 392 transitions. [2022-04-15 13:04:52,560 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 392 transitions. [2022-04-15 13:04:52,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:52,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:52,560 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 142 states have (on average 1.3309859154929577) internal successors, (189), 142 states have internal predecessors, (189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 270 states. [2022-04-15 13:04:52,560 INFO L87 Difference]: Start difference. First operand has 147 states, 142 states have (on average 1.3309859154929577) internal successors, (189), 142 states have internal predecessors, (189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 270 states. [2022-04-15 13:04:52,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:52,563 INFO L93 Difference]: Finished difference Result 270 states and 392 transitions. [2022-04-15 13:04:52,563 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 392 transitions. [2022-04-15 13:04:52,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:52,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:52,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:52,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:52,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 142 states have (on average 1.3309859154929577) internal successors, (189), 142 states have internal predecessors, (189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:52,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 193 transitions. [2022-04-15 13:04:52,565 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 193 transitions. Word has length 36 [2022-04-15 13:04:52,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:52,565 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 193 transitions. [2022-04-15 13:04:52,565 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:52,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 193 transitions. [2022-04-15 13:05:05,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:05,408 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 193 transitions. [2022-04-15 13:05:05,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 13:05:05,408 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:05:05,408 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:05:05,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-15 13:05:05,609 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-15 13:05:05,609 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:05:05,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:05:05,609 INFO L85 PathProgramCache]: Analyzing trace with hash 784665945, now seen corresponding path program 3 times [2022-04-15 13:05:05,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:05,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [638630976] [2022-04-15 13:05:05,757 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:05:05,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1237504745, now seen corresponding path program 1 times [2022-04-15 13:05:05,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:05,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691791612] [2022-04-15 13:05:05,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:05,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:06,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:05:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:06,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {34812#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34797#true} is VALID [2022-04-15 13:05:06,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {34797#true} assume true; {34797#true} is VALID [2022-04-15 13:05:06,504 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34797#true} {34797#true} #94#return; {34797#true} is VALID [2022-04-15 13:05:06,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {34797#true} call ULTIMATE.init(); {34812#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:05:06,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {34812#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34797#true} is VALID [2022-04-15 13:05:06,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {34797#true} assume true; {34797#true} is VALID [2022-04-15 13:05:06,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34797#true} {34797#true} #94#return; {34797#true} is VALID [2022-04-15 13:05:06,505 INFO L272 TraceCheckUtils]: 4: Hoare triple {34797#true} call #t~ret17 := main(); {34797#true} is VALID [2022-04-15 13:05:06,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {34797#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34797#true} is VALID [2022-04-15 13:05:06,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {34797#true} [170] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_37 v_main_~y~0_Out_74) (= v_main_~x~0_In_37 v_main_~x~0_Out_74)) (and (= (+ v_main_~y~0_Out_74 v_main_~x~0_Out_74) (+ v_main_~x~0_In_37 v_main_~y~0_In_37)) (<= v_main_~x~0_Out_74 v_main_~x~0_In_37) (= |v_main_#t~post6_Out_74| 0) (< 0 (mod (+ v_main_~x~0_Out_74 1) 4294967296)) (= |v_main_#t~post5_Out_74| 0))) InVars {main_~x~0=v_main_~x~0_In_37, main_~y~0=v_main_~y~0_In_37} OutVars{main_~y~0=v_main_~y~0_Out_74, main_#t~post5=|v_main_#t~post5_Out_74|, main_~x~0=v_main_~x~0_Out_74, main_#t~post6=|v_main_#t~post6_Out_74|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {34797#true} is VALID [2022-04-15 13:05:06,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {34797#true} [169] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {34797#true} is VALID [2022-04-15 13:05:06,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {34797#true} ~z~0 := ~y~0; {34802#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 13:05:06,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {34802#(= 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; {34803#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 13:05:06,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {34803#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34804#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967296)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 13:05:06,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {34804#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967296)) (<= (+ main_~z~0 2) 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; {34805#(and (or (<= (+ main_~z~0 3) main_~y~0) (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967296)))} is VALID [2022-04-15 13:05:06,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {34805#(and (or (<= (+ main_~z~0 3) main_~y~0) (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 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; {34806#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} is VALID [2022-04-15 13:05:06,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {34806#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {34806#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} is VALID [2022-04-15 13:05:06,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {34806#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34807#(<= (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 3) main_~y~0)} is VALID [2022-04-15 13:05:06,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {34807#(<= (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 3) main_~y~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34808#(<= (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) 2) main_~y~0)} is VALID [2022-04-15 13:05:06,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {34808#(<= (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) 2) main_~y~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34809#(<= (+ (* (div (+ main_~y~0 3) 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 13:05:06,549 INFO L290 TraceCheckUtils]: 17: Hoare triple {34809#(<= (+ (* (div (+ main_~y~0 3) 4294967296) 4294967296) 1) main_~y~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34810#(<= (* 4294967296 (div (+ main_~y~0 4) 4294967296)) main_~y~0)} is VALID [2022-04-15 13:05:06,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {34810#(<= (* 4294967296 (div (+ main_~y~0 4) 4294967296)) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {34810#(<= (* 4294967296 (div (+ main_~y~0 4) 4294967296)) main_~y~0)} is VALID [2022-04-15 13:05:06,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {34810#(<= (* 4294967296 (div (+ main_~y~0 4) 4294967296)) main_~y~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {34809#(<= (+ (* (div (+ main_~y~0 3) 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 13:05:06,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {34809#(<= (+ (* (div (+ main_~y~0 3) 4294967296) 4294967296) 1) main_~y~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {34808#(<= (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) 2) main_~y~0)} is VALID [2022-04-15 13:05:06,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {34808#(<= (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) 2) main_~y~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {34807#(<= (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 3) main_~y~0)} is VALID [2022-04-15 13:05:06,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {34807#(<= (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 3) main_~y~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {34811#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} is VALID [2022-04-15 13:05:06,577 INFO L290 TraceCheckUtils]: 23: Hoare triple {34811#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} assume !(~x~0 % 4294967296 > 0); {34811#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} is VALID [2022-04-15 13:05:06,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {34811#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~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; {34811#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} is VALID [2022-04-15 13:05:06,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {34811#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~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; {34811#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} is VALID [2022-04-15 13:05:06,578 INFO L290 TraceCheckUtils]: 26: Hoare triple {34811#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~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; {34811#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} is VALID [2022-04-15 13:05:06,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {34811#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~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; {34811#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} is VALID [2022-04-15 13:05:06,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {34811#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {34811#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} is VALID [2022-04-15 13:05:06,584 INFO L290 TraceCheckUtils]: 29: Hoare triple {34811#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {34798#false} is VALID [2022-04-15 13:05:06,584 INFO L272 TraceCheckUtils]: 30: Hoare triple {34798#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {34798#false} is VALID [2022-04-15 13:05:06,584 INFO L290 TraceCheckUtils]: 31: Hoare triple {34798#false} ~cond := #in~cond; {34798#false} is VALID [2022-04-15 13:05:06,584 INFO L290 TraceCheckUtils]: 32: Hoare triple {34798#false} assume 0 == ~cond; {34798#false} is VALID [2022-04-15 13:05:06,584 INFO L290 TraceCheckUtils]: 33: Hoare triple {34798#false} assume !false; {34798#false} is VALID [2022-04-15 13:05:06,584 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 13:05:06,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:05:06,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691791612] [2022-04-15 13:05:06,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691791612] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:05:06,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811567455] [2022-04-15 13:05:06,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:06,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:05:06,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:05:06,585 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:05:06,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-15 13:05:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:06,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-15 13:05:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:06,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:05:07,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {34797#true} call ULTIMATE.init(); {34797#true} is VALID [2022-04-15 13:05:07,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {34797#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34797#true} is VALID [2022-04-15 13:05:07,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {34797#true} assume true; {34797#true} is VALID [2022-04-15 13:05:07,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34797#true} {34797#true} #94#return; {34797#true} is VALID [2022-04-15 13:05:07,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {34797#true} call #t~ret17 := main(); {34797#true} is VALID [2022-04-15 13:05:07,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {34797#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34797#true} is VALID [2022-04-15 13:05:07,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {34797#true} [170] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_37 v_main_~y~0_Out_74) (= v_main_~x~0_In_37 v_main_~x~0_Out_74)) (and (= (+ v_main_~y~0_Out_74 v_main_~x~0_Out_74) (+ v_main_~x~0_In_37 v_main_~y~0_In_37)) (<= v_main_~x~0_Out_74 v_main_~x~0_In_37) (= |v_main_#t~post6_Out_74| 0) (< 0 (mod (+ v_main_~x~0_Out_74 1) 4294967296)) (= |v_main_#t~post5_Out_74| 0))) InVars {main_~x~0=v_main_~x~0_In_37, main_~y~0=v_main_~y~0_In_37} OutVars{main_~y~0=v_main_~y~0_Out_74, main_#t~post5=|v_main_#t~post5_Out_74|, main_~x~0=v_main_~x~0_Out_74, main_#t~post6=|v_main_#t~post6_Out_74|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {34797#true} is VALID [2022-04-15 13:05:07,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {34797#true} [169] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {34797#true} is VALID [2022-04-15 13:05:07,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {34797#true} ~z~0 := ~y~0; {34802#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 13:05:07,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {34802#(= 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; {34803#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 13:05:07,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {34803#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34846#(= (+ (- 2) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 13:05:07,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {34846#(= (+ (- 2) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34850#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-15 13:05:07,866 INFO L290 TraceCheckUtils]: 12: Hoare triple {34850#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34854#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} is VALID [2022-04-15 13:05:07,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {34854#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {34854#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} is VALID [2022-04-15 13:05:07,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {34854#(= (+ main_~y~0 (- 3)) (+ 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; {34846#(= (+ (- 2) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 13:05:07,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {34846#(= (+ (- 2) main_~y~0 (* (- 1) main_~z~0)) 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; {34802#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 13:05:07,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {34802#(= main_~z~0 main_~y~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34867#(= (+ main_~y~0 2) main_~z~0)} is VALID [2022-04-15 13:05:07,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {34867#(= (+ main_~y~0 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; {34871#(= (+ main_~y~0 1) (+ main_~z~0 (- 3)))} is VALID [2022-04-15 13:05:07,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {34871#(= (+ main_~y~0 1) (+ main_~z~0 (- 3)))} assume !(~y~0 % 4294967296 > 0); {34871#(= (+ main_~y~0 1) (+ main_~z~0 (- 3)))} is VALID [2022-04-15 13:05:07,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {34871#(= (+ main_~y~0 1) (+ main_~z~0 (- 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {34878#(= main_~y~0 (+ main_~z~0 (- 3)))} is VALID [2022-04-15 13:05:07,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {34878#(= main_~y~0 (+ main_~z~0 (- 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {34867#(= (+ main_~y~0 2) main_~z~0)} is VALID [2022-04-15 13:05:07,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {34867#(= (+ main_~y~0 2) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {34885#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-15 13:05:07,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {34885#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {34802#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 13:05:07,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {34802#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {34802#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 13:05:07,910 INFO L290 TraceCheckUtils]: 24: Hoare triple {34802#(= main_~z~0 main_~y~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; {34895#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-15 13:05:07,914 INFO L290 TraceCheckUtils]: 25: Hoare triple {34895#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ 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; {34899#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= main_~y~0 (+ main_~z~0 2)))} is VALID [2022-04-15 13:05:07,920 INFO L290 TraceCheckUtils]: 26: Hoare triple {34899#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= main_~y~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; {34903#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:05:07,921 INFO L290 TraceCheckUtils]: 27: Hoare triple {34903#(< 0 (mod main_~y~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; {34903#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:05:07,921 INFO L290 TraceCheckUtils]: 28: Hoare triple {34903#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {34903#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:05:07,921 INFO L290 TraceCheckUtils]: 29: Hoare triple {34903#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {34798#false} is VALID [2022-04-15 13:05:07,921 INFO L272 TraceCheckUtils]: 30: Hoare triple {34798#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {34798#false} is VALID [2022-04-15 13:05:07,921 INFO L290 TraceCheckUtils]: 31: Hoare triple {34798#false} ~cond := #in~cond; {34798#false} is VALID [2022-04-15 13:05:07,921 INFO L290 TraceCheckUtils]: 32: Hoare triple {34798#false} assume 0 == ~cond; {34798#false} is VALID [2022-04-15 13:05:07,922 INFO L290 TraceCheckUtils]: 33: Hoare triple {34798#false} assume !false; {34798#false} is VALID [2022-04-15 13:05:07,922 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 13:05:07,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:05:10,179 INFO L290 TraceCheckUtils]: 33: Hoare triple {34798#false} assume !false; {34798#false} is VALID [2022-04-15 13:05:10,179 INFO L290 TraceCheckUtils]: 32: Hoare triple {34798#false} assume 0 == ~cond; {34798#false} is VALID [2022-04-15 13:05:10,179 INFO L290 TraceCheckUtils]: 31: Hoare triple {34798#false} ~cond := #in~cond; {34798#false} is VALID [2022-04-15 13:05:10,179 INFO L272 TraceCheckUtils]: 30: Hoare triple {34798#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {34798#false} is VALID [2022-04-15 13:05:10,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {34903#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {34798#false} is VALID [2022-04-15 13:05:10,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {34903#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {34903#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:05:10,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {34903#(< 0 (mod main_~y~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; {34903#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:05:10,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {34903#(< 0 (mod main_~y~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; {34903#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:05:10,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {34903#(< 0 (mod main_~y~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; {34903#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:05:10,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {34952#(or (<= (mod main_~z~0 4294967296) 0) (< 0 (mod main_~y~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; {34903#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:05:10,181 INFO L290 TraceCheckUtils]: 23: Hoare triple {34952#(or (<= (mod main_~z~0 4294967296) 0) (< 0 (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {34952#(or (<= (mod main_~z~0 4294967296) 0) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 13:05:10,191 INFO L290 TraceCheckUtils]: 22: Hoare triple {34959#(or (< 0 (mod (+ main_~y~0 1) 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; {34952#(or (<= (mod main_~z~0 4294967296) 0) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 13:05:10,196 INFO L290 TraceCheckUtils]: 21: Hoare triple {34963#(or (< 0 (mod (+ main_~y~0 2) 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; {34959#(or (< 0 (mod (+ main_~y~0 1) 4294967296)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-15 13:05:10,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {34967#(or (< 0 (mod (+ main_~y~0 3) 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; {34963#(or (< 0 (mod (+ main_~y~0 2) 4294967296)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-15 13:05:10,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {34971#(or (< 0 (mod (+ main_~y~0 4) 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; {34967#(or (< 0 (mod (+ main_~y~0 3) 4294967296)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-15 13:05:10,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {34971#(or (< 0 (mod (+ main_~y~0 4) 4294967296)) (<= (mod main_~z~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {34971#(or (< 0 (mod (+ main_~y~0 4) 4294967296)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-15 13:05:10,208 INFO L290 TraceCheckUtils]: 17: Hoare triple {34978#(or (<= (mod (+ main_~z~0 1) 4294967296) 0) (< 0 (mod (+ main_~y~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; {34971#(or (< 0 (mod (+ main_~y~0 4) 4294967296)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-15 13:05:10,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {34982#(or (<= (mod (+ main_~z~0 2) 4294967296) 0) (< 0 (mod (+ main_~y~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; {34978#(or (<= (mod (+ main_~z~0 1) 4294967296) 0) (< 0 (mod (+ main_~y~0 3) 4294967296)))} is VALID [2022-04-15 13:05:10,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {34986#(or (<= (mod (+ main_~z~0 3) 4294967296) 0) (< 0 (mod (+ main_~y~0 1) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34982#(or (<= (mod (+ main_~z~0 2) 4294967296) 0) (< 0 (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-15 13:05:10,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {34990#(or (<= (mod (+ main_~z~0 4) 4294967296) 0) (< 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; {34986#(or (<= (mod (+ main_~z~0 3) 4294967296) 0) (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-15 13:05:10,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {34990#(or (<= (mod (+ main_~z~0 4) 4294967296) 0) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {34990#(or (<= (mod (+ main_~z~0 4) 4294967296) 0) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 13:05:10,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {34997#(or (<= (mod (+ main_~z~0 3) 4294967296) 0) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34990#(or (<= (mod (+ main_~z~0 4) 4294967296) 0) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 13:05:10,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {35001#(or (<= (mod (+ main_~z~0 2) 4294967296) 0) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34997#(or (<= (mod (+ main_~z~0 3) 4294967296) 0) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 13:05:10,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {35005#(or (<= (mod (+ main_~z~0 1) 4294967296) 0) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35001#(or (<= (mod (+ main_~z~0 2) 4294967296) 0) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 13:05:10,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {34952#(or (<= (mod main_~z~0 4294967296) 0) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35005#(or (<= (mod (+ main_~z~0 1) 4294967296) 0) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 13:05:10,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {34797#true} ~z~0 := ~y~0; {34952#(or (<= (mod main_~z~0 4294967296) 0) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 13:05:10,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {34797#true} [169] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {34797#true} is VALID [2022-04-15 13:05:10,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {34797#true} [170] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_37 v_main_~y~0_Out_74) (= v_main_~x~0_In_37 v_main_~x~0_Out_74)) (and (= (+ v_main_~y~0_Out_74 v_main_~x~0_Out_74) (+ v_main_~x~0_In_37 v_main_~y~0_In_37)) (<= v_main_~x~0_Out_74 v_main_~x~0_In_37) (= |v_main_#t~post6_Out_74| 0) (< 0 (mod (+ v_main_~x~0_Out_74 1) 4294967296)) (= |v_main_#t~post5_Out_74| 0))) InVars {main_~x~0=v_main_~x~0_In_37, main_~y~0=v_main_~y~0_In_37} OutVars{main_~y~0=v_main_~y~0_Out_74, main_#t~post5=|v_main_#t~post5_Out_74|, main_~x~0=v_main_~x~0_Out_74, main_#t~post6=|v_main_#t~post6_Out_74|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {34797#true} is VALID [2022-04-15 13:05:10,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {34797#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34797#true} is VALID [2022-04-15 13:05:10,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {34797#true} call #t~ret17 := main(); {34797#true} is VALID [2022-04-15 13:05:10,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34797#true} {34797#true} #94#return; {34797#true} is VALID [2022-04-15 13:05:10,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {34797#true} assume true; {34797#true} is VALID [2022-04-15 13:05:10,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {34797#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34797#true} is VALID [2022-04-15 13:05:10,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {34797#true} call ULTIMATE.init(); {34797#true} is VALID [2022-04-15 13:05:10,240 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 13:05:10,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811567455] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:05:10,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:05:10,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15] total 35 [2022-04-15 13:05:12,883 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:05:12,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [638630976] [2022-04-15 13:05:12,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [638630976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:12,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:12,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 13:05:12,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188065561] [2022-04-15 13:05:12,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:05:12,884 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 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 37 [2022-04-15 13:05:12,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:05:12,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:05:13,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:13,095 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 13:05:13,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:13,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 13:05:13,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1325, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 13:05:13,096 INFO L87 Difference]: Start difference. First operand 147 states and 193 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:05:55,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:55,741 INFO L93 Difference]: Finished difference Result 283 states and 415 transitions. [2022-04-15 13:05:55,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-15 13:05:55,742 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 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 37 [2022-04-15 13:05:55,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:05:55,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:05:55,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 210 transitions. [2022-04-15 13:05:55,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:05:55,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 210 transitions. [2022-04-15 13:05:55,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 210 transitions. [2022-04-15 13:05:58,038 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-15 13:05:58,042 INFO L225 Difference]: With dead ends: 283 [2022-04-15 13:05:58,042 INFO L226 Difference]: Without dead ends: 278 [2022-04-15 13:05:58,043 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=1030, Invalid=6802, Unknown=0, NotChecked=0, Total=7832 [2022-04-15 13:05:58,043 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 221 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-04-15 13:05:58,043 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 80 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2022-04-15 13:05:58,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-04-15 13:05:59,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 147. [2022-04-15 13:05:59,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:05:59,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 278 states. Second operand has 147 states, 142 states have (on average 1.2816901408450705) internal successors, (182), 142 states have internal predecessors, (182), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:05:59,590 INFO L74 IsIncluded]: Start isIncluded. First operand 278 states. Second operand has 147 states, 142 states have (on average 1.2816901408450705) internal successors, (182), 142 states have internal predecessors, (182), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:05:59,591 INFO L87 Difference]: Start difference. First operand 278 states. Second operand has 147 states, 142 states have (on average 1.2816901408450705) internal successors, (182), 142 states have internal predecessors, (182), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:05:59,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:59,594 INFO L93 Difference]: Finished difference Result 278 states and 376 transitions. [2022-04-15 13:05:59,594 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 376 transitions. [2022-04-15 13:05:59,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:59,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:59,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 142 states have (on average 1.2816901408450705) internal successors, (182), 142 states have internal predecessors, (182), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 278 states. [2022-04-15 13:05:59,594 INFO L87 Difference]: Start difference. First operand has 147 states, 142 states have (on average 1.2816901408450705) internal successors, (182), 142 states have internal predecessors, (182), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 278 states. [2022-04-15 13:05:59,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:59,597 INFO L93 Difference]: Finished difference Result 278 states and 376 transitions. [2022-04-15 13:05:59,597 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 376 transitions. [2022-04-15 13:05:59,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:59,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:59,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:05:59,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:05:59,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 142 states have (on average 1.2816901408450705) internal successors, (182), 142 states have internal predecessors, (182), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:05:59,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 186 transitions. [2022-04-15 13:05:59,599 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 186 transitions. Word has length 37 [2022-04-15 13:05:59,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:05:59,599 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 186 transitions. [2022-04-15 13:05:59,599 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:05:59,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 186 transitions. [2022-04-15 13:06:11,904 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-15 13:06:11,904 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 186 transitions. [2022-04-15 13:06:11,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 13:06:11,904 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:06:11,904 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:06:11,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-15 13:06:12,105 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-15 13:06:12,105 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:06:12,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:06:12,105 INFO L85 PathProgramCache]: Analyzing trace with hash -552778231, now seen corresponding path program 8 times [2022-04-15 13:06:12,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:12,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [68338333] [2022-04-15 13:06:12,274 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:06:12,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1038301640, now seen corresponding path program 1 times [2022-04-15 13:06:12,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:06:12,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973965096] [2022-04-15 13:06:12,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:12,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:06:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:12,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:06:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:12,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {36578#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36562#true} is VALID [2022-04-15 13:06:12,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {36562#true} assume true; {36562#true} is VALID [2022-04-15 13:06:12,919 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36562#true} {36562#true} #94#return; {36562#true} is VALID [2022-04-15 13:06:12,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {36562#true} call ULTIMATE.init(); {36578#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:06:12,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {36578#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36562#true} is VALID [2022-04-15 13:06:12,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {36562#true} assume true; {36562#true} is VALID [2022-04-15 13:06:12,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36562#true} {36562#true} #94#return; {36562#true} is VALID [2022-04-15 13:06:12,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {36562#true} call #t~ret17 := main(); {36562#true} is VALID [2022-04-15 13:06:12,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {36562#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36562#true} is VALID [2022-04-15 13:06:12,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {36562#true} [172] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_38 v_main_~y~0_Out_76) (= v_main_~x~0_In_38 v_main_~x~0_Out_76)) (and (= (+ v_main_~x~0_In_38 v_main_~y~0_In_38) (+ v_main_~y~0_Out_76 v_main_~x~0_Out_76)) (< 0 (mod (+ v_main_~x~0_Out_76 1) 4294967296)) (= |v_main_#t~post5_Out_76| 0) (= |v_main_#t~post6_Out_76| 0) (<= v_main_~x~0_Out_76 v_main_~x~0_In_38))) InVars {main_~x~0=v_main_~x~0_In_38, main_~y~0=v_main_~y~0_In_38} OutVars{main_~y~0=v_main_~y~0_Out_76, main_#t~post5=|v_main_#t~post5_Out_76|, main_~x~0=v_main_~x~0_Out_76, main_#t~post6=|v_main_#t~post6_Out_76|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {36562#true} is VALID [2022-04-15 13:06:12,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {36562#true} [171] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {36562#true} is VALID [2022-04-15 13:06:12,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {36562#true} ~z~0 := ~y~0; {36567#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 13:06:12,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {36567#(= 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; {36568#(and (= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0) (<= main_~y~0 (+ 4294967295 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 13:06:12,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {36568#(and (= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0) (<= main_~y~0 (+ 4294967295 (* (div 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; {36569#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 13:06:12,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {36569#(<= main_~z~0 (+ (* (div main_~z~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; {36570#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 13:06:12,940 INFO L290 TraceCheckUtils]: 12: Hoare triple {36570#(<= main_~z~0 (+ 4294967292 (* (div 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; {36571#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 13:06:12,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {36571#(<= main_~z~0 (+ 4294967291 (* (div 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; {36572#(<= main_~z~0 (+ 4294967290 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 13:06:12,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {36572#(<= main_~z~0 (+ 4294967290 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {36572#(<= main_~z~0 (+ 4294967290 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 13:06:12,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {36572#(<= main_~z~0 (+ 4294967290 (* (div 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; {36573#(<= main_~z~0 (+ 4294967291 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 13:06:12,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {36573#(<= main_~z~0 (+ 4294967291 (* 4294967296 (div (+ (- 1) 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; {36574#(<= main_~z~0 (+ 4294967292 (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296))))} is VALID [2022-04-15 13:06:12,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {36574#(<= main_~z~0 (+ 4294967292 (* 4294967296 (div (+ (- 2) 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; {36575#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 13:06:12,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {36575#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36576#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967294))} is VALID [2022-04-15 13:06:12,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {36576#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967294))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36577#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 13:06:12,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {36577#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {36577#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 13:06:12,980 INFO L290 TraceCheckUtils]: 21: Hoare triple {36577#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36577#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 13:06:12,980 INFO L290 TraceCheckUtils]: 22: Hoare triple {36577#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36577#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 13:06:12,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {36577#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36577#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 13:06:12,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {36577#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36577#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 13:06:12,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {36577#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36577#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 13:06:12,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {36577#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {36577#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 13:06:12,985 INFO L290 TraceCheckUtils]: 27: Hoare triple {36577#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {36563#false} is VALID [2022-04-15 13:06:12,985 INFO L290 TraceCheckUtils]: 28: Hoare triple {36563#false} assume !(~y~0 % 4294967296 > 0); {36563#false} is VALID [2022-04-15 13:06:12,985 INFO L272 TraceCheckUtils]: 29: Hoare triple {36563#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {36563#false} is VALID [2022-04-15 13:06:12,985 INFO L290 TraceCheckUtils]: 30: Hoare triple {36563#false} ~cond := #in~cond; {36563#false} is VALID [2022-04-15 13:06:12,985 INFO L290 TraceCheckUtils]: 31: Hoare triple {36563#false} assume 0 == ~cond; {36563#false} is VALID [2022-04-15 13:06:12,985 INFO L290 TraceCheckUtils]: 32: Hoare triple {36563#false} assume !false; {36563#false} is VALID [2022-04-15 13:06:12,986 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 13:06:12,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:06:12,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973965096] [2022-04-15 13:06:12,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973965096] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:06:12,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167392689] [2022-04-15 13:06:12,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:12,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:06:12,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:06:12,987 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:06:12,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-15 13:06:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:13,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 13:06:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:13,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:06:13,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {36562#true} call ULTIMATE.init(); {36562#true} is VALID [2022-04-15 13:06:13,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {36562#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36562#true} is VALID [2022-04-15 13:06:13,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {36562#true} assume true; {36562#true} is VALID [2022-04-15 13:06:13,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36562#true} {36562#true} #94#return; {36562#true} is VALID [2022-04-15 13:06:13,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {36562#true} call #t~ret17 := main(); {36562#true} is VALID [2022-04-15 13:06:13,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {36562#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36562#true} is VALID [2022-04-15 13:06:13,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {36562#true} [172] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_38 v_main_~y~0_Out_76) (= v_main_~x~0_In_38 v_main_~x~0_Out_76)) (and (= (+ v_main_~x~0_In_38 v_main_~y~0_In_38) (+ v_main_~y~0_Out_76 v_main_~x~0_Out_76)) (< 0 (mod (+ v_main_~x~0_Out_76 1) 4294967296)) (= |v_main_#t~post5_Out_76| 0) (= |v_main_#t~post6_Out_76| 0) (<= v_main_~x~0_Out_76 v_main_~x~0_In_38))) InVars {main_~x~0=v_main_~x~0_In_38, main_~y~0=v_main_~y~0_In_38} OutVars{main_~y~0=v_main_~y~0_Out_76, main_#t~post5=|v_main_#t~post5_Out_76|, main_~x~0=v_main_~x~0_Out_76, main_#t~post6=|v_main_#t~post6_Out_76|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {36562#true} is VALID [2022-04-15 13:06:13,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {36562#true} [171] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {36562#true} is VALID [2022-04-15 13:06:13,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {36562#true} ~z~0 := ~y~0; {36567#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 13:06:13,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {36567#(= 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; {36609#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:06:13,806 INFO L290 TraceCheckUtils]: 10: Hoare triple {36609#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36609#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:06:13,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {36609#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36609#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:06:13,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {36609#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36609#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:06:13,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {36609#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36609#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:06:13,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {36609#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {36609#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:06:13,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {36609#(< 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; {36628#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 13:06:13,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {36628#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36632#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 13:06:13,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {36632#(< 0 (mod (+ main_~y~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; {36636#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 13:06:13,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {36636#(< 0 (mod (+ main_~y~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; {36640#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-15 13:06:13,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {36640#(< 0 (mod (+ main_~y~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; {36644#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-15 13:06:13,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {36644#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !(~y~0 % 4294967296 > 0); {36644#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-15 13:06:13,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {36644#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36640#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-15 13:06:13,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {36640#(< 0 (mod (+ main_~y~0 4) 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; {36636#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 13:06:13,850 INFO L290 TraceCheckUtils]: 23: Hoare triple {36636#(< 0 (mod (+ main_~y~0 3) 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; {36632#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 13:06:13,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {36632#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36628#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 13:06:13,861 INFO L290 TraceCheckUtils]: 25: Hoare triple {36628#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36609#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:06:13,862 INFO L290 TraceCheckUtils]: 26: Hoare triple {36609#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {36609#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:06:13,862 INFO L290 TraceCheckUtils]: 27: Hoare triple {36609#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {36609#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:06:13,862 INFO L290 TraceCheckUtils]: 28: Hoare triple {36609#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {36563#false} is VALID [2022-04-15 13:06:13,862 INFO L272 TraceCheckUtils]: 29: Hoare triple {36563#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {36563#false} is VALID [2022-04-15 13:06:13,862 INFO L290 TraceCheckUtils]: 30: Hoare triple {36563#false} ~cond := #in~cond; {36563#false} is VALID [2022-04-15 13:06:13,862 INFO L290 TraceCheckUtils]: 31: Hoare triple {36563#false} assume 0 == ~cond; {36563#false} is VALID [2022-04-15 13:06:13,863 INFO L290 TraceCheckUtils]: 32: Hoare triple {36563#false} assume !false; {36563#false} is VALID [2022-04-15 13:06:13,863 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 13:06:13,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:06:14,134 INFO L290 TraceCheckUtils]: 32: Hoare triple {36563#false} assume !false; {36563#false} is VALID [2022-04-15 13:06:14,134 INFO L290 TraceCheckUtils]: 31: Hoare triple {36563#false} assume 0 == ~cond; {36563#false} is VALID [2022-04-15 13:06:14,134 INFO L290 TraceCheckUtils]: 30: Hoare triple {36563#false} ~cond := #in~cond; {36563#false} is VALID [2022-04-15 13:06:14,135 INFO L272 TraceCheckUtils]: 29: Hoare triple {36563#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {36563#false} is VALID [2022-04-15 13:06:14,135 INFO L290 TraceCheckUtils]: 28: Hoare triple {36609#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {36563#false} is VALID [2022-04-15 13:06:14,135 INFO L290 TraceCheckUtils]: 27: Hoare triple {36609#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {36609#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:06:14,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {36609#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {36609#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:06:14,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {36628#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36609#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:06:14,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {36632#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36628#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 13:06:14,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {36636#(< 0 (mod (+ main_~y~0 3) 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; {36632#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 13:06:14,163 INFO L290 TraceCheckUtils]: 22: Hoare triple {36640#(< 0 (mod (+ main_~y~0 4) 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; {36636#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 13:06:14,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {36644#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36640#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-15 13:06:14,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {36644#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !(~y~0 % 4294967296 > 0); {36644#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-15 13:06:14,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {36640#(< 0 (mod (+ main_~y~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; {36644#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-15 13:06:14,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {36636#(< 0 (mod (+ main_~y~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; {36640#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-15 13:06:14,181 INFO L290 TraceCheckUtils]: 17: Hoare triple {36632#(< 0 (mod (+ main_~y~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; {36636#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 13:06:14,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {36628#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36632#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 13:06:14,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {36609#(< 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; {36628#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 13:06:14,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {36609#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {36609#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:06:14,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {36609#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36609#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:06:14,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {36609#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36609#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:06:14,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {36609#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36609#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:06:14,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {36609#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36609#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:06:14,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {36753#(or (<= (mod main_~z~0 4294967296) 0) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36609#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 13:06:14,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {36562#true} ~z~0 := ~y~0; {36753#(or (<= (mod main_~z~0 4294967296) 0) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 13:06:14,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {36562#true} [171] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {36562#true} is VALID [2022-04-15 13:06:14,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {36562#true} [172] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_38 v_main_~y~0_Out_76) (= v_main_~x~0_In_38 v_main_~x~0_Out_76)) (and (= (+ v_main_~x~0_In_38 v_main_~y~0_In_38) (+ v_main_~y~0_Out_76 v_main_~x~0_Out_76)) (< 0 (mod (+ v_main_~x~0_Out_76 1) 4294967296)) (= |v_main_#t~post5_Out_76| 0) (= |v_main_#t~post6_Out_76| 0) (<= v_main_~x~0_Out_76 v_main_~x~0_In_38))) InVars {main_~x~0=v_main_~x~0_In_38, main_~y~0=v_main_~y~0_In_38} OutVars{main_~y~0=v_main_~y~0_Out_76, main_#t~post5=|v_main_#t~post5_Out_76|, main_~x~0=v_main_~x~0_Out_76, main_#t~post6=|v_main_#t~post6_Out_76|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {36562#true} is VALID [2022-04-15 13:06:14,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {36562#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36562#true} is VALID [2022-04-15 13:06:14,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {36562#true} call #t~ret17 := main(); {36562#true} is VALID [2022-04-15 13:06:14,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36562#true} {36562#true} #94#return; {36562#true} is VALID [2022-04-15 13:06:14,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {36562#true} assume true; {36562#true} is VALID [2022-04-15 13:06:14,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {36562#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36562#true} is VALID [2022-04-15 13:06:14,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {36562#true} call ULTIMATE.init(); {36562#true} is VALID [2022-04-15 13:06:14,194 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 13:06:14,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167392689] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:06:14,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:06:14,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 21 [2022-04-15 13:06:16,523 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:06:16,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [68338333] [2022-04-15 13:06:16,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [68338333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:16,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:16,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 13:06:16,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568932475] [2022-04-15 13:06:16,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:06:16,524 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 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 37 [2022-04-15 13:06:16,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:06:16,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:16,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:16,731 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 13:06:16,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:16,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 13:06:16,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2022-04-15 13:06:16,732 INFO L87 Difference]: Start difference. First operand 147 states and 186 transitions. Second operand has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:07,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:07,397 INFO L93 Difference]: Finished difference Result 417 states and 563 transitions. [2022-04-15 13:07:07,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-15 13:07:07,398 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 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 37 [2022-04-15 13:07:07,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:07:07,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:07,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 225 transitions. [2022-04-15 13:07:07,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:07,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 225 transitions. [2022-04-15 13:07:07,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 225 transitions. [2022-04-15 13:07:10,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:10,063 INFO L225 Difference]: With dead ends: 417 [2022-04-15 13:07:10,063 INFO L226 Difference]: Without dead ends: 404 [2022-04-15 13:07:10,063 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1180 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=673, Invalid=4439, Unknown=0, NotChecked=0, Total=5112 [2022-04-15 13:07:10,063 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 237 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-04-15 13:07:10,064 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 66 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2022-04-15 13:07:10,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-04-15 13:07:11,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 158. [2022-04-15 13:07:11,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:07:11,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 404 states. Second operand has 158 states, 153 states have (on average 1.261437908496732) internal successors, (193), 153 states have internal predecessors, (193), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:11,787 INFO L74 IsIncluded]: Start isIncluded. First operand 404 states. Second operand has 158 states, 153 states have (on average 1.261437908496732) internal successors, (193), 153 states have internal predecessors, (193), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:11,787 INFO L87 Difference]: Start difference. First operand 404 states. Second operand has 158 states, 153 states have (on average 1.261437908496732) internal successors, (193), 153 states have internal predecessors, (193), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:11,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:11,793 INFO L93 Difference]: Finished difference Result 404 states and 542 transitions. [2022-04-15 13:07:11,793 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 542 transitions. [2022-04-15 13:07:11,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:07:11,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:07:11,794 INFO L74 IsIncluded]: Start isIncluded. First operand has 158 states, 153 states have (on average 1.261437908496732) internal successors, (193), 153 states have internal predecessors, (193), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 404 states. [2022-04-15 13:07:11,794 INFO L87 Difference]: Start difference. First operand has 158 states, 153 states have (on average 1.261437908496732) internal successors, (193), 153 states have internal predecessors, (193), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 404 states. [2022-04-15 13:07:11,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:11,799 INFO L93 Difference]: Finished difference Result 404 states and 542 transitions. [2022-04-15 13:07:11,799 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 542 transitions. [2022-04-15 13:07:11,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:07:11,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:07:11,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:07:11,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:07:11,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 153 states have (on average 1.261437908496732) internal successors, (193), 153 states have internal predecessors, (193), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:11,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 197 transitions. [2022-04-15 13:07:11,802 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 197 transitions. Word has length 37 [2022-04-15 13:07:11,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:07:11,802 INFO L478 AbstractCegarLoop]: Abstraction has 158 states and 197 transitions. [2022-04-15 13:07:11,802 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:11,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 158 states and 197 transitions. [2022-04-15 13:07:25,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:25,883 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 197 transitions. [2022-04-15 13:07:25,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 13:07:25,883 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:07:25,884 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:07:25,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-15 13:07:26,084 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-15 13:07:26,084 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:07:26,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:07:26,084 INFO L85 PathProgramCache]: Analyzing trace with hash -352003804, now seen corresponding path program 11 times [2022-04-15 13:07:26,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:26,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [960956758] [2022-04-15 13:07:26,222 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:07:26,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1156292442, now seen corresponding path program 1 times [2022-04-15 13:07:26,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:07:26,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975441351] [2022-04-15 13:07:26,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:07:26,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:07:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:27,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:07:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:27,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {38860#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38839#true} is VALID [2022-04-15 13:07:27,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {38839#true} assume true; {38839#true} is VALID [2022-04-15 13:07:27,335 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38839#true} {38839#true} #94#return; {38839#true} is VALID [2022-04-15 13:07:27,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {38839#true} call ULTIMATE.init(); {38860#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:07:27,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {38860#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38839#true} is VALID [2022-04-15 13:07:27,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {38839#true} assume true; {38839#true} is VALID [2022-04-15 13:07:27,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38839#true} {38839#true} #94#return; {38839#true} is VALID [2022-04-15 13:07:27,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {38839#true} call #t~ret17 := main(); {38839#true} is VALID [2022-04-15 13:07:27,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {38839#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38839#true} is VALID [2022-04-15 13:07:27,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {38839#true} [174] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_78| 0) (< 0 (mod (+ v_main_~x~0_Out_78 1) 4294967296)) (<= v_main_~x~0_Out_78 v_main_~x~0_In_39) (= (+ v_main_~y~0_Out_78 v_main_~x~0_Out_78) (+ v_main_~x~0_In_39 v_main_~y~0_In_39)) (= |v_main_#t~post6_Out_78| 0)) (and (= v_main_~y~0_In_39 v_main_~y~0_Out_78) (= v_main_~x~0_In_39 v_main_~x~0_Out_78))) InVars {main_~x~0=v_main_~x~0_In_39, main_~y~0=v_main_~y~0_In_39} OutVars{main_~y~0=v_main_~y~0_Out_78, main_#t~post5=|v_main_#t~post5_Out_78|, main_~x~0=v_main_~x~0_Out_78, main_#t~post6=|v_main_#t~post6_Out_78|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {38839#true} is VALID [2022-04-15 13:07:27,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {38839#true} [173] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {38839#true} is VALID [2022-04-15 13:07:27,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {38839#true} ~z~0 := ~y~0; {38844#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 13:07:27,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {38844#(and (<= main_~y~0 main_~z~0) (<= 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; {38845#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 13:07:27,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {38845#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38846#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 13:07:27,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {38846#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) 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; {38847#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 13:07:27,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {38847#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38848#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 13:07:27,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {38848#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38849#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 13:07:27,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {38849#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 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; {38850#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 13:07:27,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {38850#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38851#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 13:07:27,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {38851#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 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; {38852#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:07:27,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {38852#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {38852#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:07:27,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {38852#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 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; {38853#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 13:07:27,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {38853#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38854#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 13:07:27,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {38854#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38855#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 13:07:27,399 INFO L290 TraceCheckUtils]: 21: Hoare triple {38855#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38856#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 13:07:27,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {38856#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38857#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 13:07:27,409 INFO L290 TraceCheckUtils]: 23: Hoare triple {38857#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38858#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 13:07:27,422 INFO L290 TraceCheckUtils]: 24: Hoare triple {38858#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {38859#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 13:07:27,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {38859#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {38840#false} is VALID [2022-04-15 13:07:27,427 INFO L290 TraceCheckUtils]: 26: Hoare triple {38840#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; {38840#false} is VALID [2022-04-15 13:07:27,427 INFO L290 TraceCheckUtils]: 27: Hoare triple {38840#false} assume !(~x~0 % 4294967296 > 0); {38840#false} is VALID [2022-04-15 13:07:27,427 INFO L290 TraceCheckUtils]: 28: Hoare triple {38840#false} assume !(~z~0 % 4294967296 > 0); {38840#false} is VALID [2022-04-15 13:07:27,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {38840#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; {38840#false} is VALID [2022-04-15 13:07:27,428 INFO L290 TraceCheckUtils]: 30: Hoare triple {38840#false} assume !(~y~0 % 4294967296 > 0); {38840#false} is VALID [2022-04-15 13:07:27,428 INFO L272 TraceCheckUtils]: 31: Hoare triple {38840#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {38840#false} is VALID [2022-04-15 13:07:27,428 INFO L290 TraceCheckUtils]: 32: Hoare triple {38840#false} ~cond := #in~cond; {38840#false} is VALID [2022-04-15 13:07:27,428 INFO L290 TraceCheckUtils]: 33: Hoare triple {38840#false} assume 0 == ~cond; {38840#false} is VALID [2022-04-15 13:07:27,428 INFO L290 TraceCheckUtils]: 34: Hoare triple {38840#false} assume !false; {38840#false} is VALID [2022-04-15 13:07:27,428 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 13:07:27,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:07:27,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975441351] [2022-04-15 13:07:27,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975441351] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:07:27,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17122743] [2022-04-15 13:07:27,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:07:27,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:07:27,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:07:27,431 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:07:27,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-15 13:07:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:27,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 13:07:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:27,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:07:28,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {38839#true} call ULTIMATE.init(); {38839#true} is VALID [2022-04-15 13:07:28,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {38839#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38839#true} is VALID [2022-04-15 13:07:28,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {38839#true} assume true; {38839#true} is VALID [2022-04-15 13:07:28,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38839#true} {38839#true} #94#return; {38839#true} is VALID [2022-04-15 13:07:28,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {38839#true} call #t~ret17 := main(); {38839#true} is VALID [2022-04-15 13:07:28,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {38839#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38839#true} is VALID [2022-04-15 13:07:28,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {38839#true} [174] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_78| 0) (< 0 (mod (+ v_main_~x~0_Out_78 1) 4294967296)) (<= v_main_~x~0_Out_78 v_main_~x~0_In_39) (= (+ v_main_~y~0_Out_78 v_main_~x~0_Out_78) (+ v_main_~x~0_In_39 v_main_~y~0_In_39)) (= |v_main_#t~post6_Out_78| 0)) (and (= v_main_~y~0_In_39 v_main_~y~0_Out_78) (= v_main_~x~0_In_39 v_main_~x~0_Out_78))) InVars {main_~x~0=v_main_~x~0_In_39, main_~y~0=v_main_~y~0_In_39} OutVars{main_~y~0=v_main_~y~0_Out_78, main_#t~post5=|v_main_#t~post5_Out_78|, main_~x~0=v_main_~x~0_Out_78, main_#t~post6=|v_main_#t~post6_Out_78|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {38839#true} is VALID [2022-04-15 13:07:28,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {38839#true} [173] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {38839#true} is VALID [2022-04-15 13:07:28,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {38839#true} ~z~0 := ~y~0; {38844#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 13:07:28,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {38844#(and (<= main_~y~0 main_~z~0) (<= 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; {38845#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 13:07:28,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {38845#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38846#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 13:07:28,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {38846#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) 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; {38847#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 13:07:28,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {38847#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38848#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 13:07:28,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {38848#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38849#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 13:07:28,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {38849#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 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; {38850#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 13:07:28,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {38850#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38851#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 13:07:28,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {38851#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 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; {38852#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:07:28,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {38852#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {38852#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:07:28,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {38852#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 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; {38853#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 13:07:28,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {38853#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38854#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 13:07:28,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {38854#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38855#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 13:07:28,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {38855#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38856#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 13:07:28,478 INFO L290 TraceCheckUtils]: 22: Hoare triple {38856#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38857#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 13:07:28,484 INFO L290 TraceCheckUtils]: 23: Hoare triple {38857#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38858#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 13:07:28,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {38858#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {38859#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 13:07:28,497 INFO L290 TraceCheckUtils]: 25: Hoare triple {38859#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {38859#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 13:07:28,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {38859#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {38858#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 13:07:28,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {38858#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {38858#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 13:07:28,507 INFO L290 TraceCheckUtils]: 28: Hoare triple {38858#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {38858#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 13:07:28,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {38858#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {38859#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 13:07:28,529 INFO L290 TraceCheckUtils]: 30: Hoare triple {38859#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {38840#false} is VALID [2022-04-15 13:07:28,529 INFO L272 TraceCheckUtils]: 31: Hoare triple {38840#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {38840#false} is VALID [2022-04-15 13:07:28,529 INFO L290 TraceCheckUtils]: 32: Hoare triple {38840#false} ~cond := #in~cond; {38840#false} is VALID [2022-04-15 13:07:28,529 INFO L290 TraceCheckUtils]: 33: Hoare triple {38840#false} assume 0 == ~cond; {38840#false} is VALID [2022-04-15 13:07:28,529 INFO L290 TraceCheckUtils]: 34: Hoare triple {38840#false} assume !false; {38840#false} is VALID [2022-04-15 13:07:28,530 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:07:28,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:07:30,787 INFO L290 TraceCheckUtils]: 34: Hoare triple {38840#false} assume !false; {38840#false} is VALID [2022-04-15 13:07:30,787 INFO L290 TraceCheckUtils]: 33: Hoare triple {38840#false} assume 0 == ~cond; {38840#false} is VALID [2022-04-15 13:07:30,787 INFO L290 TraceCheckUtils]: 32: Hoare triple {38840#false} ~cond := #in~cond; {38840#false} is VALID [2022-04-15 13:07:30,787 INFO L272 TraceCheckUtils]: 31: Hoare triple {38840#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {38840#false} is VALID [2022-04-15 13:07:30,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {38859#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {38840#false} is VALID [2022-04-15 13:07:30,806 INFO L290 TraceCheckUtils]: 29: Hoare triple {38858#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {38859#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 13:07:30,807 INFO L290 TraceCheckUtils]: 28: Hoare triple {38858#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {38858#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 13:07:30,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {38858#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {38858#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 13:07:30,818 INFO L290 TraceCheckUtils]: 26: Hoare triple {38859#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {38858#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 13:07:30,818 INFO L290 TraceCheckUtils]: 25: Hoare triple {38859#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {38859#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 13:07:30,827 INFO L290 TraceCheckUtils]: 24: Hoare triple {38858#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {38859#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 13:07:30,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {38857#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38858#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 13:07:30,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {38856#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38857#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 13:07:30,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {38855#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38856#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 13:07:30,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {38854#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38855#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 13:07:30,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {38853#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38854#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 13:07:30,871 INFO L290 TraceCheckUtils]: 18: Hoare triple {38852#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 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; {38853#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 13:07:30,871 INFO L290 TraceCheckUtils]: 17: Hoare triple {38852#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {38852#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:07:30,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {39020#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 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; {38852#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:07:30,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {39024#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 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; {39020#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 13:07:30,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {39028#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 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; {39024#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))))} is VALID [2022-04-15 13:07:30,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {39032#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39028#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 13:07:30,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {39036#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39032#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} is VALID [2022-04-15 13:07:30,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {39040#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39036#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-15 13:07:30,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {39044#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967290 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; {39040#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-15 13:07:30,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {39048#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39044#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-15 13:07:30,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {38839#true} ~z~0 := ~y~0; {39048#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-15 13:07:30,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {38839#true} [173] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {38839#true} is VALID [2022-04-15 13:07:30,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {38839#true} [174] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_78| 0) (< 0 (mod (+ v_main_~x~0_Out_78 1) 4294967296)) (<= v_main_~x~0_Out_78 v_main_~x~0_In_39) (= (+ v_main_~y~0_Out_78 v_main_~x~0_Out_78) (+ v_main_~x~0_In_39 v_main_~y~0_In_39)) (= |v_main_#t~post6_Out_78| 0)) (and (= v_main_~y~0_In_39 v_main_~y~0_Out_78) (= v_main_~x~0_In_39 v_main_~x~0_Out_78))) InVars {main_~x~0=v_main_~x~0_In_39, main_~y~0=v_main_~y~0_In_39} OutVars{main_~y~0=v_main_~y~0_Out_78, main_#t~post5=|v_main_#t~post5_Out_78|, main_~x~0=v_main_~x~0_Out_78, main_#t~post6=|v_main_#t~post6_Out_78|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {38839#true} is VALID [2022-04-15 13:07:30,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {38839#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38839#true} is VALID [2022-04-15 13:07:30,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {38839#true} call #t~ret17 := main(); {38839#true} is VALID [2022-04-15 13:07:30,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38839#true} {38839#true} #94#return; {38839#true} is VALID [2022-04-15 13:07:30,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {38839#true} assume true; {38839#true} is VALID [2022-04-15 13:07:30,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {38839#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38839#true} is VALID [2022-04-15 13:07:30,935 INFO L272 TraceCheckUtils]: 0: Hoare triple {38839#true} call ULTIMATE.init(); {38839#true} is VALID [2022-04-15 13:07:30,936 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:07:30,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17122743] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:07:30,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:07:30,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 27 [2022-04-15 13:07:34,057 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:07:34,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [960956758] [2022-04-15 13:07:34,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [960956758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:07:34,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:07:34,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 13:07:34,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941428131] [2022-04-15 13:07:34,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:07:34,058 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 22 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-15 13:07:34,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:07:34,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 22 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:34,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:34,340 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 13:07:34,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:34,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 13:07:34,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=849, Unknown=0, NotChecked=0, Total=930 [2022-04-15 13:07:34,341 INFO L87 Difference]: Start difference. First operand 158 states and 197 transitions. Second operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 22 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)