/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-de51.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:51:50,893 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:51:50,895 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:51:50,940 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:51:50,941 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:51:50,942 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:51:50,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:51:50,948 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:51:50,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:51:50,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:51:50,955 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:51:50,956 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:51:50,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:51:50,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:51:50,959 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:51:50,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:51:50,962 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:51:50,963 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:51:50,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:51:50,970 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:51:50,972 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:51:50,973 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:51:50,974 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:51:50,975 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:51:50,976 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:51:50,982 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:51:50,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:51:50,983 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:51:50,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:51:50,984 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:51:50,985 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:51:50,985 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:51:50,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:51:50,987 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:51:50,988 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:51:50,988 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:51:50,989 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:51:50,989 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:51:50,989 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:51:50,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:51:50,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:51:50,992 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:51:50,992 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:51:51,003 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:51:51,004 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:51:51,005 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:51:51,005 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:51:51,005 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:51:51,005 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:51:51,006 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:51:51,006 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:51:51,006 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:51:51,007 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:51:51,007 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:51:51,007 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:51:51,007 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:51:51,007 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:51:51,007 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:51:51,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:51:51,008 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:51:51,008 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:51:51,008 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:51:51,008 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:51:51,008 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:51:51,008 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:51:51,008 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:51:51,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:51:51,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:51:51,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:51:51,237 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:51:51,237 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:51:51,238 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de51.c [2022-04-15 12:51:51,295 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ea20c78a/af1dad01ebcc4c6b99e37ac9cd5b1ef1/FLAGee284817d [2022-04-15 12:51:51,729 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:51:51,730 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de51.c [2022-04-15 12:51:51,736 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ea20c78a/af1dad01ebcc4c6b99e37ac9cd5b1ef1/FLAGee284817d [2022-04-15 12:51:51,754 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ea20c78a/af1dad01ebcc4c6b99e37ac9cd5b1ef1 [2022-04-15 12:51:51,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:51:51,758 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:51:51,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:51:51,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:51:51,764 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:51:51,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:51:51" (1/1) ... [2022-04-15 12:51:51,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a0e6503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:51:51, skipping insertion in model container [2022-04-15 12:51:51,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:51:51" (1/1) ... [2022-04-15 12:51:51,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:51:51,788 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:51:51,918 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-de51.c[368,381] [2022-04-15 12:51:51,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:51:51,970 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:51:51,986 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-de51.c[368,381] [2022-04-15 12:51:51,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:51:52,014 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:51:52,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:51:52 WrapperNode [2022-04-15 12:51:52,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:51:52,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:51:52,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:51:52,017 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:51:52,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:51:52" (1/1) ... [2022-04-15 12:51:52,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:51:52" (1/1) ... [2022-04-15 12:51:52,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:51:52" (1/1) ... [2022-04-15 12:51:52,033 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:51:52" (1/1) ... [2022-04-15 12:51:52,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:51:52" (1/1) ... [2022-04-15 12:51:52,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:51:52" (1/1) ... [2022-04-15 12:51:52,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:51:52" (1/1) ... [2022-04-15 12:51:52,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:51:52,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:51:52,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:51:52,046 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:51:52,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:51:52" (1/1) ... [2022-04-15 12:51:52,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:51:52,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:51:52,076 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:51:52,078 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:51:52,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:51:52,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:51:52,107 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:51:52,107 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:51:52,107 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:51:52,107 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:51:52,107 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:51:52,108 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:51:52,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:51:52,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 12:51:52,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:51:52,108 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:51:52,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:51:52,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:51:52,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:51:52,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:51:52,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:51:52,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:51:52,164 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:51:52,166 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:51:52,436 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:51:52,442 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:51:52,442 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-15 12:51:52,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:51:52 BoogieIcfgContainer [2022-04-15 12:51:52,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:51:52,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:51:52,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:51:52,462 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:51:52,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:51:51" (1/3) ... [2022-04-15 12:51:52,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aaa653a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:51:52, skipping insertion in model container [2022-04-15 12:51:52,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:51:52" (2/3) ... [2022-04-15 12:51:52,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aaa653a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:51:52, skipping insertion in model container [2022-04-15 12:51:52,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:51:52" (3/3) ... [2022-04-15 12:51:52,465 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de51.c [2022-04-15 12:51:52,469 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:51:52,469 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:51:52,533 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:51:52,539 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:51:52,540 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:51:52,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:51:52,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 12:51:52,567 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:51:52,568 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:51:52,569 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:51:52,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:51:52,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1060076674, now seen corresponding path program 1 times [2022-04-15 12:51:52,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:52,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [226063026] [2022-04-15 12:51:52,592 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:51:52,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1060076674, now seen corresponding path program 2 times [2022-04-15 12:51:52,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:51:52,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398592006] [2022-04-15 12:51:52,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:51:52,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:51:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:52,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:51:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:52,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-15 12:51:52,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 12:51:52,824 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #83#return; {27#true} is VALID [2022-04-15 12:51:52,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:51:52,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-15 12:51:52,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 12:51:52,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #83#return; {27#true} is VALID [2022-04-15 12:51:52,827 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret15 := main(); {27#true} is VALID [2022-04-15 12:51:52,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27#true} is VALID [2022-04-15 12:51:52,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !(~x~0 % 4294967296 > 0); {27#true} is VALID [2022-04-15 12:51:52,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} ~z~0 := ~y~0; {27#true} is VALID [2022-04-15 12:51:52,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#true} assume !(~z~0 % 4294967296 > 0); {27#true} is VALID [2022-04-15 12:51:52,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#true} assume !(~y~0 % 4294967296 > 0); {27#true} is VALID [2022-04-15 12:51:52,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-15 12:51:52,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !(~z~0 % 4294967296 > 0); {28#false} is VALID [2022-04-15 12:51:52,830 INFO L272 TraceCheckUtils]: 12: Hoare triple {28#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28#false} is VALID [2022-04-15 12:51:52,831 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-15 12:51:52,831 INFO L290 TraceCheckUtils]: 14: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-15 12:51:52,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-15 12:51:52,832 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:51:52,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:51:52,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398592006] [2022-04-15 12:51:52,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398592006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:51:52,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:51:52,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:51:52,837 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:51:52,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [226063026] [2022-04-15 12:51:52,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [226063026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:51:52,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:51:52,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:51:52,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90369947] [2022-04-15 12:51:52,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:51:52,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:51:52,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:51:52,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:52,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:52,887 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:51:52,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:52,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:51:52,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:51:52,913 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:52,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:52,982 INFO L93 Difference]: Finished difference Result 41 states and 60 transitions. [2022-04-15 12:51:52,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:51:52,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:51:52,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:51:52,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:52,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-15 12:51:52,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:52,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-15 12:51:52,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-04-15 12:51:53,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:53,061 INFO L225 Difference]: With dead ends: 41 [2022-04-15 12:51:53,061 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 12:51:53,063 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:51:53,066 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:51:53,067 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:51:53,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 12:51:53,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 12:51:53,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:51:53,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:53,093 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:53,093 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:53,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:53,095 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-04-15 12:51:53,095 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-15 12:51:53,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:53,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:53,096 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 12:51:53,096 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 12:51:53,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:53,098 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-04-15 12:51:53,098 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-15 12:51:53,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:53,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:53,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:51:53,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:51:53,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:53,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-04-15 12:51:53,101 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 16 [2022-04-15 12:51:53,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:51:53,102 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-04-15 12:51:53,102 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:53,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 21 transitions. [2022-04-15 12:51:53,125 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:51:53,125 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-15 12:51:53,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 12:51:53,126 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:51:53,126 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:51:53,126 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:51:53,127 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:51:53,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:51:53,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1174593278, now seen corresponding path program 1 times [2022-04-15 12:51:53,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:53,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [490708075] [2022-04-15 12:51:53,128 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:51:53,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1174593278, now seen corresponding path program 2 times [2022-04-15 12:51:53,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:51:53,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786110854] [2022-04-15 12:51:53,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:51:53,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:51:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:53,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:51:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:53,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {185#true} is VALID [2022-04-15 12:51:53,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {185#true} assume true; {185#true} is VALID [2022-04-15 12:51:53,313 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {185#true} {185#true} #83#return; {185#true} is VALID [2022-04-15 12:51:53,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {185#true} call ULTIMATE.init(); {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:51:53,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {185#true} is VALID [2022-04-15 12:51:53,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {185#true} assume true; {185#true} is VALID [2022-04-15 12:51:53,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185#true} {185#true} #83#return; {185#true} is VALID [2022-04-15 12:51:53,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {185#true} call #t~ret15 := main(); {185#true} is VALID [2022-04-15 12:51:53,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {185#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-15 12:51:53,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-15 12:51:53,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} ~z~0 := ~y~0; {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-15 12:51:53,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-15 12:51:53,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~y~0 % 4294967296 > 0); {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-15 12:51:53,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-15 12:51:53,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-15 12:51:53,321 INFO L272 TraceCheckUtils]: 12: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {191#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:51:53,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {191#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {192#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:51:53,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {192#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {186#false} is VALID [2022-04-15 12:51:53,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {186#false} assume !false; {186#false} is VALID [2022-04-15 12:51:53,323 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:51:53,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:51:53,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786110854] [2022-04-15 12:51:53,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786110854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:51:53,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:51:53,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:51:53,328 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:51:53,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [490708075] [2022-04-15 12:51:53,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [490708075] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:51:53,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:51:53,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:51:53,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655271642] [2022-04-15 12:51:53,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:51:53,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:51:53,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:51:53,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:53,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:53,347 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:51:53,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:53,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:51:53,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:51:53,348 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:53,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:53,612 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-15 12:51:53,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:51:53,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:51:53,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:51:53,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:53,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-15 12:51:53,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:53,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-15 12:51:53,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-04-15 12:51:53,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:53,659 INFO L225 Difference]: With dead ends: 28 [2022-04-15 12:51:53,659 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 12:51:53,660 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:51:53,663 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:51:53,663 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 31 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:51:53,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 12:51:53,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 12:51:53,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:51:53,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:53,678 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:53,679 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:53,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:53,681 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-04-15 12:51:53,681 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-15 12:51:53,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:53,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:53,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:51:53,683 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:51:53,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:53,685 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-04-15 12:51:53,685 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-15 12:51:53,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:53,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:53,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:51:53,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:51:53,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:53,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-04-15 12:51:53,689 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 16 [2022-04-15 12:51:53,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:51:53,689 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-04-15 12:51:53,691 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:53,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 31 transitions. [2022-04-15 12:51:53,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:53,729 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-15 12:51:53,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:51:53,730 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:51:53,730 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:51:53,730 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:51:53,730 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:51:53,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:51:53,731 INFO L85 PathProgramCache]: Analyzing trace with hash -2018158143, now seen corresponding path program 1 times [2022-04-15 12:51:53,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:53,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1576714942] [2022-04-15 12:51:53,732 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:51:53,732 INFO L85 PathProgramCache]: Analyzing trace with hash -2018158143, now seen corresponding path program 2 times [2022-04-15 12:51:53,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:51:53,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509817711] [2022-04-15 12:51:53,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:51:53,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:51:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:53,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:51:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:53,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {356#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {350#true} is VALID [2022-04-15 12:51:53,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {350#true} assume true; {350#true} is VALID [2022-04-15 12:51:53,795 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {350#true} {350#true} #83#return; {350#true} is VALID [2022-04-15 12:51:53,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {350#true} call ULTIMATE.init(); {356#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:51:53,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {356#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {350#true} is VALID [2022-04-15 12:51:53,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {350#true} assume true; {350#true} is VALID [2022-04-15 12:51:53,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {350#true} {350#true} #83#return; {350#true} is VALID [2022-04-15 12:51:53,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {350#true} call #t~ret15 := main(); {350#true} is VALID [2022-04-15 12:51:53,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {350#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {350#true} is VALID [2022-04-15 12:51:53,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {350#true} assume !(~x~0 % 4294967296 > 0); {350#true} is VALID [2022-04-15 12:51:53,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {350#true} ~z~0 := ~y~0; {350#true} is VALID [2022-04-15 12:51:53,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {350#true} assume !(~z~0 % 4294967296 > 0); {355#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:51:53,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {355#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {355#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:51:53,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {355#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {355#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:51:53,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {355#(<= 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; {351#false} is VALID [2022-04-15 12:51:53,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {351#false} assume !(~z~0 % 4294967296 > 0); {351#false} is VALID [2022-04-15 12:51:53,809 INFO L272 TraceCheckUtils]: 13: Hoare triple {351#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {351#false} is VALID [2022-04-15 12:51:53,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {351#false} ~cond := #in~cond; {351#false} is VALID [2022-04-15 12:51:53,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {351#false} assume 0 == ~cond; {351#false} is VALID [2022-04-15 12:51:53,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {351#false} assume !false; {351#false} is VALID [2022-04-15 12:51:53,810 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:51:53,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:51:53,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509817711] [2022-04-15 12:51:53,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509817711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:51:53,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:51:53,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:51:53,811 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:51:53,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1576714942] [2022-04-15 12:51:53,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1576714942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:51:53,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:51:53,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:51:53,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346911157] [2022-04-15 12:51:53,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:51:53,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:51:53,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:51:53,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:53,828 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:51:53,828 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:51:53,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:53,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:51:53,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:51:53,830 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:53,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:53,915 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-04-15 12:51:53,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:51:53,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:51:53,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:51:53,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:53,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-15 12:51:53,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:53,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-15 12:51:53,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2022-04-15 12:51:53,950 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:51:53,951 INFO L225 Difference]: With dead ends: 35 [2022-04-15 12:51:53,951 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 12:51:53,951 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:51:53,952 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:51:53,953 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 26 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:51:53,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 12:51:53,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-15 12:51:53,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:51:53,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:53,963 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:53,964 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:53,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:53,966 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-15 12:51:53,966 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-15 12:51:53,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:53,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:53,966 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 12:51:53,967 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 12:51:53,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:53,968 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-15 12:51:53,969 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-15 12:51:53,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:53,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:53,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:51:53,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:51:53,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:53,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-15 12:51:53,971 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 17 [2022-04-15 12:51:53,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:51:53,972 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-15 12:51:53,974 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:53,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 39 transitions. [2022-04-15 12:51:54,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:54,014 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-15 12:51:54,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:51:54,017 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:51:54,017 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:51:54,017 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:51:54,019 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:51:54,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:51:54,020 INFO L85 PathProgramCache]: Analyzing trace with hash -615329744, now seen corresponding path program 1 times [2022-04-15 12:51:54,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:54,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2086774652] [2022-04-15 12:51:54,023 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:51:54,024 INFO L85 PathProgramCache]: Analyzing trace with hash -615329744, now seen corresponding path program 2 times [2022-04-15 12:51:54,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:51:54,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425383884] [2022-04-15 12:51:54,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:51:54,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:51:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:54,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:51:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:54,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {543#true} is VALID [2022-04-15 12:51:54,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {543#true} assume true; {543#true} is VALID [2022-04-15 12:51:54,087 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {543#true} {543#true} #83#return; {543#true} is VALID [2022-04-15 12:51:54,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {543#true} call ULTIMATE.init(); {549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:51:54,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {543#true} is VALID [2022-04-15 12:51:54,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {543#true} assume true; {543#true} is VALID [2022-04-15 12:51:54,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {543#true} {543#true} #83#return; {543#true} is VALID [2022-04-15 12:51:54,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {543#true} call #t~ret15 := main(); {543#true} is VALID [2022-04-15 12:51:54,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {543#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {543#true} is VALID [2022-04-15 12:51:54,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {543#true} assume !(~x~0 % 4294967296 > 0); {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:54,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:54,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:54,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:54,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {548#(<= 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; {544#false} is VALID [2022-04-15 12:51:54,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {544#false} assume !(~x~0 % 4294967296 > 0); {544#false} is VALID [2022-04-15 12:51:54,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {544#false} assume !(~z~0 % 4294967296 > 0); {544#false} is VALID [2022-04-15 12:51:54,096 INFO L272 TraceCheckUtils]: 13: Hoare triple {544#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {544#false} is VALID [2022-04-15 12:51:54,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {544#false} ~cond := #in~cond; {544#false} is VALID [2022-04-15 12:51:54,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {544#false} assume 0 == ~cond; {544#false} is VALID [2022-04-15 12:51:54,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {544#false} assume !false; {544#false} is VALID [2022-04-15 12:51:54,097 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:51:54,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:51:54,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425383884] [2022-04-15 12:51:54,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425383884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:51:54,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:51:54,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:51:54,098 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:51:54,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2086774652] [2022-04-15 12:51:54,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2086774652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:51:54,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:51:54,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:51:54,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963754219] [2022-04-15 12:51:54,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:51:54,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:51:54,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:51:54,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:54,116 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:51:54,116 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:51:54,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:54,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:51:54,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:51:54,117 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:54,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:54,228 INFO L93 Difference]: Finished difference Result 44 states and 63 transitions. [2022-04-15 12:51:54,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:51:54,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:51:54,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:51:54,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-15 12:51:54,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:54,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-15 12:51:54,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-15 12:51:54,274 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 12:51:54,275 INFO L225 Difference]: With dead ends: 44 [2022-04-15 12:51:54,275 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 12:51:54,276 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:51:54,276 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:51:54,277 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 25 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:51:54,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 12:51:54,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-15 12:51:54,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:51:54,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:54,298 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:54,299 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:54,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:54,304 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2022-04-15 12:51:54,304 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2022-04-15 12:51:54,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:54,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:54,305 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states 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:51:54,305 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states 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:51:54,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:54,306 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2022-04-15 12:51:54,306 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2022-04-15 12:51:54,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:54,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:54,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:51:54,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:51:54,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:54,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2022-04-15 12:51:54,309 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 17 [2022-04-15 12:51:54,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:51:54,309 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2022-04-15 12:51:54,309 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:54,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 44 transitions. [2022-04-15 12:51:54,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:54,357 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2022-04-15 12:51:54,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:51:54,358 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:51:54,358 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:51:54,359 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 12:51:54,359 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:51:54,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:51:54,359 INFO L85 PathProgramCache]: Analyzing trace with hash -578961840, now seen corresponding path program 1 times [2022-04-15 12:51:54,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:54,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1236002863] [2022-04-15 12:51:54,554 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:51:54,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1386235727, now seen corresponding path program 1 times [2022-04-15 12:51:54,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:51:54,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819960513] [2022-04-15 12:51:54,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:51:54,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:51:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:55,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:51:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:55,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {787#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {774#true} is VALID [2022-04-15 12:51:55,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-15 12:51:55,143 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {774#true} {774#true} #83#return; {774#true} is VALID [2022-04-15 12:51:55,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {787#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:51:55,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {787#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {774#true} is VALID [2022-04-15 12:51:55,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-15 12:51:55,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {774#true} {774#true} #83#return; {774#true} is VALID [2022-04-15 12:51:55,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {774#true} call #t~ret15 := main(); {774#true} is VALID [2022-04-15 12:51:55,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {774#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {779#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 12:51:55,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {779#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {779#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 12:51:55,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {779#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} ~z~0 := ~y~0; {780#(and (= main_~z~0 0) (= main_~n~0 main_~x~0))} is VALID [2022-04-15 12:51:55,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {780#(and (= main_~z~0 0) (= main_~n~0 main_~x~0))} [87] L23-2-->L29-1_primed: Formula: (or (and (= v_main_~z~0_In_1 v_main_~z~0_Out_2) (= v_main_~x~0_In_1 v_main_~x~0_Out_2)) (and (<= v_main_~x~0_In_1 v_main_~x~0_Out_2) (= |v_main_#t~post8_Out_2| 0) (= (+ v_main_~x~0_Out_2 v_main_~z~0_Out_2) (+ v_main_~z~0_In_1 v_main_~x~0_In_1)) (< 0 (mod (+ v_main_~z~0_Out_2 1) 4294967296)) (= |v_main_#t~post7_Out_2| 0))) InVars {main_~x~0=v_main_~x~0_In_1, main_~z~0=v_main_~z~0_In_1} OutVars{main_~x~0=v_main_~x~0_Out_2, main_#t~post8=|v_main_#t~post8_Out_2|, main_~z~0=v_main_~z~0_Out_2, main_#t~post7=|v_main_#t~post7_Out_2|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {781#(or (and (or (<= main_~n~0 (+ main_~z~0 main_~x~0)) (not (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))))) (<= (+ main_~x~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) main_~n~0)) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:51:55,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {781#(or (and (or (<= main_~n~0 (+ main_~z~0 main_~x~0)) (not (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))))) (<= (+ main_~x~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) main_~n~0)) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296))))} [86] L29-1_primed-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_5 4294967296))) InVars {main_~z~0=v_main_~z~0_5} OutVars{main_~z~0=v_main_~z~0_5} AuxVars[] AssignedVars[] {782#(or (and (<= (+ main_~x~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:51:55,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {782#(or (and (<= (+ main_~x~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {782#(or (and (<= (+ main_~x~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:51:55,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {782#(or (and (<= (+ main_~x~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {783#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:51:55,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {783#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {784#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:51:55,158 INFO L272 TraceCheckUtils]: 13: Hoare triple {784#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {785#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:51:55,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {785#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {786#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:51:55,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {786#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {775#false} is VALID [2022-04-15 12:51:55,159 INFO L290 TraceCheckUtils]: 16: Hoare triple {775#false} assume !false; {775#false} is VALID [2022-04-15 12:51:55,159 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:51:55,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:51:55,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819960513] [2022-04-15 12:51:55,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819960513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:51:55,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:51:55,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:51:55,287 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:51:55,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1236002863] [2022-04-15 12:51:55,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1236002863] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:51:55,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:51:55,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:51:55,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883361472] [2022-04-15 12:51:55,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:51:55,288 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 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:51:55,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:51:55,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 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:51:55,317 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:51:55,317 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:51:55,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:55,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:51:55,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:51:55,318 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 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:51:55,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:55,650 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2022-04-15 12:51:55,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:51:55,650 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 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:51:55,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:51:55,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 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:51:55,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-15 12:51:55,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 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:51:55,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-15 12:51:55,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2022-04-15 12:51:55,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:55,689 INFO L225 Difference]: With dead ends: 44 [2022-04-15 12:51:55,689 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 12:51:55,689 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:51:55,690 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:51:55,690 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 49 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:51:55,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 12:51:55,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 12:51:55,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:51:55,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:55,704 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:55,705 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:55,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:55,706 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2022-04-15 12:51:55,706 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-04-15 12:51:55,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:55,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:55,706 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 12:51:55,707 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 12:51:55,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:55,708 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2022-04-15 12:51:55,708 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-04-15 12:51:55,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:55,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:55,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:51:55,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:51:55,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:55,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2022-04-15 12:51:55,709 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 17 [2022-04-15 12:51:55,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:51:55,710 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-04-15 12:51:55,710 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 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:51:55,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 35 transitions. [2022-04-15 12:51:55,747 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 12:51:55,747 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-04-15 12:51:55,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:51:55,748 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:51:55,748 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:51:55,748 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 12:51:55,748 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:51:55,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:51:55,749 INFO L85 PathProgramCache]: Analyzing trace with hash 388404751, now seen corresponding path program 1 times [2022-04-15 12:51:55,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:55,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [531901734] [2022-04-15 12:52:03,363 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:52:03,365 INFO L85 PathProgramCache]: Analyzing trace with hash -679545490, now seen corresponding path program 1 times [2022-04-15 12:52:03,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:03,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299214820] [2022-04-15 12:52:03,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:03,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:03,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:52:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:03,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {999#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {988#true} is VALID [2022-04-15 12:52:03,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {988#true} assume true; {988#true} is VALID [2022-04-15 12:52:03,611 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {988#true} {988#true} #83#return; {988#true} is VALID [2022-04-15 12:52:03,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {988#true} call ULTIMATE.init(); {999#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:52:03,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {999#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {988#true} is VALID [2022-04-15 12:52:03,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {988#true} assume true; {988#true} is VALID [2022-04-15 12:52:03,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {988#true} {988#true} #83#return; {988#true} is VALID [2022-04-15 12:52:03,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {988#true} call #t~ret15 := main(); {988#true} is VALID [2022-04-15 12:52:03,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {988#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {993#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 12:52:03,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {993#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} [89] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_2 v_main_~x~0_Out_4) (= v_main_~y~0_In_1 v_main_~y~0_Out_2)) (and (= 0 |v_main_#t~post6_Out_2|) (<= v_main_~x~0_Out_4 v_main_~x~0_In_2) (< 0 (mod (+ v_main_~x~0_Out_4 1) 4294967296)) (= |v_main_#t~post5_Out_2| 0) (= (+ v_main_~x~0_Out_4 v_main_~y~0_Out_2) (+ v_main_~x~0_In_2 v_main_~y~0_In_1)))) InVars {main_~x~0=v_main_~x~0_In_2, 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_4, main_#t~post6=|v_main_#t~post6_Out_2|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {994#(or (= main_~n~0 main_~x~0) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (or (<= main_~n~0 (+ main_~y~0 main_~x~0)) (not (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))))))) (not (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-15 12:52:03,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {994#(or (= main_~n~0 main_~x~0) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (or (<= main_~n~0 (+ main_~y~0 main_~x~0)) (not (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))))))) (not (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))))))} [88] 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[] {995#(and (or (= main_~n~0 main_~x~0) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (or (<= main_~n~0 (+ main_~y~0 main_~x~0)) (not (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))))))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-15 12:52:03,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {995#(and (or (= main_~n~0 main_~x~0) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (or (<= main_~n~0 (+ main_~y~0 main_~x~0)) (not (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))))))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))))} ~z~0 := ~y~0; {995#(and (or (= main_~n~0 main_~x~0) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (or (<= main_~n~0 (+ main_~y~0 main_~x~0)) (not (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))))))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-15 12:52:03,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {995#(and (or (= main_~n~0 main_~x~0) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (or (<= main_~n~0 (+ main_~y~0 main_~x~0)) (not (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))))))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))))} assume !(~z~0 % 4294967296 > 0); {995#(and (or (= main_~n~0 main_~x~0) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (or (<= main_~n~0 (+ main_~y~0 main_~x~0)) (not (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))))))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-15 12:52:03,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {995#(and (or (= main_~n~0 main_~x~0) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (or (<= main_~n~0 (+ main_~y~0 main_~x~0)) (not (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))))))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))))} assume !(~y~0 % 4294967296 > 0); {996#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:52:03,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {996#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~x~0 % 4294967296 > 0); {996#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:52:03,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {996#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {996#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:52:03,623 INFO L272 TraceCheckUtils]: 13: Hoare triple {996#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {997#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:52:03,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {997#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {998#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:52:03,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {998#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {989#false} is VALID [2022-04-15 12:52:03,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {989#false} assume !false; {989#false} is VALID [2022-04-15 12:52:03,624 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:52:03,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:52:03,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299214820] [2022-04-15 12:52:03,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299214820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:03,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:03,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:52:03,723 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:52:03,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [531901734] [2022-04-15 12:52:03,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [531901734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:03,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:03,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:52:03,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699298203] [2022-04-15 12:52:03,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:52:03,724 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:52:03,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:52:03,724 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:52:03,748 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:52:03,748 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:52:03,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:03,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:52:03,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:52:03,749 INFO L87 Difference]: Start difference. First operand 26 states and 35 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:52:04,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:04,499 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-15 12:52:04,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:52:04,499 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:52:04,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:52:04,499 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:52:04,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-15 12:52:04,501 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:52:04,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-15 12:52:04,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2022-04-15 12:52:04,611 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 12:52:04,611 INFO L225 Difference]: With dead ends: 32 [2022-04-15 12:52:04,612 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 12:52:04,612 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:52:04,613 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:52:04,613 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 45 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:52:04,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 12:52:04,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 12:52:04,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:52:04,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:04,649 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:04,649 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:04,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:04,651 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-04-15 12:52:04,651 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-04-15 12:52:04,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:04,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:04,652 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 12:52:04,653 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 12:52:04,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:04,657 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-04-15 12:52:04,657 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-04-15 12:52:04,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:04,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:04,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:52:04,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:52:04,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:04,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-04-15 12:52:04,661 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 17 [2022-04-15 12:52:04,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:52:04,661 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-04-15 12:52:04,661 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:52:04,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 33 transitions. [2022-04-15 12:52:04,711 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:52:04,711 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-04-15 12:52:04,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:52:04,712 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:52:04,712 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:52:04,712 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 12:52:04,712 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:52:04,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:52:04,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1130976308, now seen corresponding path program 1 times [2022-04-15 12:52:04,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:04,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1423285448] [2022-04-15 12:52:04,901 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:52:04,902 INFO L85 PathProgramCache]: Analyzing trace with hash -951480075, now seen corresponding path program 1 times [2022-04-15 12:52:04,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:04,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974654835] [2022-04-15 12:52:04,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:04,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:05,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:52:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:05,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {1185#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1178#true} is VALID [2022-04-15 12:52:05,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-15 12:52:05,022 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1178#true} {1178#true} #83#return; {1178#true} is VALID [2022-04-15 12:52:05,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {1178#true} call ULTIMATE.init(); {1185#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:52:05,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {1185#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1178#true} is VALID [2022-04-15 12:52:05,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-15 12:52:05,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1178#true} {1178#true} #83#return; {1178#true} is VALID [2022-04-15 12:52:05,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {1178#true} call #t~ret15 := main(); {1178#true} is VALID [2022-04-15 12:52:05,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {1178#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1178#true} is VALID [2022-04-15 12:52:05,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {1178#true} [91] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~x~0_Out_6 v_main_~y~0_Out_4) (+ v_main_~x~0_In_3 v_main_~y~0_In_2)) (= |v_main_#t~post5_Out_4| 0) (<= v_main_~x~0_Out_6 v_main_~x~0_In_3) (= 0 |v_main_#t~post6_Out_4|) (< 0 (mod (+ v_main_~x~0_Out_6 1) 4294967296))) (and (= v_main_~x~0_In_3 v_main_~x~0_Out_6) (= v_main_~y~0_In_2 v_main_~y~0_Out_4))) InVars {main_~x~0=v_main_~x~0_In_3, 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_6, main_#t~post6=|v_main_#t~post6_Out_4|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1178#true} is VALID [2022-04-15 12:52:05,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {1178#true} [90] 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[] {1178#true} is VALID [2022-04-15 12:52:05,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {1178#true} ~z~0 := ~y~0; {1183#(and (<= main_~y~0 main_~z~0) (<= (div main_~z~0 4294967296) (div main_~y~0 4294967296)))} is VALID [2022-04-15 12:52:05,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {1183#(and (<= main_~y~0 main_~z~0) (<= (div main_~z~0 4294967296) (div main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1184#(and (<= main_~y~0 (* (div main_~z~0 4294967296) 4294967296)) (<= (div main_~z~0 4294967296) (div main_~y~0 4294967296)))} is VALID [2022-04-15 12:52:05,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {1184#(and (<= main_~y~0 (* (div main_~z~0 4294967296) 4294967296)) (<= (div main_~z~0 4294967296) (div 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; {1179#false} is VALID [2022-04-15 12:52:05,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {1179#false} assume !(~y~0 % 4294967296 > 0); {1179#false} is VALID [2022-04-15 12:52:05,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {1179#false} assume !(~x~0 % 4294967296 > 0); {1179#false} is VALID [2022-04-15 12:52:05,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {1179#false} assume !(~z~0 % 4294967296 > 0); {1179#false} is VALID [2022-04-15 12:52:05,026 INFO L272 TraceCheckUtils]: 14: Hoare triple {1179#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1179#false} is VALID [2022-04-15 12:52:05,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {1179#false} ~cond := #in~cond; {1179#false} is VALID [2022-04-15 12:52:05,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {1179#false} assume 0 == ~cond; {1179#false} is VALID [2022-04-15 12:52:05,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {1179#false} assume !false; {1179#false} is VALID [2022-04-15 12:52:05,027 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:52:05,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:52:05,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974654835] [2022-04-15 12:52:05,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974654835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:05,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:05,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:52:05,056 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:52:05,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1423285448] [2022-04-15 12:52:05,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1423285448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:05,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:05,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:52:05,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914814424] [2022-04-15 12:52:05,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:52:05,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 12:52:05,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:52:05,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:05,072 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:52:05,072 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:52:05,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:05,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:52:05,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:52:05,073 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:05,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:05,263 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-15 12:52:05,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:52:05,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 12:52:05,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:52:05,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:05,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-15 12:52:05,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:05,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-15 12:52:05,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-15 12:52:05,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:05,308 INFO L225 Difference]: With dead ends: 35 [2022-04-15 12:52:05,308 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 12:52:05,308 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:52:05,309 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:52:05,309 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 29 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:52:05,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 12:52:05,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2022-04-15 12:52:05,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:52:05,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:05,339 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:05,339 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:05,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:05,340 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2022-04-15 12:52:05,340 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-04-15 12:52:05,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:05,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:05,340 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 12:52:05,341 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 12:52:05,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:05,343 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2022-04-15 12:52:05,343 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-04-15 12:52:05,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:05,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:05,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:52:05,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:52:05,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:05,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-04-15 12:52:05,346 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 18 [2022-04-15 12:52:05,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:52:05,347 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-04-15 12:52:05,347 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:05,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 28 transitions. [2022-04-15 12:52:05,392 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:52:05,392 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-15 12:52:05,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:52:05,393 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:52:05,393 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:52:05,393 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 12:52:05,393 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:52:05,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:52:05,394 INFO L85 PathProgramCache]: Analyzing trace with hash 629336803, now seen corresponding path program 1 times [2022-04-15 12:52:05,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:05,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [786816840] [2022-04-15 12:52:05,565 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:52:05,566 INFO L85 PathProgramCache]: Analyzing trace with hash -493889564, now seen corresponding path program 1 times [2022-04-15 12:52:05,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:05,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201831602] [2022-04-15 12:52:05,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:05,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:05,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:52:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:05,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {1370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1362#true} is VALID [2022-04-15 12:52:05,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {1362#true} assume true; {1362#true} is VALID [2022-04-15 12:52:05,661 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1362#true} {1362#true} #83#return; {1362#true} is VALID [2022-04-15 12:52:05,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {1362#true} call ULTIMATE.init(); {1370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:52:05,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {1370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1362#true} is VALID [2022-04-15 12:52:05,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {1362#true} assume true; {1362#true} is VALID [2022-04-15 12:52:05,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1362#true} {1362#true} #83#return; {1362#true} is VALID [2022-04-15 12:52:05,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {1362#true} call #t~ret15 := main(); {1362#true} is VALID [2022-04-15 12:52:05,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {1362#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1362#true} is VALID [2022-04-15 12:52:05,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {1362#true} [93] 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_4 v_main_~x~0_Out_8)) (and (<= v_main_~x~0_Out_8 v_main_~x~0_In_4) (= (+ v_main_~x~0_In_4 v_main_~y~0_In_3) (+ v_main_~x~0_Out_8 v_main_~y~0_Out_6)) (= |v_main_#t~post5_Out_6| 0) (< 0 (mod (+ v_main_~x~0_Out_8 1) 4294967296)) (= 0 |v_main_#t~post6_Out_6|))) InVars {main_~x~0=v_main_~x~0_In_4, 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_8, main_#t~post6=|v_main_#t~post6_Out_6|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1362#true} is VALID [2022-04-15 12:52:05,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {1362#true} [92] 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[] {1362#true} is VALID [2022-04-15 12:52:05,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {1362#true} ~z~0 := ~y~0; {1367#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:52:05,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {1367#(= (+ 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; {1368#(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:52:05,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {1368#(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); {1369#(and (not (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-15 12:52:05,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {1369#(and (not (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~y~0))} assume !(~y~0 % 4294967296 > 0); {1363#false} is VALID [2022-04-15 12:52:05,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {1363#false} assume !(~x~0 % 4294967296 > 0); {1363#false} is VALID [2022-04-15 12:52:05,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {1363#false} assume !(~z~0 % 4294967296 > 0); {1363#false} is VALID [2022-04-15 12:52:05,666 INFO L272 TraceCheckUtils]: 14: Hoare triple {1363#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1363#false} is VALID [2022-04-15 12:52:05,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {1363#false} ~cond := #in~cond; {1363#false} is VALID [2022-04-15 12:52:05,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {1363#false} assume 0 == ~cond; {1363#false} is VALID [2022-04-15 12:52:05,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {1363#false} assume !false; {1363#false} is VALID [2022-04-15 12:52:05,666 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:52:05,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:52:05,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201831602] [2022-04-15 12:52:05,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201831602] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:52:05,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997947661] [2022-04-15 12:52:05,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:05,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:05,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:52:05,671 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:52:05,692 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:52:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:05,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 12:52:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:05,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:52:05,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {1362#true} call ULTIMATE.init(); {1362#true} is VALID [2022-04-15 12:52:05,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {1362#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1362#true} is VALID [2022-04-15 12:52:05,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {1362#true} assume true; {1362#true} is VALID [2022-04-15 12:52:05,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1362#true} {1362#true} #83#return; {1362#true} is VALID [2022-04-15 12:52:05,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {1362#true} call #t~ret15 := main(); {1362#true} is VALID [2022-04-15 12:52:05,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {1362#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1362#true} is VALID [2022-04-15 12:52:05,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {1362#true} [93] 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_4 v_main_~x~0_Out_8)) (and (<= v_main_~x~0_Out_8 v_main_~x~0_In_4) (= (+ v_main_~x~0_In_4 v_main_~y~0_In_3) (+ v_main_~x~0_Out_8 v_main_~y~0_Out_6)) (= |v_main_#t~post5_Out_6| 0) (< 0 (mod (+ v_main_~x~0_Out_8 1) 4294967296)) (= 0 |v_main_#t~post6_Out_6|))) InVars {main_~x~0=v_main_~x~0_In_4, 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_8, main_#t~post6=|v_main_#t~post6_Out_6|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1362#true} is VALID [2022-04-15 12:52:05,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {1362#true} [92] 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[] {1362#true} is VALID [2022-04-15 12:52:05,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {1362#true} ~z~0 := ~y~0; {1367#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:52:05,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {1367#(= (+ 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; {1401#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:52:05,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {1401#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1401#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:52:05,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {1401#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1363#false} is VALID [2022-04-15 12:52:05,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {1363#false} assume !(~x~0 % 4294967296 > 0); {1363#false} is VALID [2022-04-15 12:52:05,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {1363#false} assume !(~z~0 % 4294967296 > 0); {1363#false} is VALID [2022-04-15 12:52:05,801 INFO L272 TraceCheckUtils]: 14: Hoare triple {1363#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1363#false} is VALID [2022-04-15 12:52:05,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {1363#false} ~cond := #in~cond; {1363#false} is VALID [2022-04-15 12:52:05,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {1363#false} assume 0 == ~cond; {1363#false} is VALID [2022-04-15 12:52:05,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {1363#false} assume !false; {1363#false} is VALID [2022-04-15 12:52:05,822 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:52:05,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:52:05,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {1363#false} assume !false; {1363#false} is VALID [2022-04-15 12:52:05,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {1363#false} assume 0 == ~cond; {1363#false} is VALID [2022-04-15 12:52:05,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {1363#false} ~cond := #in~cond; {1363#false} is VALID [2022-04-15 12:52:05,892 INFO L272 TraceCheckUtils]: 14: Hoare triple {1363#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1363#false} is VALID [2022-04-15 12:52:05,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {1363#false} assume !(~z~0 % 4294967296 > 0); {1363#false} is VALID [2022-04-15 12:52:05,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {1363#false} assume !(~x~0 % 4294967296 > 0); {1363#false} is VALID [2022-04-15 12:52:05,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {1401#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1363#false} is VALID [2022-04-15 12:52:05,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {1401#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1401#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:52:05,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {1450#(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; {1401#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:52:05,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {1362#true} ~z~0 := ~y~0; {1450#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:52:05,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {1362#true} [92] 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[] {1362#true} is VALID [2022-04-15 12:52:05,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {1362#true} [93] 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_4 v_main_~x~0_Out_8)) (and (<= v_main_~x~0_Out_8 v_main_~x~0_In_4) (= (+ v_main_~x~0_In_4 v_main_~y~0_In_3) (+ v_main_~x~0_Out_8 v_main_~y~0_Out_6)) (= |v_main_#t~post5_Out_6| 0) (< 0 (mod (+ v_main_~x~0_Out_8 1) 4294967296)) (= 0 |v_main_#t~post6_Out_6|))) InVars {main_~x~0=v_main_~x~0_In_4, 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_8, main_#t~post6=|v_main_#t~post6_Out_6|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1362#true} is VALID [2022-04-15 12:52:05,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {1362#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1362#true} is VALID [2022-04-15 12:52:05,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {1362#true} call #t~ret15 := main(); {1362#true} is VALID [2022-04-15 12:52:05,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1362#true} {1362#true} #83#return; {1362#true} is VALID [2022-04-15 12:52:05,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {1362#true} assume true; {1362#true} is VALID [2022-04-15 12:52:05,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {1362#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1362#true} is VALID [2022-04-15 12:52:05,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {1362#true} call ULTIMATE.init(); {1362#true} is VALID [2022-04-15 12:52:05,896 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:52:05,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997947661] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 12:52:05,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:52:05,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2022-04-15 12:52:05,932 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:52:05,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [786816840] [2022-04-15 12:52:05,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [786816840] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:05,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:05,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:52:05,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39895490] [2022-04-15 12:52:05,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:52:05,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 18 [2022-04-15 12:52:05,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:52:05,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:52:05,946 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:52:05,946 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:52:05,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:05,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:52:05,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:52:05,947 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:52:06,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:06,102 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-04-15 12:52:06,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:52:06,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 18 [2022-04-15 12:52:06,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:52:06,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:52:06,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-04-15 12:52:06,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:52:06,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-04-15 12:52:06,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2022-04-15 12:52:06,143 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:52:06,143 INFO L225 Difference]: With dead ends: 30 [2022-04-15 12:52:06,144 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 12:52:06,144 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:52:06,144 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:52:06,145 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 48 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:52:06,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 12:52:06,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2022-04-15 12:52:06,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:52:06,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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:52:06,175 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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:52:06,175 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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:52:06,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:06,176 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-15 12:52:06,176 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-15 12:52:06,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:06,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:06,176 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:52:06,176 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:52:06,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:06,177 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-15 12:52:06,177 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-15 12:52:06,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:06,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:06,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:52:06,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:52:06,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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:52:06,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-04-15 12:52:06,178 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 18 [2022-04-15 12:52:06,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:52:06,178 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-04-15 12:52:06,179 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:52:06,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 24 transitions. [2022-04-15 12:52:06,218 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:52:06,218 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-15 12:52:06,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 12:52:06,218 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:52:06,219 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:52:06,245 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:52:06,419 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:06,419 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:52:06,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:52:06,420 INFO L85 PathProgramCache]: Analyzing trace with hash 9935328, now seen corresponding path program 1 times [2022-04-15 12:52:06,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:06,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1740516410] [2022-04-15 12:52:06,590 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:52:06,592 INFO L85 PathProgramCache]: Analyzing trace with hash -778984257, now seen corresponding path program 1 times [2022-04-15 12:52:06,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:06,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539256046] [2022-04-15 12:52:06,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:06,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:06,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:52:06,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:06,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {1638#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1629#true} is VALID [2022-04-15 12:52:06,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {1629#true} assume true; {1629#true} is VALID [2022-04-15 12:52:06,728 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1629#true} {1629#true} #83#return; {1629#true} is VALID [2022-04-15 12:52:06,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {1629#true} call ULTIMATE.init(); {1638#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:52:06,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {1638#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1629#true} is VALID [2022-04-15 12:52:06,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {1629#true} assume true; {1629#true} is VALID [2022-04-15 12:52:06,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1629#true} {1629#true} #83#return; {1629#true} is VALID [2022-04-15 12:52:06,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {1629#true} call #t~ret15 := main(); {1629#true} is VALID [2022-04-15 12:52:06,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {1629#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1634#(= main_~y~0 0)} is VALID [2022-04-15 12:52:06,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {1634#(= main_~y~0 0)} [95] L16-2-->L16-3_primed: Formula: (or (and (= 0 |v_main_#t~post6_Out_8|) (= |v_main_#t~post5_Out_8| 0) (< 0 (mod (+ v_main_~x~0_Out_10 1) 4294967296)) (= (+ v_main_~x~0_In_5 v_main_~y~0_In_4) (+ v_main_~x~0_Out_10 v_main_~y~0_Out_8)) (<= v_main_~x~0_Out_10 v_main_~x~0_In_5)) (and (= v_main_~y~0_In_4 v_main_~y~0_Out_8) (= 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_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_10, main_#t~post6=|v_main_#t~post6_Out_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1635#(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:52:06,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {1635#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} [94] 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[] {1635#(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:52:06,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {1635#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} ~z~0 := ~y~0; {1636#(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:52:06,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {1636#(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; {1637#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:52:06,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {1637#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1637#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:52:06,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {1637#(<= (+ (* 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; {1637#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:52:06,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {1637#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1637#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:52:06,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {1637#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1630#false} is VALID [2022-04-15 12:52:06,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {1630#false} assume !(~z~0 % 4294967296 > 0); {1630#false} is VALID [2022-04-15 12:52:06,739 INFO L272 TraceCheckUtils]: 15: Hoare triple {1630#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1630#false} is VALID [2022-04-15 12:52:06,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {1630#false} ~cond := #in~cond; {1630#false} is VALID [2022-04-15 12:52:06,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {1630#false} assume 0 == ~cond; {1630#false} is VALID [2022-04-15 12:52:06,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {1630#false} assume !false; {1630#false} is VALID [2022-04-15 12:52:06,740 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:52:06,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:52:06,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539256046] [2022-04-15 12:52:06,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539256046] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:52:06,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116441441] [2022-04-15 12:52:06,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:06,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:06,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:52:06,742 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:52:06,755 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:52:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:06,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 12:52:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:06,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:52:06,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {1629#true} call ULTIMATE.init(); {1629#true} is VALID [2022-04-15 12:52:06,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {1629#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1629#true} is VALID [2022-04-15 12:52:06,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {1629#true} assume true; {1629#true} is VALID [2022-04-15 12:52:06,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1629#true} {1629#true} #83#return; {1629#true} is VALID [2022-04-15 12:52:06,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {1629#true} call #t~ret15 := main(); {1629#true} is VALID [2022-04-15 12:52:06,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {1629#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1629#true} is VALID [2022-04-15 12:52:06,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {1629#true} [95] L16-2-->L16-3_primed: Formula: (or (and (= 0 |v_main_#t~post6_Out_8|) (= |v_main_#t~post5_Out_8| 0) (< 0 (mod (+ v_main_~x~0_Out_10 1) 4294967296)) (= (+ v_main_~x~0_In_5 v_main_~y~0_In_4) (+ v_main_~x~0_Out_10 v_main_~y~0_Out_8)) (<= v_main_~x~0_Out_10 v_main_~x~0_In_5)) (and (= v_main_~y~0_In_4 v_main_~y~0_Out_8) (= 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_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_10, main_#t~post6=|v_main_#t~post6_Out_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1629#true} is VALID [2022-04-15 12:52:06,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {1629#true} [94] 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[] {1629#true} is VALID [2022-04-15 12:52:06,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {1629#true} ~z~0 := ~y~0; {1666#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:52:06,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {1666#(= 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; {1670#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 12:52:06,875 INFO L290 TraceCheckUtils]: 10: Hoare triple {1670#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {1670#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 12:52:06,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {1670#(= 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; {1677#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:52:06,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {1677#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1677#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:52:06,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {1677#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1677#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:52:06,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {1677#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1630#false} is VALID [2022-04-15 12:52:06,877 INFO L272 TraceCheckUtils]: 15: Hoare triple {1630#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1630#false} is VALID [2022-04-15 12:52:06,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {1630#false} ~cond := #in~cond; {1630#false} is VALID [2022-04-15 12:52:06,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {1630#false} assume 0 == ~cond; {1630#false} is VALID [2022-04-15 12:52:06,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {1630#false} assume !false; {1630#false} is VALID [2022-04-15 12:52:06,878 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:52:06,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:52:07,005 INFO L290 TraceCheckUtils]: 18: Hoare triple {1630#false} assume !false; {1630#false} is VALID [2022-04-15 12:52:07,005 INFO L290 TraceCheckUtils]: 17: Hoare triple {1630#false} assume 0 == ~cond; {1630#false} is VALID [2022-04-15 12:52:07,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {1630#false} ~cond := #in~cond; {1630#false} is VALID [2022-04-15 12:52:07,011 INFO L272 TraceCheckUtils]: 15: Hoare triple {1630#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1630#false} is VALID [2022-04-15 12:52:07,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {1677#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1630#false} is VALID [2022-04-15 12:52:07,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {1677#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1677#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:52:07,014 INFO L290 TraceCheckUtils]: 12: Hoare triple {1677#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1677#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:52:07,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {1720#(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; {1677#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:52:07,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {1720#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1720#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-15 12:52:07,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {1727#(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; {1720#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-15 12:52:07,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {1629#true} ~z~0 := ~y~0; {1727#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 12:52:07,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {1629#true} [94] 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[] {1629#true} is VALID [2022-04-15 12:52:07,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {1629#true} [95] L16-2-->L16-3_primed: Formula: (or (and (= 0 |v_main_#t~post6_Out_8|) (= |v_main_#t~post5_Out_8| 0) (< 0 (mod (+ v_main_~x~0_Out_10 1) 4294967296)) (= (+ v_main_~x~0_In_5 v_main_~y~0_In_4) (+ v_main_~x~0_Out_10 v_main_~y~0_Out_8)) (<= v_main_~x~0_Out_10 v_main_~x~0_In_5)) (and (= v_main_~y~0_In_4 v_main_~y~0_Out_8) (= 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_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_10, main_#t~post6=|v_main_#t~post6_Out_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1629#true} is VALID [2022-04-15 12:52:07,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {1629#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1629#true} is VALID [2022-04-15 12:52:07,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {1629#true} call #t~ret15 := main(); {1629#true} is VALID [2022-04-15 12:52:07,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1629#true} {1629#true} #83#return; {1629#true} is VALID [2022-04-15 12:52:07,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {1629#true} assume true; {1629#true} is VALID [2022-04-15 12:52:07,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {1629#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1629#true} is VALID [2022-04-15 12:52:07,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {1629#true} call ULTIMATE.init(); {1629#true} is VALID [2022-04-15 12:52:07,025 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:52:07,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116441441] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:52:07,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:52:07,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2022-04-15 12:52:07,115 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:52:07,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1740516410] [2022-04-15 12:52:07,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1740516410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:07,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:07,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:52:07,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510000058] [2022-04-15 12:52:07,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:52:07,116 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:52:07,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:52:07,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:52:07,136 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:52:07,136 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:52:07,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:07,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:52:07,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:52:07,137 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:52:07,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:07,556 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-04-15 12:52:07,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:52:07,556 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:52:07,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:52:07,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:52:07,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-04-15 12:52:07,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:52:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-04-15 12:52:07,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 43 transitions. [2022-04-15 12:52:07,614 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:52:07,614 INFO L225 Difference]: With dead ends: 35 [2022-04-15 12:52:07,615 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 12:52:07,615 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 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:52:07,616 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:52:07,616 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 32 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:52:07,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 12:52:07,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2022-04-15 12:52:07,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:52:07,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:07,675 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:07,675 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:07,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:07,676 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-04-15 12:52:07,677 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-04-15 12:52:07,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:07,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:07,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 12:52:07,677 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 12:52:07,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:07,678 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-04-15 12:52:07,678 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-04-15 12:52:07,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:07,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:07,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:52:07,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:52:07,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:07,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-04-15 12:52:07,680 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 19 [2022-04-15 12:52:07,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:52:07,680 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-04-15 12:52:07,680 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:52:07,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 30 transitions. [2022-04-15 12:52:07,742 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:52:07,742 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-04-15 12:52:07,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:52:07,742 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:52:07,742 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:52:07,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 12:52:07,958 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,SelfDestructingSolverStorable8 [2022-04-15 12:52:07,958 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:52:07,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:52:07,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1745318674, now seen corresponding path program 1 times [2022-04-15 12:52:07,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:07,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1545691764] [2022-04-15 12:52:08,126 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:52:08,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1460692051, now seen corresponding path program 1 times [2022-04-15 12:52:08,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:08,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654696916] [2022-04-15 12:52:08,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:08,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:08,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:52:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:08,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {1950#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1943#true} is VALID [2022-04-15 12:52:08,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 12:52:08,186 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1943#true} {1943#true} #83#return; {1943#true} is VALID [2022-04-15 12:52:08,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {1943#true} call ULTIMATE.init(); {1950#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:52:08,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {1950#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1943#true} is VALID [2022-04-15 12:52:08,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 12:52:08,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1943#true} {1943#true} #83#return; {1943#true} is VALID [2022-04-15 12:52:08,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {1943#true} call #t~ret15 := main(); {1943#true} is VALID [2022-04-15 12:52:08,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {1943#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1943#true} is VALID [2022-04-15 12:52:08,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {1943#true} [97] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_12 1) 4294967296)) (= |v_main_#t~post6_Out_10| 0) (<= v_main_~x~0_Out_12 v_main_~x~0_In_6) (= |v_main_#t~post5_Out_10| 0) (= (+ v_main_~y~0_Out_10 v_main_~x~0_Out_12) (+ v_main_~x~0_In_6 v_main_~y~0_In_5))) (and (= v_main_~y~0_In_5 v_main_~y~0_Out_10) (= v_main_~x~0_In_6 v_main_~x~0_Out_12))) InVars {main_~x~0=v_main_~x~0_In_6, 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_12, main_#t~post6=|v_main_#t~post6_Out_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1943#true} is VALID [2022-04-15 12:52:08,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {1943#true} [96] 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[] {1943#true} is VALID [2022-04-15 12:52:08,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {1943#true} ~z~0 := ~y~0; {1943#true} is VALID [2022-04-15 12:52:08,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {1943#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; {1948#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:08,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {1948#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1948#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:08,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {1948#(<= 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; {1949#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:52:08,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {1949#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {1949#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:52:08,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {1949#(<= (+ (* (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; {1949#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:52:08,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {1949#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {1949#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:52:08,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {1949#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {1944#false} is VALID [2022-04-15 12:52:08,193 INFO L272 TraceCheckUtils]: 16: Hoare triple {1944#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1944#false} is VALID [2022-04-15 12:52:08,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {1944#false} ~cond := #in~cond; {1944#false} is VALID [2022-04-15 12:52:08,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {1944#false} assume 0 == ~cond; {1944#false} is VALID [2022-04-15 12:52:08,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {1944#false} assume !false; {1944#false} is VALID [2022-04-15 12:52:08,194 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:52:08,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:52:08,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654696916] [2022-04-15 12:52:08,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654696916] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:52:08,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020761854] [2022-04-15 12:52:08,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:08,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:08,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:52:08,200 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:52:08,201 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:52:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:08,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:52:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:08,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:52:08,499 INFO L272 TraceCheckUtils]: 0: Hoare triple {1943#true} call ULTIMATE.init(); {1943#true} is VALID [2022-04-15 12:52:08,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {1943#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1943#true} is VALID [2022-04-15 12:52:08,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 12:52:08,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1943#true} {1943#true} #83#return; {1943#true} is VALID [2022-04-15 12:52:08,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {1943#true} call #t~ret15 := main(); {1943#true} is VALID [2022-04-15 12:52:08,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {1943#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1943#true} is VALID [2022-04-15 12:52:08,500 INFO L290 TraceCheckUtils]: 6: Hoare triple {1943#true} [97] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_12 1) 4294967296)) (= |v_main_#t~post6_Out_10| 0) (<= v_main_~x~0_Out_12 v_main_~x~0_In_6) (= |v_main_#t~post5_Out_10| 0) (= (+ v_main_~y~0_Out_10 v_main_~x~0_Out_12) (+ v_main_~x~0_In_6 v_main_~y~0_In_5))) (and (= v_main_~y~0_In_5 v_main_~y~0_Out_10) (= v_main_~x~0_In_6 v_main_~x~0_Out_12))) InVars {main_~x~0=v_main_~x~0_In_6, 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_12, main_#t~post6=|v_main_#t~post6_Out_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1943#true} is VALID [2022-04-15 12:52:08,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {1943#true} [96] 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[] {1943#true} is VALID [2022-04-15 12:52:08,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {1943#true} ~z~0 := ~y~0; {1943#true} is VALID [2022-04-15 12:52:08,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {1943#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; {1948#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:08,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {1948#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1948#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:08,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {1948#(<= 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; {1949#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:52:08,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {1949#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {1949#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:52:08,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {1949#(<= (+ (* (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; {1949#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:52:08,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {1949#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {1949#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:52:08,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {1949#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {1944#false} is VALID [2022-04-15 12:52:08,505 INFO L272 TraceCheckUtils]: 16: Hoare triple {1944#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1944#false} is VALID [2022-04-15 12:52:08,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {1944#false} ~cond := #in~cond; {1944#false} is VALID [2022-04-15 12:52:08,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {1944#false} assume 0 == ~cond; {1944#false} is VALID [2022-04-15 12:52:08,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {1944#false} assume !false; {1944#false} is VALID [2022-04-15 12:52:08,506 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:52:08,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:52:08,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {1944#false} assume !false; {1944#false} is VALID [2022-04-15 12:52:08,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {1944#false} assume 0 == ~cond; {1944#false} is VALID [2022-04-15 12:52:08,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {1944#false} ~cond := #in~cond; {1944#false} is VALID [2022-04-15 12:52:08,783 INFO L272 TraceCheckUtils]: 16: Hoare triple {1944#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1944#false} is VALID [2022-04-15 12:52:08,784 INFO L290 TraceCheckUtils]: 15: Hoare triple {1949#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {1944#false} is VALID [2022-04-15 12:52:08,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {1949#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {1949#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:52:08,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {1949#(<= (+ (* (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; {1949#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:52:08,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {1949#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {1949#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:52:08,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {1948#(<= 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; {1949#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:52:08,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {1948#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1948#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:08,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {1943#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; {1948#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:08,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {1943#true} ~z~0 := ~y~0; {1943#true} is VALID [2022-04-15 12:52:08,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {1943#true} [96] 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[] {1943#true} is VALID [2022-04-15 12:52:08,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {1943#true} [97] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_12 1) 4294967296)) (= |v_main_#t~post6_Out_10| 0) (<= v_main_~x~0_Out_12 v_main_~x~0_In_6) (= |v_main_#t~post5_Out_10| 0) (= (+ v_main_~y~0_Out_10 v_main_~x~0_Out_12) (+ v_main_~x~0_In_6 v_main_~y~0_In_5))) (and (= v_main_~y~0_In_5 v_main_~y~0_Out_10) (= v_main_~x~0_In_6 v_main_~x~0_Out_12))) InVars {main_~x~0=v_main_~x~0_In_6, 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_12, main_#t~post6=|v_main_#t~post6_Out_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1943#true} is VALID [2022-04-15 12:52:08,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {1943#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1943#true} is VALID [2022-04-15 12:52:08,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {1943#true} call #t~ret15 := main(); {1943#true} is VALID [2022-04-15 12:52:08,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1943#true} {1943#true} #83#return; {1943#true} is VALID [2022-04-15 12:52:08,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 12:52:08,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {1943#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1943#true} is VALID [2022-04-15 12:52:08,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {1943#true} call ULTIMATE.init(); {1943#true} is VALID [2022-04-15 12:52:08,791 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:52:08,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020761854] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:52:08,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:52:08,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-15 12:52:08,815 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:52:08,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1545691764] [2022-04-15 12:52:08,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1545691764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:08,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:08,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:52:08,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825172423] [2022-04-15 12:52:08,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:52:08,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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:52:08,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:52:08,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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:52:08,835 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:52:08,836 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:52:08,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:08,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:52:08,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:52:08,836 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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:52:09,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:09,145 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2022-04-15 12:52:09,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:52:09,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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:52:09,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:52:09,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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:52:09,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-15 12:52:09,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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:52:09,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-15 12:52:09,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2022-04-15 12:52:09,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:09,192 INFO L225 Difference]: With dead ends: 38 [2022-04-15 12:52:09,192 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 12:52:09,192 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:52:09,193 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:52:09,193 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 33 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:52:09,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 12:52:09,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2022-04-15 12:52:09,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:52:09,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 29 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:09,257 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 29 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:09,259 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 29 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:09,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:09,260 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-04-15 12:52:09,260 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-04-15 12:52:09,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:09,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:09,260 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 12:52:09,261 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 12:52:09,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:09,261 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-04-15 12:52:09,262 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-04-15 12:52:09,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:09,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:09,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:52:09,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:52:09,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:09,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2022-04-15 12:52:09,263 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 20 [2022-04-15 12:52:09,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:52:09,263 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2022-04-15 12:52:09,263 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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:52:09,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 38 transitions. [2022-04-15 12:52:09,344 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 12:52:09,345 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-04-15 12:52:09,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:52:09,345 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:52:09,345 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:52:09,361 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:52:09,546 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:09,546 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:52:09,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:52:09,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1695200847, now seen corresponding path program 1 times [2022-04-15 12:52:09,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:09,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1268335127] [2022-04-15 12:52:09,706 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:52:09,708 INFO L85 PathProgramCache]: Analyzing trace with hash 75294800, now seen corresponding path program 1 times [2022-04-15 12:52:09,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:09,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788496860] [2022-04-15 12:52:09,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:09,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:10,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:52:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:10,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {2298#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2282#true} is VALID [2022-04-15 12:52:10,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {2282#true} assume true; {2282#true} is VALID [2022-04-15 12:52:10,162 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2282#true} {2282#true} #83#return; {2282#true} is VALID [2022-04-15 12:52:10,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {2282#true} call ULTIMATE.init(); {2298#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:52:10,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {2298#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2282#true} is VALID [2022-04-15 12:52:10,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {2282#true} assume true; {2282#true} is VALID [2022-04-15 12:52:10,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2282#true} {2282#true} #83#return; {2282#true} is VALID [2022-04-15 12:52:10,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {2282#true} call #t~ret15 := main(); {2282#true} is VALID [2022-04-15 12:52:10,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {2282#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2287#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:52:10,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {2287#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [99] 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_6 v_main_~y~0_Out_12)) (and (= |v_main_#t~post5_Out_12| 0) (= (+ v_main_~y~0_Out_12 v_main_~x~0_Out_14) (+ v_main_~x~0_In_7 v_main_~y~0_In_6)) (< 0 (mod (+ v_main_~x~0_Out_14 1) 4294967296)) (= |v_main_#t~post6_Out_12| 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_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_14, main_#t~post6=|v_main_#t~post6_Out_12|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2288#(or (and (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~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:52:10,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {2288#(or (and (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} [98] 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[] {2289#(or (and (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 main_~x~0) main_~n~0)) (= main_~y~0 0))} is VALID [2022-04-15 12:52:10,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {2289#(or (and (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 main_~x~0) main_~n~0)) (= main_~y~0 0))} ~z~0 := ~y~0; {2290#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (or (and (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 main_~x~0) main_~n~0)) (= main_~y~0 0)))} is VALID [2022-04-15 12:52:10,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {2290#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (or (and (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 main_~x~0) main_~n~0)) (= 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; {2291#(and (or (not (= main_~y~0 0)) (<= (+ main_~y~0 4294967295 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)) (or (and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 1) main_~x~0) (<= (+ main_~z~0 main_~x~0) main_~n~0)) (= main_~y~0 0)))} is VALID [2022-04-15 12:52:10,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {2291#(and (or (not (= main_~y~0 0)) (<= (+ main_~y~0 4294967295 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)) (or (and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 1) main_~x~0) (<= (+ main_~z~0 main_~x~0) main_~n~0)) (= main_~y~0 0)))} assume !(~z~0 % 4294967296 > 0); {2292#(and (not (= main_~y~0 0)) (<= (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296)) main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967294 (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-15 12:52:10,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {2292#(and (not (= main_~y~0 0)) (<= (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296)) main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967294 (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296) 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; {2293#(<= (+ main_~x~0 (* 4294967296 (div (+ (* (div (+ (- 1) main_~x~0) 4294967296) (- 4294967296)) main_~n~0 4294967294) 4294967296))) main_~n~0)} is VALID [2022-04-15 12:52:10,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {2293#(<= (+ main_~x~0 (* 4294967296 (div (+ (* (div (+ (- 1) main_~x~0) 4294967296) (- 4294967296)) main_~n~0 4294967294) 4294967296))) main_~n~0)} assume !(~y~0 % 4294967296 > 0); {2293#(<= (+ main_~x~0 (* 4294967296 (div (+ (* (div (+ (- 1) main_~x~0) 4294967296) (- 4294967296)) main_~n~0 4294967294) 4294967296))) main_~n~0)} is VALID [2022-04-15 12:52:10,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {2293#(<= (+ main_~x~0 (* 4294967296 (div (+ (* (div (+ (- 1) main_~x~0) 4294967296) (- 4294967296)) main_~n~0 4294967294) 4294967296))) main_~n~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2294#(<= (+ (* 4294967296 (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~n~0 4294967294) 4294967296)) main_~x~0 1) main_~n~0)} is VALID [2022-04-15 12:52:10,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {2294#(<= (+ (* 4294967296 (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~n~0 4294967294) 4294967296)) main_~x~0 1) main_~n~0)} assume !(~x~0 % 4294967296 > 0); {2294#(<= (+ (* 4294967296 (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~n~0 4294967294) 4294967296)) main_~x~0 1) main_~n~0)} is VALID [2022-04-15 12:52:10,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {2294#(<= (+ (* 4294967296 (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~n~0 4294967294) 4294967296)) main_~x~0 1) main_~n~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2295#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:52:10,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {2295#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {2295#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:52:10,177 INFO L272 TraceCheckUtils]: 17: Hoare triple {2295#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2296#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:52:10,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {2296#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2297#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:52:10,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {2297#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2283#false} is VALID [2022-04-15 12:52:10,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {2283#false} assume !false; {2283#false} is VALID [2022-04-15 12:52:10,178 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:52:10,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:52:10,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788496860] [2022-04-15 12:52:10,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788496860] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:52:10,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875947918] [2022-04-15 12:52:10,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:10,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:10,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:52:10,180 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:52:10,181 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:52:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:10,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 12:52:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:10,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:52:20,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {2282#true} call ULTIMATE.init(); {2282#true} is VALID [2022-04-15 12:52:20,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {2282#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2282#true} is VALID [2022-04-15 12:52:20,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {2282#true} assume true; {2282#true} is VALID [2022-04-15 12:52:20,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2282#true} {2282#true} #83#return; {2282#true} is VALID [2022-04-15 12:52:20,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {2282#true} call #t~ret15 := main(); {2282#true} is VALID [2022-04-15 12:52:20,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {2282#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2287#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:52:20,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {2287#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [99] 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_6 v_main_~y~0_Out_12)) (and (= |v_main_#t~post5_Out_12| 0) (= (+ v_main_~y~0_Out_12 v_main_~x~0_Out_14) (+ v_main_~x~0_In_7 v_main_~y~0_In_6)) (< 0 (mod (+ v_main_~x~0_Out_14 1) 4294967296)) (= |v_main_#t~post6_Out_12| 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_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_14, main_#t~post6=|v_main_#t~post6_Out_12|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2320#(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:52:20,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {2320#(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)))} [98] 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[] {2324#(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:52:20,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {2324#(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; {2324#(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:52:20,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {2324#(and (<= 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; {2331#(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))))} is VALID [2022-04-15 12:52:20,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {2331#(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))))} assume !(~z~0 % 4294967296 > 0); {2331#(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))))} is VALID [2022-04-15 12:52:20,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {2331#(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))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2338#(and (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (not (< 0 (mod (+ main_~n~0 4294967295 (* main_~y~0 4294967295)) 4294967296))) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-15 12:52:20,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {2338#(and (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (not (< 0 (mod (+ main_~n~0 4294967295 (* main_~y~0 4294967295)) 4294967296))) (<= 0 (+ main_~y~0 1)))} assume !(~y~0 % 4294967296 > 0); {2342#(and (not (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~x~0 (+ main_~n~0 1)))} is VALID [2022-04-15 12:52:20,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {2342#(and (not (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967295) 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; {2346#(and (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 main_~n~0) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-15 12:52:20,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {2346#(and (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 main_~n~0) (<= (mod main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {2346#(and (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 main_~n~0) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-15 12:52:20,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {2346#(and (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 main_~n~0) (<= (mod main_~x~0 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; {2342#(and (not (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~x~0 (+ main_~n~0 1)))} is VALID [2022-04-15 12:52:20,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {2342#(and (not (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~x~0 (+ main_~n~0 1)))} assume !(~z~0 % 4294967296 > 0); {2342#(and (not (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~x~0 (+ main_~n~0 1)))} is VALID [2022-04-15 12:52:20,341 INFO L272 TraceCheckUtils]: 17: Hoare triple {2342#(and (not (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~x~0 (+ main_~n~0 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2359#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:52:20,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {2359#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2363#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:52:20,342 INFO L290 TraceCheckUtils]: 19: Hoare triple {2363#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2283#false} is VALID [2022-04-15 12:52:20,343 INFO L290 TraceCheckUtils]: 20: Hoare triple {2283#false} assume !false; {2283#false} is VALID [2022-04-15 12:52:20,343 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:52:20,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:52:24,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {2283#false} assume !false; {2283#false} is VALID [2022-04-15 12:52:24,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {2363#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2283#false} is VALID [2022-04-15 12:52:24,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {2359#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2363#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:52:24,480 INFO L272 TraceCheckUtils]: 17: Hoare triple {2295#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2359#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:52:24,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {2295#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {2295#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:52:24,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {2385#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 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; {2295#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:52:24,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {2385#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {2385#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-15 12:52:24,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {2392#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (not (< 0 (mod 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; {2385#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-15 12:52:24,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {2396#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (not (< 0 (mod main_~x~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2392#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-15 12:52:24,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {2400#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~x~0 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2396#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (not (< 0 (mod main_~x~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:52:24,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {2400#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~x~0 4294967296))))} assume !(~z~0 % 4294967296 > 0); {2400#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-15 12:52:24,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {2407#(or (not (< 0 (mod (+ main_~x~0 1) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 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; {2400#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-15 12:52:24,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {2407#(or (not (< 0 (mod (+ main_~x~0 1) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))))} ~z~0 := ~y~0; {2407#(or (not (< 0 (mod (+ main_~x~0 1) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:52:24,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {2414#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (< 0 (mod main_~x~0 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))))} [98] 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[] {2407#(or (not (< 0 (mod (+ main_~x~0 1) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:52:24,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {2418#(and (or (< (div (+ (* (- 1) main_~x~0) (- 4294967296) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~n~0 4294967296) 2 (div (+ main_~y~0 main_~x~0 4294967296 (* (- 1) main_~n~0)) 4294967296))) (<= (div (+ (* (- 1) main_~x~0) (- 4294967297) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 main_~x~0 4294967294) 4294967296) 1))) (<= (+ (div (+ (* (- 1) main_~x~0) (- 4294967296) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~x~0) (- 4294967296) (* (- 1) main_~y~0)) (- 4294967296)) (div main_~n~0 4294967296)) (+ (div (+ main_~y~0 main_~x~0 4294967294) 4294967296) 3 (div (+ main_~y~0 main_~x~0) 4294967296))))} [99] 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_6 v_main_~y~0_Out_12)) (and (= |v_main_#t~post5_Out_12| 0) (= (+ v_main_~y~0_Out_12 v_main_~x~0_Out_14) (+ v_main_~x~0_In_7 v_main_~y~0_In_6)) (< 0 (mod (+ v_main_~x~0_Out_14 1) 4294967296)) (= |v_main_#t~post6_Out_12| 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_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_14, main_#t~post6=|v_main_#t~post6_Out_12|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2414#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (< 0 (mod main_~x~0 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:52:24,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {2282#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2418#(and (or (< (div (+ (* (- 1) main_~x~0) (- 4294967296) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~n~0 4294967296) 2 (div (+ main_~y~0 main_~x~0 4294967296 (* (- 1) main_~n~0)) 4294967296))) (<= (div (+ (* (- 1) main_~x~0) (- 4294967297) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 main_~x~0 4294967294) 4294967296) 1))) (<= (+ (div (+ (* (- 1) main_~x~0) (- 4294967296) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~x~0) (- 4294967296) (* (- 1) main_~y~0)) (- 4294967296)) (div main_~n~0 4294967296)) (+ (div (+ main_~y~0 main_~x~0 4294967294) 4294967296) 3 (div (+ main_~y~0 main_~x~0) 4294967296))))} is VALID [2022-04-15 12:52:24,607 INFO L272 TraceCheckUtils]: 4: Hoare triple {2282#true} call #t~ret15 := main(); {2282#true} is VALID [2022-04-15 12:52:24,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2282#true} {2282#true} #83#return; {2282#true} is VALID [2022-04-15 12:52:24,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {2282#true} assume true; {2282#true} is VALID [2022-04-15 12:52:24,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {2282#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2282#true} is VALID [2022-04-15 12:52:24,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {2282#true} call ULTIMATE.init(); {2282#true} is VALID [2022-04-15 12:52:24,608 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:52:24,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875947918] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:52:24,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:52:24,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 29 [2022-04-15 12:52:24,733 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:52:24,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1268335127] [2022-04-15 12:52:24,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1268335127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:24,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:24,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:52:24,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343013263] [2022-04-15 12:52:24,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:52:24,734 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 12 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:52:24,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:52:24,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 12 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:52:24,761 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:52:24,761 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:52:24,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:24,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:52:24,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:52:24,762 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 12 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:52:25,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:25,930 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-15 12:52:25,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:52:25,930 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 12 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:52:25,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:52:25,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 12 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:52:25,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 47 transitions. [2022-04-15 12:52:25,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 12 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:52:25,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 47 transitions. [2022-04-15 12:52:25,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 47 transitions. [2022-04-15 12:52:26,010 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:52:26,011 INFO L225 Difference]: With dead ends: 47 [2022-04-15 12:52:26,011 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 12:52:26,012 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=267, Invalid=1373, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 12:52:26,013 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:52:26,013 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 60 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:52:26,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 12:52:26,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-04-15 12:52:26,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:52:26,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 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:52:26,110 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 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:52:26,110 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 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:52:26,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:26,112 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-04-15 12:52:26,112 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-15 12:52:26,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:26,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:26,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 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 35 states. [2022-04-15 12:52:26,112 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 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 35 states. [2022-04-15 12:52:26,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:26,113 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-04-15 12:52:26,113 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-15 12:52:26,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:26,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:26,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:52:26,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:52:26,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 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:52:26,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-04-15 12:52:26,115 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 21 [2022-04-15 12:52:26,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:52:26,115 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-04-15 12:52:26,115 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 12 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:52:26,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 43 transitions. [2022-04-15 12:52:26,251 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:52:26,251 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-15 12:52:26,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:52:26,252 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:52:26,252 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:52:26,278 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:52:26,452 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:26,452 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:52:26,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:52:26,453 INFO L85 PathProgramCache]: Analyzing trace with hash -794011953, now seen corresponding path program 2 times [2022-04-15 12:52:26,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:26,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [406138189] [2022-04-15 12:52:26,610 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:52:26,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1314497234, now seen corresponding path program 1 times [2022-04-15 12:52:26,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:26,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552096359] [2022-04-15 12:52:26,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:26,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:26,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:52:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:26,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {2700#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2691#true} is VALID [2022-04-15 12:52:26,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {2691#true} assume true; {2691#true} is VALID [2022-04-15 12:52:26,693 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2691#true} {2691#true} #83#return; {2691#true} is VALID [2022-04-15 12:52:26,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {2691#true} call ULTIMATE.init(); {2700#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:52:26,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {2700#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2691#true} is VALID [2022-04-15 12:52:26,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {2691#true} assume true; {2691#true} is VALID [2022-04-15 12:52:26,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2691#true} {2691#true} #83#return; {2691#true} is VALID [2022-04-15 12:52:26,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {2691#true} call #t~ret15 := main(); {2691#true} is VALID [2022-04-15 12:52:26,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {2691#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2691#true} is VALID [2022-04-15 12:52:26,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {2691#true} [101] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_14| 0) (< 0 (mod (+ v_main_~x~0_Out_16 1) 4294967296)) (<= v_main_~x~0_Out_16 v_main_~x~0_In_8) (= |v_main_#t~post6_Out_14| 0) (= (+ v_main_~y~0_Out_14 v_main_~x~0_Out_16) (+ v_main_~x~0_In_8 v_main_~y~0_In_7))) (and (= v_main_~y~0_In_7 v_main_~y~0_Out_14) (= v_main_~x~0_In_8 v_main_~x~0_Out_16))) InVars {main_~x~0=v_main_~x~0_In_8, 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_16, main_#t~post6=|v_main_#t~post6_Out_14|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2691#true} is VALID [2022-04-15 12:52:26,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {2691#true} [100] 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[] {2691#true} is VALID [2022-04-15 12:52:26,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {2691#true} ~z~0 := ~y~0; {2696#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:52:26,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {2696#(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; {2697#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:52:26,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {2697#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {2698#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 1)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-15 12:52:26,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {2698#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 1)) (<= (+ (* (div main_~z~0 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; {2699#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:52:26,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {2699#(<= 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; {2692#false} is VALID [2022-04-15 12:52:26,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {2692#false} assume !(~y~0 % 4294967296 > 0); {2692#false} is VALID [2022-04-15 12:52:26,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {2692#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; {2692#false} is VALID [2022-04-15 12:52:26,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {2692#false} assume !(~x~0 % 4294967296 > 0); {2692#false} is VALID [2022-04-15 12:52:26,700 INFO L290 TraceCheckUtils]: 16: Hoare triple {2692#false} assume !(~z~0 % 4294967296 > 0); {2692#false} is VALID [2022-04-15 12:52:26,700 INFO L272 TraceCheckUtils]: 17: Hoare triple {2692#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2692#false} is VALID [2022-04-15 12:52:26,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {2692#false} ~cond := #in~cond; {2692#false} is VALID [2022-04-15 12:52:26,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {2692#false} assume 0 == ~cond; {2692#false} is VALID [2022-04-15 12:52:26,700 INFO L290 TraceCheckUtils]: 20: Hoare triple {2692#false} assume !false; {2692#false} is VALID [2022-04-15 12:52:26,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:52:26,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:52:26,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552096359] [2022-04-15 12:52:26,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552096359] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:52:26,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398660774] [2022-04-15 12:52:26,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:26,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:26,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:52:26,705 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:52:26,706 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:52:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:26,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 12:52:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:26,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:52:27,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {2691#true} call ULTIMATE.init(); {2691#true} is VALID [2022-04-15 12:52:27,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {2691#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2691#true} is VALID [2022-04-15 12:52:27,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {2691#true} assume true; {2691#true} is VALID [2022-04-15 12:52:27,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2691#true} {2691#true} #83#return; {2691#true} is VALID [2022-04-15 12:52:27,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {2691#true} call #t~ret15 := main(); {2691#true} is VALID [2022-04-15 12:52:27,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {2691#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2691#true} is VALID [2022-04-15 12:52:27,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {2691#true} [101] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_14| 0) (< 0 (mod (+ v_main_~x~0_Out_16 1) 4294967296)) (<= v_main_~x~0_Out_16 v_main_~x~0_In_8) (= |v_main_#t~post6_Out_14| 0) (= (+ v_main_~y~0_Out_14 v_main_~x~0_Out_16) (+ v_main_~x~0_In_8 v_main_~y~0_In_7))) (and (= v_main_~y~0_In_7 v_main_~y~0_Out_14) (= v_main_~x~0_In_8 v_main_~x~0_Out_16))) InVars {main_~x~0=v_main_~x~0_In_8, 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_16, main_#t~post6=|v_main_#t~post6_Out_14|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2691#true} is VALID [2022-04-15 12:52:27,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {2691#true} [100] 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[] {2691#true} is VALID [2022-04-15 12:52:27,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {2691#true} ~z~0 := ~y~0; {2696#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:52:27,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {2696#(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; {2697#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:52:27,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {2697#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {2734#(<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) main_~y~0) 4294967296))} is VALID [2022-04-15 12:52:27,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {2734#(<= (div (+ (* (- 1) main_~y~0) 1) (- 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; {2699#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:52:27,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {2699#(<= 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; {2692#false} is VALID [2022-04-15 12:52:27,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {2692#false} assume !(~y~0 % 4294967296 > 0); {2692#false} is VALID [2022-04-15 12:52:27,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {2692#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; {2692#false} is VALID [2022-04-15 12:52:27,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {2692#false} assume !(~x~0 % 4294967296 > 0); {2692#false} is VALID [2022-04-15 12:52:27,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {2692#false} assume !(~z~0 % 4294967296 > 0); {2692#false} is VALID [2022-04-15 12:52:27,101 INFO L272 TraceCheckUtils]: 17: Hoare triple {2692#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2692#false} is VALID [2022-04-15 12:52:27,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {2692#false} ~cond := #in~cond; {2692#false} is VALID [2022-04-15 12:52:27,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {2692#false} assume 0 == ~cond; {2692#false} is VALID [2022-04-15 12:52:27,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {2692#false} assume !false; {2692#false} is VALID [2022-04-15 12:52:27,102 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:52:27,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:52:27,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {2692#false} assume !false; {2692#false} is VALID [2022-04-15 12:52:27,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {2692#false} assume 0 == ~cond; {2692#false} is VALID [2022-04-15 12:52:27,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {2692#false} ~cond := #in~cond; {2692#false} is VALID [2022-04-15 12:52:27,572 INFO L272 TraceCheckUtils]: 17: Hoare triple {2692#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2692#false} is VALID [2022-04-15 12:52:27,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {2692#false} assume !(~z~0 % 4294967296 > 0); {2692#false} is VALID [2022-04-15 12:52:27,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {2692#false} assume !(~x~0 % 4294967296 > 0); {2692#false} is VALID [2022-04-15 12:52:27,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {2692#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; {2692#false} is VALID [2022-04-15 12:52:27,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {2692#false} assume !(~y~0 % 4294967296 > 0); {2692#false} is VALID [2022-04-15 12:52:27,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {2699#(<= 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; {2692#false} is VALID [2022-04-15 12:52:27,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {2734#(<= (div (+ (* (- 1) main_~y~0) 1) (- 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; {2699#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:52:27,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {2795#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) main_~y~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2734#(<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) main_~y~0) 4294967296))} is VALID [2022-04-15 12:52:27,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {2799#(or (<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) 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; {2795#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) main_~y~0) 4294967296)))} is VALID [2022-04-15 12:52:27,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {2691#true} ~z~0 := ~y~0; {2799#(or (<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:52:27,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {2691#true} [100] 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[] {2691#true} is VALID [2022-04-15 12:52:27,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {2691#true} [101] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_14| 0) (< 0 (mod (+ v_main_~x~0_Out_16 1) 4294967296)) (<= v_main_~x~0_Out_16 v_main_~x~0_In_8) (= |v_main_#t~post6_Out_14| 0) (= (+ v_main_~y~0_Out_14 v_main_~x~0_Out_16) (+ v_main_~x~0_In_8 v_main_~y~0_In_7))) (and (= v_main_~y~0_In_7 v_main_~y~0_Out_14) (= v_main_~x~0_In_8 v_main_~x~0_Out_16))) InVars {main_~x~0=v_main_~x~0_In_8, 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_16, main_#t~post6=|v_main_#t~post6_Out_14|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2691#true} is VALID [2022-04-15 12:52:27,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {2691#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2691#true} is VALID [2022-04-15 12:52:27,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {2691#true} call #t~ret15 := main(); {2691#true} is VALID [2022-04-15 12:52:27,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2691#true} {2691#true} #83#return; {2691#true} is VALID [2022-04-15 12:52:27,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {2691#true} assume true; {2691#true} is VALID [2022-04-15 12:52:27,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {2691#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2691#true} is VALID [2022-04-15 12:52:27,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {2691#true} call ULTIMATE.init(); {2691#true} is VALID [2022-04-15 12:52:27,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:52:27,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398660774] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:52:27,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:52:27,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-04-15 12:52:27,633 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:52:27,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [406138189] [2022-04-15 12:52:27,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [406138189] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:27,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:27,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:52:27,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509647756] [2022-04-15 12:52:27,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:52:27,634 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:52:27,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:52:27,635 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:52:27,657 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:52:27,658 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:52:27,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:27,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:52:27,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:52:27,659 INFO L87 Difference]: Start difference. First operand 33 states and 43 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:52:28,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:28,253 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-15 12:52:28,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:52:28,253 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:52:28,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:52:28,254 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:52:28,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2022-04-15 12:52:28,255 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:52:28,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2022-04-15 12:52:28,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 49 transitions. [2022-04-15 12:52:28,313 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:52:28,314 INFO L225 Difference]: With dead ends: 50 [2022-04-15 12:52:28,314 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 12:52:28,315 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:52:28,315 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:52:28,315 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 42 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:52:28,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 12:52:28,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2022-04-15 12:52:28,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:52:28,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 29 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:28,400 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 29 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:28,400 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 29 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:28,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:28,401 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2022-04-15 12:52:28,401 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2022-04-15 12:52:28,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:28,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:28,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 12:52:28,402 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 12:52:28,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:28,404 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2022-04-15 12:52:28,404 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2022-04-15 12:52:28,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:28,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:28,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:52:28,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:52:28,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:28,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-04-15 12:52:28,405 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 21 [2022-04-15 12:52:28,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:52:28,406 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-04-15 12:52:28,406 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:52:28,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 36 transitions. [2022-04-15 12:52:28,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:28,513 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-15 12:52:28,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:52:28,513 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:52:28,513 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:52:28,529 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:52:28,713 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,SelfDestructingSolverStorable11 [2022-04-15 12:52:28,714 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:52:28,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:52:28,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1058899791, now seen corresponding path program 1 times [2022-04-15 12:52:28,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:28,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [227164705] [2022-04-15 12:52:28,828 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:52:28,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1752566418, now seen corresponding path program 1 times [2022-04-15 12:52:28,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:28,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304968096] [2022-04-15 12:52:28,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:28,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:28,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:52:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:28,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {3089#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3080#true} is VALID [2022-04-15 12:52:28,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {3080#true} assume true; {3080#true} is VALID [2022-04-15 12:52:28,919 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3080#true} {3080#true} #83#return; {3080#true} is VALID [2022-04-15 12:52:28,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {3080#true} call ULTIMATE.init(); {3089#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:52:28,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {3089#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3080#true} is VALID [2022-04-15 12:52:28,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {3080#true} assume true; {3080#true} is VALID [2022-04-15 12:52:28,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3080#true} {3080#true} #83#return; {3080#true} is VALID [2022-04-15 12:52:28,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {3080#true} call #t~ret15 := main(); {3080#true} is VALID [2022-04-15 12:52:28,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {3080#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3080#true} is VALID [2022-04-15 12:52:28,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {3080#true} [103] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_16| 0) (<= v_main_~x~0_Out_18 v_main_~x~0_In_9) (= |v_main_#t~post6_Out_16| 0) (= (+ v_main_~x~0_In_9 v_main_~y~0_In_8) (+ v_main_~y~0_Out_16 v_main_~x~0_Out_18)) (< 0 (mod (+ v_main_~x~0_Out_18 1) 4294967296))) (and (= v_main_~x~0_In_9 v_main_~x~0_Out_18) (= v_main_~y~0_In_8 v_main_~y~0_Out_16))) InVars {main_~x~0=v_main_~x~0_In_9, 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_18, main_#t~post6=|v_main_#t~post6_Out_16|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3080#true} is VALID [2022-04-15 12:52:28,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {3080#true} [102] 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[] {3080#true} is VALID [2022-04-15 12:52:28,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {3080#true} ~z~0 := ~y~0; {3085#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:52:28,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {3085#(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; {3086#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:52:28,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {3086#(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; {3087#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:52:28,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {3087#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {3087#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:52:28,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {3087#(<= 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; {3088#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:52:28,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {3088#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {3081#false} is VALID [2022-04-15 12:52:28,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {3081#false} assume !(~x~0 % 4294967296 > 0); {3081#false} is VALID [2022-04-15 12:52:28,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {3081#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3081#false} is VALID [2022-04-15 12:52:28,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {3081#false} assume !(~z~0 % 4294967296 > 0); {3081#false} is VALID [2022-04-15 12:52:28,928 INFO L272 TraceCheckUtils]: 17: Hoare triple {3081#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3081#false} is VALID [2022-04-15 12:52:28,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {3081#false} ~cond := #in~cond; {3081#false} is VALID [2022-04-15 12:52:28,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {3081#false} assume 0 == ~cond; {3081#false} is VALID [2022-04-15 12:52:28,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {3081#false} assume !false; {3081#false} is VALID [2022-04-15 12:52:28,929 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:52:28,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:52:28,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304968096] [2022-04-15 12:52:28,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304968096] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:52:28,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395945291] [2022-04-15 12:52:28,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:28,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:28,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:52:28,932 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:52:28,955 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:52:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:28,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 12:52:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:28,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:52:29,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {3080#true} call ULTIMATE.init(); {3080#true} is VALID [2022-04-15 12:52:29,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {3080#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3080#true} is VALID [2022-04-15 12:52:29,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {3080#true} assume true; {3080#true} is VALID [2022-04-15 12:52:29,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3080#true} {3080#true} #83#return; {3080#true} is VALID [2022-04-15 12:52:29,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {3080#true} call #t~ret15 := main(); {3080#true} is VALID [2022-04-15 12:52:29,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {3080#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3080#true} is VALID [2022-04-15 12:52:29,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {3080#true} [103] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_16| 0) (<= v_main_~x~0_Out_18 v_main_~x~0_In_9) (= |v_main_#t~post6_Out_16| 0) (= (+ v_main_~x~0_In_9 v_main_~y~0_In_8) (+ v_main_~y~0_Out_16 v_main_~x~0_Out_18)) (< 0 (mod (+ v_main_~x~0_Out_18 1) 4294967296))) (and (= v_main_~x~0_In_9 v_main_~x~0_Out_18) (= v_main_~y~0_In_8 v_main_~y~0_Out_16))) InVars {main_~x~0=v_main_~x~0_In_9, 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_18, main_#t~post6=|v_main_#t~post6_Out_16|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3080#true} is VALID [2022-04-15 12:52:29,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {3080#true} [102] 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[] {3080#true} is VALID [2022-04-15 12:52:29,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {3080#true} ~z~0 := ~y~0; {3085#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:52:29,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {3085#(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; {3086#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:52:29,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {3086#(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; {3087#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:52:29,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {3087#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {3087#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:52:29,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {3087#(<= 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; {3088#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:52:29,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {3088#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {3081#false} is VALID [2022-04-15 12:52:29,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {3081#false} assume !(~x~0 % 4294967296 > 0); {3081#false} is VALID [2022-04-15 12:52:29,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {3081#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3081#false} is VALID [2022-04-15 12:52:29,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {3081#false} assume !(~z~0 % 4294967296 > 0); {3081#false} is VALID [2022-04-15 12:52:29,336 INFO L272 TraceCheckUtils]: 17: Hoare triple {3081#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3081#false} is VALID [2022-04-15 12:52:29,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {3081#false} ~cond := #in~cond; {3081#false} is VALID [2022-04-15 12:52:29,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {3081#false} assume 0 == ~cond; {3081#false} is VALID [2022-04-15 12:52:29,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {3081#false} assume !false; {3081#false} is VALID [2022-04-15 12:52:29,336 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:52:29,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:52:29,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {3081#false} assume !false; {3081#false} is VALID [2022-04-15 12:52:29,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {3081#false} assume 0 == ~cond; {3081#false} is VALID [2022-04-15 12:52:29,567 INFO L290 TraceCheckUtils]: 18: Hoare triple {3081#false} ~cond := #in~cond; {3081#false} is VALID [2022-04-15 12:52:29,567 INFO L272 TraceCheckUtils]: 17: Hoare triple {3081#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3081#false} is VALID [2022-04-15 12:52:29,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {3081#false} assume !(~z~0 % 4294967296 > 0); {3081#false} is VALID [2022-04-15 12:52:29,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {3081#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3081#false} is VALID [2022-04-15 12:52:29,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {3081#false} assume !(~x~0 % 4294967296 > 0); {3081#false} is VALID [2022-04-15 12:52:29,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {3088#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {3081#false} is VALID [2022-04-15 12:52:29,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {3087#(<= 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; {3088#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:52:29,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {3087#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {3087#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:52:29,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {3183#(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; {3087#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:52:29,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {3187#(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; {3183#(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:52:29,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {3080#true} ~z~0 := ~y~0; {3187#(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:52:29,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {3080#true} [102] 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[] {3080#true} is VALID [2022-04-15 12:52:29,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {3080#true} [103] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_16| 0) (<= v_main_~x~0_Out_18 v_main_~x~0_In_9) (= |v_main_#t~post6_Out_16| 0) (= (+ v_main_~x~0_In_9 v_main_~y~0_In_8) (+ v_main_~y~0_Out_16 v_main_~x~0_Out_18)) (< 0 (mod (+ v_main_~x~0_Out_18 1) 4294967296))) (and (= v_main_~x~0_In_9 v_main_~x~0_Out_18) (= v_main_~y~0_In_8 v_main_~y~0_Out_16))) InVars {main_~x~0=v_main_~x~0_In_9, 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_18, main_#t~post6=|v_main_#t~post6_Out_16|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3080#true} is VALID [2022-04-15 12:52:29,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {3080#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3080#true} is VALID [2022-04-15 12:52:29,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {3080#true} call #t~ret15 := main(); {3080#true} is VALID [2022-04-15 12:52:29,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3080#true} {3080#true} #83#return; {3080#true} is VALID [2022-04-15 12:52:29,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {3080#true} assume true; {3080#true} is VALID [2022-04-15 12:52:29,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {3080#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3080#true} is VALID [2022-04-15 12:52:29,573 INFO L272 TraceCheckUtils]: 0: Hoare triple {3080#true} call ULTIMATE.init(); {3080#true} is VALID [2022-04-15 12:52:29,574 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:52:29,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395945291] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:52:29,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:52:29,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-15 12:52:29,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:52:29,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [227164705] [2022-04-15 12:52:29,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [227164705] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:29,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:29,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:52:29,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850958580] [2022-04-15 12:52:29,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:52:29,603 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:52:29,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:52:29,603 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:52:29,619 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:52:29,620 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:52:29,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:29,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:52:29,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:52:29,620 INFO L87 Difference]: Start difference. First operand 29 states and 36 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:52:30,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:30,151 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-15 12:52:30,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:52:30,152 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:52:30,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:52:30,152 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:52:30,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-15 12:52:30,153 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:52:30,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-15 12:52:30,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 48 transitions. [2022-04-15 12:52:30,214 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:52:30,214 INFO L225 Difference]: With dead ends: 43 [2022-04-15 12:52:30,214 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 12:52:30,215 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:52:30,215 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 30 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:52:30,216 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 43 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:52:30,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 12:52:30,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2022-04-15 12:52:30,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:52:30,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:30,294 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:30,294 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:30,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:30,295 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 12:52:30,295 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-15 12:52:30,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:30,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:30,296 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states 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:52:30,296 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states 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:52:30,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:30,297 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 12:52:30,297 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-15 12:52:30,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:30,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:30,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:52:30,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:52:30,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:30,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-04-15 12:52:30,299 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 21 [2022-04-15 12:52:30,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:52:30,299 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-04-15 12:52:30,299 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:52:30,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 33 transitions. [2022-04-15 12:52:30,406 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:52:30,407 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-04-15 12:52:30,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:52:30,407 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:52:30,407 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:52:30,426 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:52:30,611 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:30,611 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:52:30,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:52:30,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1295231697, now seen corresponding path program 2 times [2022-04-15 12:52:30,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:30,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1517821092] [2022-04-15 12:52:30,715 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:52:30,716 INFO L85 PathProgramCache]: Analyzing trace with hash -2102711538, now seen corresponding path program 1 times [2022-04-15 12:52:30,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:30,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071290635] [2022-04-15 12:52:30,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:30,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:30,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:52:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:30,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {3456#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3446#true} is VALID [2022-04-15 12:52:30,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {3446#true} assume true; {3446#true} is VALID [2022-04-15 12:52:30,861 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3446#true} {3446#true} #83#return; {3446#true} is VALID [2022-04-15 12:52:30,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {3446#true} call ULTIMATE.init(); {3456#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:52:30,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {3456#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3446#true} is VALID [2022-04-15 12:52:30,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {3446#true} assume true; {3446#true} is VALID [2022-04-15 12:52:30,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3446#true} {3446#true} #83#return; {3446#true} is VALID [2022-04-15 12:52:30,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {3446#true} call #t~ret15 := main(); {3446#true} is VALID [2022-04-15 12:52:30,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {3446#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3451#(= main_~y~0 0)} is VALID [2022-04-15 12:52:30,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {3451#(= main_~y~0 0)} [105] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_18| 0) (< 0 (mod (+ v_main_~x~0_Out_20 1) 4294967296)) (= |v_main_#t~post6_Out_18| 0) (= (+ v_main_~x~0_In_10 v_main_~y~0_In_9) (+ v_main_~y~0_Out_18 v_main_~x~0_Out_20)) (<= v_main_~x~0_Out_20 v_main_~x~0_In_10)) (and (= v_main_~y~0_In_9 v_main_~y~0_Out_18) (= 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_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_20, main_#t~post6=|v_main_#t~post6_Out_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3452#(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:52:30,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {3452#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} [104] 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[] {3453#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:52:30,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {3453#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3453#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:52:30,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {3453#(<= 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; {3454#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-15 12:52:30,867 INFO L290 TraceCheckUtils]: 10: Hoare triple {3454#(<= (+ (* (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; {3455#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:52:30,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {3455#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {3455#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:52:30,867 INFO L290 TraceCheckUtils]: 12: Hoare triple {3455#(<= (+ 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; {3455#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:52:30,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {3455#(<= (+ 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; {3455#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:52:30,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {3455#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {3455#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:52:30,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {3455#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {3447#false} is VALID [2022-04-15 12:52:30,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {3447#false} assume !(~z~0 % 4294967296 > 0); {3447#false} is VALID [2022-04-15 12:52:30,869 INFO L272 TraceCheckUtils]: 17: Hoare triple {3447#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3447#false} is VALID [2022-04-15 12:52:30,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {3447#false} ~cond := #in~cond; {3447#false} is VALID [2022-04-15 12:52:30,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {3447#false} assume 0 == ~cond; {3447#false} is VALID [2022-04-15 12:52:30,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {3447#false} assume !false; {3447#false} is VALID [2022-04-15 12:52:30,870 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:52:30,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:52:30,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071290635] [2022-04-15 12:52:30,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071290635] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:52:30,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183653432] [2022-04-15 12:52:30,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:30,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:30,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:52:30,871 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:52:30,872 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:52:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:30,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 12:52:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:30,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:52:31,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {3446#true} call ULTIMATE.init(); {3446#true} is VALID [2022-04-15 12:52:31,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {3446#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3446#true} is VALID [2022-04-15 12:52:31,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {3446#true} assume true; {3446#true} is VALID [2022-04-15 12:52:31,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3446#true} {3446#true} #83#return; {3446#true} is VALID [2022-04-15 12:52:31,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {3446#true} call #t~ret15 := main(); {3446#true} is VALID [2022-04-15 12:52:31,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {3446#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3446#true} is VALID [2022-04-15 12:52:31,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {3446#true} [105] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_18| 0) (< 0 (mod (+ v_main_~x~0_Out_20 1) 4294967296)) (= |v_main_#t~post6_Out_18| 0) (= (+ v_main_~x~0_In_10 v_main_~y~0_In_9) (+ v_main_~y~0_Out_18 v_main_~x~0_Out_20)) (<= v_main_~x~0_Out_20 v_main_~x~0_In_10)) (and (= v_main_~y~0_In_9 v_main_~y~0_Out_18) (= 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_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_20, main_#t~post6=|v_main_#t~post6_Out_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3446#true} is VALID [2022-04-15 12:52:31,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {3446#true} [104] 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[] {3446#true} is VALID [2022-04-15 12:52:31,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {3446#true} ~z~0 := ~y~0; {3446#true} is VALID [2022-04-15 12:52:31,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {3446#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; {3487#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:52:31,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {3487#(< 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; {3491#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:52:31,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {3491#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !(~z~0 % 4294967296 > 0); {3491#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:52:31,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {3491#(< 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; {3487#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:52:31,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {3487#(< 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; {3501#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:52:31,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {3501#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {3501#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:52:31,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {3501#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {3501#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:52:31,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {3501#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3447#false} is VALID [2022-04-15 12:52:31,022 INFO L272 TraceCheckUtils]: 17: Hoare triple {3447#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3447#false} is VALID [2022-04-15 12:52:31,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {3447#false} ~cond := #in~cond; {3447#false} is VALID [2022-04-15 12:52:31,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {3447#false} assume 0 == ~cond; {3447#false} is VALID [2022-04-15 12:52:31,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {3447#false} assume !false; {3447#false} is VALID [2022-04-15 12:52:31,022 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:52:31,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:52:31,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {3447#false} assume !false; {3447#false} is VALID [2022-04-15 12:52:31,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {3447#false} assume 0 == ~cond; {3447#false} is VALID [2022-04-15 12:52:31,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {3447#false} ~cond := #in~cond; {3447#false} is VALID [2022-04-15 12:52:31,084 INFO L272 TraceCheckUtils]: 17: Hoare triple {3447#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3447#false} is VALID [2022-04-15 12:52:31,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {3501#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3447#false} is VALID [2022-04-15 12:52:31,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {3501#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {3501#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:52:31,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {3501#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {3501#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:52:31,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {3487#(< 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; {3501#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:52:31,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {3491#(< 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; {3487#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:52:31,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {3491#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !(~z~0 % 4294967296 > 0); {3491#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:52:31,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {3487#(< 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; {3491#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:52:31,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {3446#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; {3487#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:52:31,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {3446#true} ~z~0 := ~y~0; {3446#true} is VALID [2022-04-15 12:52:31,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {3446#true} [104] 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[] {3446#true} is VALID [2022-04-15 12:52:31,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {3446#true} [105] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_18| 0) (< 0 (mod (+ v_main_~x~0_Out_20 1) 4294967296)) (= |v_main_#t~post6_Out_18| 0) (= (+ v_main_~x~0_In_10 v_main_~y~0_In_9) (+ v_main_~y~0_Out_18 v_main_~x~0_Out_20)) (<= v_main_~x~0_Out_20 v_main_~x~0_In_10)) (and (= v_main_~y~0_In_9 v_main_~y~0_Out_18) (= 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_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_20, main_#t~post6=|v_main_#t~post6_Out_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3446#true} is VALID [2022-04-15 12:52:31,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {3446#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3446#true} is VALID [2022-04-15 12:52:31,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {3446#true} call #t~ret15 := main(); {3446#true} is VALID [2022-04-15 12:52:31,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3446#true} {3446#true} #83#return; {3446#true} is VALID [2022-04-15 12:52:31,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {3446#true} assume true; {3446#true} is VALID [2022-04-15 12:52:31,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {3446#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3446#true} is VALID [2022-04-15 12:52:31,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {3446#true} call ULTIMATE.init(); {3446#true} is VALID [2022-04-15 12:52:31,093 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:52:31,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183653432] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:52:31,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:52:31,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 11 [2022-04-15 12:52:31,171 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:52:31,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1517821092] [2022-04-15 12:52:31,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1517821092] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:31,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:31,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:52:31,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616349171] [2022-04-15 12:52:31,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:52:31,172 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 21 [2022-04-15 12:52:31,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:52:31,174 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:52:31,193 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:52:31,193 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:52:31,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:31,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:52:31,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:52:31,194 INFO L87 Difference]: Start difference. First operand 28 states and 33 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:52:31,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:31,936 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2022-04-15 12:52:31,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:52:31,937 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 21 [2022-04-15 12:52:31,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:52:31,937 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:52:31,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 53 transitions. [2022-04-15 12:52:31,938 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:52:31,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 53 transitions. [2022-04-15 12:52:31,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 53 transitions. [2022-04-15 12:52:32,020 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:52:32,021 INFO L225 Difference]: With dead ends: 47 [2022-04-15 12:52:32,021 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 12:52:32,021 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:52:32,022 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 33 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:52:32,022 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 46 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:52:32,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 12:52:32,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2022-04-15 12:52:32,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:52:32,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 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:52:32,118 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 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:52:32,118 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 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:52:32,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:32,119 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2022-04-15 12:52:32,119 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2022-04-15 12:52:32,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:32,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:32,120 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 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 41 states. [2022-04-15 12:52:32,120 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 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 41 states. [2022-04-15 12:52:32,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:32,121 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2022-04-15 12:52:32,121 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2022-04-15 12:52:32,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:32,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:32,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:52:32,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:52:32,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 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:52:32,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-04-15 12:52:32,123 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 21 [2022-04-15 12:52:32,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:52:32,123 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-04-15 12:52:32,123 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:52:32,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 42 transitions. [2022-04-15 12:52:32,252 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:52:32,252 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-04-15 12:52:32,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 12:52:32,253 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:52:32,253 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:52:32,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 12:52:32,455 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:32,455 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:52:32,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:52:32,456 INFO L85 PathProgramCache]: Analyzing trace with hash -977123598, now seen corresponding path program 2 times [2022-04-15 12:52:32,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:32,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1422583914] [2022-04-15 12:52:32,600 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:52:32,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1754840371, now seen corresponding path program 1 times [2022-04-15 12:52:32,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:32,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594566345] [2022-04-15 12:52:32,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:32,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:32,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:52:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:32,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {3854#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3847#true} is VALID [2022-04-15 12:52:32,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {3847#true} assume true; {3847#true} is VALID [2022-04-15 12:52:32,677 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3847#true} {3847#true} #83#return; {3847#true} is VALID [2022-04-15 12:52:32,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {3847#true} call ULTIMATE.init(); {3854#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:52:32,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {3854#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3847#true} is VALID [2022-04-15 12:52:32,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {3847#true} assume true; {3847#true} is VALID [2022-04-15 12:52:32,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3847#true} {3847#true} #83#return; {3847#true} is VALID [2022-04-15 12:52:32,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {3847#true} call #t~ret15 := main(); {3847#true} is VALID [2022-04-15 12:52:32,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {3847#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3847#true} is VALID [2022-04-15 12:52:32,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {3847#true} [107] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_10 v_main_~y~0_Out_20) (= v_main_~x~0_In_11 v_main_~x~0_Out_22)) (and (= |v_main_#t~post5_Out_20| 0) (= (+ v_main_~x~0_In_11 v_main_~y~0_In_10) (+ v_main_~y~0_Out_20 v_main_~x~0_Out_22)) (< 0 (mod (+ v_main_~x~0_Out_22 1) 4294967296)) (= |v_main_#t~post6_Out_20| 0) (<= v_main_~x~0_Out_22 v_main_~x~0_In_11))) InVars {main_~x~0=v_main_~x~0_In_11, 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_22, main_#t~post6=|v_main_#t~post6_Out_20|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3847#true} is VALID [2022-04-15 12:52:32,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {3847#true} [106] 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[] {3847#true} is VALID [2022-04-15 12:52:32,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {3847#true} ~z~0 := ~y~0; {3847#true} is VALID [2022-04-15 12:52:32,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {3847#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; {3847#true} is VALID [2022-04-15 12:52:32,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {3847#true} assume !(~z~0 % 4294967296 > 0); {3852#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:52:32,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {3852#(<= 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; {3853#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:52:32,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {3853#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !(~y~0 % 4294967296 > 0); {3853#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:52:32,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {3853#(<= 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; {3853#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:52:32,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {3853#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !(~x~0 % 4294967296 > 0); {3853#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:52:32,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {3853#(<= 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; {3852#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:52:32,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {3852#(<= 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; {3848#false} is VALID [2022-04-15 12:52:32,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {3848#false} assume !(~z~0 % 4294967296 > 0); {3848#false} is VALID [2022-04-15 12:52:32,684 INFO L272 TraceCheckUtils]: 18: Hoare triple {3848#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3848#false} is VALID [2022-04-15 12:52:32,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {3848#false} ~cond := #in~cond; {3848#false} is VALID [2022-04-15 12:52:32,684 INFO L290 TraceCheckUtils]: 20: Hoare triple {3848#false} assume 0 == ~cond; {3848#false} is VALID [2022-04-15 12:52:32,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {3848#false} assume !false; {3848#false} is VALID [2022-04-15 12:52:32,685 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:52:32,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:52:32,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594566345] [2022-04-15 12:52:32,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594566345] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:52:32,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257479614] [2022-04-15 12:52:32,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:32,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:32,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:52:32,687 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:52:32,697 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:52:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:32,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:52:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:32,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:52:32,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {3847#true} call ULTIMATE.init(); {3847#true} is VALID [2022-04-15 12:52:32,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {3847#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3847#true} is VALID [2022-04-15 12:52:32,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {3847#true} assume true; {3847#true} is VALID [2022-04-15 12:52:32,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3847#true} {3847#true} #83#return; {3847#true} is VALID [2022-04-15 12:52:32,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {3847#true} call #t~ret15 := main(); {3847#true} is VALID [2022-04-15 12:52:32,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {3847#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3847#true} is VALID [2022-04-15 12:52:32,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {3847#true} [107] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_10 v_main_~y~0_Out_20) (= v_main_~x~0_In_11 v_main_~x~0_Out_22)) (and (= |v_main_#t~post5_Out_20| 0) (= (+ v_main_~x~0_In_11 v_main_~y~0_In_10) (+ v_main_~y~0_Out_20 v_main_~x~0_Out_22)) (< 0 (mod (+ v_main_~x~0_Out_22 1) 4294967296)) (= |v_main_#t~post6_Out_20| 0) (<= v_main_~x~0_Out_22 v_main_~x~0_In_11))) InVars {main_~x~0=v_main_~x~0_In_11, 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_22, main_#t~post6=|v_main_#t~post6_Out_20|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3847#true} is VALID [2022-04-15 12:52:32,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {3847#true} [106] 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[] {3847#true} is VALID [2022-04-15 12:52:32,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {3847#true} ~z~0 := ~y~0; {3882#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:52:32,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {3882#(= 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; {3886#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 12:52:32,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {3886#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {3886#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 12:52:32,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {3886#(= 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; {3893#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-15 12:52:32,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {3893#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {3853#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:52:32,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {3853#(<= 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; {3853#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:52:32,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {3853#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !(~x~0 % 4294967296 > 0); {3853#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:52:32,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {3853#(<= 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; {3852#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:52:32,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {3852#(<= 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; {3848#false} is VALID [2022-04-15 12:52:32,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {3848#false} assume !(~z~0 % 4294967296 > 0); {3848#false} is VALID [2022-04-15 12:52:32,964 INFO L272 TraceCheckUtils]: 18: Hoare triple {3848#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3848#false} is VALID [2022-04-15 12:52:32,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {3848#false} ~cond := #in~cond; {3848#false} is VALID [2022-04-15 12:52:32,965 INFO L290 TraceCheckUtils]: 20: Hoare triple {3848#false} assume 0 == ~cond; {3848#false} is VALID [2022-04-15 12:52:32,965 INFO L290 TraceCheckUtils]: 21: Hoare triple {3848#false} assume !false; {3848#false} is VALID [2022-04-15 12:52:32,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:52:32,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:52:33,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {3848#false} assume !false; {3848#false} is VALID [2022-04-15 12:52:33,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {3848#false} assume 0 == ~cond; {3848#false} is VALID [2022-04-15 12:52:33,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {3848#false} ~cond := #in~cond; {3848#false} is VALID [2022-04-15 12:52:33,305 INFO L272 TraceCheckUtils]: 18: Hoare triple {3848#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3848#false} is VALID [2022-04-15 12:52:33,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {3848#false} assume !(~z~0 % 4294967296 > 0); {3848#false} is VALID [2022-04-15 12:52:33,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {3852#(<= 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; {3848#false} is VALID [2022-04-15 12:52:33,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {3853#(<= 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; {3852#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:52:33,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {3853#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !(~x~0 % 4294967296 > 0); {3853#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:52:33,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {3853#(<= 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; {3853#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:52:33,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {3951#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3853#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:52:33,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {3955#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= 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; {3951#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:52:33,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {3955#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3955#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:33,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {3962#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 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; {3955#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:33,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {3847#true} ~z~0 := ~y~0; {3962#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:52:33,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {3847#true} [106] 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[] {3847#true} is VALID [2022-04-15 12:52:33,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {3847#true} [107] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_10 v_main_~y~0_Out_20) (= v_main_~x~0_In_11 v_main_~x~0_Out_22)) (and (= |v_main_#t~post5_Out_20| 0) (= (+ v_main_~x~0_In_11 v_main_~y~0_In_10) (+ v_main_~y~0_Out_20 v_main_~x~0_Out_22)) (< 0 (mod (+ v_main_~x~0_Out_22 1) 4294967296)) (= |v_main_#t~post6_Out_20| 0) (<= v_main_~x~0_Out_22 v_main_~x~0_In_11))) InVars {main_~x~0=v_main_~x~0_In_11, 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_22, main_#t~post6=|v_main_#t~post6_Out_20|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3847#true} is VALID [2022-04-15 12:52:33,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {3847#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3847#true} is VALID [2022-04-15 12:52:33,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {3847#true} call #t~ret15 := main(); {3847#true} is VALID [2022-04-15 12:52:33,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3847#true} {3847#true} #83#return; {3847#true} is VALID [2022-04-15 12:52:33,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {3847#true} assume true; {3847#true} is VALID [2022-04-15 12:52:33,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {3847#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3847#true} is VALID [2022-04-15 12:52:33,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {3847#true} call ULTIMATE.init(); {3847#true} is VALID [2022-04-15 12:52:33,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:52:33,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257479614] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:52:33,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:52:33,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 11 [2022-04-15 12:52:33,347 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:52:33,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1422583914] [2022-04-15 12:52:33,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1422583914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:33,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:33,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:52:33,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089184345] [2022-04-15 12:52:33,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:52:33,348 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:52:33,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:52:33,348 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:52:33,368 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:52:33,368 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:52:33,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:33,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:52:33,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:52:33,368 INFO L87 Difference]: Start difference. First operand 34 states and 42 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:52:33,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:33,750 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-15 12:52:33,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:52:33,750 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:52:33,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:52:33,750 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:52:33,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-15 12:52:33,751 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:52:33,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-15 12:52:33,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2022-04-15 12:52:33,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:33,802 INFO L225 Difference]: With dead ends: 43 [2022-04-15 12:52:33,802 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 12:52:33,803 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:52:33,803 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:52:33,804 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 33 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:52:33,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 12:52:33,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-04-15 12:52:33,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:52:33,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:33,878 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:33,878 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:33,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:33,879 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-04-15 12:52:33,879 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-04-15 12:52:33,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:33,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:33,880 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-15 12:52:33,880 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-15 12:52:33,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:33,881 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-04-15 12:52:33,881 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-04-15 12:52:33,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:33,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:33,881 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:52:33,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:52:33,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:33,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-04-15 12:52:33,882 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 22 [2022-04-15 12:52:33,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:52:33,882 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-04-15 12:52:33,883 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:52:33,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 35 transitions. [2022-04-15 12:52:33,995 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 12:52:33,995 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-15 12:52:33,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 12:52:33,995 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:52:33,995 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:52:34,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-15 12:52:34,199 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,SelfDestructingSolverStorable14 [2022-04-15 12:52:34,202 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:52:34,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:52:34,202 INFO L85 PathProgramCache]: Analyzing trace with hash -60153437, now seen corresponding path program 3 times [2022-04-15 12:52:34,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:34,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [827039379] [2022-04-15 12:52:34,338 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:52:34,339 INFO L85 PathProgramCache]: Analyzing trace with hash 370878500, now seen corresponding path program 1 times [2022-04-15 12:52:34,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:34,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44686230] [2022-04-15 12:52:34,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:34,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:34,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:52:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:34,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {4220#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4208#true} is VALID [2022-04-15 12:52:34,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {4208#true} assume true; {4208#true} is VALID [2022-04-15 12:52:34,495 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4208#true} {4208#true} #83#return; {4208#true} is VALID [2022-04-15 12:52:34,504 INFO L272 TraceCheckUtils]: 0: Hoare triple {4208#true} call ULTIMATE.init(); {4220#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:52:34,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {4220#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4208#true} is VALID [2022-04-15 12:52:34,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {4208#true} assume true; {4208#true} is VALID [2022-04-15 12:52:34,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4208#true} {4208#true} #83#return; {4208#true} is VALID [2022-04-15 12:52:34,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {4208#true} call #t~ret15 := main(); {4208#true} is VALID [2022-04-15 12:52:34,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {4208#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4213#(= main_~y~0 0)} is VALID [2022-04-15 12:52:34,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {4213#(= main_~y~0 0)} [109] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_11 v_main_~y~0_Out_22) (= v_main_~x~0_In_12 v_main_~x~0_Out_24)) (and (< 0 (mod (+ v_main_~x~0_Out_24 1) 4294967296)) (= |v_main_#t~post6_Out_22| 0) (= (+ v_main_~x~0_In_12 v_main_~y~0_In_11) (+ v_main_~y~0_Out_22 v_main_~x~0_Out_24)) (= |v_main_#t~post5_Out_22| 0) (<= 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_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_24, main_#t~post6=|v_main_#t~post6_Out_22|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4214#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 12:52:34,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {4214#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} [108] 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[] {4214#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 12:52:34,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {4214#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} ~z~0 := ~y~0; {4215#(and (or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0)) (or (not (= main_~y~0 0)) (= (+ main_~y~0 (* (- 1) main_~z~0)) 0)))} is VALID [2022-04-15 12:52:34,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {4215#(and (or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0)) (or (not (= main_~y~0 0)) (= (+ 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; {4216#(and (not (= main_~y~0 0)) (<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296))))} is VALID [2022-04-15 12:52:34,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {4216#(and (not (= main_~y~0 0)) (<= 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; {4217#(and (<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296))) (not (= main_~y~0 0)))} is VALID [2022-04-15 12:52:34,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {4217#(and (<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296))) (not (= main_~y~0 0)))} assume !(~z~0 % 4294967296 > 0); {4217#(and (<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296))) (not (= main_~y~0 0)))} is VALID [2022-04-15 12:52:34,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {4217#(and (<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296))) (not (= main_~y~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; {4218#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:34,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {4218#(<= 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; {4218#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:34,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {4218#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4218#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:34,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {4218#(<= 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; {4219#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:52:34,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {4219#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {4209#false} is VALID [2022-04-15 12:52:34,515 INFO L290 TraceCheckUtils]: 17: Hoare triple {4209#false} assume !(~z~0 % 4294967296 > 0); {4209#false} is VALID [2022-04-15 12:52:34,515 INFO L272 TraceCheckUtils]: 18: Hoare triple {4209#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4209#false} is VALID [2022-04-15 12:52:34,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {4209#false} ~cond := #in~cond; {4209#false} is VALID [2022-04-15 12:52:34,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {4209#false} assume 0 == ~cond; {4209#false} is VALID [2022-04-15 12:52:34,516 INFO L290 TraceCheckUtils]: 21: Hoare triple {4209#false} assume !false; {4209#false} is VALID [2022-04-15 12:52:34,516 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:52:34,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:52:34,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44686230] [2022-04-15 12:52:34,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44686230] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:52:34,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286769432] [2022-04-15 12:52:34,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:34,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:34,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:52:34,520 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:52:34,535 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:52:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:34,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 12:52:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:34,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:52:34,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {4208#true} call ULTIMATE.init(); {4208#true} is VALID [2022-04-15 12:52:34,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {4208#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4208#true} is VALID [2022-04-15 12:52:34,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {4208#true} assume true; {4208#true} is VALID [2022-04-15 12:52:34,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4208#true} {4208#true} #83#return; {4208#true} is VALID [2022-04-15 12:52:34,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {4208#true} call #t~ret15 := main(); {4208#true} is VALID [2022-04-15 12:52:34,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {4208#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4208#true} is VALID [2022-04-15 12:52:34,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {4208#true} [109] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_11 v_main_~y~0_Out_22) (= v_main_~x~0_In_12 v_main_~x~0_Out_24)) (and (< 0 (mod (+ v_main_~x~0_Out_24 1) 4294967296)) (= |v_main_#t~post6_Out_22| 0) (= (+ v_main_~x~0_In_12 v_main_~y~0_In_11) (+ v_main_~y~0_Out_22 v_main_~x~0_Out_24)) (= |v_main_#t~post5_Out_22| 0) (<= 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_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_24, main_#t~post6=|v_main_#t~post6_Out_22|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4208#true} is VALID [2022-04-15 12:52:34,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {4208#true} [108] 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[] {4208#true} is VALID [2022-04-15 12:52:34,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {4208#true} ~z~0 := ~y~0; {4208#true} is VALID [2022-04-15 12:52:34,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {4208#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; {4251#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:52:34,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {4251#(< 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; {4255#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:52:34,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {4255#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4255#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:52:34,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {4255#(< 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; {4251#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:52:34,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {4251#(< 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; {4265#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:52:34,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {4265#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {4265#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:52:34,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {4265#(< 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; {4265#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:52:34,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {4265#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {4265#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:52:34,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {4265#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4209#false} is VALID [2022-04-15 12:52:34,684 INFO L272 TraceCheckUtils]: 18: Hoare triple {4209#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4209#false} is VALID [2022-04-15 12:52:34,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {4209#false} ~cond := #in~cond; {4209#false} is VALID [2022-04-15 12:52:34,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {4209#false} assume 0 == ~cond; {4209#false} is VALID [2022-04-15 12:52:34,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {4209#false} assume !false; {4209#false} is VALID [2022-04-15 12:52:34,685 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:52:34,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:52:34,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {4209#false} assume !false; {4209#false} is VALID [2022-04-15 12:52:34,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {4209#false} assume 0 == ~cond; {4209#false} is VALID [2022-04-15 12:52:34,764 INFO L290 TraceCheckUtils]: 19: Hoare triple {4209#false} ~cond := #in~cond; {4209#false} is VALID [2022-04-15 12:52:34,764 INFO L272 TraceCheckUtils]: 18: Hoare triple {4209#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4209#false} is VALID [2022-04-15 12:52:34,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {4265#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4209#false} is VALID [2022-04-15 12:52:34,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {4265#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {4265#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:52:34,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {4265#(< 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; {4265#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:52:34,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {4265#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {4265#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:52:34,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {4251#(< 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; {4265#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:52:34,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {4255#(< 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; {4251#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:52:34,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {4255#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4255#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:52:34,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {4251#(< 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; {4255#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:52:34,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {4208#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; {4251#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:52:34,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {4208#true} ~z~0 := ~y~0; {4208#true} is VALID [2022-04-15 12:52:34,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {4208#true} [108] 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[] {4208#true} is VALID [2022-04-15 12:52:34,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {4208#true} [109] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_11 v_main_~y~0_Out_22) (= v_main_~x~0_In_12 v_main_~x~0_Out_24)) (and (< 0 (mod (+ v_main_~x~0_Out_24 1) 4294967296)) (= |v_main_#t~post6_Out_22| 0) (= (+ v_main_~x~0_In_12 v_main_~y~0_In_11) (+ v_main_~y~0_Out_22 v_main_~x~0_Out_24)) (= |v_main_#t~post5_Out_22| 0) (<= 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_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_24, main_#t~post6=|v_main_#t~post6_Out_22|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4208#true} is VALID [2022-04-15 12:52:34,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {4208#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4208#true} is VALID [2022-04-15 12:52:34,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {4208#true} call #t~ret15 := main(); {4208#true} is VALID [2022-04-15 12:52:34,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4208#true} {4208#true} #83#return; {4208#true} is VALID [2022-04-15 12:52:34,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {4208#true} assume true; {4208#true} is VALID [2022-04-15 12:52:34,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {4208#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4208#true} is VALID [2022-04-15 12:52:34,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {4208#true} call ULTIMATE.init(); {4208#true} is VALID [2022-04-15 12:52:34,773 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:52:34,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286769432] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:52:34,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:52:34,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 13 [2022-04-15 12:52:34,869 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:52:34,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [827039379] [2022-04-15 12:52:34,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [827039379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:34,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:34,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:52:34,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53891877] [2022-04-15 12:52:34,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:52:34,870 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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:52:34,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:52:34,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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:52:34,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:34,904 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:52:34,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:34,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:52:34,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:52:34,905 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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:52:35,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:35,808 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2022-04-15 12:52:35,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:52:35,808 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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:52:35,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:52:35,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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:52:35,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2022-04-15 12:52:35,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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:52:35,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2022-04-15 12:52:35,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 43 transitions. [2022-04-15 12:52:35,870 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:52:35,871 INFO L225 Difference]: With dead ends: 42 [2022-04-15 12:52:35,871 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 12:52:35,872 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:52:35,872 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:52:35,872 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 50 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:52:35,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 12:52:35,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2022-04-15 12:52:35,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:52:35,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 32 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 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:52:35,962 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 32 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 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:52:35,962 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 32 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 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:52:35,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:35,963 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-15 12:52:35,963 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-15 12:52:35,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:35,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:35,964 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 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 36 states. [2022-04-15 12:52:35,964 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 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 36 states. [2022-04-15 12:52:35,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:35,965 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-15 12:52:35,965 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-15 12:52:35,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:35,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:35,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:52:35,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:52:35,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 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:52:35,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-04-15 12:52:35,966 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 22 [2022-04-15 12:52:35,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:52:35,966 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-04-15 12:52:35,966 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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:52:35,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 40 transitions. [2022-04-15 12:52:36,090 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:52:36,090 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-15 12:52:36,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 12:52:36,090 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:52:36,090 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:52:36,108 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:52:36,299 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,SelfDestructingSolverStorable15 [2022-04-15 12:52:36,300 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:52:36,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:52:36,300 INFO L85 PathProgramCache]: Analyzing trace with hash -427433041, now seen corresponding path program 4 times [2022-04-15 12:52:36,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:36,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1650106194] [2022-04-15 12:52:36,445 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:52:36,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1735206158, now seen corresponding path program 1 times [2022-04-15 12:52:36,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:36,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596270727] [2022-04-15 12:52:36,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:36,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:36,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:52:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:36,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {4604#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4595#true} is VALID [2022-04-15 12:52:36,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {4595#true} assume true; {4595#true} is VALID [2022-04-15 12:52:36,547 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4595#true} {4595#true} #83#return; {4595#true} is VALID [2022-04-15 12:52:36,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {4595#true} call ULTIMATE.init(); {4604#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:52:36,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {4604#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4595#true} is VALID [2022-04-15 12:52:36,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {4595#true} assume true; {4595#true} is VALID [2022-04-15 12:52:36,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4595#true} {4595#true} #83#return; {4595#true} is VALID [2022-04-15 12:52:36,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {4595#true} call #t~ret15 := main(); {4595#true} is VALID [2022-04-15 12:52:36,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {4595#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4595#true} is VALID [2022-04-15 12:52:36,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {4595#true} [111] 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_12 v_main_~y~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_26 1) 4294967296)) (<= v_main_~x~0_Out_26 v_main_~x~0_In_13) (= (+ v_main_~x~0_In_13 v_main_~y~0_In_12) (+ v_main_~y~0_Out_24 v_main_~x~0_Out_26)))) InVars {main_~x~0=v_main_~x~0_In_13, 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_26, main_#t~post6=|v_main_#t~post6_Out_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4595#true} is VALID [2022-04-15 12:52:36,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {4595#true} [110] 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[] {4595#true} is VALID [2022-04-15 12:52:36,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {4595#true} ~z~0 := ~y~0; {4595#true} is VALID [2022-04-15 12:52:36,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {4595#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; {4600#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:36,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {4600#(<= main_~z~0 (+ 4294967294 (* (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; {4601#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:52:36,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {4601#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} assume !(~z~0 % 4294967296 > 0); {4601#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:52:36,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {4601#(<= main_~z~0 (+ (* (div main_~z~0 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; {4602#(<= main_~z~0 (+ 4294967294 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:52:36,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {4602#(<= main_~z~0 (+ 4294967294 (* 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; {4603#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:52:36,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {4603#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {4603#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:52:36,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {4603#(<= (+ 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; {4603#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:52:36,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {4603#(<= (+ 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; {4603#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:52:36,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {4603#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {4603#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:52:36,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {4603#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {4596#false} is VALID [2022-04-15 12:52:36,559 INFO L272 TraceCheckUtils]: 19: Hoare triple {4596#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4596#false} is VALID [2022-04-15 12:52:36,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {4596#false} ~cond := #in~cond; {4596#false} is VALID [2022-04-15 12:52:36,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {4596#false} assume 0 == ~cond; {4596#false} is VALID [2022-04-15 12:52:36,560 INFO L290 TraceCheckUtils]: 22: Hoare triple {4596#false} assume !false; {4596#false} is VALID [2022-04-15 12:52:36,560 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:52:36,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:52:36,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596270727] [2022-04-15 12:52:36,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596270727] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:52:36,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510715617] [2022-04-15 12:52:36,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:36,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:36,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:52:36,561 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:52:36,595 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:52:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:36,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 12:52:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:36,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:52:36,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {4595#true} call ULTIMATE.init(); {4595#true} is VALID [2022-04-15 12:52:36,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {4595#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4595#true} is VALID [2022-04-15 12:52:36,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {4595#true} assume true; {4595#true} is VALID [2022-04-15 12:52:36,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4595#true} {4595#true} #83#return; {4595#true} is VALID [2022-04-15 12:52:36,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {4595#true} call #t~ret15 := main(); {4595#true} is VALID [2022-04-15 12:52:36,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {4595#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4595#true} is VALID [2022-04-15 12:52:36,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {4595#true} [111] 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_12 v_main_~y~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_26 1) 4294967296)) (<= v_main_~x~0_Out_26 v_main_~x~0_In_13) (= (+ v_main_~x~0_In_13 v_main_~y~0_In_12) (+ v_main_~y~0_Out_24 v_main_~x~0_Out_26)))) InVars {main_~x~0=v_main_~x~0_In_13, 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_26, main_#t~post6=|v_main_#t~post6_Out_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4595#true} is VALID [2022-04-15 12:52:36,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {4595#true} [110] 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[] {4595#true} is VALID [2022-04-15 12:52:36,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {4595#true} ~z~0 := ~y~0; {4595#true} is VALID [2022-04-15 12:52:36,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {4595#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; {4600#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:36,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {4600#(<= main_~z~0 (+ 4294967294 (* (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; {4638#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:52:36,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {4638#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} assume !(~z~0 % 4294967296 > 0); {4638#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:52:36,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {4638#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 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; {4600#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:36,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {4600#(<= 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; {4648#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:52:36,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {4648#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {4648#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:52:36,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {4648#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {4648#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:52:36,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {4648#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {4648#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:52:36,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {4648#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {4648#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:52:36,909 INFO L290 TraceCheckUtils]: 18: Hoare triple {4648#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {4596#false} is VALID [2022-04-15 12:52:36,909 INFO L272 TraceCheckUtils]: 19: Hoare triple {4596#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4596#false} is VALID [2022-04-15 12:52:36,909 INFO L290 TraceCheckUtils]: 20: Hoare triple {4596#false} ~cond := #in~cond; {4596#false} is VALID [2022-04-15 12:52:36,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {4596#false} assume 0 == ~cond; {4596#false} is VALID [2022-04-15 12:52:36,909 INFO L290 TraceCheckUtils]: 22: Hoare triple {4596#false} assume !false; {4596#false} is VALID [2022-04-15 12:52:36,909 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:52:36,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:52:37,170 INFO L290 TraceCheckUtils]: 22: Hoare triple {4596#false} assume !false; {4596#false} is VALID [2022-04-15 12:52:37,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {4596#false} assume 0 == ~cond; {4596#false} is VALID [2022-04-15 12:52:37,171 INFO L290 TraceCheckUtils]: 20: Hoare triple {4596#false} ~cond := #in~cond; {4596#false} is VALID [2022-04-15 12:52:37,171 INFO L272 TraceCheckUtils]: 19: Hoare triple {4596#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4596#false} is VALID [2022-04-15 12:52:37,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {4648#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {4596#false} is VALID [2022-04-15 12:52:37,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {4648#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {4648#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:52:37,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {4648#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {4648#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:52:37,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {4648#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {4648#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:52:37,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {4648#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {4648#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:52:37,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {4600#(<= 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; {4648#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:52:37,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {4638#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 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; {4600#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:37,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {4638#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} assume !(~z~0 % 4294967296 > 0); {4638#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:52:37,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {4600#(<= main_~z~0 (+ 4294967294 (* (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; {4638#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:52:37,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {4595#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; {4600#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:37,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {4595#true} ~z~0 := ~y~0; {4595#true} is VALID [2022-04-15 12:52:37,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {4595#true} [110] 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[] {4595#true} is VALID [2022-04-15 12:52:37,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {4595#true} [111] 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_12 v_main_~y~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_26 1) 4294967296)) (<= v_main_~x~0_Out_26 v_main_~x~0_In_13) (= (+ v_main_~x~0_In_13 v_main_~y~0_In_12) (+ v_main_~y~0_Out_24 v_main_~x~0_Out_26)))) InVars {main_~x~0=v_main_~x~0_In_13, 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_26, main_#t~post6=|v_main_#t~post6_Out_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4595#true} is VALID [2022-04-15 12:52:37,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {4595#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4595#true} is VALID [2022-04-15 12:52:37,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {4595#true} call #t~ret15 := main(); {4595#true} is VALID [2022-04-15 12:52:37,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4595#true} {4595#true} #83#return; {4595#true} is VALID [2022-04-15 12:52:37,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {4595#true} assume true; {4595#true} is VALID [2022-04-15 12:52:37,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {4595#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4595#true} is VALID [2022-04-15 12:52:37,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {4595#true} call ULTIMATE.init(); {4595#true} is VALID [2022-04-15 12:52:37,182 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:52:37,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510715617] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:52:37,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:52:37,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 9 [2022-04-15 12:52:37,206 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:52:37,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1650106194] [2022-04-15 12:52:37,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1650106194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:37,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:37,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:52:37,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611403984] [2022-04-15 12:52:37,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:52:37,206 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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 23 [2022-04-15 12:52:37,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:52:37,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:52:37,228 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:52:37,228 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:52:37,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:37,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:52:37,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:52:37,229 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:52:37,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:37,851 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2022-04-15 12:52:37,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:52:37,851 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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 23 [2022-04-15 12:52:37,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:52:37,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:52:37,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2022-04-15 12:52:37,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:52:37,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2022-04-15 12:52:37,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 47 transitions. [2022-04-15 12:52:37,913 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:52:37,914 INFO L225 Difference]: With dead ends: 52 [2022-04-15 12:52:37,914 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 12:52:37,914 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:52:37,915 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:52:37,915 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 42 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:52:37,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 12:52:38,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2022-04-15 12:52:38,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:52:38,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 40 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 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:52:38,043 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 40 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 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:52:38,044 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 40 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 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:52:38,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:38,045 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2022-04-15 12:52:38,045 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2022-04-15 12:52:38,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:38,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:38,045 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 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 47 states. [2022-04-15 12:52:38,045 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 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 47 states. [2022-04-15 12:52:38,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:38,046 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2022-04-15 12:52:38,046 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2022-04-15 12:52:38,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:38,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:38,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:52:38,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:52:38,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 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:52:38,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2022-04-15 12:52:38,048 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 23 [2022-04-15 12:52:38,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:52:38,048 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2022-04-15 12:52:38,048 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:52:38,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 52 transitions. [2022-04-15 12:52:38,216 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:52:38,216 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2022-04-15 12:52:38,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 12:52:38,216 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:52:38,216 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:52:38,235 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:52:38,427 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,SelfDestructingSolverStorable16 [2022-04-15 12:52:38,428 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:52:38,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:52:38,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1594121644, now seen corresponding path program 5 times [2022-04-15 12:52:38,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:38,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1724054482] [2022-04-15 12:52:38,550 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:52:38,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1735658773, now seen corresponding path program 1 times [2022-04-15 12:52:38,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:38,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321647227] [2022-04-15 12:52:38,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:38,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:38,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:52:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:38,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {5049#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5038#true} is VALID [2022-04-15 12:52:38,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {5038#true} assume true; {5038#true} is VALID [2022-04-15 12:52:38,685 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5038#true} {5038#true} #83#return; {5038#true} is VALID [2022-04-15 12:52:38,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {5038#true} call ULTIMATE.init(); {5049#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:52:38,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {5049#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5038#true} is VALID [2022-04-15 12:52:38,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {5038#true} assume true; {5038#true} is VALID [2022-04-15 12:52:38,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5038#true} {5038#true} #83#return; {5038#true} is VALID [2022-04-15 12:52:38,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {5038#true} call #t~ret15 := main(); {5038#true} is VALID [2022-04-15 12:52:38,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {5038#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5038#true} is VALID [2022-04-15 12:52:38,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {5038#true} [113] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_14 v_main_~x~0_Out_28) (= v_main_~y~0_In_13 v_main_~y~0_Out_26)) (and (<= v_main_~x~0_Out_28 v_main_~x~0_In_14) (= |v_main_#t~post6_Out_26| 0) (< 0 (mod (+ v_main_~x~0_Out_28 1) 4294967296)) (= (+ v_main_~x~0_In_14 v_main_~y~0_In_13) (+ v_main_~y~0_Out_26 v_main_~x~0_Out_28)) (= |v_main_#t~post5_Out_26| 0))) InVars {main_~x~0=v_main_~x~0_In_14, 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_28, main_#t~post6=|v_main_#t~post6_Out_26|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5038#true} is VALID [2022-04-15 12:52:38,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {5038#true} [112] 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[] {5038#true} is VALID [2022-04-15 12:52:38,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {5038#true} ~z~0 := ~y~0; {5043#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:52:38,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {5043#(= (+ 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; {5044#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:52:38,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {5044#(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; {5045#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:52:38,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {5045#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {5046#(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:52:38,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {5046#(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; {5047#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:52:38,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {5047#(<= 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; {5048#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:52:38,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {5048#(<= 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; {5039#false} is VALID [2022-04-15 12:52:38,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {5039#false} assume !(~y~0 % 4294967296 > 0); {5039#false} is VALID [2022-04-15 12:52:38,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {5039#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; {5039#false} is VALID [2022-04-15 12:52:38,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {5039#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; {5039#false} is VALID [2022-04-15 12:52:38,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {5039#false} assume !(~x~0 % 4294967296 > 0); {5039#false} is VALID [2022-04-15 12:52:38,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {5039#false} assume !(~z~0 % 4294967296 > 0); {5039#false} is VALID [2022-04-15 12:52:38,695 INFO L272 TraceCheckUtils]: 20: Hoare triple {5039#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5039#false} is VALID [2022-04-15 12:52:38,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {5039#false} ~cond := #in~cond; {5039#false} is VALID [2022-04-15 12:52:38,695 INFO L290 TraceCheckUtils]: 22: Hoare triple {5039#false} assume 0 == ~cond; {5039#false} is VALID [2022-04-15 12:52:38,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {5039#false} assume !false; {5039#false} is VALID [2022-04-15 12:52:38,695 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:52:38,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:52:38,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321647227] [2022-04-15 12:52:38,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321647227] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:52:38,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041235938] [2022-04-15 12:52:38,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:38,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:38,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:52:38,697 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:52:38,697 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:52:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:38,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:52:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:38,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:52:39,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {5038#true} call ULTIMATE.init(); {5038#true} is VALID [2022-04-15 12:52:39,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {5038#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5038#true} is VALID [2022-04-15 12:52:39,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {5038#true} assume true; {5038#true} is VALID [2022-04-15 12:52:39,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5038#true} {5038#true} #83#return; {5038#true} is VALID [2022-04-15 12:52:39,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {5038#true} call #t~ret15 := main(); {5038#true} is VALID [2022-04-15 12:52:39,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {5038#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5038#true} is VALID [2022-04-15 12:52:39,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {5038#true} [113] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_14 v_main_~x~0_Out_28) (= v_main_~y~0_In_13 v_main_~y~0_Out_26)) (and (<= v_main_~x~0_Out_28 v_main_~x~0_In_14) (= |v_main_#t~post6_Out_26| 0) (< 0 (mod (+ v_main_~x~0_Out_28 1) 4294967296)) (= (+ v_main_~x~0_In_14 v_main_~y~0_In_13) (+ v_main_~y~0_Out_26 v_main_~x~0_Out_28)) (= |v_main_#t~post5_Out_26| 0))) InVars {main_~x~0=v_main_~x~0_In_14, 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_28, main_#t~post6=|v_main_#t~post6_Out_26|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5038#true} is VALID [2022-04-15 12:52:39,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {5038#true} [112] 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[] {5038#true} is VALID [2022-04-15 12:52:39,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {5038#true} ~z~0 := ~y~0; {5043#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:52:39,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {5043#(= (+ 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; {5044#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:52:39,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {5044#(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; {5045#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:52:39,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {5045#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {5086#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296))} is VALID [2022-04-15 12:52:39,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {5086#(<= (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; {5047#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:52:39,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {5047#(<= 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; {5048#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:52:39,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {5048#(<= 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; {5039#false} is VALID [2022-04-15 12:52:39,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {5039#false} assume !(~y~0 % 4294967296 > 0); {5039#false} is VALID [2022-04-15 12:52:39,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {5039#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; {5039#false} is VALID [2022-04-15 12:52:39,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {5039#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; {5039#false} is VALID [2022-04-15 12:52:39,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {5039#false} assume !(~x~0 % 4294967296 > 0); {5039#false} is VALID [2022-04-15 12:52:39,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {5039#false} assume !(~z~0 % 4294967296 > 0); {5039#false} is VALID [2022-04-15 12:52:39,097 INFO L272 TraceCheckUtils]: 20: Hoare triple {5039#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5039#false} is VALID [2022-04-15 12:52:39,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {5039#false} ~cond := #in~cond; {5039#false} is VALID [2022-04-15 12:52:39,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {5039#false} assume 0 == ~cond; {5039#false} is VALID [2022-04-15 12:52:39,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {5039#false} assume !false; {5039#false} is VALID [2022-04-15 12:52:39,098 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:52:39,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:52:39,647 INFO L290 TraceCheckUtils]: 23: Hoare triple {5039#false} assume !false; {5039#false} is VALID [2022-04-15 12:52:39,648 INFO L290 TraceCheckUtils]: 22: Hoare triple {5039#false} assume 0 == ~cond; {5039#false} is VALID [2022-04-15 12:52:39,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {5039#false} ~cond := #in~cond; {5039#false} is VALID [2022-04-15 12:52:39,648 INFO L272 TraceCheckUtils]: 20: Hoare triple {5039#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5039#false} is VALID [2022-04-15 12:52:39,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {5039#false} assume !(~z~0 % 4294967296 > 0); {5039#false} is VALID [2022-04-15 12:52:39,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {5039#false} assume !(~x~0 % 4294967296 > 0); {5039#false} is VALID [2022-04-15 12:52:39,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {5039#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; {5039#false} is VALID [2022-04-15 12:52:39,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {5039#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; {5039#false} is VALID [2022-04-15 12:52:39,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {5039#false} assume !(~y~0 % 4294967296 > 0); {5039#false} is VALID [2022-04-15 12:52:39,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {5048#(<= 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; {5039#false} is VALID [2022-04-15 12:52:39,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {5047#(<= 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; {5048#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:52:39,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {5086#(<= (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; {5047#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:52:39,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {5159#(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); {5086#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296))} is VALID [2022-04-15 12:52:39,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {5163#(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; {5159#(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:52:39,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {5167#(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; {5163#(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:52:39,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {5038#true} ~z~0 := ~y~0; {5167#(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:52:39,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {5038#true} [112] 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[] {5038#true} is VALID [2022-04-15 12:52:39,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {5038#true} [113] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_14 v_main_~x~0_Out_28) (= v_main_~y~0_In_13 v_main_~y~0_Out_26)) (and (<= v_main_~x~0_Out_28 v_main_~x~0_In_14) (= |v_main_#t~post6_Out_26| 0) (< 0 (mod (+ v_main_~x~0_Out_28 1) 4294967296)) (= (+ v_main_~x~0_In_14 v_main_~y~0_In_13) (+ v_main_~y~0_Out_26 v_main_~x~0_Out_28)) (= |v_main_#t~post5_Out_26| 0))) InVars {main_~x~0=v_main_~x~0_In_14, 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_28, main_#t~post6=|v_main_#t~post6_Out_26|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5038#true} is VALID [2022-04-15 12:52:39,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {5038#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5038#true} is VALID [2022-04-15 12:52:39,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {5038#true} call #t~ret15 := main(); {5038#true} is VALID [2022-04-15 12:52:39,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5038#true} {5038#true} #83#return; {5038#true} is VALID [2022-04-15 12:52:39,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {5038#true} assume true; {5038#true} is VALID [2022-04-15 12:52:39,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {5038#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5038#true} is VALID [2022-04-15 12:52:39,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {5038#true} call ULTIMATE.init(); {5038#true} is VALID [2022-04-15 12:52:39,657 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:52:39,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041235938] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:52:39,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:52:39,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2022-04-15 12:52:39,687 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:52:39,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1724054482] [2022-04-15 12:52:39,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1724054482] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:39,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:39,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:52:39,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3710563] [2022-04-15 12:52:39,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:52:39,688 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 12:52:39,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:52:39,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:39,709 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:52:39,709 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:52:39,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:39,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:52:39,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:52:39,710 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:40,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:40,771 INFO L93 Difference]: Finished difference Result 90 states and 122 transitions. [2022-04-15 12:52:40,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 12:52:40,771 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 12:52:40,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:52:40,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:40,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 66 transitions. [2022-04-15 12:52:40,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:40,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 66 transitions. [2022-04-15 12:52:40,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 66 transitions. [2022-04-15 12:52:40,867 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:52:40,868 INFO L225 Difference]: With dead ends: 90 [2022-04-15 12:52:40,869 INFO L226 Difference]: Without dead ends: 58 [2022-04-15 12:52:40,869 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:52:40,870 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 40 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:52:40,870 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 51 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:52:40,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-15 12:52:40,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2022-04-15 12:52:40,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:52:40,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 39 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 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:52:40,991 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 39 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 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:52:40,992 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 39 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 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:52:40,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:40,993 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2022-04-15 12:52:40,993 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2022-04-15 12:52:40,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:40,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:40,993 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 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 58 states. [2022-04-15 12:52:40,993 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 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 58 states. [2022-04-15 12:52:40,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:40,995 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2022-04-15 12:52:40,995 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2022-04-15 12:52:40,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:40,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:40,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:52:40,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:52:40,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 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:52:40,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2022-04-15 12:52:40,996 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 24 [2022-04-15 12:52:40,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:52:40,996 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2022-04-15 12:52:40,996 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:40,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 49 transitions. [2022-04-15 12:52:41,172 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:52:41,172 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2022-04-15 12:52:41,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 12:52:41,172 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:52:41,172 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:52:41,188 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:52:41,373 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,SelfDestructingSolverStorable17 [2022-04-15 12:52:41,373 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:52:41,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:52:41,373 INFO L85 PathProgramCache]: Analyzing trace with hash -294389697, now seen corresponding path program 6 times [2022-04-15 12:52:41,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:41,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [659554654] [2022-04-15 12:52:41,484 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:52:41,485 INFO L85 PathProgramCache]: Analyzing trace with hash -318387405, now seen corresponding path program 1 times [2022-04-15 12:52:41,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:41,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805618360] [2022-04-15 12:52:41,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:41,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:41,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:52:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:41,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {5611#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5599#true} is VALID [2022-04-15 12:52:41,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {5599#true} assume true; {5599#true} is VALID [2022-04-15 12:52:41,655 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5599#true} {5599#true} #83#return; {5599#true} is VALID [2022-04-15 12:52:41,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {5599#true} call ULTIMATE.init(); {5611#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:52:41,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {5611#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5599#true} is VALID [2022-04-15 12:52:41,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {5599#true} assume true; {5599#true} is VALID [2022-04-15 12:52:41,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5599#true} {5599#true} #83#return; {5599#true} is VALID [2022-04-15 12:52:41,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {5599#true} call #t~ret15 := main(); {5599#true} is VALID [2022-04-15 12:52:41,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {5599#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5604#(= main_~y~0 0)} is VALID [2022-04-15 12:52:41,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {5604#(= main_~y~0 0)} [115] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_28| 0) (= |v_main_#t~post5_Out_28| 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_~x~0_In_15 v_main_~y~0_In_14) (+ v_main_~y~0_Out_28 v_main_~x~0_Out_30))) (and (= v_main_~y~0_In_14 v_main_~y~0_Out_28) (= 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_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_30, main_#t~post6=|v_main_#t~post6_Out_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5605#(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:52:41,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {5605#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} [114] 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[] {5606#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:52:41,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {5606#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {5606#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:52:41,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {5606#(<= 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; {5607#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-15 12:52:41,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {5607#(<= (+ (* (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; {5608#(<= (+ 2 (* (div (+ main_~x~0 4294967293) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-15 12:52:41,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {5608#(<= (+ 2 (* (div (+ main_~x~0 4294967293) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5609#(<= (+ 3 (* (div (+ 4294967292 main_~x~0) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-15 12:52:41,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {5609#(<= (+ 3 (* (div (+ 4294967292 main_~x~0) 4294967296) 4294967296)) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {5609#(<= (+ 3 (* (div (+ 4294967292 main_~x~0) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-15 12:52:41,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {5609#(<= (+ 3 (* (div (+ 4294967292 main_~x~0) 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; {5609#(<= (+ 3 (* (div (+ 4294967292 main_~x~0) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-15 12:52:41,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {5609#(<= (+ 3 (* (div (+ 4294967292 main_~x~0) 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; {5609#(<= (+ 3 (* (div (+ 4294967292 main_~x~0) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-15 12:52:41,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {5609#(<= (+ 3 (* (div (+ 4294967292 main_~x~0) 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; {5609#(<= (+ 3 (* (div (+ 4294967292 main_~x~0) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-15 12:52:41,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {5609#(<= (+ 3 (* (div (+ 4294967292 main_~x~0) 4294967296) 4294967296)) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {5609#(<= (+ 3 (* (div (+ 4294967292 main_~x~0) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-15 12:52:41,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {5609#(<= (+ 3 (* (div (+ 4294967292 main_~x~0) 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; {5610#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:52:41,668 INFO L290 TraceCheckUtils]: 18: Hoare triple {5610#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {5600#false} is VALID [2022-04-15 12:52:41,669 INFO L290 TraceCheckUtils]: 19: Hoare triple {5600#false} assume !(~z~0 % 4294967296 > 0); {5600#false} is VALID [2022-04-15 12:52:41,669 INFO L272 TraceCheckUtils]: 20: Hoare triple {5600#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5600#false} is VALID [2022-04-15 12:52:41,669 INFO L290 TraceCheckUtils]: 21: Hoare triple {5600#false} ~cond := #in~cond; {5600#false} is VALID [2022-04-15 12:52:41,669 INFO L290 TraceCheckUtils]: 22: Hoare triple {5600#false} assume 0 == ~cond; {5600#false} is VALID [2022-04-15 12:52:41,669 INFO L290 TraceCheckUtils]: 23: Hoare triple {5600#false} assume !false; {5600#false} is VALID [2022-04-15 12:52:41,669 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:52:41,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:52:41,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805618360] [2022-04-15 12:52:41,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805618360] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:52:41,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835936092] [2022-04-15 12:52:41,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:41,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:41,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:52:41,671 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:52:41,689 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:52:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:41,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 12:52:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:41,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:52:41,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {5599#true} call ULTIMATE.init(); {5599#true} is VALID [2022-04-15 12:52:41,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {5599#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5599#true} is VALID [2022-04-15 12:52:41,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {5599#true} assume true; {5599#true} is VALID [2022-04-15 12:52:41,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5599#true} {5599#true} #83#return; {5599#true} is VALID [2022-04-15 12:52:41,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {5599#true} call #t~ret15 := main(); {5599#true} is VALID [2022-04-15 12:52:41,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {5599#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5599#true} is VALID [2022-04-15 12:52:41,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {5599#true} [115] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_28| 0) (= |v_main_#t~post5_Out_28| 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_~x~0_In_15 v_main_~y~0_In_14) (+ v_main_~y~0_Out_28 v_main_~x~0_Out_30))) (and (= v_main_~y~0_In_14 v_main_~y~0_Out_28) (= 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_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_30, main_#t~post6=|v_main_#t~post6_Out_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5599#true} is VALID [2022-04-15 12:52:41,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {5599#true} [114] 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[] {5599#true} is VALID [2022-04-15 12:52:41,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {5599#true} ~z~0 := ~y~0; {5639#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:52:41,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {5639#(= 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; {5643#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-15 12:52:41,938 INFO L290 TraceCheckUtils]: 10: Hoare triple {5643#(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; {5647#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:52:41,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {5647#(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; {5651#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:52:41,940 INFO L290 TraceCheckUtils]: 12: Hoare triple {5651#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {5651#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:52:41,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {5651#(and (= (+ main_~z~0 2) (+ (- 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; {5658#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= (+ main_~z~0 2) (+ main_~y~0 1)))} is VALID [2022-04-15 12:52:41,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {5658#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= (+ main_~z~0 2) (+ main_~y~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5662#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-15 12:52:41,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {5662#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5666#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:52:41,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {5666#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5666#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:52:41,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {5666#(< 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; {5666#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:52:41,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {5666#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {5666#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:52:41,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {5666#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5600#false} is VALID [2022-04-15 12:52:41,945 INFO L272 TraceCheckUtils]: 20: Hoare triple {5600#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5600#false} is VALID [2022-04-15 12:52:41,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {5600#false} ~cond := #in~cond; {5600#false} is VALID [2022-04-15 12:52:41,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {5600#false} assume 0 == ~cond; {5600#false} is VALID [2022-04-15 12:52:41,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {5600#false} assume !false; {5600#false} is VALID [2022-04-15 12:52:41,945 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:52:41,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:52:42,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {5600#false} assume !false; {5600#false} is VALID [2022-04-15 12:52:42,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {5600#false} assume 0 == ~cond; {5600#false} is VALID [2022-04-15 12:52:42,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {5600#false} ~cond := #in~cond; {5600#false} is VALID [2022-04-15 12:52:42,094 INFO L272 TraceCheckUtils]: 20: Hoare triple {5600#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5600#false} is VALID [2022-04-15 12:52:42,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {5666#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5600#false} is VALID [2022-04-15 12:52:42,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {5666#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {5666#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:52:42,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {5666#(< 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; {5666#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:52:42,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {5666#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5666#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:52:42,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {5715#(< 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; {5666#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:52:42,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {5719#(< 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; {5715#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:52:42,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {5723#(< 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; {5719#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:52:42,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {5723#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5723#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:52:42,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {5719#(< 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; {5723#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:52:42,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {5715#(< 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; {5719#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:52:42,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {5599#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; {5715#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:52:42,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {5599#true} ~z~0 := ~y~0; {5599#true} is VALID [2022-04-15 12:52:42,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {5599#true} [114] 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[] {5599#true} is VALID [2022-04-15 12:52:42,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {5599#true} [115] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_28| 0) (= |v_main_#t~post5_Out_28| 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_~x~0_In_15 v_main_~y~0_In_14) (+ v_main_~y~0_Out_28 v_main_~x~0_Out_30))) (and (= v_main_~y~0_In_14 v_main_~y~0_Out_28) (= 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_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_30, main_#t~post6=|v_main_#t~post6_Out_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5599#true} is VALID [2022-04-15 12:52:42,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {5599#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5599#true} is VALID [2022-04-15 12:52:42,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {5599#true} call #t~ret15 := main(); {5599#true} is VALID [2022-04-15 12:52:42,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5599#true} {5599#true} #83#return; {5599#true} is VALID [2022-04-15 12:52:42,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {5599#true} assume true; {5599#true} is VALID [2022-04-15 12:52:42,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {5599#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5599#true} is VALID [2022-04-15 12:52:42,104 INFO L272 TraceCheckUtils]: 0: Hoare triple {5599#true} call ULTIMATE.init(); {5599#true} is VALID [2022-04-15 12:52:42,104 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:52:42,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835936092] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:52:42,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:52:42,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 6] total 20 [2022-04-15 12:52:42,297 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:52:42,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [659554654] [2022-04-15 12:52:42,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [659554654] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:42,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:42,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:52:42,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309396118] [2022-04-15 12:52:42,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:52:42,297 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 12:52:42,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:52:42,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:42,324 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:52:42,324 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:52:42,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:42,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:52:42,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:52:42,325 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:44,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:44,180 INFO L93 Difference]: Finished difference Result 76 states and 105 transitions. [2022-04-15 12:52:44,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 12:52:44,180 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 12:52:44,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:52:44,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:44,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 76 transitions. [2022-04-15 12:52:44,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:44,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 76 transitions. [2022-04-15 12:52:44,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 76 transitions. [2022-04-15 12:52:44,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:44,298 INFO L225 Difference]: With dead ends: 76 [2022-04-15 12:52:44,299 INFO L226 Difference]: Without dead ends: 66 [2022-04-15 12:52:44,299 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=196, Invalid=1286, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:52:44,300 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 55 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:52:44,300 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 53 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:52:44,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-15 12:52:44,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2022-04-15 12:52:44,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:52:44,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 52 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 47 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:44,506 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 52 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 47 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:44,506 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 52 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 47 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:44,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:44,507 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2022-04-15 12:52:44,507 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2022-04-15 12:52:44,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:44,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:44,508 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 47 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-15 12:52:44,508 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 47 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-15 12:52:44,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:44,509 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2022-04-15 12:52:44,509 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2022-04-15 12:52:44,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:44,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:44,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:52:44,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:52:44,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 47 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:44,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-15 12:52:44,511 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 25 [2022-04-15 12:52:44,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:52:44,511 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2022-04-15 12:52:44,511 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:44,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 66 transitions. [2022-04-15 12:52:44,828 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:52:44,829 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-15 12:52:44,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 12:52:44,829 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:52:44,829 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:52:44,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-15 12:52:45,031 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:45,031 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:52:45,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:52:45,032 INFO L85 PathProgramCache]: Analyzing trace with hash -137630238, now seen corresponding path program 3 times [2022-04-15 12:52:45,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:45,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1390768128] [2022-04-15 12:52:45,170 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:52:45,172 INFO L85 PathProgramCache]: Analyzing trace with hash -269680338, now seen corresponding path program 1 times [2022-04-15 12:52:45,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:45,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19673378] [2022-04-15 12:52:45,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:45,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:45,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:52:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:45,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {6206#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6188#true} is VALID [2022-04-15 12:52:45,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {6188#true} assume true; {6188#true} is VALID [2022-04-15 12:52:45,702 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6188#true} {6188#true} #83#return; {6188#true} is VALID [2022-04-15 12:52:45,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {6188#true} call ULTIMATE.init(); {6206#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:52:45,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {6206#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6188#true} is VALID [2022-04-15 12:52:45,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {6188#true} assume true; {6188#true} is VALID [2022-04-15 12:52:45,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6188#true} {6188#true} #83#return; {6188#true} is VALID [2022-04-15 12:52:45,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {6188#true} call #t~ret15 := main(); {6188#true} is VALID [2022-04-15 12:52:45,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {6188#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6193#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:52:45,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {6193#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [117] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~y~0_Out_30 v_main_~x~0_Out_32) (+ v_main_~x~0_In_16 v_main_~y~0_In_15)) (= |v_main_#t~post6_Out_30| 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~post5_Out_30| 0)) (and (= v_main_~x~0_In_16 v_main_~x~0_Out_32) (= v_main_~y~0_In_15 v_main_~y~0_Out_30))) InVars {main_~x~0=v_main_~x~0_In_16, 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_32, main_#t~post6=|v_main_#t~post6_Out_30|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6194#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))))} is VALID [2022-04-15 12:52:45,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {6194#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))))} [116] 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[] {6195#(or (and (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 main_~x~0) main_~n~0)) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} is VALID [2022-04-15 12:52:45,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {6195#(or (and (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 main_~x~0) main_~n~0)) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} ~z~0 := ~y~0; {6196#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-15 12:52:45,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {6196#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (+ main_~z~0 main_~x~0) 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; {6197#(and (<= (+ (* (div (+ main_~z~0 main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (div main_~z~0 4294967296) (- 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) main_~n~0))} is VALID [2022-04-15 12:52:45,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {6197#(and (<= (+ (* (div (+ main_~z~0 main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (div main_~z~0 4294967296) (- 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) 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; {6198#(and (or (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ main_~n~0 4294967294 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)))) (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) main_~n~0))} is VALID [2022-04-15 12:52:45,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {6198#(and (or (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ main_~n~0 4294967294 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)))) (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {6199#(and (<= main_~n~0 (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-15 12:52:45,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {6199#(and (<= main_~n~0 (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ main_~x~0 (* (div main_~z~0 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; {6200#(and (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-15 12:52:45,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {6200#(and (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 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; {6200#(and (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-15 12:52:45,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {6200#(and (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0))} assume !(~y~0 % 4294967296 > 0); {6200#(and (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-15 12:52:45,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {6200#(and (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6201#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= (+ (* (div (+ main_~n~0 4294967294 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0 1) main_~n~0))} is VALID [2022-04-15 12:52:45,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {6201#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= (+ (* (div (+ main_~n~0 4294967294 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0 1) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6202#(and (<= (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0) 4294967293) 4294967296) 4294967296) main_~x~0 2) main_~n~0))} is VALID [2022-04-15 12:52:45,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {6202#(and (<= (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0) 4294967293) 4294967296) 4294967296) main_~x~0 2) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {6202#(and (<= (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0) 4294967293) 4294967296) 4294967296) main_~x~0 2) main_~n~0))} is VALID [2022-04-15 12:52:45,742 INFO L290 TraceCheckUtils]: 18: Hoare triple {6202#(and (<= (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0) 4294967293) 4294967296) 4294967296) main_~x~0 2) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6201#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= (+ (* (div (+ main_~n~0 4294967294 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0 1) main_~n~0))} is VALID [2022-04-15 12:52:45,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {6201#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= (+ (* (div (+ main_~n~0 4294967294 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6203#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:52:45,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {6203#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {6203#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:52:45,745 INFO L272 TraceCheckUtils]: 21: Hoare triple {6203#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6204#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:52:45,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {6204#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6205#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:52:45,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {6205#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6189#false} is VALID [2022-04-15 12:52:45,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {6189#false} assume !false; {6189#false} is VALID [2022-04-15 12:52:45,746 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:52:45,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:52:45,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19673378] [2022-04-15 12:52:45,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19673378] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:52:45,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256701126] [2022-04-15 12:52:45,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:45,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:45,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:52:45,748 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:52:45,748 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:52:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:45,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-15 12:52:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:45,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:53:18,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {6188#true} call ULTIMATE.init(); {6188#true} is VALID [2022-04-15 12:53:18,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {6188#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6188#true} is VALID [2022-04-15 12:53:18,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {6188#true} assume true; {6188#true} is VALID [2022-04-15 12:53:18,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6188#true} {6188#true} #83#return; {6188#true} is VALID [2022-04-15 12:53:18,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {6188#true} call #t~ret15 := main(); {6188#true} is VALID [2022-04-15 12:53:18,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {6188#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6193#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:53:18,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {6193#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [117] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~y~0_Out_30 v_main_~x~0_Out_32) (+ v_main_~x~0_In_16 v_main_~y~0_In_15)) (= |v_main_#t~post6_Out_30| 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~post5_Out_30| 0)) (and (= v_main_~x~0_In_16 v_main_~x~0_Out_32) (= v_main_~y~0_In_15 v_main_~y~0_Out_30))) InVars {main_~x~0=v_main_~x~0_In_16, 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_32, main_#t~post6=|v_main_#t~post6_Out_30|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6228#(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:53:18,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {6228#(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)))} [116] 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[] {6232#(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:53:18,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {6232#(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; {6236#(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:53:18,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {6236#(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; {6240#(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)))} is VALID [2022-04-15 12:53:18,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {6240#(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)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6244#(and (<= 0 main_~y~0) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= main_~y~0 (+ main_~z~0 2)) (= (+ main_~n~0 2 (* (- 1) main_~y~0)) main_~x~0))} is VALID [2022-04-15 12:53:18,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {6244#(and (<= 0 main_~y~0) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= main_~y~0 (+ main_~z~0 2)) (= (+ main_~n~0 2 (* (- 1) main_~y~0)) main_~x~0))} assume !(~z~0 % 4294967296 > 0); {6244#(and (<= 0 main_~y~0) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= main_~y~0 (+ main_~z~0 2)) (= (+ main_~n~0 2 (* (- 1) main_~y~0)) main_~x~0))} is VALID [2022-04-15 12:53:18,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {6244#(and (<= 0 main_~y~0) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= main_~y~0 (+ main_~z~0 2)) (= (+ main_~n~0 2 (* (- 1) 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; {6251#(and (= (+ main_~n~0 (* (- 1) main_~y~0) 1) main_~x~0) (= main_~z~0 main_~y~0) (not (< 0 (mod (+ main_~n~0 4294967295 (* main_~y~0 4294967295)) 4294967296))) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-15 12:53:18,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {6251#(and (= (+ main_~n~0 (* (- 1) main_~y~0) 1) main_~x~0) (= main_~z~0 main_~y~0) (not (< 0 (mod (+ main_~n~0 4294967295 (* main_~y~0 4294967295)) 4294967296))) (<= 0 (+ main_~y~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6255#(and (= main_~z~0 (+ main_~n~0 2 (* (- 1) main_~x~0))) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~y~0 1)) (<= main_~x~0 (+ main_~n~0 2)))} is VALID [2022-04-15 12:53:18,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {6255#(and (= main_~z~0 (+ main_~n~0 2 (* (- 1) main_~x~0))) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~y~0 1)) (<= main_~x~0 (+ main_~n~0 2)))} assume !(~y~0 % 4294967296 > 0); {6259#(and (= main_~z~0 (+ main_~n~0 2 (* (- 1) main_~x~0))) (not (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~x~0 (+ main_~n~0 2)))} is VALID [2022-04-15 12:53:18,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {6259#(and (= main_~z~0 (+ main_~n~0 2 (* (- 1) main_~x~0))) (not (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= 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; {6263#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (= (+ main_~z~0 main_~x~0) (+ main_~n~0 1)) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= 0 main_~z~0))} is VALID [2022-04-15 12:53:18,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {6263#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (= (+ main_~z~0 main_~x~0) (+ main_~n~0 1)) (<= (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; {6267#(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:53:18,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {6267#(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); {6267#(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:53:18,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {6267#(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 !!(~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; {6274#(and (<= 0 (+ main_~z~0 1)) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (<= (mod (+ main_~n~0 4294967295 (* main_~z~0 4294967295)) 4294967296) 0) (= main_~n~0 (+ main_~z~0 main_~x~0)))} is VALID [2022-04-15 12:53:18,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {6274#(and (<= 0 (+ main_~z~0 1)) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (<= (mod (+ main_~n~0 4294967295 (* main_~z~0 4294967295)) 4294967296) 0) (= main_~n~0 (+ main_~z~0 main_~x~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; {6278#(and (<= 0 (+ main_~z~0 2)) (<= (mod (+ main_~n~0 4294967294 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod main_~z~0 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~z~0)) main_~x~0))} is VALID [2022-04-15 12:53:18,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {6278#(and (<= 0 (+ main_~z~0 2)) (<= (mod (+ main_~n~0 4294967294 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod main_~z~0 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~z~0)) main_~x~0))} assume !(~z~0 % 4294967296 > 0); {6282#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 2)))} is VALID [2022-04-15 12:53:18,872 INFO L272 TraceCheckUtils]: 21: Hoare triple {6282#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 2)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6286#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:53:18,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {6286#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6290#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:53:18,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {6290#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6189#false} is VALID [2022-04-15 12:53:18,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {6189#false} assume !false; {6189#false} is VALID [2022-04-15 12:53:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:53:18,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:53:28,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {6189#false} assume !false; {6189#false} is VALID [2022-04-15 12:53:28,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {6290#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6189#false} is VALID [2022-04-15 12:53:28,981 INFO L290 TraceCheckUtils]: 22: Hoare triple {6286#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6290#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:53:28,982 INFO L272 TraceCheckUtils]: 21: Hoare triple {6203#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6286#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:53:28,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {6309#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6203#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:53:28,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {6313#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 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; {6309#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 12:53:28,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {6317#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6313#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:53:28,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {6317#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))))} assume !(~x~0 % 4294967296 > 0); {6317#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-15 12:53:28,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {6324#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~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; {6317#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-15 12:53:28,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {6328#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod 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; {6324#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:53:28,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {6332#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod main_~x~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6328#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-15 12:53:28,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {6336#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~x~0 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6332#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod main_~x~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:53:28,997 INFO L290 TraceCheckUtils]: 12: Hoare triple {6340#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod main_~x~0 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6336#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~x~0 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:53:28,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {6340#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod main_~x~0 4294967296))))} assume !(~z~0 % 4294967296 > 0); {6340#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-15 12:53:29,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {6347#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~x~0 1) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 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; {6340#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-15 12:53:29,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {6351#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~x~0 2) 4294967296))) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~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; {6347#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~x~0 1) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:53:29,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {6355#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))) (<= (mod (+ main_~x~0 2) 4294967296) 0))} ~z~0 := ~y~0; {6351#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~x~0 2) 4294967296))) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-15 12:53:29,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {6359#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)))} [116] 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[] {6355#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))) (<= (mod (+ main_~x~0 2) 4294967296) 0))} is VALID [2022-04-15 12:53:29,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {6363#(and (or (< (+ (div (+ (* (- 1) main_~x~0) (- 4294967297) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ 2 (* (- 1) main_~n~0)) (- 4294967296))) (+ (div main_~n~0 4294967296) 3 (div (+ main_~y~0 main_~x~0 4294967293) 4294967296))) (<= (div (+ (* (- 1) main_~x~0) (- 4294967295) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 main_~x~0) 4294967296) 1))) (<= (+ (div (+ main_~n~0 (* (- 1) main_~x~0) (- 4294967296) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (* (- 1) main_~x~0) (- 4294967295) (* (- 1) main_~y~0)) (- 4294967296)) (div main_~n~0 4294967296)) (+ 3 (div (+ main_~y~0 main_~x~0) 4294967296) (div (+ main_~y~0 main_~x~0 4294967293) 4294967296))))} [117] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~y~0_Out_30 v_main_~x~0_Out_32) (+ v_main_~x~0_In_16 v_main_~y~0_In_15)) (= |v_main_#t~post6_Out_30| 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~post5_Out_30| 0)) (and (= v_main_~x~0_In_16 v_main_~x~0_Out_32) (= v_main_~y~0_In_15 v_main_~y~0_Out_30))) InVars {main_~x~0=v_main_~x~0_In_16, 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_32, main_#t~post6=|v_main_#t~post6_Out_30|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6359#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:53:29,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {6188#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6363#(and (or (< (+ (div (+ (* (- 1) main_~x~0) (- 4294967297) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ 2 (* (- 1) main_~n~0)) (- 4294967296))) (+ (div main_~n~0 4294967296) 3 (div (+ main_~y~0 main_~x~0 4294967293) 4294967296))) (<= (div (+ (* (- 1) main_~x~0) (- 4294967295) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 main_~x~0) 4294967296) 1))) (<= (+ (div (+ main_~n~0 (* (- 1) main_~x~0) (- 4294967296) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (* (- 1) main_~x~0) (- 4294967295) (* (- 1) main_~y~0)) (- 4294967296)) (div main_~n~0 4294967296)) (+ 3 (div (+ main_~y~0 main_~x~0) 4294967296) (div (+ main_~y~0 main_~x~0 4294967293) 4294967296))))} is VALID [2022-04-15 12:53:29,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {6188#true} call #t~ret15 := main(); {6188#true} is VALID [2022-04-15 12:53:29,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6188#true} {6188#true} #83#return; {6188#true} is VALID [2022-04-15 12:53:29,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {6188#true} assume true; {6188#true} is VALID [2022-04-15 12:53:29,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {6188#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6188#true} is VALID [2022-04-15 12:53:29,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {6188#true} call ULTIMATE.init(); {6188#true} is VALID [2022-04-15 12:53:29,560 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:53:29,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256701126] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:53:29,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:53:29,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 44 [2022-04-15 12:53:29,972 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:53:29,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1390768128] [2022-04-15 12:53:29,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1390768128] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:53:29,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:53:29,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 12:53:29,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950718048] [2022-04-15 12:53:29,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:53:29,972 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 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:53:29,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:53:29,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 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:53:30,041 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:53:30,041 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 12:53:30,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:53:30,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 12:53:30,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=1822, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 12:53:30,042 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 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:53:33,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:33,035 INFO L93 Difference]: Finished difference Result 79 states and 102 transitions. [2022-04-15 12:53:33,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 12:53:33,035 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 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:53:33,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:53:33,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 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:53:33,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 50 transitions. [2022-04-15 12:53:33,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 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:53:33,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 50 transitions. [2022-04-15 12:53:33,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 50 transitions. [2022-04-15 12:53:33,167 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:53:33,168 INFO L225 Difference]: With dead ends: 79 [2022-04-15 12:53:33,168 INFO L226 Difference]: Without dead ends: 68 [2022-04-15 12:53:33,169 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=522, Invalid=3138, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 12:53:33,170 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:53:33,170 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 77 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 12:53:33,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-15 12:53:33,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 56. [2022-04-15 12:53:33,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:53:33,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 56 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 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:53:33,464 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 56 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 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:53:33,464 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 56 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 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:53:33,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:33,466 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2022-04-15 12:53:33,466 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2022-04-15 12:53:33,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:53:33,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:53:33,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 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 68 states. [2022-04-15 12:53:33,466 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 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 68 states. [2022-04-15 12:53:33,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:33,468 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2022-04-15 12:53:33,468 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2022-04-15 12:53:33,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:53:33,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:53:33,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:53:33,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:53:33,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 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:53:33,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-15 12:53:33,469 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 26 [2022-04-15 12:53:33,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:53:33,469 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-04-15 12:53:33,470 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 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:53:33,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 70 transitions. [2022-04-15 12:53:34,418 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:53:34,419 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-15 12:53:34,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 12:53:34,419 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:53:34,419 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:53:34,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 12:53:34,619 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,SelfDestructingSolverStorable19 [2022-04-15 12:53:34,620 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:53:34,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:53:34,620 INFO L85 PathProgramCache]: Analyzing trace with hash 62925025, now seen corresponding path program 4 times [2022-04-15 12:53:34,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:53:34,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [829935801] [2022-04-15 12:53:34,763 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:53:34,765 INFO L85 PathProgramCache]: Analyzing trace with hash 2052714325, now seen corresponding path program 1 times [2022-04-15 12:53:34,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:53:34,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524575170] [2022-04-15 12:53:34,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:53:34,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:53:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:34,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:53:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:34,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {6829#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6821#true} is VALID [2022-04-15 12:53:34,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-15 12:53:34,849 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6821#true} {6821#true} #83#return; {6821#true} is VALID [2022-04-15 12:53:34,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {6821#true} call ULTIMATE.init(); {6829#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:53:34,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {6829#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6821#true} is VALID [2022-04-15 12:53:34,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-15 12:53:34,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6821#true} {6821#true} #83#return; {6821#true} is VALID [2022-04-15 12:53:34,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {6821#true} call #t~ret15 := main(); {6821#true} is VALID [2022-04-15 12:53:34,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {6821#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6821#true} is VALID [2022-04-15 12:53:34,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {6821#true} [119] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_32| 0) (= (+ v_main_~x~0_In_17 v_main_~y~0_In_16) (+ v_main_~y~0_Out_32 v_main_~x~0_Out_34)) (= |v_main_#t~post6_Out_32| 0) (< 0 (mod (+ v_main_~x~0_Out_34 1) 4294967296)) (<= v_main_~x~0_Out_34 v_main_~x~0_In_17)) (and (= v_main_~y~0_In_16 v_main_~y~0_Out_32) (= v_main_~x~0_In_17 v_main_~x~0_Out_34))) InVars {main_~x~0=v_main_~x~0_In_17, 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_34, main_#t~post6=|v_main_#t~post6_Out_32|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6821#true} is VALID [2022-04-15 12:53:34,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {6821#true} [118] 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[] {6821#true} is VALID [2022-04-15 12:53:34,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {6821#true} ~z~0 := ~y~0; {6821#true} is VALID [2022-04-15 12:53:34,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {6821#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; {6821#true} is VALID [2022-04-15 12:53:34,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {6821#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; {6821#true} is VALID [2022-04-15 12:53:34,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {6821#true} assume !(~z~0 % 4294967296 > 0); {6826#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:53:34,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {6826#(<= 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; {6827#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:53:34,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {6827#(<= 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; {6828#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:53:34,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {6828#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~y~0 % 4294967296 > 0); {6828#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:53:34,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {6828#(<= 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; {6828#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:53:34,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {6828#(<= 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; {6828#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:53:34,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {6828#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~x~0 % 4294967296 > 0); {6828#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:53:34,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {6828#(<= 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; {6827#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:53:34,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {6827#(<= 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; {6826#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:53:34,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {6826#(<= 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; {6822#false} is VALID [2022-04-15 12:53:34,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {6822#false} assume !(~z~0 % 4294967296 > 0); {6822#false} is VALID [2022-04-15 12:53:34,863 INFO L272 TraceCheckUtils]: 22: Hoare triple {6822#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6822#false} is VALID [2022-04-15 12:53:34,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {6822#false} ~cond := #in~cond; {6822#false} is VALID [2022-04-15 12:53:34,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {6822#false} assume 0 == ~cond; {6822#false} is VALID [2022-04-15 12:53:34,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {6822#false} assume !false; {6822#false} is VALID [2022-04-15 12:53:34,863 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:53:34,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:53:34,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524575170] [2022-04-15 12:53:34,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524575170] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:53:34,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699530296] [2022-04-15 12:53:34,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:53:34,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:53:34,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:53:34,868 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:53:34,872 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:53:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:34,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 12:53:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:34,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:53:35,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {6821#true} call ULTIMATE.init(); {6821#true} is VALID [2022-04-15 12:53:35,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {6821#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6821#true} is VALID [2022-04-15 12:53:35,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-15 12:53:35,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6821#true} {6821#true} #83#return; {6821#true} is VALID [2022-04-15 12:53:35,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {6821#true} call #t~ret15 := main(); {6821#true} is VALID [2022-04-15 12:53:35,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {6821#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6821#true} is VALID [2022-04-15 12:53:35,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {6821#true} [119] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_32| 0) (= (+ v_main_~x~0_In_17 v_main_~y~0_In_16) (+ v_main_~y~0_Out_32 v_main_~x~0_Out_34)) (= |v_main_#t~post6_Out_32| 0) (< 0 (mod (+ v_main_~x~0_Out_34 1) 4294967296)) (<= v_main_~x~0_Out_34 v_main_~x~0_In_17)) (and (= v_main_~y~0_In_16 v_main_~y~0_Out_32) (= v_main_~x~0_In_17 v_main_~x~0_Out_34))) InVars {main_~x~0=v_main_~x~0_In_17, 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_34, main_#t~post6=|v_main_#t~post6_Out_32|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6821#true} is VALID [2022-04-15 12:53:35,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {6821#true} [118] 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[] {6821#true} is VALID [2022-04-15 12:53:35,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {6821#true} ~z~0 := ~y~0; {6857#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:53:35,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {6857#(= 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; {6861#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 12:53:35,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {6861#(= 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; {6865#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-15 12:53:35,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {6865#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {6865#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-15 12:53:35,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {6865#(= (+ main_~z~0 1) (+ (- 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; {6857#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:53:35,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {6857#(= 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; {6875#(= (+ main_~y~0 2) main_~z~0)} is VALID [2022-04-15 12:53:35,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {6875#(= (+ main_~y~0 2) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {6828#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:53:35,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {6828#(<= 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; {6828#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:53:35,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {6828#(<= 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; {6828#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:53:35,255 INFO L290 TraceCheckUtils]: 17: Hoare triple {6828#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~x~0 % 4294967296 > 0); {6828#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:53:35,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {6828#(<= 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; {6827#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:53:35,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {6827#(<= 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; {6826#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:53:35,260 INFO L290 TraceCheckUtils]: 20: Hoare triple {6826#(<= 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; {6822#false} is VALID [2022-04-15 12:53:35,260 INFO L290 TraceCheckUtils]: 21: Hoare triple {6822#false} assume !(~z~0 % 4294967296 > 0); {6822#false} is VALID [2022-04-15 12:53:35,260 INFO L272 TraceCheckUtils]: 22: Hoare triple {6822#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6822#false} is VALID [2022-04-15 12:53:35,260 INFO L290 TraceCheckUtils]: 23: Hoare triple {6822#false} ~cond := #in~cond; {6822#false} is VALID [2022-04-15 12:53:35,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {6822#false} assume 0 == ~cond; {6822#false} is VALID [2022-04-15 12:53:35,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {6822#false} assume !false; {6822#false} is VALID [2022-04-15 12:53:35,260 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:53:35,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:53:35,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {6822#false} assume !false; {6822#false} is VALID [2022-04-15 12:53:35,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {6822#false} assume 0 == ~cond; {6822#false} is VALID [2022-04-15 12:53:35,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {6822#false} ~cond := #in~cond; {6822#false} is VALID [2022-04-15 12:53:35,675 INFO L272 TraceCheckUtils]: 22: Hoare triple {6822#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6822#false} is VALID [2022-04-15 12:53:35,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {6822#false} assume !(~z~0 % 4294967296 > 0); {6822#false} is VALID [2022-04-15 12:53:35,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {6826#(<= 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; {6822#false} is VALID [2022-04-15 12:53:35,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {6827#(<= 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; {6826#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:53:35,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {6828#(<= 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; {6827#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:53:35,681 INFO L290 TraceCheckUtils]: 17: Hoare triple {6828#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~x~0 % 4294967296 > 0); {6828#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:53:35,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {6828#(<= 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; {6828#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:53:35,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {6828#(<= 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; {6828#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:53:35,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {6945#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6828#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:53:35,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {6949#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)) (< 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; {6945#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:53:35,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {6953#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= 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; {6949#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:53:35,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {6953#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6953#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:35,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {6960#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~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; {6953#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:35,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {6964#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6960#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)))} is VALID [2022-04-15 12:53:35,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {6821#true} ~z~0 := ~y~0; {6964#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-15 12:53:35,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {6821#true} [118] 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[] {6821#true} is VALID [2022-04-15 12:53:35,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {6821#true} [119] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_32| 0) (= (+ v_main_~x~0_In_17 v_main_~y~0_In_16) (+ v_main_~y~0_Out_32 v_main_~x~0_Out_34)) (= |v_main_#t~post6_Out_32| 0) (< 0 (mod (+ v_main_~x~0_Out_34 1) 4294967296)) (<= v_main_~x~0_Out_34 v_main_~x~0_In_17)) (and (= v_main_~y~0_In_16 v_main_~y~0_Out_32) (= v_main_~x~0_In_17 v_main_~x~0_Out_34))) InVars {main_~x~0=v_main_~x~0_In_17, 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_34, main_#t~post6=|v_main_#t~post6_Out_32|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6821#true} is VALID [2022-04-15 12:53:35,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {6821#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6821#true} is VALID [2022-04-15 12:53:35,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {6821#true} call #t~ret15 := main(); {6821#true} is VALID [2022-04-15 12:53:35,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6821#true} {6821#true} #83#return; {6821#true} is VALID [2022-04-15 12:53:35,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-15 12:53:35,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {6821#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6821#true} is VALID [2022-04-15 12:53:35,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {6821#true} call ULTIMATE.init(); {6821#true} is VALID [2022-04-15 12:53:35,692 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:53:35,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699530296] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:53:35,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:53:35,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 10] total 15 [2022-04-15 12:53:35,767 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:53:35,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [829935801] [2022-04-15 12:53:35,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [829935801] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:53:35,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:53:35,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:53:35,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63339373] [2022-04-15 12:53:35,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:53:35,768 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 12:53:35,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:53:35,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:35,800 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:53:35,800 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:53:35,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:53:35,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:53:35,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:53:35,801 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:36,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:36,913 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2022-04-15 12:53:36,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:53:36,914 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 12:53:36,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:53:36,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:36,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 51 transitions. [2022-04-15 12:53:36,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:36,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 51 transitions. [2022-04-15 12:53:36,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 51 transitions. [2022-04-15 12:53:37,004 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:53:37,005 INFO L225 Difference]: With dead ends: 70 [2022-04-15 12:53:37,005 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 12:53:37,005 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2022-04-15 12:53:37,006 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 33 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:53:37,006 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 38 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:53:37,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 12:53:37,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2022-04-15 12:53:37,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:53:37,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:37,286 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:37,286 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:37,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:37,287 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-15 12:53:37,287 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-15 12:53:37,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:53:37,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:53:37,287 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-15 12:53:37,288 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-15 12:53:37,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:37,289 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-15 12:53:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-15 12:53:37,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:53:37,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:53:37,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:53:37,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:53:37,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2022-04-15 12:53:37,290 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 27 [2022-04-15 12:53:37,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:53:37,291 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2022-04-15 12:53:37,291 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:37,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 63 transitions. [2022-04-15 12:53:37,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:53:37,941 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-04-15 12:53:37,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 12:53:37,941 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:53:37,941 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:53:37,957 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:53:38,141 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:53:38,142 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:53:38,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:53:38,142 INFO L85 PathProgramCache]: Analyzing trace with hash -690945345, now seen corresponding path program 7 times [2022-04-15 12:53:38,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:53:38,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [794944884] [2022-04-15 12:53:38,287 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:53:38,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1207748237, now seen corresponding path program 1 times [2022-04-15 12:53:38,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:53:38,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013223702] [2022-04-15 12:53:38,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:53:38,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:53:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:38,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:53:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:38,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {7381#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7370#true} is VALID [2022-04-15 12:53:38,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {7370#true} assume true; {7370#true} is VALID [2022-04-15 12:53:38,412 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7370#true} {7370#true} #83#return; {7370#true} is VALID [2022-04-15 12:53:38,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {7370#true} call ULTIMATE.init(); {7381#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:53:38,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {7381#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7370#true} is VALID [2022-04-15 12:53:38,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {7370#true} assume true; {7370#true} is VALID [2022-04-15 12:53:38,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7370#true} {7370#true} #83#return; {7370#true} is VALID [2022-04-15 12:53:38,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {7370#true} call #t~ret15 := main(); {7370#true} is VALID [2022-04-15 12:53:38,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {7370#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7370#true} is VALID [2022-04-15 12:53:38,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {7370#true} [121] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_18 v_main_~x~0_Out_36) (= v_main_~y~0_In_17 v_main_~y~0_Out_34)) (and (<= 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_34| 0) (= (+ v_main_~x~0_In_18 v_main_~y~0_In_17) (+ v_main_~y~0_Out_34 v_main_~x~0_Out_36)) (= |v_main_#t~post5_Out_34| 0))) InVars {main_~x~0=v_main_~x~0_In_18, 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_36, main_#t~post6=|v_main_#t~post6_Out_34|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7370#true} is VALID [2022-04-15 12:53:38,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {7370#true} [120] 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[] {7370#true} is VALID [2022-04-15 12:53:38,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {7370#true} ~z~0 := ~y~0; {7370#true} is VALID [2022-04-15 12:53:38,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {7370#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; {7375#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:38,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {7375#(<= main_~z~0 (+ 4294967294 (* (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; {7376#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:53:38,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {7376#(<= 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; {7377#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:38,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {7377#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7377#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:38,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {7377#(<= 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; {7378#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 4294967293))} is VALID [2022-04-15 12:53:38,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {7378#(<= 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; {7379#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967294))} is VALID [2022-04-15 12:53:38,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {7379#(<= 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; {7380#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:53:38,428 INFO L290 TraceCheckUtils]: 16: Hoare triple {7380#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {7380#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:53:38,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {7380#(<= (+ 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; {7380#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:53:38,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {7380#(<= (+ 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; {7380#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:53:38,429 INFO L290 TraceCheckUtils]: 19: Hoare triple {7380#(<= (+ 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; {7380#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:53:38,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {7380#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {7380#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:53:38,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {7380#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {7371#false} is VALID [2022-04-15 12:53:38,431 INFO L272 TraceCheckUtils]: 22: Hoare triple {7371#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7371#false} is VALID [2022-04-15 12:53:38,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {7371#false} ~cond := #in~cond; {7371#false} is VALID [2022-04-15 12:53:38,432 INFO L290 TraceCheckUtils]: 24: Hoare triple {7371#false} assume 0 == ~cond; {7371#false} is VALID [2022-04-15 12:53:38,432 INFO L290 TraceCheckUtils]: 25: Hoare triple {7371#false} assume !false; {7371#false} is VALID [2022-04-15 12:53:38,432 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:53:38,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:53:38,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013223702] [2022-04-15 12:53:38,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013223702] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:53:38,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089301409] [2022-04-15 12:53:38,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:53:38,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:53:38,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:53:38,436 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:53:38,459 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:53:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:38,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 12:53:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:38,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:53:38,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {7370#true} call ULTIMATE.init(); {7370#true} is VALID [2022-04-15 12:53:38,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {7370#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7370#true} is VALID [2022-04-15 12:53:38,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {7370#true} assume true; {7370#true} is VALID [2022-04-15 12:53:38,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7370#true} {7370#true} #83#return; {7370#true} is VALID [2022-04-15 12:53:38,834 INFO L272 TraceCheckUtils]: 4: Hoare triple {7370#true} call #t~ret15 := main(); {7370#true} is VALID [2022-04-15 12:53:38,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {7370#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7370#true} is VALID [2022-04-15 12:53:38,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {7370#true} [121] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_18 v_main_~x~0_Out_36) (= v_main_~y~0_In_17 v_main_~y~0_Out_34)) (and (<= 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_34| 0) (= (+ v_main_~x~0_In_18 v_main_~y~0_In_17) (+ v_main_~y~0_Out_34 v_main_~x~0_Out_36)) (= |v_main_#t~post5_Out_34| 0))) InVars {main_~x~0=v_main_~x~0_In_18, 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_36, main_#t~post6=|v_main_#t~post6_Out_34|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7370#true} is VALID [2022-04-15 12:53:38,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {7370#true} [120] 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[] {7370#true} is VALID [2022-04-15 12:53:38,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {7370#true} ~z~0 := ~y~0; {7370#true} is VALID [2022-04-15 12:53:38,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {7370#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; {7375#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:38,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {7375#(<= main_~z~0 (+ 4294967294 (* (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; {7415#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:53:38,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {7415#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7419#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:38,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {7419#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7419#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:38,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {7419#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 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; {7415#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:53:38,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {7415#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 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; {7375#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:38,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {7375#(<= 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; {7432#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:53:38,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {7432#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {7432#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:53:38,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {7432#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {7432#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:53:38,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {7432#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {7432#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:53:38,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {7432#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {7432#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:53:38,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {7432#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {7432#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:53:38,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {7432#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {7371#false} is VALID [2022-04-15 12:53:38,854 INFO L272 TraceCheckUtils]: 22: Hoare triple {7371#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7371#false} is VALID [2022-04-15 12:53:38,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {7371#false} ~cond := #in~cond; {7371#false} is VALID [2022-04-15 12:53:38,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {7371#false} assume 0 == ~cond; {7371#false} is VALID [2022-04-15 12:53:38,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {7371#false} assume !false; {7371#false} is VALID [2022-04-15 12:53:38,854 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:53:38,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:53:38,972 INFO L290 TraceCheckUtils]: 25: Hoare triple {7371#false} assume !false; {7371#false} is VALID [2022-04-15 12:53:38,972 INFO L290 TraceCheckUtils]: 24: Hoare triple {7371#false} assume 0 == ~cond; {7371#false} is VALID [2022-04-15 12:53:38,972 INFO L290 TraceCheckUtils]: 23: Hoare triple {7371#false} ~cond := #in~cond; {7371#false} is VALID [2022-04-15 12:53:38,972 INFO L272 TraceCheckUtils]: 22: Hoare triple {7371#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7371#false} is VALID [2022-04-15 12:53:38,974 INFO L290 TraceCheckUtils]: 21: Hoare triple {7432#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {7371#false} is VALID [2022-04-15 12:53:38,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {7432#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {7432#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:53:38,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {7432#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {7432#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:53:38,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {7432#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {7432#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:53:38,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {7432#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {7432#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:53:38,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {7432#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {7432#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:53:38,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {7375#(<= 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; {7432#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:53:38,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {7415#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 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; {7375#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:38,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {7419#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 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; {7415#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:53:38,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {7419#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7419#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:38,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {7415#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7419#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:38,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {7375#(<= main_~z~0 (+ 4294967294 (* (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; {7415#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:53:38,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {7370#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; {7375#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:38,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {7370#true} ~z~0 := ~y~0; {7370#true} is VALID [2022-04-15 12:53:38,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {7370#true} [120] 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[] {7370#true} is VALID [2022-04-15 12:53:38,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {7370#true} [121] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_18 v_main_~x~0_Out_36) (= v_main_~y~0_In_17 v_main_~y~0_Out_34)) (and (<= 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_34| 0) (= (+ v_main_~x~0_In_18 v_main_~y~0_In_17) (+ v_main_~y~0_Out_34 v_main_~x~0_Out_36)) (= |v_main_#t~post5_Out_34| 0))) InVars {main_~x~0=v_main_~x~0_In_18, 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_36, main_#t~post6=|v_main_#t~post6_Out_34|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7370#true} is VALID [2022-04-15 12:53:38,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {7370#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7370#true} is VALID [2022-04-15 12:53:38,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {7370#true} call #t~ret15 := main(); {7370#true} is VALID [2022-04-15 12:53:38,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7370#true} {7370#true} #83#return; {7370#true} is VALID [2022-04-15 12:53:38,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {7370#true} assume true; {7370#true} is VALID [2022-04-15 12:53:38,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {7370#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7370#true} is VALID [2022-04-15 12:53:38,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {7370#true} call ULTIMATE.init(); {7370#true} is VALID [2022-04-15 12:53:38,987 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:53:38,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089301409] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:53:38,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:53:38,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 12 [2022-04-15 12:53:39,046 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:53:39,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [794944884] [2022-04-15 12:53:39,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [794944884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:53:39,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:53:39,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:53:39,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191220666] [2022-04-15 12:53:39,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:53:39,047 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 27 [2022-04-15 12:53:39,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:53:39,047 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:53:39,082 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:53:39,082 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:53:39,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:53:39,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:53:39,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:53:39,083 INFO L87 Difference]: Start difference. First operand 51 states and 63 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:53:40,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:40,790 INFO L93 Difference]: Finished difference Result 77 states and 100 transitions. [2022-04-15 12:53:40,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 12:53:40,790 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 27 [2022-04-15 12:53:40,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:53:40,790 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:53:40,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 62 transitions. [2022-04-15 12:53:40,796 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:53:40,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 62 transitions. [2022-04-15 12:53:40,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 62 transitions. [2022-04-15 12:53:40,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:53:40,925 INFO L225 Difference]: With dead ends: 77 [2022-04-15 12:53:40,925 INFO L226 Difference]: Without dead ends: 72 [2022-04-15 12:53:40,925 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2022-04-15 12:53:40,926 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 34 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:53:40,926 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 55 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:53:40,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-15 12:53:41,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2022-04-15 12:53:41,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:53:41,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 62 states, 57 states have (on average 1.280701754385965) internal successors, (73), 57 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:41,293 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 62 states, 57 states have (on average 1.280701754385965) internal successors, (73), 57 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:41,293 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 62 states, 57 states have (on average 1.280701754385965) internal successors, (73), 57 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:41,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:41,294 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2022-04-15 12:53:41,294 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2022-04-15 12:53:41,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:53:41,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:53:41,295 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 57 states have (on average 1.280701754385965) internal successors, (73), 57 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-15 12:53:41,295 INFO L87 Difference]: Start difference. First operand has 62 states, 57 states have (on average 1.280701754385965) internal successors, (73), 57 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-15 12:53:41,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:41,296 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2022-04-15 12:53:41,296 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2022-04-15 12:53:41,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:53:41,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:53:41,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:53:41,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:53:41,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.280701754385965) internal successors, (73), 57 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:41,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2022-04-15 12:53:41,298 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 27 [2022-04-15 12:53:41,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:53:41,298 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2022-04-15 12:53:41,298 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:53:41,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 77 transitions. [2022-04-15 12:53:42,113 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:53:42,113 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2022-04-15 12:53:42,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 12:53:42,114 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:53:42,114 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:53:42,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-15 12:53:42,314 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:53:42,314 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:53:42,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:53:42,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1703289154, now seen corresponding path program 5 times [2022-04-15 12:53:42,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:53:42,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [296940384] [2022-04-15 12:53:42,469 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:53:42,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1827645234, now seen corresponding path program 1 times [2022-04-15 12:53:42,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:53:42,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261733896] [2022-04-15 12:53:42,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:53:42,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:53:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:42,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:53:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:42,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {8006#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7995#true} is VALID [2022-04-15 12:53:42,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {7995#true} assume true; {7995#true} is VALID [2022-04-15 12:53:42,609 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7995#true} {7995#true} #83#return; {7995#true} is VALID [2022-04-15 12:53:42,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {7995#true} call ULTIMATE.init(); {8006#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:53:42,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {8006#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7995#true} is VALID [2022-04-15 12:53:42,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {7995#true} assume true; {7995#true} is VALID [2022-04-15 12:53:42,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7995#true} {7995#true} #83#return; {7995#true} is VALID [2022-04-15 12:53:42,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {7995#true} call #t~ret15 := main(); {7995#true} is VALID [2022-04-15 12:53:42,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {7995#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7995#true} is VALID [2022-04-15 12:53:42,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {7995#true} [123] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_36| 0) (< 0 (mod (+ v_main_~x~0_Out_38 1) 4294967296)) (= (+ v_main_~x~0_In_19 v_main_~y~0_In_18) (+ v_main_~y~0_Out_36 v_main_~x~0_Out_38)) (= |v_main_#t~post6_Out_36| 0) (<= v_main_~x~0_Out_38 v_main_~x~0_In_19)) (and (= v_main_~x~0_In_19 v_main_~x~0_Out_38) (= v_main_~y~0_In_18 v_main_~y~0_Out_36))) InVars {main_~x~0=v_main_~x~0_In_19, 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_38, main_#t~post6=|v_main_#t~post6_Out_36|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7995#true} is VALID [2022-04-15 12:53:42,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {7995#true} [122] 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[] {7995#true} is VALID [2022-04-15 12:53:42,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {7995#true} ~z~0 := ~y~0; {8000#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:53:42,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {8000#(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; {8001#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:53:42,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {8001#(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; {8002#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:53:42,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {8002#(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; {8003#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:53:42,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {8003#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {8003#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:53:42,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {8003#(<= 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; {8004#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:53:42,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {8004#(<= 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; {8005#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:53:42,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {8005#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {7996#false} is VALID [2022-04-15 12:53:42,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {7996#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; {7996#false} is VALID [2022-04-15 12:53:42,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {7996#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; {7996#false} is VALID [2022-04-15 12:53:42,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {7996#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; {7996#false} is VALID [2022-04-15 12:53:42,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {7996#false} assume !(~x~0 % 4294967296 > 0); {7996#false} is VALID [2022-04-15 12:53:42,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {7996#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7996#false} is VALID [2022-04-15 12:53:42,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {7996#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7996#false} is VALID [2022-04-15 12:53:42,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {7996#false} assume !(~z~0 % 4294967296 > 0); {7996#false} is VALID [2022-04-15 12:53:42,626 INFO L272 TraceCheckUtils]: 23: Hoare triple {7996#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7996#false} is VALID [2022-04-15 12:53:42,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {7996#false} ~cond := #in~cond; {7996#false} is VALID [2022-04-15 12:53:42,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {7996#false} assume 0 == ~cond; {7996#false} is VALID [2022-04-15 12:53:42,626 INFO L290 TraceCheckUtils]: 26: Hoare triple {7996#false} assume !false; {7996#false} is VALID [2022-04-15 12:53:42,626 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 12:53:42,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:53:42,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261733896] [2022-04-15 12:53:42,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261733896] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:53:42,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807572361] [2022-04-15 12:53:42,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:53:42,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:53:42,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:53:42,632 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:53:42,663 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:53:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:42,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:53:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:42,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:53:43,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {7995#true} call ULTIMATE.init(); {7995#true} is VALID [2022-04-15 12:53:43,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {7995#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7995#true} is VALID [2022-04-15 12:53:43,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {7995#true} assume true; {7995#true} is VALID [2022-04-15 12:53:43,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7995#true} {7995#true} #83#return; {7995#true} is VALID [2022-04-15 12:53:43,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {7995#true} call #t~ret15 := main(); {7995#true} is VALID [2022-04-15 12:53:43,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {7995#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7995#true} is VALID [2022-04-15 12:53:43,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {7995#true} [123] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_36| 0) (< 0 (mod (+ v_main_~x~0_Out_38 1) 4294967296)) (= (+ v_main_~x~0_In_19 v_main_~y~0_In_18) (+ v_main_~y~0_Out_36 v_main_~x~0_Out_38)) (= |v_main_#t~post6_Out_36| 0) (<= v_main_~x~0_Out_38 v_main_~x~0_In_19)) (and (= v_main_~x~0_In_19 v_main_~x~0_Out_38) (= v_main_~y~0_In_18 v_main_~y~0_Out_36))) InVars {main_~x~0=v_main_~x~0_In_19, 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_38, main_#t~post6=|v_main_#t~post6_Out_36|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7995#true} is VALID [2022-04-15 12:53:43,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {7995#true} [122] 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[] {7995#true} is VALID [2022-04-15 12:53:43,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {7995#true} ~z~0 := ~y~0; {8000#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:53:43,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {8000#(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; {8001#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:53:43,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {8001#(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; {8002#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:53:43,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {8002#(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; {8003#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:53:43,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {8003#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {8003#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:53:43,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {8003#(<= 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; {8004#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:53:43,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {8004#(<= 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; {8005#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:53:43,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {8005#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {7996#false} is VALID [2022-04-15 12:53:43,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {7996#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; {7996#false} is VALID [2022-04-15 12:53:43,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {7996#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; {7996#false} is VALID [2022-04-15 12:53:43,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {7996#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; {7996#false} is VALID [2022-04-15 12:53:43,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {7996#false} assume !(~x~0 % 4294967296 > 0); {7996#false} is VALID [2022-04-15 12:53:43,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {7996#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7996#false} is VALID [2022-04-15 12:53:43,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {7996#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7996#false} is VALID [2022-04-15 12:53:43,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {7996#false} assume !(~z~0 % 4294967296 > 0); {7996#false} is VALID [2022-04-15 12:53:43,097 INFO L272 TraceCheckUtils]: 23: Hoare triple {7996#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7996#false} is VALID [2022-04-15 12:53:43,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {7996#false} ~cond := #in~cond; {7996#false} is VALID [2022-04-15 12:53:43,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {7996#false} assume 0 == ~cond; {7996#false} is VALID [2022-04-15 12:53:43,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {7996#false} assume !false; {7996#false} is VALID [2022-04-15 12:53:43,097 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 12:53:43,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:53:43,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {7996#false} assume !false; {7996#false} is VALID [2022-04-15 12:53:43,464 INFO L290 TraceCheckUtils]: 25: Hoare triple {7996#false} assume 0 == ~cond; {7996#false} is VALID [2022-04-15 12:53:43,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {7996#false} ~cond := #in~cond; {7996#false} is VALID [2022-04-15 12:53:43,465 INFO L272 TraceCheckUtils]: 23: Hoare triple {7996#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7996#false} is VALID [2022-04-15 12:53:43,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {7996#false} assume !(~z~0 % 4294967296 > 0); {7996#false} is VALID [2022-04-15 12:53:43,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {7996#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7996#false} is VALID [2022-04-15 12:53:43,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {7996#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7996#false} is VALID [2022-04-15 12:53:43,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {7996#false} assume !(~x~0 % 4294967296 > 0); {7996#false} is VALID [2022-04-15 12:53:43,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {7996#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; {7996#false} is VALID [2022-04-15 12:53:43,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {7996#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; {7996#false} is VALID [2022-04-15 12:53:43,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {7996#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; {7996#false} is VALID [2022-04-15 12:53:43,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {8005#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {7996#false} is VALID [2022-04-15 12:53:43,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {8004#(<= 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; {8005#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:53:43,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {8003#(<= 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; {8004#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:53:43,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {8003#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {8003#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:53:43,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {8133#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (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; {8003#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:53:43,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {8137#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8133#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 12:53:43,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {8141#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (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; {8137#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)))} is VALID [2022-04-15 12:53:43,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {7995#true} ~z~0 := ~y~0; {8141#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 12:53:43,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {7995#true} [122] 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[] {7995#true} is VALID [2022-04-15 12:53:43,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {7995#true} [123] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_36| 0) (< 0 (mod (+ v_main_~x~0_Out_38 1) 4294967296)) (= (+ v_main_~x~0_In_19 v_main_~y~0_In_18) (+ v_main_~y~0_Out_36 v_main_~x~0_Out_38)) (= |v_main_#t~post6_Out_36| 0) (<= v_main_~x~0_Out_38 v_main_~x~0_In_19)) (and (= v_main_~x~0_In_19 v_main_~x~0_Out_38) (= v_main_~y~0_In_18 v_main_~y~0_Out_36))) InVars {main_~x~0=v_main_~x~0_In_19, 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_38, main_#t~post6=|v_main_#t~post6_Out_36|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7995#true} is VALID [2022-04-15 12:53:43,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {7995#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7995#true} is VALID [2022-04-15 12:53:43,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {7995#true} call #t~ret15 := main(); {7995#true} is VALID [2022-04-15 12:53:43,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7995#true} {7995#true} #83#return; {7995#true} is VALID [2022-04-15 12:53:43,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {7995#true} assume true; {7995#true} is VALID [2022-04-15 12:53:43,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {7995#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7995#true} is VALID [2022-04-15 12:53:43,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {7995#true} call ULTIMATE.init(); {7995#true} is VALID [2022-04-15 12:53:43,483 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:53:43,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807572361] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:53:43,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:53:43,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-04-15 12:53:43,554 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:53:43,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [296940384] [2022-04-15 12:53:43,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [296940384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:53:43,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:53:43,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:53:43,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922495483] [2022-04-15 12:53:43,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:53:43,555 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 28 [2022-04-15 12:53:43,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:53:43,555 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:53:43,589 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:53:43,590 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:53:43,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:53:43,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:53:43,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:53:43,590 INFO L87 Difference]: Start difference. First operand 62 states and 77 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:53:45,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:45,057 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2022-04-15 12:53:45,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:53:45,057 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 28 [2022-04-15 12:53:45,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:53:45,057 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:53:45,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 46 transitions. [2022-04-15 12:53:45,058 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:53:45,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 46 transitions. [2022-04-15 12:53:45,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 46 transitions. [2022-04-15 12:53:45,158 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:53:45,159 INFO L225 Difference]: With dead ends: 71 [2022-04-15 12:53:45,159 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 12:53:45,159 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:53:45,160 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:53:45,160 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 57 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:53:45,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 12:53:45,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2022-04-15 12:53:45,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:53:45,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:45,448 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:45,448 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:45,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:45,449 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-15 12:53:45,449 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-15 12:53:45,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:53:45,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:53:45,449 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-15 12:53:45,449 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-15 12:53:45,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:45,450 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-15 12:53:45,450 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-15 12:53:45,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:53:45,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:53:45,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:53:45,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:53:45,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:45,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2022-04-15 12:53:45,455 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 28 [2022-04-15 12:53:45,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:53:45,455 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2022-04-15 12:53:45,456 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:53:45,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 63 transitions. [2022-04-15 12:53:46,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:53:46,090 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-04-15 12:53:46,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 12:53:46,090 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:53:46,090 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:53:46,110 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:53:46,295 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-15 12:53:46,295 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:53:46,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:53:46,296 INFO L85 PathProgramCache]: Analyzing trace with hash 453627138, now seen corresponding path program 8 times [2022-04-15 12:53:46,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:53:46,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1709109487] [2022-04-15 12:53:46,404 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:53:46,405 INFO L85 PathProgramCache]: Analyzing trace with hash 822713422, now seen corresponding path program 1 times [2022-04-15 12:53:46,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:53:46,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247715703] [2022-04-15 12:53:46,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:53:46,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:53:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:46,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:53:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:46,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {8562#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8549#true} is VALID [2022-04-15 12:53:46,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {8549#true} assume true; {8549#true} is VALID [2022-04-15 12:53:46,598 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8549#true} {8549#true} #83#return; {8549#true} is VALID [2022-04-15 12:53:46,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {8549#true} call ULTIMATE.init(); {8562#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:53:46,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {8562#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8549#true} is VALID [2022-04-15 12:53:46,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {8549#true} assume true; {8549#true} is VALID [2022-04-15 12:53:46,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8549#true} {8549#true} #83#return; {8549#true} is VALID [2022-04-15 12:53:46,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {8549#true} call #t~ret15 := main(); {8549#true} is VALID [2022-04-15 12:53:46,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {8549#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8549#true} is VALID [2022-04-15 12:53:46,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {8549#true} [125] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_19 v_main_~y~0_Out_38) (= v_main_~x~0_In_20 v_main_~x~0_Out_40)) (and (= |v_main_#t~post5_Out_38| 0) (= (+ v_main_~y~0_Out_38 v_main_~x~0_Out_40) (+ v_main_~x~0_In_20 v_main_~y~0_In_19)) (< 0 (mod (+ v_main_~x~0_Out_40 1) 4294967296)) (= |v_main_#t~post6_Out_38| 0) (<= v_main_~x~0_Out_40 v_main_~x~0_In_20))) InVars {main_~x~0=v_main_~x~0_In_20, 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_40, main_#t~post6=|v_main_#t~post6_Out_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8549#true} is VALID [2022-04-15 12:53:46,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {8549#true} [124] 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[] {8549#true} is VALID [2022-04-15 12:53:46,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {8549#true} ~z~0 := ~y~0; {8554#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:53:46,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {8554#(= (+ 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; {8555#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:53:46,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {8555#(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; {8556#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:53:46,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {8556#(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; {8557#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:53:46,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {8557#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {8558#(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:53:46,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {8558#(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; {8559#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:46,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {8559#(<= 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; {8560#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:53:46,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {8560#(<= 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; {8561#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:53:46,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {8561#(<= 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; {8550#false} is VALID [2022-04-15 12:53:46,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {8550#false} assume !(~y~0 % 4294967296 > 0); {8550#false} is VALID [2022-04-15 12:53:46,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {8550#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; {8550#false} is VALID [2022-04-15 12:53:46,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {8550#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; {8550#false} is VALID [2022-04-15 12:53:46,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {8550#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; {8550#false} is VALID [2022-04-15 12:53:46,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {8550#false} assume !(~x~0 % 4294967296 > 0); {8550#false} is VALID [2022-04-15 12:53:46,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {8550#false} assume !(~z~0 % 4294967296 > 0); {8550#false} is VALID [2022-04-15 12:53:46,614 INFO L272 TraceCheckUtils]: 23: Hoare triple {8550#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8550#false} is VALID [2022-04-15 12:53:46,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {8550#false} ~cond := #in~cond; {8550#false} is VALID [2022-04-15 12:53:46,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {8550#false} assume 0 == ~cond; {8550#false} is VALID [2022-04-15 12:53:46,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {8550#false} assume !false; {8550#false} is VALID [2022-04-15 12:53:46,615 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:53:46,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:53:46,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247715703] [2022-04-15 12:53:46,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247715703] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:53:46,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276474567] [2022-04-15 12:53:46,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:53:46,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:53:46,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:53:46,620 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:53:46,634 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:53:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:46,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 12:53:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:46,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:53:46,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {8549#true} call ULTIMATE.init(); {8549#true} is VALID [2022-04-15 12:53:46,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {8549#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8549#true} is VALID [2022-04-15 12:53:46,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {8549#true} assume true; {8549#true} is VALID [2022-04-15 12:53:46,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8549#true} {8549#true} #83#return; {8549#true} is VALID [2022-04-15 12:53:46,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {8549#true} call #t~ret15 := main(); {8549#true} is VALID [2022-04-15 12:53:46,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {8549#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8549#true} is VALID [2022-04-15 12:53:46,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {8549#true} [125] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_19 v_main_~y~0_Out_38) (= v_main_~x~0_In_20 v_main_~x~0_Out_40)) (and (= |v_main_#t~post5_Out_38| 0) (= (+ v_main_~y~0_Out_38 v_main_~x~0_Out_40) (+ v_main_~x~0_In_20 v_main_~y~0_In_19)) (< 0 (mod (+ v_main_~x~0_Out_40 1) 4294967296)) (= |v_main_#t~post6_Out_38| 0) (<= v_main_~x~0_Out_40 v_main_~x~0_In_20))) InVars {main_~x~0=v_main_~x~0_In_20, 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_40, main_#t~post6=|v_main_#t~post6_Out_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8549#true} is VALID [2022-04-15 12:53:46,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {8549#true} [124] 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[] {8549#true} is VALID [2022-04-15 12:53:46,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {8549#true} ~z~0 := ~y~0; {8554#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:53:46,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {8554#(= (+ 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; {8555#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:53:46,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {8555#(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; {8556#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:53:46,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {8556#(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; {8557#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:53:46,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {8557#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {8602#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296))} is VALID [2022-04-15 12:53:46,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {8602#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ 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; {8559#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:46,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {8559#(<= 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; {8560#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:53:46,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {8560#(<= 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; {8561#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:53:46,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {8561#(<= 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; {8550#false} is VALID [2022-04-15 12:53:46,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {8550#false} assume !(~y~0 % 4294967296 > 0); {8550#false} is VALID [2022-04-15 12:53:46,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {8550#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; {8550#false} is VALID [2022-04-15 12:53:46,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {8550#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; {8550#false} is VALID [2022-04-15 12:53:46,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {8550#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; {8550#false} is VALID [2022-04-15 12:53:46,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {8550#false} assume !(~x~0 % 4294967296 > 0); {8550#false} is VALID [2022-04-15 12:53:46,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {8550#false} assume !(~z~0 % 4294967296 > 0); {8550#false} is VALID [2022-04-15 12:53:46,905 INFO L272 TraceCheckUtils]: 23: Hoare triple {8550#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8550#false} is VALID [2022-04-15 12:53:46,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {8550#false} ~cond := #in~cond; {8550#false} is VALID [2022-04-15 12:53:46,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {8550#false} assume 0 == ~cond; {8550#false} is VALID [2022-04-15 12:53:46,906 INFO L290 TraceCheckUtils]: 26: Hoare triple {8550#false} assume !false; {8550#false} is VALID [2022-04-15 12:53:46,906 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:53:46,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:53:47,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {8550#false} assume !false; {8550#false} is VALID [2022-04-15 12:53:47,536 INFO L290 TraceCheckUtils]: 25: Hoare triple {8550#false} assume 0 == ~cond; {8550#false} is VALID [2022-04-15 12:53:47,536 INFO L290 TraceCheckUtils]: 24: Hoare triple {8550#false} ~cond := #in~cond; {8550#false} is VALID [2022-04-15 12:53:47,536 INFO L272 TraceCheckUtils]: 23: Hoare triple {8550#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8550#false} is VALID [2022-04-15 12:53:47,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {8550#false} assume !(~z~0 % 4294967296 > 0); {8550#false} is VALID [2022-04-15 12:53:47,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {8550#false} assume !(~x~0 % 4294967296 > 0); {8550#false} is VALID [2022-04-15 12:53:47,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {8550#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; {8550#false} is VALID [2022-04-15 12:53:47,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {8550#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; {8550#false} is VALID [2022-04-15 12:53:47,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {8550#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; {8550#false} is VALID [2022-04-15 12:53:47,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {8550#false} assume !(~y~0 % 4294967296 > 0); {8550#false} is VALID [2022-04-15 12:53:47,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {8561#(<= 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; {8550#false} is VALID [2022-04-15 12:53:47,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {8560#(<= 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; {8561#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:53:47,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {8559#(<= 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; {8560#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:53:47,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {8602#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ 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; {8559#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:47,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {8687#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8602#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296))} is VALID [2022-04-15 12:53:47,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {8691#(or (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 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; {8687#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)))} is VALID [2022-04-15 12:53:47,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {8695#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~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; {8691#(or (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:53:47,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {8699#(or (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)) (< 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; {8695#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)))} is VALID [2022-04-15 12:53:47,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {8549#true} ~z~0 := ~y~0; {8699#(or (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:53:47,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {8549#true} [124] 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[] {8549#true} is VALID [2022-04-15 12:53:47,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {8549#true} [125] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_19 v_main_~y~0_Out_38) (= v_main_~x~0_In_20 v_main_~x~0_Out_40)) (and (= |v_main_#t~post5_Out_38| 0) (= (+ v_main_~y~0_Out_38 v_main_~x~0_Out_40) (+ v_main_~x~0_In_20 v_main_~y~0_In_19)) (< 0 (mod (+ v_main_~x~0_Out_40 1) 4294967296)) (= |v_main_#t~post6_Out_38| 0) (<= v_main_~x~0_Out_40 v_main_~x~0_In_20))) InVars {main_~x~0=v_main_~x~0_In_20, 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_40, main_#t~post6=|v_main_#t~post6_Out_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8549#true} is VALID [2022-04-15 12:53:47,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {8549#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8549#true} is VALID [2022-04-15 12:53:47,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {8549#true} call #t~ret15 := main(); {8549#true} is VALID [2022-04-15 12:53:47,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8549#true} {8549#true} #83#return; {8549#true} is VALID [2022-04-15 12:53:47,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {8549#true} assume true; {8549#true} is VALID [2022-04-15 12:53:47,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {8549#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8549#true} is VALID [2022-04-15 12:53:47,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {8549#true} call ULTIMATE.init(); {8549#true} is VALID [2022-04-15 12:53:47,557 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:53:47,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276474567] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:53:47,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:53:47,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2022-04-15 12:53:47,647 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:53:47,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1709109487] [2022-04-15 12:53:47,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1709109487] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:53:47,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:53:47,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 12:53:47,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362196258] [2022-04-15 12:53:47,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:53:47,648 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 28 [2022-04-15 12:53:47,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:53:47,648 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:53:47,683 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:53:47,683 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 12:53:47,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:53:47,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 12:53:47,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:53:47,684 INFO L87 Difference]: Start difference. First operand 51 states and 63 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:53:50,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:50,011 INFO L93 Difference]: Finished difference Result 101 states and 128 transitions. [2022-04-15 12:53:50,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 12:53:50,011 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 28 [2022-04-15 12:53:50,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:53:50,012 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:53:50,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 70 transitions. [2022-04-15 12:53:50,013 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:53:50,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 70 transitions. [2022-04-15 12:53:50,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 70 transitions. [2022-04-15 12:53:50,179 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:53:50,180 INFO L225 Difference]: With dead ends: 101 [2022-04-15 12:53:50,180 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 12:53:50,180 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 59 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=179, Invalid=1011, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 12:53:50,181 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:53:50,181 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 63 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:53:50,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 12:53:50,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2022-04-15 12:53:50,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:53:50,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 47 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:50,444 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 47 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:50,444 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 47 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:50,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:50,445 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-15 12:53:50,446 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-15 12:53:50,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:53:50,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:53:50,446 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-15 12:53:50,446 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-15 12:53:50,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:50,447 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-15 12:53:50,447 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-15 12:53:50,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:53:50,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:53:50,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:53:50,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:53:50,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:50,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2022-04-15 12:53:50,449 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 28 [2022-04-15 12:53:50,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:53:50,449 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2022-04-15 12:53:50,449 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:53:50,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 57 transitions. [2022-04-15 12:53:51,100 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 12:53:51,100 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-04-15 12:53:51,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 12:53:51,101 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:53:51,101 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:53:51,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-15 12:53:51,301 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:53:51,301 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:53:51,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:53:51,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1646269137, now seen corresponding path program 9 times [2022-04-15 12:53:51,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:53:51,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [273789799] [2022-04-15 12:53:51,450 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:53:51,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1240724818, now seen corresponding path program 1 times [2022-04-15 12:53:51,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:53:51,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764234652] [2022-04-15 12:53:51,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:53:51,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:53:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:51,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:53:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:51,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {9196#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9182#true} is VALID [2022-04-15 12:53:51,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {9182#true} assume true; {9182#true} is VALID [2022-04-15 12:53:51,677 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9182#true} {9182#true} #83#return; {9182#true} is VALID [2022-04-15 12:53:51,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {9182#true} call ULTIMATE.init(); {9196#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:53:51,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {9196#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9182#true} is VALID [2022-04-15 12:53:51,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {9182#true} assume true; {9182#true} is VALID [2022-04-15 12:53:51,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9182#true} {9182#true} #83#return; {9182#true} is VALID [2022-04-15 12:53:51,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {9182#true} call #t~ret15 := main(); {9182#true} is VALID [2022-04-15 12:53:51,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {9182#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9187#(= main_~y~0 0)} is VALID [2022-04-15 12:53:51,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {9187#(= main_~y~0 0)} [127] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_40| 0) (<= v_main_~x~0_Out_42 v_main_~x~0_In_21) (= (+ v_main_~x~0_In_21 v_main_~y~0_In_20) (+ v_main_~y~0_Out_40 v_main_~x~0_Out_42)) (= |v_main_#t~post6_Out_40| 0) (< 0 (mod (+ v_main_~x~0_Out_42 1) 4294967296))) (and (= v_main_~y~0_In_20 v_main_~y~0_Out_40) (= v_main_~x~0_In_21 v_main_~x~0_Out_42))) InVars {main_~x~0=v_main_~x~0_In_21, 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_42, main_#t~post6=|v_main_#t~post6_Out_40|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9188#(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:53:51,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {9188#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} [126] 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[] {9189#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:53:51,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {9189#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {9189#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:53:51,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {9189#(<= 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; {9190#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-15 12:53:51,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {9190#(<= (+ (* (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; {9191#(<= (+ 2 (* (div (+ main_~x~0 4294967293) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-15 12:53:51,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {9191#(<= (+ 2 (* (div (+ main_~x~0 4294967293) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9192#(<= (+ 3 (* (div (+ 4294967292 main_~x~0) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-15 12:53:51,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {9192#(<= (+ 3 (* (div (+ 4294967292 main_~x~0) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9193#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-15 12:53:51,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {9193#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {9193#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-15 12:53:51,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {9193#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) 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; {9193#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-15 12:53:51,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {9193#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) 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; {9193#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-15 12:53:51,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {9193#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) 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; {9193#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-15 12:53:51,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {9193#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) 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; {9193#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-15 12:53:51,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {9193#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {9193#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-15 12:53:51,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {9193#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) 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; {9194#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:53:51,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {9194#(<= (+ 3 (* 4294967296 (div main_~x~0 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; {9195#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:53:51,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {9195#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {9183#false} is VALID [2022-04-15 12:53:51,695 INFO L290 TraceCheckUtils]: 22: Hoare triple {9183#false} assume !(~z~0 % 4294967296 > 0); {9183#false} is VALID [2022-04-15 12:53:51,695 INFO L272 TraceCheckUtils]: 23: Hoare triple {9183#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9183#false} is VALID [2022-04-15 12:53:51,695 INFO L290 TraceCheckUtils]: 24: Hoare triple {9183#false} ~cond := #in~cond; {9183#false} is VALID [2022-04-15 12:53:51,695 INFO L290 TraceCheckUtils]: 25: Hoare triple {9183#false} assume 0 == ~cond; {9183#false} is VALID [2022-04-15 12:53:51,696 INFO L290 TraceCheckUtils]: 26: Hoare triple {9183#false} assume !false; {9183#false} is VALID [2022-04-15 12:53:51,696 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:53:51,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:53:51,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764234652] [2022-04-15 12:53:51,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764234652] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:53:51,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485931193] [2022-04-15 12:53:51,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:53:51,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:53:51,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:53:51,697 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:53:51,698 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:53:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:51,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 12:53:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:51,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:53:51,935 INFO L272 TraceCheckUtils]: 0: Hoare triple {9182#true} call ULTIMATE.init(); {9182#true} is VALID [2022-04-15 12:53:51,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {9182#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9182#true} is VALID [2022-04-15 12:53:51,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {9182#true} assume true; {9182#true} is VALID [2022-04-15 12:53:51,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9182#true} {9182#true} #83#return; {9182#true} is VALID [2022-04-15 12:53:51,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {9182#true} call #t~ret15 := main(); {9182#true} is VALID [2022-04-15 12:53:51,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {9182#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9182#true} is VALID [2022-04-15 12:53:51,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {9182#true} [127] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_40| 0) (<= v_main_~x~0_Out_42 v_main_~x~0_In_21) (= (+ v_main_~x~0_In_21 v_main_~y~0_In_20) (+ v_main_~y~0_Out_40 v_main_~x~0_Out_42)) (= |v_main_#t~post6_Out_40| 0) (< 0 (mod (+ v_main_~x~0_Out_42 1) 4294967296))) (and (= v_main_~y~0_In_20 v_main_~y~0_Out_40) (= v_main_~x~0_In_21 v_main_~x~0_Out_42))) InVars {main_~x~0=v_main_~x~0_In_21, 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_42, main_#t~post6=|v_main_#t~post6_Out_40|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9182#true} is VALID [2022-04-15 12:53:51,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {9182#true} [126] 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[] {9182#true} is VALID [2022-04-15 12:53:51,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {9182#true} ~z~0 := ~y~0; {9182#true} is VALID [2022-04-15 12:53:51,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {9182#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; {9227#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:53:51,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {9227#(< 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; {9231#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:53:51,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {9231#(< 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; {9235#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:53:51,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {9235#(< 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; {9239#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:53:51,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {9239#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !(~z~0 % 4294967296 > 0); {9239#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:53:51,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {9239#(< 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; {9235#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:53:51,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {9235#(< 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; {9231#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:53:51,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {9231#(< 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; {9227#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:53:51,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {9227#(< 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; {9255#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:53:51,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {9255#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {9255#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:53:51,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {9255#(< 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; {9255#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:53:51,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {9255#(< 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; {9255#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:53:51,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {9255#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {9255#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:53:51,950 INFO L290 TraceCheckUtils]: 22: Hoare triple {9255#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {9183#false} is VALID [2022-04-15 12:53:51,950 INFO L272 TraceCheckUtils]: 23: Hoare triple {9183#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9183#false} is VALID [2022-04-15 12:53:51,950 INFO L290 TraceCheckUtils]: 24: Hoare triple {9183#false} ~cond := #in~cond; {9183#false} is VALID [2022-04-15 12:53:51,950 INFO L290 TraceCheckUtils]: 25: Hoare triple {9183#false} assume 0 == ~cond; {9183#false} is VALID [2022-04-15 12:53:51,950 INFO L290 TraceCheckUtils]: 26: Hoare triple {9183#false} assume !false; {9183#false} is VALID [2022-04-15 12:53:51,950 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:53:51,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:53:52,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {9183#false} assume !false; {9183#false} is VALID [2022-04-15 12:53:52,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {9183#false} assume 0 == ~cond; {9183#false} is VALID [2022-04-15 12:53:52,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {9183#false} ~cond := #in~cond; {9183#false} is VALID [2022-04-15 12:53:52,051 INFO L272 TraceCheckUtils]: 23: Hoare triple {9183#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9183#false} is VALID [2022-04-15 12:53:52,051 INFO L290 TraceCheckUtils]: 22: Hoare triple {9255#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {9183#false} is VALID [2022-04-15 12:53:52,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {9255#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {9255#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:53:52,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {9255#(< 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; {9255#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:53:52,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {9255#(< 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; {9255#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:53:52,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {9255#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {9255#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:53:52,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {9227#(< 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; {9255#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:53:52,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {9231#(< 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; {9227#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:53:52,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {9235#(< 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; {9231#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:53:52,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {9239#(< 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; {9235#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:53:52,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {9239#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !(~z~0 % 4294967296 > 0); {9239#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:53:52,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {9235#(< 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; {9239#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:53:52,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {9231#(< 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; {9235#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:53:52,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {9227#(< 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; {9231#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:53:52,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {9182#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; {9227#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:53:52,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {9182#true} ~z~0 := ~y~0; {9182#true} is VALID [2022-04-15 12:53:52,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {9182#true} [126] 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[] {9182#true} is VALID [2022-04-15 12:53:52,065 INFO L290 TraceCheckUtils]: 6: Hoare triple {9182#true} [127] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_40| 0) (<= v_main_~x~0_Out_42 v_main_~x~0_In_21) (= (+ v_main_~x~0_In_21 v_main_~y~0_In_20) (+ v_main_~y~0_Out_40 v_main_~x~0_Out_42)) (= |v_main_#t~post6_Out_40| 0) (< 0 (mod (+ v_main_~x~0_Out_42 1) 4294967296))) (and (= v_main_~y~0_In_20 v_main_~y~0_Out_40) (= v_main_~x~0_In_21 v_main_~x~0_Out_42))) InVars {main_~x~0=v_main_~x~0_In_21, 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_42, main_#t~post6=|v_main_#t~post6_Out_40|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9182#true} is VALID [2022-04-15 12:53:52,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {9182#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9182#true} is VALID [2022-04-15 12:53:52,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {9182#true} call #t~ret15 := main(); {9182#true} is VALID [2022-04-15 12:53:52,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9182#true} {9182#true} #83#return; {9182#true} is VALID [2022-04-15 12:53:52,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {9182#true} assume true; {9182#true} is VALID [2022-04-15 12:53:52,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {9182#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9182#true} is VALID [2022-04-15 12:53:52,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {9182#true} call ULTIMATE.init(); {9182#true} is VALID [2022-04-15 12:53:52,065 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:53:52,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485931193] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:53:52,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:53:52,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 17 [2022-04-15 12:53:52,393 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:53:52,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [273789799] [2022-04-15 12:53:52,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [273789799] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:53:52,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:53:52,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:53:52,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085016793] [2022-04-15 12:53:52,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:53:52,394 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 12:53:52,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:53:52,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:52,436 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:53:52,436 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:53:52,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:53:52,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:53:52,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:53:52,437 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:56,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:56,251 INFO L93 Difference]: Finished difference Result 104 states and 138 transitions. [2022-04-15 12:53:56,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 12:53:56,251 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 12:53:56,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:53:56,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:56,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 87 transitions. [2022-04-15 12:53:56,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:56,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 87 transitions. [2022-04-15 12:53:56,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 87 transitions. [2022-04-15 12:53:56,548 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:53:56,549 INFO L225 Difference]: With dead ends: 104 [2022-04-15 12:53:56,549 INFO L226 Difference]: Without dead ends: 91 [2022-04-15 12:53:56,550 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=309, Invalid=1583, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 12:53:56,550 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 77 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:53:56,550 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 55 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 12:53:56,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-15 12:53:56,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 59. [2022-04-15 12:53:56,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:53:56,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 59 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:56,907 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 59 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:56,907 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 59 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:56,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:56,909 INFO L93 Difference]: Finished difference Result 91 states and 115 transitions. [2022-04-15 12:53:56,909 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2022-04-15 12:53:56,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:53:56,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:53:56,910 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 91 states. [2022-04-15 12:53:56,910 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 91 states. [2022-04-15 12:53:56,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:56,911 INFO L93 Difference]: Finished difference Result 91 states and 115 transitions. [2022-04-15 12:53:56,911 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2022-04-15 12:53:56,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:53:56,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:53:56,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:53:56,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:53:56,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:56,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2022-04-15 12:53:56,913 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 29 [2022-04-15 12:53:56,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:53:56,913 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2022-04-15 12:53:56,913 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:56,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 72 transitions. [2022-04-15 12:53:57,849 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:53:57,850 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-04-15 12:53:57,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 12:53:57,850 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:53:57,850 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:53:57,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-15 12:53:58,050 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:53:58,051 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:53:58,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:53:58,051 INFO L85 PathProgramCache]: Analyzing trace with hash 274096195, now seen corresponding path program 10 times [2022-04-15 12:53:58,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:53:58,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2142003397] [2022-04-15 12:53:58,200 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:53:58,201 INFO L85 PathProgramCache]: Analyzing trace with hash 602624740, now seen corresponding path program 1 times [2022-04-15 12:53:58,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:53:58,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267273711] [2022-04-15 12:53:58,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:53:58,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:53:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:58,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:53:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:58,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {9936#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9921#true} is VALID [2022-04-15 12:53:58,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {9921#true} assume true; {9921#true} is VALID [2022-04-15 12:53:58,481 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9921#true} {9921#true} #83#return; {9921#true} is VALID [2022-04-15 12:53:58,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {9921#true} call ULTIMATE.init(); {9936#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:53:58,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {9936#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9921#true} is VALID [2022-04-15 12:53:58,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {9921#true} assume true; {9921#true} is VALID [2022-04-15 12:53:58,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9921#true} {9921#true} #83#return; {9921#true} is VALID [2022-04-15 12:53:58,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {9921#true} call #t~ret15 := main(); {9921#true} is VALID [2022-04-15 12:53:58,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {9921#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9921#true} is VALID [2022-04-15 12:53:58,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {9921#true} [129] L16-2-->L16-3_primed: Formula: (or (and (<= v_main_~x~0_Out_44 v_main_~x~0_In_22) (< 0 (mod (+ v_main_~x~0_Out_44 1) 4294967296)) (= |v_main_#t~post6_Out_42| 0) (= (+ v_main_~x~0_In_22 v_main_~y~0_In_21) (+ v_main_~y~0_Out_42 v_main_~x~0_Out_44)) (= |v_main_#t~post5_Out_42| 0)) (and (= v_main_~y~0_In_21 v_main_~y~0_Out_42) (= 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_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_44, main_#t~post6=|v_main_#t~post6_Out_42|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9921#true} is VALID [2022-04-15 12:53:58,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {9921#true} [128] 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[] {9921#true} is VALID [2022-04-15 12:53:58,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {9921#true} ~z~0 := ~y~0; {9926#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:53:58,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {9926#(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; {9927#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:53:58,487 INFO L290 TraceCheckUtils]: 10: Hoare triple {9927#(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; {9928#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:53:58,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {9928#(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; {9929#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:53:58,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {9929#(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; {9930#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:53:58,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {9930#(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; {9931#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:53:58,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {9931#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {9931#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:53:58,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {9931#(<= 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; {9932#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:53:58,495 INFO L290 TraceCheckUtils]: 16: Hoare triple {9932#(<= 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; {9933#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:53:58,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {9933#(<= 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; {9934#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:53:58,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {9934#(<= 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; {9935#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:53:58,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {9935#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {9922#false} is VALID [2022-04-15 12:53:58,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {9922#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; {9922#false} is VALID [2022-04-15 12:53:58,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {9922#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; {9922#false} is VALID [2022-04-15 12:53:58,503 INFO L290 TraceCheckUtils]: 22: Hoare triple {9922#false} assume !(~x~0 % 4294967296 > 0); {9922#false} is VALID [2022-04-15 12:53:58,503 INFO L290 TraceCheckUtils]: 23: Hoare triple {9922#false} assume !(~z~0 % 4294967296 > 0); {9922#false} is VALID [2022-04-15 12:53:58,503 INFO L272 TraceCheckUtils]: 24: Hoare triple {9922#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9922#false} is VALID [2022-04-15 12:53:58,503 INFO L290 TraceCheckUtils]: 25: Hoare triple {9922#false} ~cond := #in~cond; {9922#false} is VALID [2022-04-15 12:53:58,503 INFO L290 TraceCheckUtils]: 26: Hoare triple {9922#false} assume 0 == ~cond; {9922#false} is VALID [2022-04-15 12:53:58,503 INFO L290 TraceCheckUtils]: 27: Hoare triple {9922#false} assume !false; {9922#false} is VALID [2022-04-15 12:53:58,504 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:53:58,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:53:58,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267273711] [2022-04-15 12:53:58,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267273711] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:53:58,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666894345] [2022-04-15 12:53:58,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:53:58,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:53:58,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:53:58,505 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:53:58,508 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:53:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:58,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 12:53:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:58,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:53:58,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {9921#true} call ULTIMATE.init(); {9921#true} is VALID [2022-04-15 12:53:58,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {9921#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9921#true} is VALID [2022-04-15 12:53:58,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {9921#true} assume true; {9921#true} is VALID [2022-04-15 12:53:58,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9921#true} {9921#true} #83#return; {9921#true} is VALID [2022-04-15 12:53:58,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {9921#true} call #t~ret15 := main(); {9921#true} is VALID [2022-04-15 12:53:58,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {9921#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9921#true} is VALID [2022-04-15 12:53:58,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {9921#true} [129] L16-2-->L16-3_primed: Formula: (or (and (<= v_main_~x~0_Out_44 v_main_~x~0_In_22) (< 0 (mod (+ v_main_~x~0_Out_44 1) 4294967296)) (= |v_main_#t~post6_Out_42| 0) (= (+ v_main_~x~0_In_22 v_main_~y~0_In_21) (+ v_main_~y~0_Out_42 v_main_~x~0_Out_44)) (= |v_main_#t~post5_Out_42| 0)) (and (= v_main_~y~0_In_21 v_main_~y~0_Out_42) (= 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_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_44, main_#t~post6=|v_main_#t~post6_Out_42|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9921#true} is VALID [2022-04-15 12:53:58,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {9921#true} [128] 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[] {9921#true} is VALID [2022-04-15 12:53:58,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {9921#true} ~z~0 := ~y~0; {9926#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:53:58,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {9926#(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; {9927#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:53:58,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {9927#(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; {9928#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:53:58,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {9928#(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; {9929#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:53:58,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {9929#(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; {9930#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:53:58,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {9930#(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; {9931#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:53:58,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {9931#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {9931#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:53:58,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {9931#(<= 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; {9932#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:53:58,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {9932#(<= 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; {9933#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:53:58,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {9933#(<= 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; {9934#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:53:58,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {9934#(<= 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; {9935#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:53:58,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {9935#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {9922#false} is VALID [2022-04-15 12:53:58,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {9922#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; {9922#false} is VALID [2022-04-15 12:53:58,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {9922#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; {9922#false} is VALID [2022-04-15 12:53:58,956 INFO L290 TraceCheckUtils]: 22: Hoare triple {9922#false} assume !(~x~0 % 4294967296 > 0); {9922#false} is VALID [2022-04-15 12:53:58,956 INFO L290 TraceCheckUtils]: 23: Hoare triple {9922#false} assume !(~z~0 % 4294967296 > 0); {9922#false} is VALID [2022-04-15 12:53:58,956 INFO L272 TraceCheckUtils]: 24: Hoare triple {9922#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9922#false} is VALID [2022-04-15 12:53:58,956 INFO L290 TraceCheckUtils]: 25: Hoare triple {9922#false} ~cond := #in~cond; {9922#false} is VALID [2022-04-15 12:53:58,956 INFO L290 TraceCheckUtils]: 26: Hoare triple {9922#false} assume 0 == ~cond; {9922#false} is VALID [2022-04-15 12:53:58,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {9922#false} assume !false; {9922#false} is VALID [2022-04-15 12:53:58,956 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:53:58,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:53:59,466 INFO L290 TraceCheckUtils]: 27: Hoare triple {9922#false} assume !false; {9922#false} is VALID [2022-04-15 12:53:59,466 INFO L290 TraceCheckUtils]: 26: Hoare triple {9922#false} assume 0 == ~cond; {9922#false} is VALID [2022-04-15 12:53:59,466 INFO L290 TraceCheckUtils]: 25: Hoare triple {9922#false} ~cond := #in~cond; {9922#false} is VALID [2022-04-15 12:53:59,466 INFO L272 TraceCheckUtils]: 24: Hoare triple {9922#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9922#false} is VALID [2022-04-15 12:53:59,466 INFO L290 TraceCheckUtils]: 23: Hoare triple {9922#false} assume !(~z~0 % 4294967296 > 0); {9922#false} is VALID [2022-04-15 12:53:59,466 INFO L290 TraceCheckUtils]: 22: Hoare triple {9922#false} assume !(~x~0 % 4294967296 > 0); {9922#false} is VALID [2022-04-15 12:53:59,466 INFO L290 TraceCheckUtils]: 21: Hoare triple {9922#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; {9922#false} is VALID [2022-04-15 12:53:59,467 INFO L290 TraceCheckUtils]: 20: Hoare triple {9922#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; {9922#false} is VALID [2022-04-15 12:53:59,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {9935#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {9922#false} is VALID [2022-04-15 12:53:59,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {9934#(<= 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; {9935#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:53:59,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {9933#(<= 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; {9934#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:53:59,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {9932#(<= 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; {9933#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:53:59,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {9931#(<= 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; {9932#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:53:59,477 INFO L290 TraceCheckUtils]: 14: Hoare triple {9931#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {9931#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:53:59,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {10063#(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; {9931#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:53:59,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {10067#(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; {10063#(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:53:59,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {10071#(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; {10067#(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:53:59,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {10075#(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; {10071#(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:53:59,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {10079#(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; {10075#(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:53:59,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {9921#true} ~z~0 := ~y~0; {10079#(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:53:59,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {9921#true} [128] 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[] {9921#true} is VALID [2022-04-15 12:53:59,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {9921#true} [129] L16-2-->L16-3_primed: Formula: (or (and (<= v_main_~x~0_Out_44 v_main_~x~0_In_22) (< 0 (mod (+ v_main_~x~0_Out_44 1) 4294967296)) (= |v_main_#t~post6_Out_42| 0) (= (+ v_main_~x~0_In_22 v_main_~y~0_In_21) (+ v_main_~y~0_Out_42 v_main_~x~0_Out_44)) (= |v_main_#t~post5_Out_42| 0)) (and (= v_main_~y~0_In_21 v_main_~y~0_Out_42) (= 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_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_44, main_#t~post6=|v_main_#t~post6_Out_42|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9921#true} is VALID [2022-04-15 12:53:59,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {9921#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9921#true} is VALID [2022-04-15 12:53:59,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {9921#true} call #t~ret15 := main(); {9921#true} is VALID [2022-04-15 12:53:59,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9921#true} {9921#true} #83#return; {9921#true} is VALID [2022-04-15 12:53:59,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {9921#true} assume true; {9921#true} is VALID [2022-04-15 12:53:59,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {9921#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9921#true} is VALID [2022-04-15 12:53:59,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {9921#true} call ULTIMATE.init(); {9921#true} is VALID [2022-04-15 12:53:59,489 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:53:59,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666894345] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:53:59,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:53:59,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 18 [2022-04-15 12:53:59,705 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:53:59,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2142003397] [2022-04-15 12:53:59,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2142003397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:53:59,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:53:59,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 12:53:59,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567791333] [2022-04-15 12:53:59,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:53:59,706 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 12:53:59,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:53:59,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:59,751 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:53:59,752 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 12:53:59,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:53:59,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 12:53:59,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:53:59,753 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:07,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:07,011 INFO L93 Difference]: Finished difference Result 116 states and 148 transitions. [2022-04-15 12:54:07,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 12:54:07,011 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 12:54:07,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:54:07,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 102 transitions. [2022-04-15 12:54:07,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:07,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 102 transitions. [2022-04-15 12:54:07,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 102 transitions. [2022-04-15 12:54:07,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:54:07,852 INFO L225 Difference]: With dead ends: 116 [2022-04-15 12:54:07,852 INFO L226 Difference]: Without dead ends: 83 [2022-04-15 12:54:07,853 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 59 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=491, Invalid=2371, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 12:54:07,853 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 74 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:54:07,854 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 81 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-15 12:54:07,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-15 12:54:08,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 63. [2022-04-15 12:54:08,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:54:08,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 63 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:08,315 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 63 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:08,315 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 63 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:08,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:08,317 INFO L93 Difference]: Finished difference Result 83 states and 104 transitions. [2022-04-15 12:54:08,317 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 104 transitions. [2022-04-15 12:54:08,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:54:08,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:54:08,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 83 states. [2022-04-15 12:54:08,318 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 83 states. [2022-04-15 12:54:08,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:08,319 INFO L93 Difference]: Finished difference Result 83 states and 104 transitions. [2022-04-15 12:54:08,319 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 104 transitions. [2022-04-15 12:54:08,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:54:08,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:54:08,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:54:08,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:54:08,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:08,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2022-04-15 12:54:08,321 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 30 [2022-04-15 12:54:08,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:54:08,321 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2022-04-15 12:54:08,321 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:08,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 75 transitions. [2022-04-15 12:54:10,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:54:10,180 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-15 12:54:10,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 12:54:10,180 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:54:10,180 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:54:10,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-04-15 12:54:10,381 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:54:10,381 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:54:10,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:54:10,381 INFO L85 PathProgramCache]: Analyzing trace with hash -543637167, now seen corresponding path program 6 times [2022-04-15 12:54:10,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:54:10,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [595397722] [2022-04-15 12:54:10,530 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:54:10,531 INFO L85 PathProgramCache]: Analyzing trace with hash -535770480, now seen corresponding path program 1 times [2022-04-15 12:54:10,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:54:10,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715141672] [2022-04-15 12:54:10,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:54:10,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:54:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:11,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:54:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:11,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {10725#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10705#true} is VALID [2022-04-15 12:54:11,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {10705#true} assume true; {10705#true} is VALID [2022-04-15 12:54:11,360 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10705#true} {10705#true} #83#return; {10705#true} is VALID [2022-04-15 12:54:11,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {10705#true} call ULTIMATE.init(); {10725#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:54:11,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {10725#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10705#true} is VALID [2022-04-15 12:54:11,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {10705#true} assume true; {10705#true} is VALID [2022-04-15 12:54:11,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10705#true} {10705#true} #83#return; {10705#true} is VALID [2022-04-15 12:54:11,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {10705#true} call #t~ret15 := main(); {10705#true} is VALID [2022-04-15 12:54:11,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {10705#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10710#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:54:11,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {10710#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [131] 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_22 v_main_~y~0_Out_44)) (and (= (+ v_main_~x~0_In_23 v_main_~y~0_In_22) (+ v_main_~y~0_Out_44 v_main_~x~0_Out_46)) (< 0 (mod (+ v_main_~x~0_Out_46 1) 4294967296)) (= |v_main_#t~post6_Out_44| 0) (= |v_main_#t~post5_Out_44| 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_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_46, main_#t~post6=|v_main_#t~post6_Out_44|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10711#(or (and (<= (+ 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:54:11,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {10711#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} [130] 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[] {10712#(or (and (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 main_~x~0) main_~n~0)) (= main_~y~0 0))} is VALID [2022-04-15 12:54:11,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {10712#(or (and (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 main_~x~0) main_~n~0)) (= main_~y~0 0))} ~z~0 := ~y~0; {10713#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (or (and (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 main_~x~0) main_~n~0)) (= main_~y~0 0)))} is VALID [2022-04-15 12:54:11,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {10713#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (or (and (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 main_~x~0) main_~n~0)) (= 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; {10714#(and (not (= main_~y~0 0)) (<= (+ main_~z~0 main_~x~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294 (* (div main_~z~0 4294967296) (- 4294967296)) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296))) (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) main_~n~0))} is VALID [2022-04-15 12:54:11,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {10714#(and (not (= main_~y~0 0)) (<= (+ main_~z~0 main_~x~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294 (* (div main_~z~0 4294967296) (- 4294967296)) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296))) (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) 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; {10715#(and (not (= main_~y~0 0)) (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ 2 (* (div (+ main_~z~0 main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (div main_~z~0 4294967296) (- 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~x~0) (<= (+ main_~z~0 main_~x~0) main_~n~0))} is VALID [2022-04-15 12:54:11,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {10715#(and (not (= main_~y~0 0)) (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ 2 (* (div (+ main_~z~0 main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (div main_~z~0 4294967296) (- 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~x~0) (<= (+ main_~z~0 main_~x~0) 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; {10716#(and (or (and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) main_~n~0) (or (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296) 4294967293) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296))))) (= main_~y~0 0)) (or (<= (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296) 4294967293) main_~z~0) (not (= main_~y~0 0))))} is VALID [2022-04-15 12:54:11,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {10716#(and (or (and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) main_~n~0) (or (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296) 4294967293) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296))))) (= main_~y~0 0)) (or (<= (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296) 4294967293) main_~z~0) (not (= main_~y~0 0))))} assume !(~z~0 % 4294967296 > 0); {10717#(and (<= main_~n~0 (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296))) (not (= main_~y~0 0)) (<= (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296)) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} is VALID [2022-04-15 12:54:11,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {10717#(and (<= main_~n~0 (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296))) (not (= main_~y~0 0)) (<= (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296)) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 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; {10718#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0)) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} is VALID [2022-04-15 12:54:11,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {10718#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0)) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 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; {10718#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0)) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} is VALID [2022-04-15 12:54:11,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {10718#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0)) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 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; {10718#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0)) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} is VALID [2022-04-15 12:54:11,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {10718#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0)) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} assume !(~y~0 % 4294967296 > 0); {10718#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0)) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} is VALID [2022-04-15 12:54:11,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {10718#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0)) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) 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; {10719#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 1 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:54:11,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {10719#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 1 (* (div (+ (- 1) main_~n~0 (* (- 1) 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; {10720#(and (<= main_~n~0 (+ main_~x~0 2 (* 4294967296 (div (+ (- 2) main_~n~0 (* (- 1) main_~x~0)) 4294967296)))) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-15 12:54:11,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {10720#(and (<= main_~n~0 (+ main_~x~0 2 (* 4294967296 (div (+ (- 2) main_~n~0 (* (- 1) main_~x~0)) 4294967296)))) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 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; {10721#(and (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 3 (* (div (+ main_~n~0 (- 3) (* (- 1) main_~x~0)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:54:11,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {10721#(and (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 3 (* (div (+ main_~n~0 (- 3) (* (- 1) main_~x~0)) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {10721#(and (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 3 (* (div (+ main_~n~0 (- 3) (* (- 1) main_~x~0)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:54:11,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {10721#(and (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 3 (* (div (+ main_~n~0 (- 3) (* (- 1) main_~x~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; {10720#(and (<= main_~n~0 (+ main_~x~0 2 (* 4294967296 (div (+ (- 2) main_~n~0 (* (- 1) main_~x~0)) 4294967296)))) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-15 12:54:11,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {10720#(and (<= main_~n~0 (+ main_~x~0 2 (* 4294967296 (div (+ (- 2) main_~n~0 (* (- 1) main_~x~0)) 4294967296)))) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~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; {10719#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 1 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:54:11,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {10719#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 1 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~x~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; {10722#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:54:11,457 INFO L290 TraceCheckUtils]: 24: Hoare triple {10722#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {10722#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:54:11,458 INFO L272 TraceCheckUtils]: 25: Hoare triple {10722#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10723#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:54:11,458 INFO L290 TraceCheckUtils]: 26: Hoare triple {10723#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {10724#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:54:11,459 INFO L290 TraceCheckUtils]: 27: Hoare triple {10724#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {10706#false} is VALID [2022-04-15 12:54:11,459 INFO L290 TraceCheckUtils]: 28: Hoare triple {10706#false} assume !false; {10706#false} is VALID [2022-04-15 12:54:11,459 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:54:11,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:54:11,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715141672] [2022-04-15 12:54:11,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715141672] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:54:11,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973341804] [2022-04-15 12:54:11,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:54:11,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:54:11,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:54:11,461 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:54:11,461 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:54:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:11,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-15 12:54:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:11,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:54:25,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {10705#true} call ULTIMATE.init(); {10705#true} is VALID [2022-04-15 12:54:25,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {10705#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10705#true} is VALID [2022-04-15 12:54:25,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {10705#true} assume true; {10705#true} is VALID [2022-04-15 12:54:25,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10705#true} {10705#true} #83#return; {10705#true} is VALID [2022-04-15 12:54:25,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {10705#true} call #t~ret15 := main(); {10705#true} is VALID [2022-04-15 12:54:25,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {10705#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10710#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:54:25,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {10710#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [131] 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_22 v_main_~y~0_Out_44)) (and (= (+ v_main_~x~0_In_23 v_main_~y~0_In_22) (+ v_main_~y~0_Out_44 v_main_~x~0_Out_46)) (< 0 (mod (+ v_main_~x~0_Out_46 1) 4294967296)) (= |v_main_#t~post6_Out_44| 0) (= |v_main_#t~post5_Out_44| 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_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_46, main_#t~post6=|v_main_#t~post6_Out_44|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10747#(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:54:25,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {10747#(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)))} [130] 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[] {10747#(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:54:25,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {10747#(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)))} ~z~0 := ~y~0; {10754#(and (= main_~z~0 main_~y~0) (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:54:25,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {10754#(and (= main_~z~0 main_~y~0) (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))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10758#(and (= main_~n~0 (+ (- 1) main_~y~0 main_~x~0)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (< 0 (mod main_~x~0 4294967296)) (= main_~y~0 (+ main_~z~0 1)) (<= main_~x~0 (+ main_~n~0 1)))} is VALID [2022-04-15 12:54:25,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {10758#(and (= main_~n~0 (+ (- 1) main_~y~0 main_~x~0)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (< 0 (mod main_~x~0 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; {10762#(and (<= 0 main_~y~0) (< 0 (mod (+ main_~z~0 2) 4294967296)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 2)) (= (+ main_~n~0 2 (* (- 1) main_~y~0)) main_~x~0) (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295) 1) 4294967296)))} is VALID [2022-04-15 12:54:25,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {10762#(and (<= 0 main_~y~0) (< 0 (mod (+ main_~z~0 2) 4294967296)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 2)) (= (+ main_~n~0 2 (* (- 1) main_~y~0)) main_~x~0) (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295) 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; {10766#(and (<= 0 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~n~0 3 (* (- 1) main_~y~0)) main_~x~0) (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295) 1) 4294967296)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:54:25,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {10766#(and (<= 0 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~n~0 3 (* (- 1) main_~y~0)) main_~x~0) (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295) 1) 4294967296)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10770#(and (<= 0 main_~y~0) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (= (+ main_~n~0 3) (+ main_~y~0 main_~x~0)) (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295) 1) 4294967296)))} is VALID [2022-04-15 12:54:25,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {10770#(and (<= 0 main_~y~0) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (= (+ main_~n~0 3) (+ main_~y~0 main_~x~0)) (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295) 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; {10774#(and (= (+ main_~y~0 main_~x~0 1) (+ main_~n~0 3)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296)) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-15 12:54:25,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {10774#(and (= (+ main_~y~0 main_~x~0 1) (+ main_~n~0 3)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296)) (<= 0 (+ main_~y~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10778#(and (<= main_~x~0 (+ main_~n~0 3)) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (= (+ main_~y~0 1) (+ main_~n~0 2 (* (- 1) main_~x~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-15 12:54:25,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {10778#(and (<= main_~x~0 (+ main_~n~0 3)) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (= (+ main_~y~0 1) (+ main_~n~0 2 (* (- 1) main_~x~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10782#(and (<= main_~x~0 (+ main_~n~0 3)) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~y~0 1)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-15 12:54:25,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {10782#(and (<= main_~x~0 (+ main_~n~0 3)) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~y~0 1)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10786#(and (<= main_~x~0 (+ main_~n~0 3)) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-15 12:54:25,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {10786#(and (<= main_~x~0 (+ main_~n~0 3)) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (< 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; {10790#(and (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 2)))} is VALID [2022-04-15 12:54:25,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {10790#(and (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 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; {10794#(and (< 0 (mod main_~x~0 4294967296)) (<= (mod (+ main_~n~0 4294967294 (* main_~x~0 4294967295)) 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)) (<= main_~x~0 (+ main_~n~0 1)))} is VALID [2022-04-15 12:54:25,599 INFO L290 TraceCheckUtils]: 19: Hoare triple {10794#(and (< 0 (mod main_~x~0 4294967296)) (<= (mod (+ main_~n~0 4294967294 (* main_~x~0 4294967295)) 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 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; {10798#(and (< 0 (mod (+ main_~x~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~x~0 main_~n~0) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295) 4294967293) 4294967296) 0))} is VALID [2022-04-15 12:54:25,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {10798#(and (< 0 (mod (+ main_~x~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~x~0 main_~n~0) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295) 4294967293) 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {10802#(and (<= main_~x~0 main_~n~0) (<= (mod main_~x~0 4294967296) 0) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295) 4294967293) 4294967296) 0))} is VALID [2022-04-15 12:54:25,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {10802#(and (<= main_~x~0 main_~n~0) (<= (mod main_~x~0 4294967296) 0) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295) 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; {10806#(and (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (<= (mod (+ main_~n~0 4294967294 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 1)))} is VALID [2022-04-15 12:54:25,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {10806#(and (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (<= (mod (+ main_~n~0 4294967294 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ main_~n~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; {10810#(and (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 2)))} is VALID [2022-04-15 12:54:25,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {10810#(and (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= main_~x~0 (+ main_~n~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; {10814#(and (<= main_~x~0 (+ main_~n~0 3)) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0))} is VALID [2022-04-15 12:54:25,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {10814#(and (<= main_~x~0 (+ main_~n~0 3)) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {10814#(and (<= main_~x~0 (+ main_~n~0 3)) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0))} is VALID [2022-04-15 12:54:25,617 INFO L272 TraceCheckUtils]: 25: Hoare triple {10814#(and (<= main_~x~0 (+ main_~n~0 3)) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10821#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:54:25,617 INFO L290 TraceCheckUtils]: 26: Hoare triple {10821#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10825#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:54:25,617 INFO L290 TraceCheckUtils]: 27: Hoare triple {10825#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10706#false} is VALID [2022-04-15 12:54:25,617 INFO L290 TraceCheckUtils]: 28: Hoare triple {10706#false} assume !false; {10706#false} is VALID [2022-04-15 12:54:25,618 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:54:25,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:54:41,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {10706#false} assume !false; {10706#false} is VALID [2022-04-15 12:54:41,334 INFO L290 TraceCheckUtils]: 27: Hoare triple {10825#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10706#false} is VALID [2022-04-15 12:54:41,334 INFO L290 TraceCheckUtils]: 26: Hoare triple {10821#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10825#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:54:41,335 INFO L272 TraceCheckUtils]: 25: Hoare triple {10722#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10821#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:54:41,336 INFO L290 TraceCheckUtils]: 24: Hoare triple {10722#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {10722#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:54:41,337 INFO L290 TraceCheckUtils]: 23: Hoare triple {10847#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 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; {10722#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:54:41,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {10851#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10847#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-15 12:54:41,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {10855#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 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; {10851#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:54:41,343 INFO L290 TraceCheckUtils]: 20: Hoare triple {10859#(or (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< 0 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {10855#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-15 12:54:41,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {10863#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10859#(or (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:54:41,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {10867#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~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; {10863#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-15 12:54:41,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {10871#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~x~0 4294967293) 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; {10867#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:54:41,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {10875#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10871#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:54:41,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {10879#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 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; {10875#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:54:41,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {10883#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10879#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:54:41,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {10887#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~x~0 4294967293) 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; {10883#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-15 12:54:41,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {10891#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10887#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:54:41,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {10895#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 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; {10891#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:54:41,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {10899#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (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; {10895#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:54:41,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {10903#(or (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 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; {10899#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:54:41,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {10907#(or (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} ~z~0 := ~y~0; {10903#(or (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:54:41,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {10907#(or (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} [130] 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[] {10907#(or (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:54:41,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {10914#(and (or (<= (+ (div (+ (* (- 1) main_~x~0) (- 4294967297) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (* (- 1) main_~x~0) (* (- 1) main_~y~0) (- 4294967294)) (- 4294967296))) (+ (div (+ 4294967292 main_~y~0 main_~x~0) 4294967296) 3 (div (+ main_~y~0 main_~x~0) 4294967296))) (< (div (+ (* (- 1) main_~x~0) (* (- 1) main_~y~0) (- 4294967294)) (- 4294967296)) (+ (div main_~n~0 4294967296) 2 (div (+ main_~y~0 main_~x~0 4294967296 (* (- 1) main_~n~0)) 4294967296)))) (or (<= (+ (div (+ (* (- 1) main_~x~0) (- 4294967297) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (* (- 1) main_~x~0) (* (- 1) main_~y~0) (- 4294967294)) (- 4294967296))) (+ (div (+ 4294967292 main_~y~0 main_~x~0) 4294967296) 3 (div (+ main_~y~0 main_~x~0) 4294967296))) (<= (+ (div main_~n~0 4294967296) (div (+ (* (- 1) main_~x~0) (* (- 1) main_~y~0) (- 4294967294)) (- 4294967296))) (+ (div (+ main_~n~0 (- 3)) 4294967296) 2 (div (+ main_~y~0 main_~x~0) 4294967296)))))} [131] 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_22 v_main_~y~0_Out_44)) (and (= (+ v_main_~x~0_In_23 v_main_~y~0_In_22) (+ v_main_~y~0_Out_44 v_main_~x~0_Out_46)) (< 0 (mod (+ v_main_~x~0_Out_46 1) 4294967296)) (= |v_main_#t~post6_Out_44| 0) (= |v_main_#t~post5_Out_44| 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_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_46, main_#t~post6=|v_main_#t~post6_Out_44|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10907#(or (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:54:41,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {10705#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10914#(and (or (<= (+ (div (+ (* (- 1) main_~x~0) (- 4294967297) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (* (- 1) main_~x~0) (* (- 1) main_~y~0) (- 4294967294)) (- 4294967296))) (+ (div (+ 4294967292 main_~y~0 main_~x~0) 4294967296) 3 (div (+ main_~y~0 main_~x~0) 4294967296))) (< (div (+ (* (- 1) main_~x~0) (* (- 1) main_~y~0) (- 4294967294)) (- 4294967296)) (+ (div main_~n~0 4294967296) 2 (div (+ main_~y~0 main_~x~0 4294967296 (* (- 1) main_~n~0)) 4294967296)))) (or (<= (+ (div (+ (* (- 1) main_~x~0) (- 4294967297) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (* (- 1) main_~x~0) (* (- 1) main_~y~0) (- 4294967294)) (- 4294967296))) (+ (div (+ 4294967292 main_~y~0 main_~x~0) 4294967296) 3 (div (+ main_~y~0 main_~x~0) 4294967296))) (<= (+ (div main_~n~0 4294967296) (div (+ (* (- 1) main_~x~0) (* (- 1) main_~y~0) (- 4294967294)) (- 4294967296))) (+ (div (+ main_~n~0 (- 3)) 4294967296) 2 (div (+ main_~y~0 main_~x~0) 4294967296)))))} is VALID [2022-04-15 12:54:41,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {10705#true} call #t~ret15 := main(); {10705#true} is VALID [2022-04-15 12:54:41,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10705#true} {10705#true} #83#return; {10705#true} is VALID [2022-04-15 12:54:41,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {10705#true} assume true; {10705#true} is VALID [2022-04-15 12:54:41,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {10705#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10705#true} is VALID [2022-04-15 12:54:41,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {10705#true} call ULTIMATE.init(); {10705#true} is VALID [2022-04-15 12:54:41,565 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:54:41,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973341804] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:54:41,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:54:41,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 22] total 54 [2022-04-15 12:54:42,949 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:54:42,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [595397722] [2022-04-15 12:54:42,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [595397722] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:54:42,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:54:42,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 12:54:42,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957053430] [2022-04-15 12:54:42,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:54:42,950 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 18 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 31 [2022-04-15 12:54:42,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:54:42,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 18 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:54:43,094 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:54:43,094 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 12:54:43,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:54:43,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 12:54:43,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=2846, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 12:54:43,096 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 18 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:54:49,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:49,957 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2022-04-15 12:54:49,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 12:54:49,957 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 18 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 31 [2022-04-15 12:54:49,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:54:49,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 18 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:54:49,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 54 transitions. [2022-04-15 12:54:49,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 18 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:54:49,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 54 transitions. [2022-04-15 12:54:49,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 54 transitions. [2022-04-15 12:54:50,172 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:54:50,173 INFO L225 Difference]: With dead ends: 81 [2022-04-15 12:54:50,173 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 12:54:50,174 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1323 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=691, Invalid=4711, Unknown=0, NotChecked=0, Total=5402 [2022-04-15 12:54:50,175 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:54:50,175 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 99 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-15 12:54:50,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 12:54:50,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2022-04-15 12:54:50,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:54:50,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 66 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:50,693 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 66 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:50,693 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 66 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:50,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:50,694 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-04-15 12:54:50,694 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2022-04-15 12:54:50,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:54:50,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:54:50,695 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-15 12:54:50,695 INFO L87 Difference]: Start difference. First operand has 66 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-15 12:54:50,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:50,696 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-04-15 12:54:50,696 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2022-04-15 12:54:50,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:54:50,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:54:50,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:54:50,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:54:50,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:50,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2022-04-15 12:54:50,698 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 31 [2022-04-15 12:54:50,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:54:50,698 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2022-04-15 12:54:50,698 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 18 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:54:50,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 79 transitions. [2022-04-15 12:54:53,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:54:53,196 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-15 12:54:53,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 12:54:53,197 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:54:53,197 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:54:53,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-15 12:54:53,397 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,SelfDestructingSolverStorable26 [2022-04-15 12:54:53,397 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:54:53,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:54:53,398 INFO L85 PathProgramCache]: Analyzing trace with hash 361612114, now seen corresponding path program 7 times [2022-04-15 12:54:53,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:54:53,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1798349245] [2022-04-15 12:54:53,548 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:54:53,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1333972429, now seen corresponding path program 1 times [2022-04-15 12:54:53,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:54:53,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340961742] [2022-04-15 12:54:53,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:54:53,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:54:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:53,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:54:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:53,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {11412#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11403#true} is VALID [2022-04-15 12:54:53,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {11403#true} assume true; {11403#true} is VALID [2022-04-15 12:54:53,675 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11403#true} {11403#true} #83#return; {11403#true} is VALID [2022-04-15 12:54:53,676 INFO L272 TraceCheckUtils]: 0: Hoare triple {11403#true} call ULTIMATE.init(); {11412#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:54:53,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {11412#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11403#true} is VALID [2022-04-15 12:54:53,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {11403#true} assume true; {11403#true} is VALID [2022-04-15 12:54:53,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11403#true} {11403#true} #83#return; {11403#true} is VALID [2022-04-15 12:54:53,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {11403#true} call #t~ret15 := main(); {11403#true} is VALID [2022-04-15 12:54:53,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {11403#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11403#true} is VALID [2022-04-15 12:54:53,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {11403#true} [133] 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_23 v_main_~y~0_Out_46)) (and (= |v_main_#t~post5_Out_46| 0) (= |v_main_#t~post6_Out_46| 0) (= (+ v_main_~x~0_In_24 v_main_~y~0_In_23) (+ v_main_~y~0_Out_46 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)))) InVars {main_~x~0=v_main_~x~0_In_24, 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_48, main_#t~post6=|v_main_#t~post6_Out_46|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11403#true} is VALID [2022-04-15 12:54:53,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {11403#true} [132] 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[] {11403#true} is VALID [2022-04-15 12:54:53,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {11403#true} ~z~0 := ~y~0; {11403#true} is VALID [2022-04-15 12:54:53,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {11403#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; {11403#true} is VALID [2022-04-15 12:54:53,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {11403#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; {11403#true} is VALID [2022-04-15 12:54:53,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {11403#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; {11403#true} is VALID [2022-04-15 12:54:53,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {11403#true} assume !(~z~0 % 4294967296 > 0); {11408#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:54:53,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {11408#(<= 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; {11409#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:54:53,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {11409#(<= 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; {11410#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:54:53,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {11410#(<= 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; {11411#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:53,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {11411#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {11411#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:53,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {11411#(<= 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; {11411#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:53,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {11411#(<= 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; {11411#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:53,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {11411#(<= 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; {11411#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:53,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {11411#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {11411#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:53,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {11411#(<= 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; {11410#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:54:53,695 INFO L290 TraceCheckUtils]: 22: Hoare triple {11410#(<= 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; {11409#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:54:53,699 INFO L290 TraceCheckUtils]: 23: Hoare triple {11409#(<= 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; {11408#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:54:53,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {11408#(<= 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; {11404#false} is VALID [2022-04-15 12:54:53,701 INFO L290 TraceCheckUtils]: 25: Hoare triple {11404#false} assume !(~z~0 % 4294967296 > 0); {11404#false} is VALID [2022-04-15 12:54:53,702 INFO L272 TraceCheckUtils]: 26: Hoare triple {11404#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11404#false} is VALID [2022-04-15 12:54:53,702 INFO L290 TraceCheckUtils]: 27: Hoare triple {11404#false} ~cond := #in~cond; {11404#false} is VALID [2022-04-15 12:54:53,702 INFO L290 TraceCheckUtils]: 28: Hoare triple {11404#false} assume 0 == ~cond; {11404#false} is VALID [2022-04-15 12:54:53,702 INFO L290 TraceCheckUtils]: 29: Hoare triple {11404#false} assume !false; {11404#false} is VALID [2022-04-15 12:54:53,702 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 12:54:53,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:54:53,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340961742] [2022-04-15 12:54:53,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340961742] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:54:53,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882981998] [2022-04-15 12:54:53,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:54:53,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:54:53,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:54:53,704 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:54:53,705 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:54:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:53,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 12:54:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:53,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:54:54,202 INFO L272 TraceCheckUtils]: 0: Hoare triple {11403#true} call ULTIMATE.init(); {11403#true} is VALID [2022-04-15 12:54:54,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {11403#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11403#true} is VALID [2022-04-15 12:54:54,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {11403#true} assume true; {11403#true} is VALID [2022-04-15 12:54:54,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11403#true} {11403#true} #83#return; {11403#true} is VALID [2022-04-15 12:54:54,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {11403#true} call #t~ret15 := main(); {11403#true} is VALID [2022-04-15 12:54:54,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {11403#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11403#true} is VALID [2022-04-15 12:54:54,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {11403#true} [133] 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_23 v_main_~y~0_Out_46)) (and (= |v_main_#t~post5_Out_46| 0) (= |v_main_#t~post6_Out_46| 0) (= (+ v_main_~x~0_In_24 v_main_~y~0_In_23) (+ v_main_~y~0_Out_46 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)))) InVars {main_~x~0=v_main_~x~0_In_24, 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_48, main_#t~post6=|v_main_#t~post6_Out_46|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11403#true} is VALID [2022-04-15 12:54:54,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {11403#true} [132] 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[] {11403#true} is VALID [2022-04-15 12:54:54,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {11403#true} ~z~0 := ~y~0; {11440#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:54:54,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {11440#(= 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; {11444#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 12:54:54,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {11444#(= 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; {11448#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-15 12:54:54,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {11448#(= (+ 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; {11452#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-15 12:54:54,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {11452#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {11452#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-15 12:54:54,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {11452#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11444#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 12:54:54,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {11444#(= 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; {11462#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-15 12:54:54,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {11462#(= main_~z~0 (+ main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11466#(= main_~z~0 (+ main_~y~0 3))} is VALID [2022-04-15 12:54:54,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {11466#(= main_~z~0 (+ main_~y~0 3))} assume !(~y~0 % 4294967296 > 0); {11411#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:54,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {11411#(<= 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; {11411#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:54,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {11411#(<= 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; {11411#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:54,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {11411#(<= 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; {11411#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:54,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {11411#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {11411#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:54,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {11411#(<= 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; {11410#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:54:54,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {11410#(<= 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; {11409#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:54:54,226 INFO L290 TraceCheckUtils]: 23: Hoare triple {11409#(<= 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; {11408#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:54:54,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {11408#(<= 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; {11404#false} is VALID [2022-04-15 12:54:54,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {11404#false} assume !(~z~0 % 4294967296 > 0); {11404#false} is VALID [2022-04-15 12:54:54,228 INFO L272 TraceCheckUtils]: 26: Hoare triple {11404#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11404#false} is VALID [2022-04-15 12:54:54,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {11404#false} ~cond := #in~cond; {11404#false} is VALID [2022-04-15 12:54:54,228 INFO L290 TraceCheckUtils]: 28: Hoare triple {11404#false} assume 0 == ~cond; {11404#false} is VALID [2022-04-15 12:54:54,228 INFO L290 TraceCheckUtils]: 29: Hoare triple {11404#false} assume !false; {11404#false} is VALID [2022-04-15 12:54:54,229 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:54:54,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:54:54,950 INFO L290 TraceCheckUtils]: 29: Hoare triple {11404#false} assume !false; {11404#false} is VALID [2022-04-15 12:54:54,950 INFO L290 TraceCheckUtils]: 28: Hoare triple {11404#false} assume 0 == ~cond; {11404#false} is VALID [2022-04-15 12:54:54,950 INFO L290 TraceCheckUtils]: 27: Hoare triple {11404#false} ~cond := #in~cond; {11404#false} is VALID [2022-04-15 12:54:54,950 INFO L272 TraceCheckUtils]: 26: Hoare triple {11404#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11404#false} is VALID [2022-04-15 12:54:54,950 INFO L290 TraceCheckUtils]: 25: Hoare triple {11404#false} assume !(~z~0 % 4294967296 > 0); {11404#false} is VALID [2022-04-15 12:54:54,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {11408#(<= 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; {11404#false} is VALID [2022-04-15 12:54:54,956 INFO L290 TraceCheckUtils]: 23: Hoare triple {11409#(<= 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; {11408#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:54:54,959 INFO L290 TraceCheckUtils]: 22: Hoare triple {11410#(<= 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; {11409#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:54:54,962 INFO L290 TraceCheckUtils]: 21: Hoare triple {11411#(<= 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; {11410#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:54:54,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {11411#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {11411#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:54,963 INFO L290 TraceCheckUtils]: 19: Hoare triple {11411#(<= 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; {11411#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:54,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {11411#(<= 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; {11411#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:54,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {11411#(<= 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; {11411#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:54,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {11548#(or (<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {11411#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:54,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {11552#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 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; {11548#(or (<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:54:54,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {11556#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= 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; {11552#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:54:54,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {11560#(or (<= main_~z~0 (* (div main_~z~0 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; {11556#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)))} is VALID [2022-04-15 12:54:54,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {11560#(or (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {11560#(or (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:54:54,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {11567#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)) (< 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; {11560#(or (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:54:54,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {11571#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 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; {11567#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:54:54,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {11575#(or (< 0 (mod (+ main_~y~0 4294967293) 4294967296)) (<= main_~z~0 (+ 3 (* (div (+ main_~z~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; {11571#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:54:54,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {11403#true} ~z~0 := ~y~0; {11575#(or (< 0 (mod (+ main_~y~0 4294967293) 4294967296)) (<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:54:54,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {11403#true} [132] 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[] {11403#true} is VALID [2022-04-15 12:54:54,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {11403#true} [133] 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_23 v_main_~y~0_Out_46)) (and (= |v_main_#t~post5_Out_46| 0) (= |v_main_#t~post6_Out_46| 0) (= (+ v_main_~x~0_In_24 v_main_~y~0_In_23) (+ v_main_~y~0_Out_46 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)))) InVars {main_~x~0=v_main_~x~0_In_24, 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_48, main_#t~post6=|v_main_#t~post6_Out_46|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11403#true} is VALID [2022-04-15 12:54:54,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {11403#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11403#true} is VALID [2022-04-15 12:54:54,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {11403#true} call #t~ret15 := main(); {11403#true} is VALID [2022-04-15 12:54:54,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11403#true} {11403#true} #83#return; {11403#true} is VALID [2022-04-15 12:54:54,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {11403#true} assume true; {11403#true} is VALID [2022-04-15 12:54:54,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {11403#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11403#true} is VALID [2022-04-15 12:54:54,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {11403#true} call ULTIMATE.init(); {11403#true} is VALID [2022-04-15 12:54:54,988 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:54:54,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882981998] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:54:54,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:54:54,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 13] total 20 [2022-04-15 12:54:55,342 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:54:55,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1798349245] [2022-04-15 12:54:55,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1798349245] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:54:55,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:54:55,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:54:55,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237695897] [2022-04-15 12:54:55,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:54:55,343 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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 32 [2022-04-15 12:54:55,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:54:55,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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:54:55,426 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:54:55,426 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:54:55,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:54:55,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:54:55,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:54:55,427 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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:54:58,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:58,861 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-15 12:54:58,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 12:54:58,861 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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 32 [2022-04-15 12:54:58,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:54:58,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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:54:58,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 58 transitions. [2022-04-15 12:54:58,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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:54:58,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 58 transitions. [2022-04-15 12:54:58,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 58 transitions. [2022-04-15 12:54:59,092 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:54:59,093 INFO L225 Difference]: With dead ends: 79 [2022-04-15 12:54:59,093 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 12:54:59,093 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=190, Invalid=1216, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 12:54:59,094 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 33 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:54:59,094 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 48 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 12:54:59,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 12:54:59,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2022-04-15 12:54:59,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:54:59,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:59,482 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:59,482 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:59,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:59,483 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-04-15 12:54:59,483 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2022-04-15 12:54:59,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:54:59,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:54:59,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-15 12:54:59,484 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-15 12:54:59,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:59,485 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-04-15 12:54:59,485 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2022-04-15 12:54:59,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:54:59,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:54:59,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:54:59,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:54:59,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:59,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-04-15 12:54:59,487 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 32 [2022-04-15 12:54:59,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:54:59,487 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-04-15 12:54:59,487 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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:54:59,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 66 transitions. [2022-04-15 12:55:01,562 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:01,562 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-15 12:55:01,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 12:55:01,562 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:01,562 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:01,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-15 12:55:01,771 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,SelfDestructingSolverStorable27 [2022-04-15 12:55:01,772 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:01,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:01,772 INFO L85 PathProgramCache]: Analyzing trace with hash -876076878, now seen corresponding path program 11 times [2022-04-15 12:55:01,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:01,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [143690869] [2022-04-15 12:55:01,878 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:01,880 INFO L85 PathProgramCache]: Analyzing trace with hash -216145965, now seen corresponding path program 1 times [2022-04-15 12:55:01,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:01,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928880276] [2022-04-15 12:55:01,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:01,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:02,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:02,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {12044#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12031#true} is VALID [2022-04-15 12:55:02,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-15 12:55:02,152 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12031#true} {12031#true} #83#return; {12031#true} is VALID [2022-04-15 12:55:02,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {12031#true} call ULTIMATE.init(); {12044#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:02,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {12044#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12031#true} is VALID [2022-04-15 12:55:02,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-15 12:55:02,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12031#true} {12031#true} #83#return; {12031#true} is VALID [2022-04-15 12:55:02,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {12031#true} call #t~ret15 := main(); {12031#true} is VALID [2022-04-15 12:55:02,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {12031#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12031#true} is VALID [2022-04-15 12:55:02,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {12031#true} [135] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_24 v_main_~y~0_Out_48) (= v_main_~x~0_In_25 v_main_~x~0_Out_50)) (and (<= 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_48| 0) (= (+ v_main_~x~0_In_25 v_main_~y~0_In_24) (+ v_main_~y~0_Out_48 v_main_~x~0_Out_50)) (= |v_main_#t~post5_Out_48| 0))) InVars {main_~x~0=v_main_~x~0_In_25, 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_50, main_#t~post6=|v_main_#t~post6_Out_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12031#true} is VALID [2022-04-15 12:55:02,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {12031#true} [134] 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[] {12036#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:55:02,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {12036#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {12036#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:55:02,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {12036#(<= 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; {12037#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 1))} is VALID [2022-04-15 12:55:02,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {12037#(<= main_~x~0 (+ (* 4294967296 (div main_~x~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; {12038#(<= main_~x~0 (+ 2 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:02,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {12038#(<= main_~x~0 (+ 2 (* (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; {12039#(<= main_~x~0 (+ 3 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:02,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {12039#(<= main_~x~0 (+ 3 (* (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; {12040#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 12:55:02,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {12040#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296) 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12041#(<= main_~x~0 (+ 5 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:02,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {12041#(<= main_~x~0 (+ 5 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {12041#(<= main_~x~0 (+ 5 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:02,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {12041#(<= main_~x~0 (+ 5 (* (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; {12041#(<= main_~x~0 (+ 5 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:02,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {12041#(<= main_~x~0 (+ 5 (* (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; {12041#(<= main_~x~0 (+ 5 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:02,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {12041#(<= main_~x~0 (+ 5 (* (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; {12041#(<= main_~x~0 (+ 5 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:02,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {12041#(<= main_~x~0 (+ 5 (* (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; {12041#(<= main_~x~0 (+ 5 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:02,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {12041#(<= main_~x~0 (+ 5 (* (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; {12041#(<= main_~x~0 (+ 5 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:02,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {12041#(<= main_~x~0 (+ 5 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {12041#(<= main_~x~0 (+ 5 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:02,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {12041#(<= main_~x~0 (+ 5 (* (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; {12040#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 12:55:02,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {12040#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296) 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12042#(<= (div main_~x~0 4294967296) (div (+ (- 2) main_~x~0) 4294967296))} is VALID [2022-04-15 12:55:02,180 INFO L290 TraceCheckUtils]: 23: Hoare triple {12042#(<= (div main_~x~0 4294967296) (div (+ (- 2) 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; {12043#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:55:02,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {12043#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {12032#false} is VALID [2022-04-15 12:55:02,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {12032#false} assume !(~z~0 % 4294967296 > 0); {12032#false} is VALID [2022-04-15 12:55:02,182 INFO L272 TraceCheckUtils]: 26: Hoare triple {12032#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12032#false} is VALID [2022-04-15 12:55:02,182 INFO L290 TraceCheckUtils]: 27: Hoare triple {12032#false} ~cond := #in~cond; {12032#false} is VALID [2022-04-15 12:55:02,182 INFO L290 TraceCheckUtils]: 28: Hoare triple {12032#false} assume 0 == ~cond; {12032#false} is VALID [2022-04-15 12:55:02,182 INFO L290 TraceCheckUtils]: 29: Hoare triple {12032#false} assume !false; {12032#false} is VALID [2022-04-15 12:55:02,182 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 12:55:02,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:02,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928880276] [2022-04-15 12:55:02,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928880276] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:02,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13764677] [2022-04-15 12:55:02,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:02,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:02,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:02,184 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:55:02,184 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:55:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:02,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 12:55:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:02,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:02,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {12031#true} call ULTIMATE.init(); {12031#true} is VALID [2022-04-15 12:55:02,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {12031#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12031#true} is VALID [2022-04-15 12:55:02,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-15 12:55:02,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12031#true} {12031#true} #83#return; {12031#true} is VALID [2022-04-15 12:55:02,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {12031#true} call #t~ret15 := main(); {12031#true} is VALID [2022-04-15 12:55:02,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {12031#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12031#true} is VALID [2022-04-15 12:55:02,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {12031#true} [135] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_24 v_main_~y~0_Out_48) (= v_main_~x~0_In_25 v_main_~x~0_Out_50)) (and (<= 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_48| 0) (= (+ v_main_~x~0_In_25 v_main_~y~0_In_24) (+ v_main_~y~0_Out_48 v_main_~x~0_Out_50)) (= |v_main_#t~post5_Out_48| 0))) InVars {main_~x~0=v_main_~x~0_In_25, 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_50, main_#t~post6=|v_main_#t~post6_Out_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12031#true} is VALID [2022-04-15 12:55:02,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {12031#true} [134] 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[] {12031#true} is VALID [2022-04-15 12:55:02,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {12031#true} ~z~0 := ~y~0; {12031#true} is VALID [2022-04-15 12:55:02,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {12031#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; {12075#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:55:02,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {12075#(< 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; {12079#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:55:02,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {12079#(< 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; {12083#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:55:02,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {12083#(< 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; {12087#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:55:02,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {12087#(< 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; {12091#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 12:55:02,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {12091#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {12091#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 12:55:02,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {12091#(< 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; {12087#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:55:02,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {12087#(< 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; {12083#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:55:02,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {12083#(< 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; {12079#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:55:02,601 INFO L290 TraceCheckUtils]: 18: Hoare triple {12079#(< 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; {12075#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:55:02,603 INFO L290 TraceCheckUtils]: 19: Hoare triple {12075#(< 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; {12110#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:02,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {12110#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {12110#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:02,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {12110#(< 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; {12110#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:02,603 INFO L290 TraceCheckUtils]: 22: Hoare triple {12110#(< 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; {12110#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:02,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {12110#(< 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; {12110#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:02,604 INFO L290 TraceCheckUtils]: 24: Hoare triple {12110#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {12110#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:02,604 INFO L290 TraceCheckUtils]: 25: Hoare triple {12110#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {12032#false} is VALID [2022-04-15 12:55:02,604 INFO L272 TraceCheckUtils]: 26: Hoare triple {12032#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12032#false} is VALID [2022-04-15 12:55:02,604 INFO L290 TraceCheckUtils]: 27: Hoare triple {12032#false} ~cond := #in~cond; {12032#false} is VALID [2022-04-15 12:55:02,604 INFO L290 TraceCheckUtils]: 28: Hoare triple {12032#false} assume 0 == ~cond; {12032#false} is VALID [2022-04-15 12:55:02,605 INFO L290 TraceCheckUtils]: 29: Hoare triple {12032#false} assume !false; {12032#false} is VALID [2022-04-15 12:55:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:55:02,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:55:02,725 INFO L290 TraceCheckUtils]: 29: Hoare triple {12032#false} assume !false; {12032#false} is VALID [2022-04-15 12:55:02,725 INFO L290 TraceCheckUtils]: 28: Hoare triple {12032#false} assume 0 == ~cond; {12032#false} is VALID [2022-04-15 12:55:02,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {12032#false} ~cond := #in~cond; {12032#false} is VALID [2022-04-15 12:55:02,725 INFO L272 TraceCheckUtils]: 26: Hoare triple {12032#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12032#false} is VALID [2022-04-15 12:55:02,725 INFO L290 TraceCheckUtils]: 25: Hoare triple {12110#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {12032#false} is VALID [2022-04-15 12:55:02,726 INFO L290 TraceCheckUtils]: 24: Hoare triple {12110#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {12110#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:02,726 INFO L290 TraceCheckUtils]: 23: Hoare triple {12110#(< 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; {12110#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:02,726 INFO L290 TraceCheckUtils]: 22: Hoare triple {12110#(< 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; {12110#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:02,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {12110#(< 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; {12110#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:02,727 INFO L290 TraceCheckUtils]: 20: Hoare triple {12110#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {12110#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:02,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {12075#(< 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; {12110#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:02,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {12079#(< 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; {12075#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:55:02,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {12083#(< 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; {12079#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:55:02,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {12087#(< 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; {12083#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:55:02,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {12091#(< 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; {12087#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:55:02,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {12091#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {12091#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 12:55:02,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {12087#(< 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; {12091#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 12:55:02,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {12083#(< 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; {12087#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:55:02,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {12079#(< 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; {12083#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:55:02,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {12075#(< 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; {12079#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:55:02,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {12031#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; {12075#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:55:02,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {12031#true} ~z~0 := ~y~0; {12031#true} is VALID [2022-04-15 12:55:02,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {12031#true} [134] 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[] {12031#true} is VALID [2022-04-15 12:55:02,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {12031#true} [135] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_24 v_main_~y~0_Out_48) (= v_main_~x~0_In_25 v_main_~x~0_Out_50)) (and (<= 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_48| 0) (= (+ v_main_~x~0_In_25 v_main_~y~0_In_24) (+ v_main_~y~0_Out_48 v_main_~x~0_Out_50)) (= |v_main_#t~post5_Out_48| 0))) InVars {main_~x~0=v_main_~x~0_In_25, 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_50, main_#t~post6=|v_main_#t~post6_Out_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12031#true} is VALID [2022-04-15 12:55:02,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {12031#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12031#true} is VALID [2022-04-15 12:55:02,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {12031#true} call #t~ret15 := main(); {12031#true} is VALID [2022-04-15 12:55:02,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12031#true} {12031#true} #83#return; {12031#true} is VALID [2022-04-15 12:55:02,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-15 12:55:02,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {12031#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12031#true} is VALID [2022-04-15 12:55:02,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {12031#true} call ULTIMATE.init(); {12031#true} is VALID [2022-04-15 12:55:02,748 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:55:02,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13764677] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:55:02,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:55:02,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 17 [2022-04-15 12:55:03,153 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:03,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [143690869] [2022-04-15 12:55:03,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [143690869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:03,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:03,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:55:03,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003897806] [2022-04-15 12:55:03,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:03,154 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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 32 [2022-04-15 12:55:03,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:03,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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:55:03,257 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:55:03,257 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:55:03,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:03,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:55:03,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:55:03,258 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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:55:09,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:09,781 INFO L93 Difference]: Finished difference Result 135 states and 173 transitions. [2022-04-15 12:55:09,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 12:55:09,781 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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 32 [2022-04-15 12:55:09,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:09,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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:55:09,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 113 transitions. [2022-04-15 12:55:09,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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:55:09,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 113 transitions. [2022-04-15 12:55:09,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 113 transitions. [2022-04-15 12:55:10,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:10,253 INFO L225 Difference]: With dead ends: 135 [2022-04-15 12:55:10,253 INFO L226 Difference]: Without dead ends: 124 [2022-04-15 12:55:10,254 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=332, Invalid=1228, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 12:55:10,254 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 115 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:10,254 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 53 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 12:55:10,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-15 12:55:10,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 67. [2022-04-15 12:55:10,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:10,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 67 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 62 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call 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:10,884 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 67 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 62 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call 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:10,884 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 67 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 62 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call 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:10,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:10,887 INFO L93 Difference]: Finished difference Result 124 states and 156 transitions. [2022-04-15 12:55:10,887 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 156 transitions. [2022-04-15 12:55:10,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:10,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:10,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 62 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 124 states. [2022-04-15 12:55:10,888 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 62 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 124 states. [2022-04-15 12:55:10,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:10,889 INFO L93 Difference]: Finished difference Result 124 states and 156 transitions. [2022-04-15 12:55:10,889 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 156 transitions. [2022-04-15 12:55:10,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:10,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:10,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:10,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 62 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call 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:10,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2022-04-15 12:55:10,891 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 32 [2022-04-15 12:55:10,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:10,892 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2022-04-15 12:55:10,892 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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:55:10,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 81 transitions. [2022-04-15 12:55:13,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:13,920 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2022-04-15 12:55:13,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 12:55:13,920 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:13,921 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:13,937 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:55:14,121 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,SelfDestructingSolverStorable28 [2022-04-15 12:55:14,121 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:14,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:14,121 INFO L85 PathProgramCache]: Analyzing trace with hash 93956866, now seen corresponding path program 12 times [2022-04-15 12:55:14,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:14,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2048988699] [2022-04-15 12:55:14,288 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:14,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1071086638, now seen corresponding path program 1 times [2022-04-15 12:55:14,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:14,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941274532] [2022-04-15 12:55:14,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:14,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:14,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:14,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {12938#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12925#true} is VALID [2022-04-15 12:55:14,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {12925#true} assume true; {12925#true} is VALID [2022-04-15 12:55:14,494 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12925#true} {12925#true} #83#return; {12925#true} is VALID [2022-04-15 12:55:14,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {12925#true} call ULTIMATE.init(); {12938#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:14,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {12938#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12925#true} is VALID [2022-04-15 12:55:14,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {12925#true} assume true; {12925#true} is VALID [2022-04-15 12:55:14,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12925#true} {12925#true} #83#return; {12925#true} is VALID [2022-04-15 12:55:14,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {12925#true} call #t~ret15 := main(); {12925#true} is VALID [2022-04-15 12:55:14,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {12925#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12925#true} is VALID [2022-04-15 12:55:14,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {12925#true} [137] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_52 1) 4294967296)) (= (+ v_main_~x~0_In_26 v_main_~y~0_In_25) (+ v_main_~y~0_Out_50 v_main_~x~0_Out_52)) (= |v_main_#t~post5_Out_50| 0) (<= v_main_~x~0_Out_52 v_main_~x~0_In_26) (= |v_main_#t~post6_Out_50| 0)) (and (= v_main_~x~0_In_26 v_main_~x~0_Out_52) (= v_main_~y~0_In_25 v_main_~y~0_Out_50))) InVars {main_~x~0=v_main_~x~0_In_26, 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_52, main_#t~post6=|v_main_#t~post6_Out_50|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12925#true} is VALID [2022-04-15 12:55:14,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {12925#true} [136] 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[] {12925#true} is VALID [2022-04-15 12:55:14,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {12925#true} ~z~0 := ~y~0; {12925#true} is VALID [2022-04-15 12:55:14,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {12925#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; {12930#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:14,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {12930#(<= main_~z~0 (+ 4294967294 (* (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; {12931#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:55:14,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {12931#(<= 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; {12932#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:14,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {12932#(<= 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; {12933#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:14,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {12933#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {12933#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:14,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {12933#(<= 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; {12934#(<= main_~z~0 (+ 4294967292 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:55:14,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {12934#(<= 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; {12935#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967293))} is VALID [2022-04-15 12:55:14,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {12935#(<= 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; {12936#(<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:14,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {12936#(<= 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; {12937#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-15 12:55:14,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {12937#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {12937#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-15 12:55:14,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {12937#(<= (+ (* (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; {12937#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-15 12:55:14,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {12937#(<= (+ (* (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; {12937#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-15 12:55:14,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {12937#(<= (+ (* (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; {12937#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-15 12:55:14,518 INFO L290 TraceCheckUtils]: 22: Hoare triple {12937#(<= (+ (* (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; {12937#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-15 12:55:14,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {12937#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {12937#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-15 12:55:14,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {12937#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {12926#false} is VALID [2022-04-15 12:55:14,520 INFO L272 TraceCheckUtils]: 25: Hoare triple {12926#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12926#false} is VALID [2022-04-15 12:55:14,520 INFO L290 TraceCheckUtils]: 26: Hoare triple {12926#false} ~cond := #in~cond; {12926#false} is VALID [2022-04-15 12:55:14,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {12926#false} assume 0 == ~cond; {12926#false} is VALID [2022-04-15 12:55:14,520 INFO L290 TraceCheckUtils]: 28: Hoare triple {12926#false} assume !false; {12926#false} is VALID [2022-04-15 12:55:14,520 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:55:14,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:14,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941274532] [2022-04-15 12:55:14,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941274532] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:14,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576119233] [2022-04-15 12:55:14,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:14,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:14,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:14,522 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:55:14,522 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:55:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:14,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 12:55:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:14,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:14,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {12925#true} call ULTIMATE.init(); {12925#true} is VALID [2022-04-15 12:55:14,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {12925#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12925#true} is VALID [2022-04-15 12:55:14,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {12925#true} assume true; {12925#true} is VALID [2022-04-15 12:55:14,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12925#true} {12925#true} #83#return; {12925#true} is VALID [2022-04-15 12:55:14,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {12925#true} call #t~ret15 := main(); {12925#true} is VALID [2022-04-15 12:55:14,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {12925#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12925#true} is VALID [2022-04-15 12:55:14,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {12925#true} [137] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_52 1) 4294967296)) (= (+ v_main_~x~0_In_26 v_main_~y~0_In_25) (+ v_main_~y~0_Out_50 v_main_~x~0_Out_52)) (= |v_main_#t~post5_Out_50| 0) (<= v_main_~x~0_Out_52 v_main_~x~0_In_26) (= |v_main_#t~post6_Out_50| 0)) (and (= v_main_~x~0_In_26 v_main_~x~0_Out_52) (= v_main_~y~0_In_25 v_main_~y~0_Out_50))) InVars {main_~x~0=v_main_~x~0_In_26, 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_52, main_#t~post6=|v_main_#t~post6_Out_50|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12925#true} is VALID [2022-04-15 12:55:14,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {12925#true} [136] 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[] {12925#true} is VALID [2022-04-15 12:55:14,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {12925#true} ~z~0 := ~y~0; {12925#true} is VALID [2022-04-15 12:55:14,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {12925#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; {12930#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:14,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {12930#(<= main_~z~0 (+ 4294967294 (* (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; {12972#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:55:14,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {12972#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12976#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:14,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {12976#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12980#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:14,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {12980#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {12980#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:14,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {12980#(<= main_~z~0 (+ 4294967291 (* (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; {12976#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:14,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {12976#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 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; {12972#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:55:14,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {12972#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 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; {12930#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:14,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {12930#(<= 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; {12996#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:55:14,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {12996#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {12996#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:55:14,989 INFO L290 TraceCheckUtils]: 19: Hoare triple {12996#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {12996#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:55:14,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {12996#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {12996#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:55:14,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {12996#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {12996#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:55:14,990 INFO L290 TraceCheckUtils]: 22: Hoare triple {12996#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {12996#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:55:14,990 INFO L290 TraceCheckUtils]: 23: Hoare triple {12996#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {12996#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:55:14,994 INFO L290 TraceCheckUtils]: 24: Hoare triple {12996#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {12926#false} is VALID [2022-04-15 12:55:14,994 INFO L272 TraceCheckUtils]: 25: Hoare triple {12926#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12926#false} is VALID [2022-04-15 12:55:14,994 INFO L290 TraceCheckUtils]: 26: Hoare triple {12926#false} ~cond := #in~cond; {12926#false} is VALID [2022-04-15 12:55:14,994 INFO L290 TraceCheckUtils]: 27: Hoare triple {12926#false} assume 0 == ~cond; {12926#false} is VALID [2022-04-15 12:55:14,994 INFO L290 TraceCheckUtils]: 28: Hoare triple {12926#false} assume !false; {12926#false} is VALID [2022-04-15 12:55:14,994 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:55:14,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:55:15,171 INFO L290 TraceCheckUtils]: 28: Hoare triple {12926#false} assume !false; {12926#false} is VALID [2022-04-15 12:55:15,171 INFO L290 TraceCheckUtils]: 27: Hoare triple {12926#false} assume 0 == ~cond; {12926#false} is VALID [2022-04-15 12:55:15,171 INFO L290 TraceCheckUtils]: 26: Hoare triple {12926#false} ~cond := #in~cond; {12926#false} is VALID [2022-04-15 12:55:15,171 INFO L272 TraceCheckUtils]: 25: Hoare triple {12926#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12926#false} is VALID [2022-04-15 12:55:15,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {12996#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {12926#false} is VALID [2022-04-15 12:55:15,175 INFO L290 TraceCheckUtils]: 23: Hoare triple {12996#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {12996#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:55:15,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {12996#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {12996#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:55:15,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {12996#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {12996#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:55:15,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {12996#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {12996#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:55:15,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {12996#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {12996#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:55:15,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {12996#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {12996#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:55:15,180 INFO L290 TraceCheckUtils]: 17: Hoare triple {12930#(<= 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; {12996#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:55:15,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {12972#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 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; {12930#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:15,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {12976#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 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; {12972#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:55:15,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {12980#(<= main_~z~0 (+ 4294967291 (* (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; {12976#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:15,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {12980#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {12980#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:15,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {12976#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12980#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:15,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {12972#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12976#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:15,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {12930#(<= main_~z~0 (+ 4294967294 (* (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; {12972#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:55:15,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {12925#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; {12930#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:15,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {12925#true} ~z~0 := ~y~0; {12925#true} is VALID [2022-04-15 12:55:15,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {12925#true} [136] 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[] {12925#true} is VALID [2022-04-15 12:55:15,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {12925#true} [137] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_52 1) 4294967296)) (= (+ v_main_~x~0_In_26 v_main_~y~0_In_25) (+ v_main_~y~0_Out_50 v_main_~x~0_Out_52)) (= |v_main_#t~post5_Out_50| 0) (<= v_main_~x~0_Out_52 v_main_~x~0_In_26) (= |v_main_#t~post6_Out_50| 0)) (and (= v_main_~x~0_In_26 v_main_~x~0_Out_52) (= v_main_~y~0_In_25 v_main_~y~0_Out_50))) InVars {main_~x~0=v_main_~x~0_In_26, 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_52, main_#t~post6=|v_main_#t~post6_Out_50|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12925#true} is VALID [2022-04-15 12:55:15,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {12925#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12925#true} is VALID [2022-04-15 12:55:15,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {12925#true} call #t~ret15 := main(); {12925#true} is VALID [2022-04-15 12:55:15,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12925#true} {12925#true} #83#return; {12925#true} is VALID [2022-04-15 12:55:15,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {12925#true} assume true; {12925#true} is VALID [2022-04-15 12:55:15,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {12925#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12925#true} is VALID [2022-04-15 12:55:15,202 INFO L272 TraceCheckUtils]: 0: Hoare triple {12925#true} call ULTIMATE.init(); {12925#true} is VALID [2022-04-15 12:55:15,202 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:55:15,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576119233] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:55:15,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:55:15,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 15 [2022-04-15 12:55:15,554 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:15,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2048988699] [2022-04-15 12:55:15,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2048988699] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:15,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:15,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 12:55:15,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985824460] [2022-04-15 12:55:15,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:15,555 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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 32 [2022-04-15 12:55:15,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:15,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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:55:15,622 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:55:15,622 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 12:55:15,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:15,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 12:55:15,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:55:15,623 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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:55:20,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:20,910 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2022-04-15 12:55:20,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 12:55:20,910 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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 32 [2022-04-15 12:55:20,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:20,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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:55:20,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 70 transitions. [2022-04-15 12:55:20,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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:55:20,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 70 transitions. [2022-04-15 12:55:20,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 70 transitions. [2022-04-15 12:55:21,416 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:55:21,417 INFO L225 Difference]: With dead ends: 90 [2022-04-15 12:55:21,417 INFO L226 Difference]: Without dead ends: 85 [2022-04-15 12:55:21,418 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=334, Invalid=1388, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 12:55:21,418 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 47 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:21,419 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 42 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 12:55:21,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-15 12:55:22,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2022-04-15 12:55:22,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:22,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 76 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 71 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call 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:22,069 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 76 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 71 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call 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:22,069 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 76 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 71 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call 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:22,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:22,071 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2022-04-15 12:55:22,072 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2022-04-15 12:55:22,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:22,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:22,072 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 71 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states. [2022-04-15 12:55:22,072 INFO L87 Difference]: Start difference. First operand has 76 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 71 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states. [2022-04-15 12:55:22,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:22,073 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2022-04-15 12:55:22,074 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2022-04-15 12:55:22,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:22,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:22,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:22,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:22,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 71 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call 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:22,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2022-04-15 12:55:22,075 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 32 [2022-04-15 12:55:22,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:22,075 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2022-04-15 12:55:22,076 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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:55:22,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 91 transitions. [2022-04-15 12:55:25,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:25,617 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-15 12:55:25,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 12:55:25,617 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:25,617 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:25,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-15 12:55:25,818 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:25,818 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:25,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:25,818 INFO L85 PathProgramCache]: Analyzing trace with hash 48744064, now seen corresponding path program 13 times [2022-04-15 12:55:25,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:25,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [131645305] [2022-04-15 12:55:25,989 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:25,990 INFO L85 PathProgramCache]: Analyzing trace with hash -955163905, now seen corresponding path program 1 times [2022-04-15 12:55:25,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:25,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956527062] [2022-04-15 12:55:25,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:25,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:26,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:26,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {13682#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13669#true} is VALID [2022-04-15 12:55:26,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {13669#true} assume true; {13669#true} is VALID [2022-04-15 12:55:26,416 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13669#true} {13669#true} #83#return; {13669#true} is VALID [2022-04-15 12:55:26,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {13669#true} call ULTIMATE.init(); {13682#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:26,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {13682#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13669#true} is VALID [2022-04-15 12:55:26,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {13669#true} assume true; {13669#true} is VALID [2022-04-15 12:55:26,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13669#true} {13669#true} #83#return; {13669#true} is VALID [2022-04-15 12:55:26,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {13669#true} call #t~ret15 := main(); {13669#true} is VALID [2022-04-15 12:55:26,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {13669#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13674#(= main_~y~0 0)} is VALID [2022-04-15 12:55:26,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {13674#(= main_~y~0 0)} [139] 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~post6_Out_52| 0) (= (+ v_main_~y~0_Out_52 v_main_~x~0_Out_54) (+ v_main_~x~0_In_27 v_main_~y~0_In_26)) (= |v_main_#t~post5_Out_52| 0)) (and (= v_main_~y~0_In_26 v_main_~y~0_Out_52) (= 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_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_54, main_#t~post6=|v_main_#t~post6_Out_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13675#(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:26,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {13675#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} [138] 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[] {13675#(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:26,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {13675#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} ~z~0 := ~y~0; {13676#(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:26,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {13676#(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; {13677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:26,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {13677#(<= 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; {13678#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:26,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {13678#(<= main_~x~0 (+ 4294967296 (* (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; {13679#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:26,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {13679#(<= main_~x~0 (+ 4294967297 (* (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; {13680#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:55:26,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {13680#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13681#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} is VALID [2022-04-15 12:55:26,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {13681#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} assume !(~z~0 % 4294967296 > 0); {13681#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} is VALID [2022-04-15 12:55:26,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {13681#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 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; {13681#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} is VALID [2022-04-15 12:55:26,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {13681#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 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; {13681#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} is VALID [2022-04-15 12:55:26,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {13681#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 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; {13681#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} is VALID [2022-04-15 12:55:26,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {13681#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 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; {13681#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} is VALID [2022-04-15 12:55:26,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {13681#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 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; {13681#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} is VALID [2022-04-15 12:55:26,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {13681#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} assume !(~y~0 % 4294967296 > 0); {13681#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} is VALID [2022-04-15 12:55:26,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {13681#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13680#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:55:26,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {13680#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13679#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:26,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {13679#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13678#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:26,459 INFO L290 TraceCheckUtils]: 24: Hoare triple {13678#(<= 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; {13677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:26,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {13677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {13670#false} is VALID [2022-04-15 12:55:26,462 INFO L290 TraceCheckUtils]: 26: Hoare triple {13670#false} assume !(~z~0 % 4294967296 > 0); {13670#false} is VALID [2022-04-15 12:55:26,462 INFO L272 TraceCheckUtils]: 27: Hoare triple {13670#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13670#false} is VALID [2022-04-15 12:55:26,462 INFO L290 TraceCheckUtils]: 28: Hoare triple {13670#false} ~cond := #in~cond; {13670#false} is VALID [2022-04-15 12:55:26,462 INFO L290 TraceCheckUtils]: 29: Hoare triple {13670#false} assume 0 == ~cond; {13670#false} is VALID [2022-04-15 12:55:26,462 INFO L290 TraceCheckUtils]: 30: Hoare triple {13670#false} assume !false; {13670#false} is VALID [2022-04-15 12:55:26,462 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 12:55:26,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:26,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956527062] [2022-04-15 12:55:26,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956527062] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:26,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246585021] [2022-04-15 12:55:26,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:26,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:26,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:26,464 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:55:26,464 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:55:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:26,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 12:55:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:26,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:26,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {13669#true} call ULTIMATE.init(); {13669#true} is VALID [2022-04-15 12:55:26,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {13669#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13669#true} is VALID [2022-04-15 12:55:26,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {13669#true} assume true; {13669#true} is VALID [2022-04-15 12:55:26,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13669#true} {13669#true} #83#return; {13669#true} is VALID [2022-04-15 12:55:26,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {13669#true} call #t~ret15 := main(); {13669#true} is VALID [2022-04-15 12:55:26,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {13669#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13669#true} is VALID [2022-04-15 12:55:26,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {13669#true} [139] 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~post6_Out_52| 0) (= (+ v_main_~y~0_Out_52 v_main_~x~0_Out_54) (+ v_main_~x~0_In_27 v_main_~y~0_In_26)) (= |v_main_#t~post5_Out_52| 0)) (and (= v_main_~y~0_In_26 v_main_~y~0_Out_52) (= 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_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_54, main_#t~post6=|v_main_#t~post6_Out_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13669#true} is VALID [2022-04-15 12:55:26,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {13669#true} [138] 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[] {13669#true} is VALID [2022-04-15 12:55:26,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {13669#true} ~z~0 := ~y~0; {13669#true} is VALID [2022-04-15 12:55:26,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {13669#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; {13713#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:55:26,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {13713#(< 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; {13717#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:55:26,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {13717#(< 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; {13721#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:55:26,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {13721#(< 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; {13725#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:55:26,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {13725#(< 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; {13729#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 12:55:26,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {13729#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {13729#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 12:55:26,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {13729#(< 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; {13725#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:55:26,953 INFO L290 TraceCheckUtils]: 16: Hoare triple {13725#(< 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; {13721#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:55:26,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {13721#(< 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; {13717#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:55:26,956 INFO L290 TraceCheckUtils]: 18: Hoare triple {13717#(< 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; {13713#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:55:26,958 INFO L290 TraceCheckUtils]: 19: Hoare triple {13713#(< 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; {13748#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:26,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {13748#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {13748#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:26,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {13748#(< 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; {13748#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:26,959 INFO L290 TraceCheckUtils]: 22: Hoare triple {13748#(< 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; {13748#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:26,959 INFO L290 TraceCheckUtils]: 23: Hoare triple {13748#(< 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; {13748#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:26,959 INFO L290 TraceCheckUtils]: 24: Hoare triple {13748#(< 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; {13748#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:26,960 INFO L290 TraceCheckUtils]: 25: Hoare triple {13748#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {13748#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:26,960 INFO L290 TraceCheckUtils]: 26: Hoare triple {13748#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {13670#false} is VALID [2022-04-15 12:55:26,960 INFO L272 TraceCheckUtils]: 27: Hoare triple {13670#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13670#false} is VALID [2022-04-15 12:55:26,960 INFO L290 TraceCheckUtils]: 28: Hoare triple {13670#false} ~cond := #in~cond; {13670#false} is VALID [2022-04-15 12:55:26,960 INFO L290 TraceCheckUtils]: 29: Hoare triple {13670#false} assume 0 == ~cond; {13670#false} is VALID [2022-04-15 12:55:26,960 INFO L290 TraceCheckUtils]: 30: Hoare triple {13670#false} assume !false; {13670#false} is VALID [2022-04-15 12:55:26,960 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:55:26,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:55:27,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {13670#false} assume !false; {13670#false} is VALID [2022-04-15 12:55:27,096 INFO L290 TraceCheckUtils]: 29: Hoare triple {13670#false} assume 0 == ~cond; {13670#false} is VALID [2022-04-15 12:55:27,096 INFO L290 TraceCheckUtils]: 28: Hoare triple {13670#false} ~cond := #in~cond; {13670#false} is VALID [2022-04-15 12:55:27,096 INFO L272 TraceCheckUtils]: 27: Hoare triple {13670#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13670#false} is VALID [2022-04-15 12:55:27,096 INFO L290 TraceCheckUtils]: 26: Hoare triple {13748#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {13670#false} is VALID [2022-04-15 12:55:27,096 INFO L290 TraceCheckUtils]: 25: Hoare triple {13748#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {13748#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:27,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {13748#(< 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; {13748#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:27,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {13748#(< 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; {13748#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:27,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {13748#(< 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; {13748#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:27,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {13748#(< 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; {13748#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:27,098 INFO L290 TraceCheckUtils]: 20: Hoare triple {13748#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {13748#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:27,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {13713#(< 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; {13748#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:27,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {13717#(< 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; {13713#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:55:27,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {13721#(< 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; {13717#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:55:27,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {13725#(< 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; {13721#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:55:27,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {13729#(< 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; {13725#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:55:27,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {13729#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {13729#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 12:55:27,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {13725#(< 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; {13729#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 12:55:27,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {13721#(< 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; {13725#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:55:27,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {13717#(< 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; {13721#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:55:27,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {13713#(< 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; {13717#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:55:27,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {13669#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; {13713#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:55:27,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {13669#true} ~z~0 := ~y~0; {13669#true} is VALID [2022-04-15 12:55:27,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {13669#true} [138] 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[] {13669#true} is VALID [2022-04-15 12:55:27,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {13669#true} [139] 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~post6_Out_52| 0) (= (+ v_main_~y~0_Out_52 v_main_~x~0_Out_54) (+ v_main_~x~0_In_27 v_main_~y~0_In_26)) (= |v_main_#t~post5_Out_52| 0)) (and (= v_main_~y~0_In_26 v_main_~y~0_Out_52) (= 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_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_54, main_#t~post6=|v_main_#t~post6_Out_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13669#true} is VALID [2022-04-15 12:55:27,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {13669#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13669#true} is VALID [2022-04-15 12:55:27,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {13669#true} call #t~ret15 := main(); {13669#true} is VALID [2022-04-15 12:55:27,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13669#true} {13669#true} #83#return; {13669#true} is VALID [2022-04-15 12:55:27,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {13669#true} assume true; {13669#true} is VALID [2022-04-15 12:55:27,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {13669#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13669#true} is VALID [2022-04-15 12:55:27,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {13669#true} call ULTIMATE.init(); {13669#true} is VALID [2022-04-15 12:55:27,123 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:55:27,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246585021] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:55:27,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:55:27,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 17 [2022-04-15 12:55:27,848 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:27,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [131645305] [2022-04-15 12:55:27,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [131645305] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:27,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:27,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:55:27,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127768499] [2022-04-15 12:55:27,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:27,849 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 33 [2022-04-15 12:55:27,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:27,849 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:55:27,956 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:55:27,956 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:55:27,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:27,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:55:27,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:55:27,957 INFO L87 Difference]: Start difference. First operand 76 states and 91 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:55:35,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:35,694 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2022-04-15 12:55:35,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 12:55:35,694 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 33 [2022-04-15 12:55:35,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:35,694 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:55:35,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 77 transitions. [2022-04-15 12:55:35,696 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:55:35,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 77 transitions. [2022-04-15 12:55:35,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 77 transitions. [2022-04-15 12:55:36,277 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:55:36,278 INFO L225 Difference]: With dead ends: 106 [2022-04-15 12:55:36,278 INFO L226 Difference]: Without dead ends: 100 [2022-04-15 12:55:36,279 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=289, Invalid=1691, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 12:55:36,279 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 63 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:36,279 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 70 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 12:55:36,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-15 12:55:37,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 84. [2022-04-15 12:55:37,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:37,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 84 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 79 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call 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,061 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 84 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 79 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call 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,061 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 84 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 79 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call 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,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:37,062 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2022-04-15 12:55:37,062 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-04-15 12:55:37,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:37,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:37,062 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 79 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 100 states. [2022-04-15 12:55:37,062 INFO L87 Difference]: Start difference. First operand has 84 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 79 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 100 states. [2022-04-15 12:55:37,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:37,063 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2022-04-15 12:55:37,064 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-04-15 12:55:37,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:37,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:37,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:37,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:37,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 79 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call 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,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2022-04-15 12:55:37,065 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 33 [2022-04-15 12:55:37,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:37,066 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2022-04-15 12:55:37,066 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:55:37,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 101 transitions. [2022-04-15 12:55:42,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:42,579 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2022-04-15 12:55:42,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 12:55:42,580 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:42,580 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:42,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-04-15 12:55:42,780 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:42,781 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:42,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:42,781 INFO L85 PathProgramCache]: Analyzing trace with hash -236853986, now seen corresponding path program 14 times [2022-04-15 12:55:42,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:42,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [942517169] [2022-04-15 12:55:42,933 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:42,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1234226851, now seen corresponding path program 1 times [2022-04-15 12:55:42,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:42,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860049663] [2022-04-15 12:55:42,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:42,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:43,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:43,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {14523#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14506#true} is VALID [2022-04-15 12:55:43,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {14506#true} assume true; {14506#true} is VALID [2022-04-15 12:55:43,384 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14506#true} {14506#true} #83#return; {14506#true} is VALID [2022-04-15 12:55:43,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {14506#true} call ULTIMATE.init(); {14523#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:43,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {14523#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14506#true} is VALID [2022-04-15 12:55:43,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {14506#true} assume true; {14506#true} is VALID [2022-04-15 12:55:43,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14506#true} {14506#true} #83#return; {14506#true} is VALID [2022-04-15 12:55:43,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {14506#true} call #t~ret15 := main(); {14506#true} is VALID [2022-04-15 12:55:43,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {14506#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14506#true} is VALID [2022-04-15 12:55:43,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {14506#true} [141] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_27 v_main_~y~0_Out_54) (= v_main_~x~0_In_28 v_main_~x~0_Out_56)) (and (= |v_main_#t~post5_Out_54| 0) (< 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_54| 0) (= (+ v_main_~x~0_In_28 v_main_~y~0_In_27) (+ v_main_~y~0_Out_54 v_main_~x~0_Out_56)))) InVars {main_~x~0=v_main_~x~0_In_28, 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_56, main_#t~post6=|v_main_#t~post6_Out_54|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14506#true} is VALID [2022-04-15 12:55:43,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {14506#true} [140] 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[] {14506#true} is VALID [2022-04-15 12:55:43,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {14506#true} ~z~0 := ~y~0; {14511#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:55:43,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {14511#(= (+ 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; {14512#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:55:43,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {14512#(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; {14513#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:55:43,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {14513#(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; {14514#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:55:43,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {14514#(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; {14515#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:55:43,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {14515#(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; {14516#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:55:43,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {14516#(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; {14517#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:55:43,399 INFO L290 TraceCheckUtils]: 15: Hoare triple {14517#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14517#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:55:43,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {14517#(<= 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; {14518#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:55:43,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {14518#(<= 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; {14519#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:55:43,410 INFO L290 TraceCheckUtils]: 18: Hoare triple {14519#(<= 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; {14520#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:55:43,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {14520#(<= 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; {14521#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:55:43,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {14521#(<= 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; {14522#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:55:43,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {14522#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {14507#false} is VALID [2022-04-15 12:55:43,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {14507#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; {14507#false} is VALID [2022-04-15 12:55:43,419 INFO L290 TraceCheckUtils]: 23: Hoare triple {14507#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; {14507#false} is VALID [2022-04-15 12:55:43,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {14507#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; {14507#false} is VALID [2022-04-15 12:55:43,419 INFO L290 TraceCheckUtils]: 25: Hoare triple {14507#false} assume !(~x~0 % 4294967296 > 0); {14507#false} is VALID [2022-04-15 12:55:43,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {14507#false} assume !(~z~0 % 4294967296 > 0); {14507#false} is VALID [2022-04-15 12:55:43,419 INFO L272 TraceCheckUtils]: 27: Hoare triple {14507#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14507#false} is VALID [2022-04-15 12:55:43,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {14507#false} ~cond := #in~cond; {14507#false} is VALID [2022-04-15 12:55:43,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {14507#false} assume 0 == ~cond; {14507#false} is VALID [2022-04-15 12:55:43,419 INFO L290 TraceCheckUtils]: 30: Hoare triple {14507#false} assume !false; {14507#false} is VALID [2022-04-15 12:55:43,419 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:55:43,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:43,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860049663] [2022-04-15 12:55:43,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860049663] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:43,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207993449] [2022-04-15 12:55:43,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:43,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:43,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:43,421 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:55:43,421 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:55:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:43,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 12:55:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:43,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:46,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {14506#true} call ULTIMATE.init(); {14506#true} is VALID [2022-04-15 12:55:46,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {14506#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14506#true} is VALID [2022-04-15 12:55:46,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {14506#true} assume true; {14506#true} is VALID [2022-04-15 12:55:46,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14506#true} {14506#true} #83#return; {14506#true} is VALID [2022-04-15 12:55:46,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {14506#true} call #t~ret15 := main(); {14506#true} is VALID [2022-04-15 12:55:46,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {14506#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14506#true} is VALID [2022-04-15 12:55:46,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {14506#true} [141] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_27 v_main_~y~0_Out_54) (= v_main_~x~0_In_28 v_main_~x~0_Out_56)) (and (= |v_main_#t~post5_Out_54| 0) (< 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_54| 0) (= (+ v_main_~x~0_In_28 v_main_~y~0_In_27) (+ v_main_~y~0_Out_54 v_main_~x~0_Out_56)))) InVars {main_~x~0=v_main_~x~0_In_28, 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_56, main_#t~post6=|v_main_#t~post6_Out_54|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14506#true} is VALID [2022-04-15 12:55:46,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {14506#true} [140] 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[] {14506#true} is VALID [2022-04-15 12:55:46,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {14506#true} ~z~0 := ~y~0; {14511#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:55:46,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {14511#(= (+ 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; {14512#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:55:46,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {14512#(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; {14513#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:55:46,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {14513#(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; {14514#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:55:46,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {14514#(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; {14515#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:55:46,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {14515#(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; {14516#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:55:46,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {14516#(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; {14569#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:55:46,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {14569#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !(~z~0 % 4294967296 > 0); {14569#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:55:46,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {14569#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14515#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:55:46,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {14515#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ 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; {14579#(< (div (+ 4294967292 (* (- 1) main_~z~0)) (- 4294967296)) (+ (div (+ main_~z~0 2) 4294967296) 1))} is VALID [2022-04-15 12:55:46,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {14579#(< (div (+ 4294967292 (* (- 1) main_~z~0)) (- 4294967296)) (+ (div (+ main_~z~0 2) 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; {14583#(< (div (+ (* (- 1) main_~z~0) 4294967293) (- 4294967296)) (+ (div (+ main_~z~0 1) 4294967296) 1))} is VALID [2022-04-15 12:55:46,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {14583#(< (div (+ (* (- 1) main_~z~0) 4294967293) (- 4294967296)) (+ (div (+ main_~z~0 1) 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; {14587#(< (div (+ (* (- 1) main_~z~0) 4294967294) (- 4294967296)) (+ (div main_~z~0 4294967296) 1))} is VALID [2022-04-15 12:55:46,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {14587#(< (div (+ (* (- 1) main_~z~0) 4294967294) (- 4294967296)) (+ (div 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; {14591#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} is VALID [2022-04-15 12:55:46,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {14591#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {14591#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} is VALID [2022-04-15 12:55:46,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {14591#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 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; {14591#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} is VALID [2022-04-15 12:55:46,541 INFO L290 TraceCheckUtils]: 23: Hoare triple {14591#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 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; {14591#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} is VALID [2022-04-15 12:55:46,541 INFO L290 TraceCheckUtils]: 24: Hoare triple {14591#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 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; {14591#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} is VALID [2022-04-15 12:55:46,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {14591#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} assume !(~x~0 % 4294967296 > 0); {14591#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} is VALID [2022-04-15 12:55:46,544 INFO L290 TraceCheckUtils]: 26: Hoare triple {14591#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {14507#false} is VALID [2022-04-15 12:55:46,544 INFO L272 TraceCheckUtils]: 27: Hoare triple {14507#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14507#false} is VALID [2022-04-15 12:55:46,544 INFO L290 TraceCheckUtils]: 28: Hoare triple {14507#false} ~cond := #in~cond; {14507#false} is VALID [2022-04-15 12:55:46,544 INFO L290 TraceCheckUtils]: 29: Hoare triple {14507#false} assume 0 == ~cond; {14507#false} is VALID [2022-04-15 12:55:46,544 INFO L290 TraceCheckUtils]: 30: Hoare triple {14507#false} assume !false; {14507#false} is VALID [2022-04-15 12:55:46,544 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:55:46,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:55:47,842 INFO L290 TraceCheckUtils]: 30: Hoare triple {14507#false} assume !false; {14507#false} is VALID [2022-04-15 12:55:47,842 INFO L290 TraceCheckUtils]: 29: Hoare triple {14507#false} assume 0 == ~cond; {14507#false} is VALID [2022-04-15 12:55:47,842 INFO L290 TraceCheckUtils]: 28: Hoare triple {14507#false} ~cond := #in~cond; {14507#false} is VALID [2022-04-15 12:55:47,842 INFO L272 TraceCheckUtils]: 27: Hoare triple {14507#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14507#false} is VALID [2022-04-15 12:55:47,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {14591#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {14507#false} is VALID [2022-04-15 12:55:47,846 INFO L290 TraceCheckUtils]: 25: Hoare triple {14591#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} assume !(~x~0 % 4294967296 > 0); {14591#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} is VALID [2022-04-15 12:55:47,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {14591#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 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; {14591#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} is VALID [2022-04-15 12:55:47,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {14591#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 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; {14591#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} is VALID [2022-04-15 12:55:47,848 INFO L290 TraceCheckUtils]: 22: Hoare triple {14591#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 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; {14591#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} is VALID [2022-04-15 12:55:47,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {14591#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {14591#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} is VALID [2022-04-15 12:55:47,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {14587#(< (div (+ (* (- 1) main_~z~0) 4294967294) (- 4294967296)) (+ (div 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; {14591#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} is VALID [2022-04-15 12:55:47,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {14583#(< (div (+ (* (- 1) main_~z~0) 4294967293) (- 4294967296)) (+ (div (+ main_~z~0 1) 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; {14587#(< (div (+ (* (- 1) main_~z~0) 4294967294) (- 4294967296)) (+ (div main_~z~0 4294967296) 1))} is VALID [2022-04-15 12:55:47,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {14579#(< (div (+ 4294967292 (* (- 1) main_~z~0)) (- 4294967296)) (+ (div (+ main_~z~0 2) 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; {14583#(< (div (+ (* (- 1) main_~z~0) 4294967293) (- 4294967296)) (+ (div (+ main_~z~0 1) 4294967296) 1))} is VALID [2022-04-15 12:55:47,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {14661#(or (not (< 0 (mod main_~y~0 4294967296))) (< (div (+ 4294967291 (* (- 1) main_~z~0)) (- 4294967296)) (+ (div (+ main_~z~0 3) 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; {14579#(< (div (+ 4294967292 (* (- 1) main_~z~0)) (- 4294967296)) (+ (div (+ main_~z~0 2) 4294967296) 1))} is VALID [2022-04-15 12:55:47,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {14665#(or (< (div (+ 4294967290 (* (- 1) main_~z~0)) (- 4294967296)) (+ (div (+ main_~z~0 4) 4294967296) 1)) (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; {14661#(or (not (< 0 (mod main_~y~0 4294967296))) (< (div (+ 4294967291 (* (- 1) main_~z~0)) (- 4294967296)) (+ (div (+ main_~z~0 3) 4294967296) 1)))} is VALID [2022-04-15 12:55:47,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {14665#(or (< (div (+ 4294967290 (* (- 1) main_~z~0)) (- 4294967296)) (+ (div (+ main_~z~0 4) 4294967296) 1)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14665#(or (< (div (+ 4294967290 (* (- 1) main_~z~0)) (- 4294967296)) (+ (div (+ main_~z~0 4) 4294967296) 1)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 12:55:47,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {14672#(or (< (div (+ 4294967291 (* (- 1) main_~z~0)) (- 4294967296)) (+ (div (+ main_~z~0 3) 4294967296) 1)) (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; {14665#(or (< (div (+ 4294967290 (* (- 1) main_~z~0)) (- 4294967296)) (+ (div (+ main_~z~0 4) 4294967296) 1)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 12:55:47,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {14676#(or (< (div (+ 4294967292 (* (- 1) main_~z~0)) (- 4294967296)) (+ (div (+ main_~z~0 2) 4294967296) 1)) (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; {14672#(or (< (div (+ 4294967291 (* (- 1) main_~z~0)) (- 4294967296)) (+ (div (+ main_~z~0 3) 4294967296) 1)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 12:55:47,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {14680#(or (< (div (+ (* (- 1) main_~z~0) 4294967293) (- 4294967296)) (+ (div (+ main_~z~0 1) 4294967296) 1)) (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; {14676#(or (< (div (+ 4294967292 (* (- 1) main_~z~0)) (- 4294967296)) (+ (div (+ main_~z~0 2) 4294967296) 1)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 12:55:47,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {14684#(or (< (div (+ (* (- 1) main_~z~0) 4294967294) (- 4294967296)) (+ (div main_~z~0 4294967296) 1)) (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; {14680#(or (< (div (+ (* (- 1) main_~z~0) 4294967293) (- 4294967296)) (+ (div (+ main_~z~0 1) 4294967296) 1)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 12:55:47,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {14688#(or (< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1)) (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; {14684#(or (< (div (+ (* (- 1) main_~z~0) 4294967294) (- 4294967296)) (+ (div main_~z~0 4294967296) 1)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 12:55:47,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {14692#(or (< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1)) (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; {14688#(or (< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 12:55:47,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {14506#true} ~z~0 := ~y~0; {14692#(or (< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 12:55:47,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {14506#true} [140] 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[] {14506#true} is VALID [2022-04-15 12:55:47,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {14506#true} [141] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_27 v_main_~y~0_Out_54) (= v_main_~x~0_In_28 v_main_~x~0_Out_56)) (and (= |v_main_#t~post5_Out_54| 0) (< 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_54| 0) (= (+ v_main_~x~0_In_28 v_main_~y~0_In_27) (+ v_main_~y~0_Out_54 v_main_~x~0_Out_56)))) InVars {main_~x~0=v_main_~x~0_In_28, 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_56, main_#t~post6=|v_main_#t~post6_Out_54|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14506#true} is VALID [2022-04-15 12:55:47,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {14506#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14506#true} is VALID [2022-04-15 12:55:47,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {14506#true} call #t~ret15 := main(); {14506#true} is VALID [2022-04-15 12:55:47,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14506#true} {14506#true} #83#return; {14506#true} is VALID [2022-04-15 12:55:47,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {14506#true} assume true; {14506#true} is VALID [2022-04-15 12:55:47,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {14506#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14506#true} is VALID [2022-04-15 12:55:47,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {14506#true} call ULTIMATE.init(); {14506#true} is VALID [2022-04-15 12:55:47,883 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:55:47,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207993449] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:55:47,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:55:47,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 28 [2022-04-15 12:55:48,621 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:48,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [942517169] [2022-04-15 12:55:48,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [942517169] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:48,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:48,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 12:55:48,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857487837] [2022-04-15 12:55:48,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:48,623 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 12:55:48,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:48,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:48,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:48,696 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 12:55:48,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:48,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 12:55:48,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=856, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:55:48,697 INFO L87 Difference]: Start difference. First operand 84 states and 101 transitions. Second operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:08,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:08,135 INFO L93 Difference]: Finished difference Result 153 states and 192 transitions. [2022-04-15 12:56:08,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-15 12:56:08,135 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 12:56:08,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:56:08,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:08,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 117 transitions. [2022-04-15 12:56:08,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:08,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 117 transitions. [2022-04-15 12:56:08,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 117 transitions. [2022-04-15 12:56:09,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:09,506 INFO L225 Difference]: With dead ends: 153 [2022-04-15 12:56:09,506 INFO L226 Difference]: Without dead ends: 121 [2022-04-15 12:56:09,507 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=728, Invalid=4674, Unknown=0, NotChecked=0, Total=5402 [2022-04-15 12:56:09,508 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 100 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:56:09,508 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 84 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-15 12:56:09,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-15 12:56:10,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 95. [2022-04-15 12:56:10,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:56:10,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 95 states, 90 states have (on average 1.2222222222222223) internal successors, (110), 90 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:56:10,436 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 95 states, 90 states have (on average 1.2222222222222223) internal successors, (110), 90 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:56:10,436 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 95 states, 90 states have (on average 1.2222222222222223) internal successors, (110), 90 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:56:10,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:10,438 INFO L93 Difference]: Finished difference Result 121 states and 149 transitions. [2022-04-15 12:56:10,438 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 149 transitions. [2022-04-15 12:56:10,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:10,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:10,439 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 90 states have (on average 1.2222222222222223) internal successors, (110), 90 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 121 states. [2022-04-15 12:56:10,439 INFO L87 Difference]: Start difference. First operand has 95 states, 90 states have (on average 1.2222222222222223) internal successors, (110), 90 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 121 states. [2022-04-15 12:56:10,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:10,441 INFO L93 Difference]: Finished difference Result 121 states and 149 transitions. [2022-04-15 12:56:10,441 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 149 transitions. [2022-04-15 12:56:10,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:10,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:10,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:56:10,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:56:10,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.2222222222222223) internal successors, (110), 90 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:56:10,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 114 transitions. [2022-04-15 12:56:10,443 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 114 transitions. Word has length 33 [2022-04-15 12:56:10,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:56:10,443 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 114 transitions. [2022-04-15 12:56:10,443 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:10,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 114 transitions. [2022-04-15 12:56:20,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 113 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:20,952 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2022-04-15 12:56:20,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 12:56:20,953 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:56:20,953 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:56:20,978 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:56:21,153 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-04-15 12:56:21,154 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:56:21,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:56:21,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1645557379, now seen corresponding path program 15 times [2022-04-15 12:56:21,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:21,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1664722691] [2022-04-15 12:56:21,312 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:56:21,313 INFO L85 PathProgramCache]: Analyzing trace with hash 994357860, now seen corresponding path program 1 times [2022-04-15 12:56:21,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:56:21,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745216694] [2022-04-15 12:56:21,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:21,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:56:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:22,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:56:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:22,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {15572#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15553#true} is VALID [2022-04-15 12:56:22,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {15553#true} assume true; {15553#true} is VALID [2022-04-15 12:56:22,110 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15553#true} {15553#true} #83#return; {15553#true} is VALID [2022-04-15 12:56:22,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {15553#true} call ULTIMATE.init(); {15572#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:56:22,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {15572#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15553#true} is VALID [2022-04-15 12:56:22,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {15553#true} assume true; {15553#true} is VALID [2022-04-15 12:56:22,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15553#true} {15553#true} #83#return; {15553#true} is VALID [2022-04-15 12:56:22,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {15553#true} call #t~ret15 := main(); {15553#true} is VALID [2022-04-15 12:56:22,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {15553#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15558#(= main_~y~0 0)} is VALID [2022-04-15 12:56:22,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {15558#(= main_~y~0 0)} [143] 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_28 v_main_~y~0_Out_56)) (and (= |v_main_#t~post5_Out_56| 0) (< 0 (mod (+ v_main_~x~0_Out_58 1) 4294967296)) (= (+ v_main_~x~0_In_29 v_main_~y~0_In_28) (+ v_main_~y~0_Out_56 v_main_~x~0_Out_58)) (<= v_main_~x~0_Out_58 v_main_~x~0_In_29) (= |v_main_#t~post6_Out_56| 0))) InVars {main_~x~0=v_main_~x~0_In_29, 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_58, main_#t~post6=|v_main_#t~post6_Out_56|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15559#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 12:56:22,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {15559#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} [142] 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[] {15560#(or (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 12:56:22,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {15560#(or (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {15561#(and (or (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0)) (or (not (= main_~y~0 0)) (= (+ main_~y~0 (* (- 1) main_~z~0)) 0)))} is VALID [2022-04-15 12:56:22,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {15561#(and (or (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0)) (or (not (= main_~y~0 0)) (= (+ 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; {15562#(and (<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1)) (not (= main_~y~0 0)))} is VALID [2022-04-15 12:56:22,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {15562#(and (<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1)) (not (= 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; {15563#(and (not (= main_~y~0 0)) (<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296))))} is VALID [2022-04-15 12:56:22,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {15563#(and (not (= main_~y~0 0)) (<= 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; {15564#(and (not (= main_~y~0 0)) (<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:56:22,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {15564#(and (not (= main_~y~0 0)) (<= 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; {15565#(and (not (= main_~y~0 0)) (<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:56:22,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {15565#(and (not (= main_~y~0 0)) (<= 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; {15566#(and (not (= main_~y~0 0)) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5)))} is VALID [2022-04-15 12:56:22,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {15566#(and (not (= main_~y~0 0)) (<= 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; {15567#(and (<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296))) (not (= main_~y~0 0)))} is VALID [2022-04-15 12:56:22,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {15567#(and (<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296))) (not (= main_~y~0 0)))} assume !(~z~0 % 4294967296 > 0); {15567#(and (<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296))) (not (= main_~y~0 0)))} is VALID [2022-04-15 12:56:22,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {15567#(and (<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296))) (not (= main_~y~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; {15568#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:22,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {15568#(<= 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; {15568#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:22,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {15568#(<= 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; {15568#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:22,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {15568#(<= 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; {15568#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:22,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {15568#(<= 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; {15568#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:22,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {15568#(<= 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; {15568#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:22,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {15568#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {15568#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:22,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {15568#(<= 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; {15569#(<= (div main_~x~0 4294967296) (div (+ main_~x~0 (- 5)) 4294967296))} is VALID [2022-04-15 12:56:22,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {15569#(<= (div main_~x~0 4294967296) (div (+ main_~x~0 (- 5)) 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; {15570#(<= main_~x~0 (+ 4294967294 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:22,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {15570#(<= main_~x~0 (+ 4294967294 (* (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; {15571#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:56:22,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {15571#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {15554#false} is VALID [2022-04-15 12:56:22,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {15554#false} assume !(~z~0 % 4294967296 > 0); {15554#false} is VALID [2022-04-15 12:56:22,158 INFO L272 TraceCheckUtils]: 28: Hoare triple {15554#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15554#false} is VALID [2022-04-15 12:56:22,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {15554#false} ~cond := #in~cond; {15554#false} is VALID [2022-04-15 12:56:22,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {15554#false} assume 0 == ~cond; {15554#false} is VALID [2022-04-15 12:56:22,158 INFO L290 TraceCheckUtils]: 31: Hoare triple {15554#false} assume !false; {15554#false} is VALID [2022-04-15 12:56:22,158 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 12:56:22,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:56:22,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745216694] [2022-04-15 12:56:22,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745216694] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:56:22,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834222025] [2022-04-15 12:56:22,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:22,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:56:22,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:56:22,162 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:56:22,162 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:56:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:22,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 12:56:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:22,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:56:23,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {15553#true} call ULTIMATE.init(); {15553#true} is VALID [2022-04-15 12:56:23,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {15553#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15553#true} is VALID [2022-04-15 12:56:23,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {15553#true} assume true; {15553#true} is VALID [2022-04-15 12:56:23,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15553#true} {15553#true} #83#return; {15553#true} is VALID [2022-04-15 12:56:23,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {15553#true} call #t~ret15 := main(); {15553#true} is VALID [2022-04-15 12:56:23,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {15553#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15553#true} is VALID [2022-04-15 12:56:23,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {15553#true} [143] 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_28 v_main_~y~0_Out_56)) (and (= |v_main_#t~post5_Out_56| 0) (< 0 (mod (+ v_main_~x~0_Out_58 1) 4294967296)) (= (+ v_main_~x~0_In_29 v_main_~y~0_In_28) (+ v_main_~y~0_Out_56 v_main_~x~0_Out_58)) (<= v_main_~x~0_Out_58 v_main_~x~0_In_29) (= |v_main_#t~post6_Out_56| 0))) InVars {main_~x~0=v_main_~x~0_In_29, 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_58, main_#t~post6=|v_main_#t~post6_Out_56|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15553#true} is VALID [2022-04-15 12:56:23,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {15553#true} [142] 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[] {15553#true} is VALID [2022-04-15 12:56:23,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {15553#true} ~z~0 := ~y~0; {15600#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:56:23,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {15600#(= 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; {15604#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-15 12:56:23,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {15604#(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; {15608#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:23,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {15608#(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; {15612#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:23,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {15612#(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; {15616#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:23,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {15616#(and (= (+ main_~z~0 3) (+ (- 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; {15620#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:23,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {15620#(and (= (+ main_~y~0 (- 4)) (+ 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; {15624#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:23,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {15624#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {15624#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:23,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {15624#(and (= (+ main_~y~0 (- 4)) (+ 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; {15631#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 12:56:23,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {15631#(< 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; {15635#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:56:23,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {15635#(< 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; {15639#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:56:23,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {15639#(< 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; {15643#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:56:23,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {15643#(< 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; {15647#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:56:23,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {15647#(< 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; {15651#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:23,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {15651#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {15651#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:23,230 INFO L290 TraceCheckUtils]: 23: Hoare triple {15651#(< 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; {15651#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:23,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {15651#(< 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; {15651#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:23,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {15651#(< 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; {15651#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:23,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {15651#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {15651#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:23,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {15651#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {15554#false} is VALID [2022-04-15 12:56:23,231 INFO L272 TraceCheckUtils]: 28: Hoare triple {15554#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15554#false} is VALID [2022-04-15 12:56:23,231 INFO L290 TraceCheckUtils]: 29: Hoare triple {15554#false} ~cond := #in~cond; {15554#false} is VALID [2022-04-15 12:56:23,231 INFO L290 TraceCheckUtils]: 30: Hoare triple {15554#false} assume 0 == ~cond; {15554#false} is VALID [2022-04-15 12:56:23,231 INFO L290 TraceCheckUtils]: 31: Hoare triple {15554#false} assume !false; {15554#false} is VALID [2022-04-15 12:56:23,232 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:56:23,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:56:23,450 INFO L290 TraceCheckUtils]: 31: Hoare triple {15554#false} assume !false; {15554#false} is VALID [2022-04-15 12:56:23,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {15554#false} assume 0 == ~cond; {15554#false} is VALID [2022-04-15 12:56:23,451 INFO L290 TraceCheckUtils]: 29: Hoare triple {15554#false} ~cond := #in~cond; {15554#false} is VALID [2022-04-15 12:56:23,451 INFO L272 TraceCheckUtils]: 28: Hoare triple {15554#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15554#false} is VALID [2022-04-15 12:56:23,451 INFO L290 TraceCheckUtils]: 27: Hoare triple {15651#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {15554#false} is VALID [2022-04-15 12:56:23,451 INFO L290 TraceCheckUtils]: 26: Hoare triple {15651#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {15651#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:23,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {15651#(< 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; {15651#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:23,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {15651#(< 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; {15651#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:23,452 INFO L290 TraceCheckUtils]: 23: Hoare triple {15651#(< 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; {15651#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:23,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {15651#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {15651#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:23,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {15647#(< 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; {15651#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:23,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {15643#(< 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; {15647#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:56:23,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {15639#(< 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; {15643#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:56:23,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {15635#(< 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; {15639#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:56:23,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {15631#(< 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; {15635#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:56:23,464 INFO L290 TraceCheckUtils]: 16: Hoare triple {15727#(< 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; {15631#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 12:56:23,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {15727#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !(~z~0 % 4294967296 > 0); {15727#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 12:56:23,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {15631#(< 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; {15727#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 12:56:23,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {15635#(< 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; {15631#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 12:56:23,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {15639#(< 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; {15635#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:56:23,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {15643#(< 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; {15639#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:56:23,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {15647#(< 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; {15643#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:56:23,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {15553#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; {15647#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:56:23,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {15553#true} ~z~0 := ~y~0; {15553#true} is VALID [2022-04-15 12:56:23,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {15553#true} [142] 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[] {15553#true} is VALID [2022-04-15 12:56:23,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {15553#true} [143] 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_28 v_main_~y~0_Out_56)) (and (= |v_main_#t~post5_Out_56| 0) (< 0 (mod (+ v_main_~x~0_Out_58 1) 4294967296)) (= (+ v_main_~x~0_In_29 v_main_~y~0_In_28) (+ v_main_~y~0_Out_56 v_main_~x~0_Out_58)) (<= v_main_~x~0_Out_58 v_main_~x~0_In_29) (= |v_main_#t~post6_Out_56| 0))) InVars {main_~x~0=v_main_~x~0_In_29, 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_58, main_#t~post6=|v_main_#t~post6_Out_56|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15553#true} is VALID [2022-04-15 12:56:23,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {15553#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15553#true} is VALID [2022-04-15 12:56:23,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {15553#true} call #t~ret15 := main(); {15553#true} is VALID [2022-04-15 12:56:23,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15553#true} {15553#true} #83#return; {15553#true} is VALID [2022-04-15 12:56:23,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {15553#true} assume true; {15553#true} is VALID [2022-04-15 12:56:23,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {15553#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15553#true} is VALID [2022-04-15 12:56:23,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {15553#true} call ULTIMATE.init(); {15553#true} is VALID [2022-04-15 12:56:23,483 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:56:23,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834222025] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:56:23,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:56:23,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 9] total 31 [2022-04-15 12:56:24,764 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:56:24,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1664722691] [2022-04-15 12:56:24,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1664722691] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:56:24,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:56:24,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 12:56:24,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663958051] [2022-04-15 12:56:24,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:56:24,765 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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 34 [2022-04-15 12:56:24,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:56:24,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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:56:24,922 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:56:24,923 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 12:56:24,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:24,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 12:56:24,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1081, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 12:56:24,923 INFO L87 Difference]: Start difference. First operand 95 states and 114 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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:56:39,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:39,537 INFO L93 Difference]: Finished difference Result 131 states and 159 transitions. [2022-04-15 12:56:39,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 12:56:39,537 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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 34 [2022-04-15 12:56:39,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:56:39,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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:56:39,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 75 transitions. [2022-04-15 12:56:39,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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:56:39,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 75 transitions. [2022-04-15 12:56:39,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 75 transitions. [2022-04-15 12:56:39,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:39,943 INFO L225 Difference]: With dead ends: 131 [2022-04-15 12:56:39,943 INFO L226 Difference]: Without dead ends: 121 [2022-04-15 12:56:39,944 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=439, Invalid=3221, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 12:56:39,944 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 56 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:56:39,944 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 64 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-15 12:56:39,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-15 12:56:40,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 95. [2022-04-15 12:56:40,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:56:40,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 95 states, 90 states have (on average 1.211111111111111) internal successors, (109), 90 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call 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,901 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 95 states, 90 states have (on average 1.211111111111111) internal successors, (109), 90 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call 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,902 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 95 states, 90 states have (on average 1.211111111111111) internal successors, (109), 90 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call 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,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:40,903 INFO L93 Difference]: Finished difference Result 121 states and 145 transitions. [2022-04-15 12:56:40,903 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 145 transitions. [2022-04-15 12:56:40,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:40,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:40,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 90 states have (on average 1.211111111111111) internal successors, (109), 90 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 121 states. [2022-04-15 12:56:40,904 INFO L87 Difference]: Start difference. First operand has 95 states, 90 states have (on average 1.211111111111111) internal successors, (109), 90 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 121 states. [2022-04-15 12:56:40,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:40,906 INFO L93 Difference]: Finished difference Result 121 states and 145 transitions. [2022-04-15 12:56:40,906 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 145 transitions. [2022-04-15 12:56:40,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:40,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:40,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:56:40,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:56:40,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.211111111111111) internal successors, (109), 90 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call 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,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 113 transitions. [2022-04-15 12:56:40,908 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 113 transitions. Word has length 34 [2022-04-15 12:56:40,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:56:40,908 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 113 transitions. [2022-04-15 12:56:40,908 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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:56:40,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 113 transitions. [2022-04-15 12:56:48,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:48,431 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 113 transitions. [2022-04-15 12:56:48,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 12:56:48,431 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:56:48,431 INFO L499 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:56:48,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:56:48,636 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,SelfDestructingSolverStorable32 [2022-04-15 12:56:48,636 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:56:48,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:56:48,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1273237790, now seen corresponding path program 16 times [2022-04-15 12:56:48,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:48,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [915261707] [2022-04-15 12:56:48,799 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:56:48,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1471742990, now seen corresponding path program 1 times [2022-04-15 12:56:48,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:56:48,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374970895] [2022-04-15 12:56:48,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:48,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:56:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:49,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:56:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:49,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {16543#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16528#true} is VALID [2022-04-15 12:56:49,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {16528#true} assume true; {16528#true} is VALID [2022-04-15 12:56:49,339 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16528#true} {16528#true} #83#return; {16528#true} is VALID [2022-04-15 12:56:49,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {16528#true} call ULTIMATE.init(); {16543#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:56:49,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {16543#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16528#true} is VALID [2022-04-15 12:56:49,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {16528#true} assume true; {16528#true} is VALID [2022-04-15 12:56:49,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16528#true} {16528#true} #83#return; {16528#true} is VALID [2022-04-15 12:56:49,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {16528#true} call #t~ret15 := main(); {16528#true} is VALID [2022-04-15 12:56:49,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {16528#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16528#true} is VALID [2022-04-15 12:56:49,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {16528#true} [145] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~x~0_In_30 v_main_~y~0_In_29) (+ v_main_~y~0_Out_58 v_main_~x~0_Out_60)) (< 0 (mod (+ v_main_~x~0_Out_60 1) 4294967296)) (= |v_main_#t~post5_Out_58| 0) (<= v_main_~x~0_Out_60 v_main_~x~0_In_30) (= |v_main_#t~post6_Out_58| 0)) (and (= v_main_~y~0_In_29 v_main_~y~0_Out_58) (= v_main_~x~0_In_30 v_main_~x~0_Out_60))) InVars {main_~x~0=v_main_~x~0_In_30, 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_60, main_#t~post6=|v_main_#t~post6_Out_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16528#true} is VALID [2022-04-15 12:56:49,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {16528#true} [144] 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[] {16528#true} is VALID [2022-04-15 12:56:49,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {16528#true} ~z~0 := ~y~0; {16533#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:56:49,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {16533#(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; {16534#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:56:49,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {16534#(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; {16535#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:56:49,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {16535#(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; {16536#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:56:49,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {16536#(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; {16537#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:56:49,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {16537#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {16538#(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 12:56:49,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {16538#(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; {16539#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:49,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {16539#(<= 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; {16540#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:49,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {16540#(<= 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; {16541#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:49,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {16541#(<= 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; {16542#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:49,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {16542#(<= 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; {16529#false} is VALID [2022-04-15 12:56:49,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {16529#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16529#false} is VALID [2022-04-15 12:56:49,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {16529#false} assume !(~y~0 % 4294967296 > 0); {16529#false} is VALID [2022-04-15 12:56:49,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {16529#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; {16529#false} is VALID [2022-04-15 12:56:49,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {16529#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; {16529#false} is VALID [2022-04-15 12:56:49,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {16529#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; {16529#false} is VALID [2022-04-15 12:56:49,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {16529#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; {16529#false} is VALID [2022-04-15 12:56:49,380 INFO L290 TraceCheckUtils]: 25: Hoare triple {16529#false} assume !(~x~0 % 4294967296 > 0); {16529#false} is VALID [2022-04-15 12:56:49,380 INFO L290 TraceCheckUtils]: 26: Hoare triple {16529#false} assume !(~z~0 % 4294967296 > 0); {16529#false} is VALID [2022-04-15 12:56:49,381 INFO L272 TraceCheckUtils]: 27: Hoare triple {16529#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16529#false} is VALID [2022-04-15 12:56:49,381 INFO L290 TraceCheckUtils]: 28: Hoare triple {16529#false} ~cond := #in~cond; {16529#false} is VALID [2022-04-15 12:56:49,381 INFO L290 TraceCheckUtils]: 29: Hoare triple {16529#false} assume 0 == ~cond; {16529#false} is VALID [2022-04-15 12:56:49,381 INFO L290 TraceCheckUtils]: 30: Hoare triple {16529#false} assume !false; {16529#false} is VALID [2022-04-15 12:56:49,381 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-15 12:56:49,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:56:49,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374970895] [2022-04-15 12:56:49,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374970895] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:56:49,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320174875] [2022-04-15 12:56:49,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:49,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:56:49,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:56:49,383 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:56:49,418 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:56:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:49,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 12:56:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:49,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:56:49,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {16528#true} call ULTIMATE.init(); {16528#true} is VALID [2022-04-15 12:56:49,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {16528#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16528#true} is VALID [2022-04-15 12:56:49,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {16528#true} assume true; {16528#true} is VALID [2022-04-15 12:56:49,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16528#true} {16528#true} #83#return; {16528#true} is VALID [2022-04-15 12:56:49,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {16528#true} call #t~ret15 := main(); {16528#true} is VALID [2022-04-15 12:56:49,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {16528#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16528#true} is VALID [2022-04-15 12:56:49,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {16528#true} [145] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~x~0_In_30 v_main_~y~0_In_29) (+ v_main_~y~0_Out_58 v_main_~x~0_Out_60)) (< 0 (mod (+ v_main_~x~0_Out_60 1) 4294967296)) (= |v_main_#t~post5_Out_58| 0) (<= v_main_~x~0_Out_60 v_main_~x~0_In_30) (= |v_main_#t~post6_Out_58| 0)) (and (= v_main_~y~0_In_29 v_main_~y~0_Out_58) (= v_main_~x~0_In_30 v_main_~x~0_Out_60))) InVars {main_~x~0=v_main_~x~0_In_30, 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_60, main_#t~post6=|v_main_#t~post6_Out_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16528#true} is VALID [2022-04-15 12:56:49,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {16528#true} [144] 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[] {16528#true} is VALID [2022-04-15 12:56:49,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {16528#true} ~z~0 := ~y~0; {16533#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:56:49,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {16533#(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; {16534#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:56:49,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {16534#(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; {16535#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:56:49,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {16535#(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; {16536#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:56:49,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {16536#(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; {16537#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:56:49,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {16537#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {16586#(<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296))} is VALID [2022-04-15 12:56:49,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {16586#(<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ 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; {16539#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:49,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {16539#(<= 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; {16540#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:49,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {16540#(<= 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; {16541#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:49,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {16541#(<= 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; {16542#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:49,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {16542#(<= 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; {16529#false} is VALID [2022-04-15 12:56:49,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {16529#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16529#false} is VALID [2022-04-15 12:56:49,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {16529#false} assume !(~y~0 % 4294967296 > 0); {16529#false} is VALID [2022-04-15 12:56:49,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {16529#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; {16529#false} is VALID [2022-04-15 12:56:49,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {16529#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; {16529#false} is VALID [2022-04-15 12:56:49,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {16529#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; {16529#false} is VALID [2022-04-15 12:56:49,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {16529#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; {16529#false} is VALID [2022-04-15 12:56:49,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {16529#false} assume !(~x~0 % 4294967296 > 0); {16529#false} is VALID [2022-04-15 12:56:49,806 INFO L290 TraceCheckUtils]: 26: Hoare triple {16529#false} assume !(~z~0 % 4294967296 > 0); {16529#false} is VALID [2022-04-15 12:56:49,806 INFO L272 TraceCheckUtils]: 27: Hoare triple {16529#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16529#false} is VALID [2022-04-15 12:56:49,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {16529#false} ~cond := #in~cond; {16529#false} is VALID [2022-04-15 12:56:49,806 INFO L290 TraceCheckUtils]: 29: Hoare triple {16529#false} assume 0 == ~cond; {16529#false} is VALID [2022-04-15 12:56:49,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {16529#false} assume !false; {16529#false} is VALID [2022-04-15 12:56:49,807 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-15 12:56:49,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:56:50,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {16529#false} assume !false; {16529#false} is VALID [2022-04-15 12:56:50,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {16529#false} assume 0 == ~cond; {16529#false} is VALID [2022-04-15 12:56:50,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {16529#false} ~cond := #in~cond; {16529#false} is VALID [2022-04-15 12:56:50,900 INFO L272 TraceCheckUtils]: 27: Hoare triple {16529#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16529#false} is VALID [2022-04-15 12:56:50,900 INFO L290 TraceCheckUtils]: 26: Hoare triple {16529#false} assume !(~z~0 % 4294967296 > 0); {16529#false} is VALID [2022-04-15 12:56:50,900 INFO L290 TraceCheckUtils]: 25: Hoare triple {16529#false} assume !(~x~0 % 4294967296 > 0); {16529#false} is VALID [2022-04-15 12:56:50,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {16529#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; {16529#false} is VALID [2022-04-15 12:56:50,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {16529#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; {16529#false} is VALID [2022-04-15 12:56:50,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {16529#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; {16529#false} is VALID [2022-04-15 12:56:50,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {16529#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; {16529#false} is VALID [2022-04-15 12:56:50,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {16529#false} assume !(~y~0 % 4294967296 > 0); {16529#false} is VALID [2022-04-15 12:56:50,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {16529#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16529#false} is VALID [2022-04-15 12:56:50,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {16542#(<= 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; {16529#false} is VALID [2022-04-15 12:56:50,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {16541#(<= 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; {16542#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:50,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {16540#(<= 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; {16541#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:50,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {16539#(<= 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; {16540#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:50,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {16586#(<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ 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; {16539#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:50,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {16689#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {16586#(<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296))} is VALID [2022-04-15 12:56:50,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {16693#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 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; {16689#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 12:56:50,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {16697#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 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; {16693#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:56:50,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {16701#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 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; {16697#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-15 12:56:50,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {16705#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 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; {16701#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:56:50,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {16528#true} ~z~0 := ~y~0; {16705#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-15 12:56:50,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {16528#true} [144] 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[] {16528#true} is VALID [2022-04-15 12:56:50,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {16528#true} [145] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~x~0_In_30 v_main_~y~0_In_29) (+ v_main_~y~0_Out_58 v_main_~x~0_Out_60)) (< 0 (mod (+ v_main_~x~0_Out_60 1) 4294967296)) (= |v_main_#t~post5_Out_58| 0) (<= v_main_~x~0_Out_60 v_main_~x~0_In_30) (= |v_main_#t~post6_Out_58| 0)) (and (= v_main_~y~0_In_29 v_main_~y~0_Out_58) (= v_main_~x~0_In_30 v_main_~x~0_Out_60))) InVars {main_~x~0=v_main_~x~0_In_30, 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_60, main_#t~post6=|v_main_#t~post6_Out_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16528#true} is VALID [2022-04-15 12:56:50,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {16528#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16528#true} is VALID [2022-04-15 12:56:50,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {16528#true} call #t~ret15 := main(); {16528#true} is VALID [2022-04-15 12:56:50,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16528#true} {16528#true} #83#return; {16528#true} is VALID [2022-04-15 12:56:50,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {16528#true} assume true; {16528#true} is VALID [2022-04-15 12:56:50,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {16528#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16528#true} is VALID [2022-04-15 12:56:50,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {16528#true} call ULTIMATE.init(); {16528#true} is VALID [2022-04-15 12:56:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-15 12:56:50,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320174875] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:56:50,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:56:50,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 19 [2022-04-15 12:56:52,169 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:56:52,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [915261707] [2022-04-15 12:56:52,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [915261707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:56:52,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:56:52,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 12:56:52,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2570536] [2022-04-15 12:56:52,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:56:52,170 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 12:56:52,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:56:52,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:52,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:52,282 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 12:56:52,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:52,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 12:56:52,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:56:52,283 INFO L87 Difference]: Start difference. First operand 95 states and 113 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:06,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:06,276 INFO L93 Difference]: Finished difference Result 151 states and 183 transitions. [2022-04-15 12:57:06,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 12:57:06,276 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 12:57:06,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:57:06,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:06,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 85 transitions. [2022-04-15 12:57:06,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:06,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 85 transitions. [2022-04-15 12:57:06,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 85 transitions. [2022-04-15 12:57:06,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:06,878 INFO L225 Difference]: With dead ends: 151 [2022-04-15 12:57:06,878 INFO L226 Difference]: Without dead ends: 101 [2022-04-15 12:57:06,879 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=317, Invalid=1939, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 12:57:06,879 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 43 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:57:06,879 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 75 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-15 12:57:06,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-15 12:57:07,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2022-04-15 12:57:07,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:57:07,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 87 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 82 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call 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:07,759 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 87 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 82 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call 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:07,759 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 87 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 82 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call 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:07,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:07,760 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2022-04-15 12:57:07,760 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2022-04-15 12:57:07,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:07,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:07,760 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 82 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-15 12:57:07,761 INFO L87 Difference]: Start difference. First operand has 87 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 82 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-15 12:57:07,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:07,762 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2022-04-15 12:57:07,762 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2022-04-15 12:57:07,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:07,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:07,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:57:07,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:57:07,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 82 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call 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:07,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2022-04-15 12:57:07,763 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 34 [2022-04-15 12:57:07,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:57:07,764 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions. [2022-04-15 12:57:07,764 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:07,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 102 transitions. [2022-04-15 12:57:14,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:14,871 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2022-04-15 12:57:14,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 12:57:14,872 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:57:14,872 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:57:14,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-04-15 12:57:15,072 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:57:15,073 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:57:15,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:57:15,073 INFO L85 PathProgramCache]: Analyzing trace with hash 955015874, now seen corresponding path program 8 times [2022-04-15 12:57:15,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:15,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1779674774] [2022-04-15 12:57:15,188 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:57:15,189 INFO L85 PathProgramCache]: Analyzing trace with hash -538073938, now seen corresponding path program 1 times [2022-04-15 12:57:15,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:57:15,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679197732] [2022-04-15 12:57:15,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:57:15,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:57:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:16,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:57:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:16,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {17491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17469#true} is VALID [2022-04-15 12:57:16,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {17469#true} assume true; {17469#true} is VALID [2022-04-15 12:57:16,331 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17469#true} {17469#true} #83#return; {17469#true} is VALID [2022-04-15 12:57:16,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {17469#true} call ULTIMATE.init(); {17491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:57:16,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {17491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17469#true} is VALID [2022-04-15 12:57:16,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {17469#true} assume true; {17469#true} is VALID [2022-04-15 12:57:16,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17469#true} {17469#true} #83#return; {17469#true} is VALID [2022-04-15 12:57:16,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {17469#true} call #t~ret15 := main(); {17469#true} is VALID [2022-04-15 12:57:16,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {17469#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17474#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:57:16,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {17474#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [147] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_62 1) 4294967296)) (<= v_main_~x~0_Out_62 v_main_~x~0_In_31) (= |v_main_#t~post5_Out_60| 0) (= (+ v_main_~x~0_In_31 v_main_~y~0_In_30) (+ v_main_~y~0_Out_60 v_main_~x~0_Out_62)) (= |v_main_#t~post6_Out_60| 0)) (and (= v_main_~y~0_In_30 v_main_~y~0_Out_60) (= 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_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_62, main_#t~post6=|v_main_#t~post6_Out_60|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17475#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))))} is VALID [2022-04-15 12:57:16,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {17475#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))))} [146] 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[] {17476#(or (and (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 main_~x~0) main_~n~0)) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} is VALID [2022-04-15 12:57:16,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {17476#(or (and (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 main_~x~0) main_~n~0)) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} ~z~0 := ~y~0; {17477#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-15 12:57:16,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {17477#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (+ main_~z~0 main_~x~0) 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; {17478#(and (<= (+ main_~z~0 main_~x~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294 (* (div main_~z~0 4294967296) (- 4294967296)) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296))) (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) main_~n~0))} is VALID [2022-04-15 12:57:16,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {17478#(and (<= (+ main_~z~0 main_~x~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294 (* (div main_~z~0 4294967296) (- 4294967296)) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296))) (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) 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; {17479#(and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= (+ main_~z~0 main_~x~0 (* (div (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0 (* (- 1) main_~z~0) (* (div main_~z~0 4294967296) (- 4294967296)) 4294967293) 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296))))} is VALID [2022-04-15 12:57:16,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {17479#(and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= (+ main_~z~0 main_~x~0 (* (div (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0 (* (- 1) main_~z~0) (* (div main_~z~0 4294967296) (- 4294967296)) 4294967293) 4294967296) 4294967296)) (+ main_~n~0 (* (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; {17480#(and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ 3 (* (div (+ main_~z~0 main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (div main_~z~0 4294967296) (- 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~x~0) (<= (+ main_~z~0 main_~x~0) main_~n~0))} is VALID [2022-04-15 12:57:16,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {17480#(and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ 3 (* (div (+ main_~z~0 main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (div main_~z~0 4294967296) (- 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~x~0) (<= (+ main_~z~0 main_~x~0) 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; {17481#(and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (or (<= (+ 4294967292 main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0)) (<= (+ main_~z~0 main_~x~0) main_~n~0))} is VALID [2022-04-15 12:57:16,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {17481#(and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (or (<= (+ 4294967292 main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0)) (<= (+ main_~z~0 main_~x~0) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {17482#(and (<= main_~n~0 (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296)) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-15 12:57:16,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {17482#(and (<= main_~n~0 (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296)) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) 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; {17483#(and (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-15 12:57:16,407 INFO L290 TraceCheckUtils]: 15: Hoare triple {17483#(and (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) 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; {17483#(and (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-15 12:57:16,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {17483#(and (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) 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; {17483#(and (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-15 12:57:16,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {17483#(and (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) 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; {17483#(and (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-15 12:57:16,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {17483#(and (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} assume !(~y~0 % 4294967296 > 0); {17483#(and (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-15 12:57:16,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {17483#(and (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) 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; {17484#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= (+ (* (div (+ main_~n~0 4294967294 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0 1) main_~n~0))} is VALID [2022-04-15 12:57:16,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {17484#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= (+ (* (div (+ main_~n~0 4294967294 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0 1) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17485#(and (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0) 4294967293) 4294967296) 4294967296) main_~x~0 2) main_~n~0))} is VALID [2022-04-15 12:57:16,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {17485#(and (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0) 4294967293) 4294967296) 4294967296) main_~x~0 2) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17486#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 1) main_~x~0) (<= (+ main_~x~0 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-15 12:57:16,438 INFO L290 TraceCheckUtils]: 22: Hoare triple {17486#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 1) main_~x~0) (<= (+ main_~x~0 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17487#(and (<= (+ main_~x~0 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) 4) main_~n~0) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} is VALID [2022-04-15 12:57:16,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {17487#(and (<= (+ main_~x~0 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) 4) main_~n~0) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} assume !(~x~0 % 4294967296 > 0); {17487#(and (<= (+ main_~x~0 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) 4) main_~n~0) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} is VALID [2022-04-15 12:57:16,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {17487#(and (<= (+ main_~x~0 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) 4) main_~n~0) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~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; {17486#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 1) main_~x~0) (<= (+ main_~x~0 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-15 12:57:16,454 INFO L290 TraceCheckUtils]: 25: Hoare triple {17486#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 1) main_~x~0) (<= (+ main_~x~0 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~x~0)) 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; {17485#(and (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0) 4294967293) 4294967296) 4294967296) main_~x~0 2) main_~n~0))} is VALID [2022-04-15 12:57:16,458 INFO L290 TraceCheckUtils]: 26: Hoare triple {17485#(and (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0) 4294967293) 4294967296) 4294967296) main_~x~0 2) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17484#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= (+ (* (div (+ main_~n~0 4294967294 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0 1) main_~n~0))} is VALID [2022-04-15 12:57:16,463 INFO L290 TraceCheckUtils]: 27: Hoare triple {17484#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= (+ (* (div (+ main_~n~0 4294967294 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17488#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:57:16,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {17488#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {17488#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:57:16,466 INFO L272 TraceCheckUtils]: 29: Hoare triple {17488#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17489#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:57:16,466 INFO L290 TraceCheckUtils]: 30: Hoare triple {17489#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {17490#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:57:16,467 INFO L290 TraceCheckUtils]: 31: Hoare triple {17490#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {17470#false} is VALID [2022-04-15 12:57:16,467 INFO L290 TraceCheckUtils]: 32: Hoare triple {17470#false} assume !false; {17470#false} is VALID [2022-04-15 12:57:16,467 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:57:16,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:57:16,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679197732] [2022-04-15 12:57:16,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679197732] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:57:16,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655222404] [2022-04-15 12:57:16,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:57:16,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:57:16,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:57:16,469 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:57:16,470 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:57:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:16,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 70 conjunts are in the unsatisfiable core [2022-04-15 12:57:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:16,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:57:53,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {17469#true} call ULTIMATE.init(); {17469#true} is VALID [2022-04-15 12:57:53,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {17469#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17469#true} is VALID [2022-04-15 12:57:53,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {17469#true} assume true; {17469#true} is VALID [2022-04-15 12:57:53,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17469#true} {17469#true} #83#return; {17469#true} is VALID [2022-04-15 12:57:53,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {17469#true} call #t~ret15 := main(); {17469#true} is VALID [2022-04-15 12:57:53,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {17469#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17474#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:57:53,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {17474#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [147] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_62 1) 4294967296)) (<= v_main_~x~0_Out_62 v_main_~x~0_In_31) (= |v_main_#t~post5_Out_60| 0) (= (+ v_main_~x~0_In_31 v_main_~y~0_In_30) (+ v_main_~y~0_Out_60 v_main_~x~0_Out_62)) (= |v_main_#t~post6_Out_60| 0)) (and (= v_main_~y~0_In_30 v_main_~y~0_Out_60) (= 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_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_62, main_#t~post6=|v_main_#t~post6_Out_60|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17513#(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:57:53,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {17513#(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)))} [146] 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[] {17517#(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:57:53,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {17517#(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; {17521#(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:57:53,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {17521#(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; {17525#(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)))} is VALID [2022-04-15 12:57:53,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {17525#(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)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17529#(and (<= 0 main_~y~0) (= (+ (- 1) main_~x~0) (+ main_~n~0 (* (- 1) main_~y~0) 1)) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= main_~y~0 (+ main_~z~0 2)))} is VALID [2022-04-15 12:57:53,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {17529#(and (<= 0 main_~y~0) (= (+ (- 1) main_~x~0) (+ main_~n~0 (* (- 1) main_~y~0) 1)) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= 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; {17533#(and (<= 0 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (= (+ main_~n~0 3 (* (- 1) main_~y~0)) main_~x~0))} is VALID [2022-04-15 12:57:53,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {17533#(and (<= 0 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (= (+ main_~n~0 3 (* (- 1) 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; {17537#(and (<= 0 main_~y~0) (= (+ (- 1) main_~x~0) (+ main_~n~0 3 (* (- 1) main_~y~0))) (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-15 12:57:53,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {17537#(and (<= 0 main_~y~0) (= (+ (- 1) main_~x~0) (+ main_~n~0 3 (* (- 1) main_~y~0))) (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !(~z~0 % 4294967296 > 0); {17537#(and (<= 0 main_~y~0) (= (+ (- 1) main_~x~0) (+ main_~n~0 3 (* (- 1) main_~y~0))) (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-15 12:57:53,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {17537#(and (<= 0 main_~y~0) (= (+ (- 1) main_~x~0) (+ main_~n~0 3 (* (- 1) main_~y~0))) (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (= (+ (- 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; {17544#(and (= (+ main_~n~0 (* (- 1) main_~x~0) 4) (+ main_~y~0 1)) (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) main_~z~0) (<= main_~x~0 (+ main_~n~0 4)) (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295) 1) 4294967296)) (< 0 (mod (+ main_~n~0 2 (* main_~x~0 4294967295)) 4294967296)))} is VALID [2022-04-15 12:57:53,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {17544#(and (= (+ main_~n~0 (* (- 1) main_~x~0) 4) (+ main_~y~0 1)) (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) main_~z~0) (<= main_~x~0 (+ main_~n~0 4)) (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295) 1) 4294967296)) (< 0 (mod (+ main_~n~0 2 (* main_~x~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; {17548#(and (= main_~z~0 (+ main_~n~0 2 (* (- 1) main_~x~0))) (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (= (+ main_~y~0 1) (+ main_~n~0 3 (* (- 1) main_~x~0))) (<= main_~x~0 (+ main_~n~0 4)) (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295) 1) 4294967296)) (< 0 (mod (+ main_~n~0 2 (* main_~x~0 4294967295)) 4294967296)))} is VALID [2022-04-15 12:57:53,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {17548#(and (= main_~z~0 (+ main_~n~0 2 (* (- 1) main_~x~0))) (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (= (+ main_~y~0 1) (+ main_~n~0 3 (* (- 1) main_~x~0))) (<= main_~x~0 (+ main_~n~0 4)) (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295) 1) 4294967296)) (< 0 (mod (+ main_~n~0 2 (* main_~x~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; {17552#(and (= (+ main_~y~0 2) (+ main_~n~0 3 (* (- 1) main_~x~0))) (= (+ (- 1) main_~z~0) (+ main_~n~0 2 (* (- 1) main_~x~0))) (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 (+ main_~n~0 4)) (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295) 1) 4294967296)) (< 0 (mod (+ main_~n~0 2 (* main_~x~0 4294967295)) 4294967296)))} is VALID [2022-04-15 12:57:53,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {17552#(and (= (+ main_~y~0 2) (+ main_~n~0 3 (* (- 1) main_~x~0))) (= (+ (- 1) main_~z~0) (+ main_~n~0 2 (* (- 1) main_~x~0))) (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 (+ main_~n~0 4)) (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295) 1) 4294967296)) (< 0 (mod (+ main_~n~0 2 (* main_~x~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; {17556#(and (= (+ main_~n~0 (* (- 1) main_~x~0) 4) main_~z~0) (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 (+ main_~n~0 4)) (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295) 1) 4294967296)) (< 0 (mod (+ main_~n~0 2 (* main_~x~0 4294967295)) 4294967296)) (= (+ main_~n~0 3 (* (- 1) main_~x~0)) (+ main_~y~0 3)))} is VALID [2022-04-15 12:57:53,969 INFO L290 TraceCheckUtils]: 18: Hoare triple {17556#(and (= (+ main_~n~0 (* (- 1) main_~x~0) 4) main_~z~0) (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 (+ main_~n~0 4)) (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295) 1) 4294967296)) (< 0 (mod (+ main_~n~0 2 (* main_~x~0 4294967295)) 4294967296)) (= (+ main_~n~0 3 (* (- 1) main_~x~0)) (+ main_~y~0 3)))} assume !(~y~0 % 4294967296 > 0); {17560#(and (= (+ main_~n~0 4) (+ main_~z~0 main_~x~0)) (<= (mod (+ 4294967292 main_~x~0) 4294967296) 0) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 4)))} is VALID [2022-04-15 12:57:53,976 INFO L290 TraceCheckUtils]: 19: Hoare triple {17560#(and (= (+ main_~n~0 4) (+ main_~z~0 main_~x~0)) (<= (mod (+ 4294967292 main_~x~0) 4294967296) 0) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 4)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17564#(and (= (+ main_~z~0 main_~x~0) (+ main_~n~0 3)) (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0) (<= 0 main_~z~0))} is VALID [2022-04-15 12:57:53,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {17564#(and (= (+ main_~z~0 main_~x~0) (+ main_~n~0 3)) (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ 4294967292 main_~z~0) 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; {17568#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0) (<= 0 main_~z~0) (= (+ main_~x~0 1) (+ main_~n~0 (* (- 1) main_~z~0) 3)))} is VALID [2022-04-15 12:57:53,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {17568#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0) (<= 0 main_~z~0) (= (+ main_~x~0 1) (+ main_~n~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; {17572#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0) (= (+ main_~z~0 main_~x~0) (+ main_~n~0 1)) (<= 0 main_~z~0))} is VALID [2022-04-15 12:57:53,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {17572#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0) (= (+ main_~z~0 main_~x~0) (+ main_~n~0 1)) (<= 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; {17576#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0) (= (+ main_~z~0 main_~x~0 1) (+ main_~n~0 1)) (<= 0 main_~z~0))} is VALID [2022-04-15 12:57:53,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {17576#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0) (= (+ main_~z~0 main_~x~0 1) (+ main_~n~0 1)) (<= 0 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {17576#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0) (= (+ main_~z~0 main_~x~0 1) (+ main_~n~0 1)) (<= 0 main_~z~0))} is VALID [2022-04-15 12:57:53,991 INFO L290 TraceCheckUtils]: 24: Hoare triple {17576#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0) (= (+ main_~z~0 main_~x~0 1) (+ main_~n~0 1)) (<= 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; {17583#(and (<= 0 (+ main_~z~0 1)) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= (mod (+ main_~n~0 4294967295 (* main_~z~0 4294967295)) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~z~0)) main_~x~0))} is VALID [2022-04-15 12:57:53,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {17583#(and (<= 0 (+ main_~z~0 1)) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= (mod (+ main_~n~0 4294967295 (* main_~z~0 4294967295)) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~z~0)) main_~x~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; {17587#(and (<= 0 (+ main_~z~0 2)) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= (mod (+ main_~n~0 4294967294 (* main_~z~0 4294967295)) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~z~0)) main_~x~0))} is VALID [2022-04-15 12:57:54,002 INFO L290 TraceCheckUtils]: 26: Hoare triple {17587#(and (<= 0 (+ main_~z~0 2)) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= (mod (+ main_~n~0 4294967294 (* main_~z~0 4294967295)) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~z~0)) main_~x~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; {17591#(and (<= main_~x~0 (+ main_~n~0 3)) (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0))} is VALID [2022-04-15 12:57:54,008 INFO L290 TraceCheckUtils]: 27: Hoare triple {17591#(and (<= main_~x~0 (+ main_~n~0 3)) (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~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; {17595#(and (<= (mod (+ 4294967292 main_~x~0) 4294967296) 0) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 4)))} is VALID [2022-04-15 12:57:54,009 INFO L290 TraceCheckUtils]: 28: Hoare triple {17595#(and (<= (mod (+ 4294967292 main_~x~0) 4294967296) 0) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 4)))} assume !(~z~0 % 4294967296 > 0); {17595#(and (<= (mod (+ 4294967292 main_~x~0) 4294967296) 0) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 4)))} is VALID [2022-04-15 12:57:54,011 INFO L272 TraceCheckUtils]: 29: Hoare triple {17595#(and (<= (mod (+ 4294967292 main_~x~0) 4294967296) 0) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 4)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17602#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:57:54,012 INFO L290 TraceCheckUtils]: 30: Hoare triple {17602#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17606#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:57:54,012 INFO L290 TraceCheckUtils]: 31: Hoare triple {17606#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17470#false} is VALID [2022-04-15 12:57:54,012 INFO L290 TraceCheckUtils]: 32: Hoare triple {17470#false} assume !false; {17470#false} is VALID [2022-04-15 12:57:54,013 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:57:54,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:58:04,704 INFO L290 TraceCheckUtils]: 32: Hoare triple {17470#false} assume !false; {17470#false} is VALID [2022-04-15 12:58:04,705 INFO L290 TraceCheckUtils]: 31: Hoare triple {17606#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17470#false} is VALID [2022-04-15 12:58:04,705 INFO L290 TraceCheckUtils]: 30: Hoare triple {17602#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17606#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:58:04,706 INFO L272 TraceCheckUtils]: 29: Hoare triple {17488#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17602#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:58:04,707 INFO L290 TraceCheckUtils]: 28: Hoare triple {17488#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {17488#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:58:04,709 INFO L290 TraceCheckUtils]: 27: Hoare triple {17628#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 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; {17488#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 12:58:04,716 INFO L290 TraceCheckUtils]: 26: Hoare triple {17632#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17628#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-15 12:58:04,718 INFO L290 TraceCheckUtils]: 25: Hoare triple {17636#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 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; {17632#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:58:04,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {17640#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 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; {17636#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-15 12:58:04,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {17640#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {17640#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-15 12:58:04,725 INFO L290 TraceCheckUtils]: 22: Hoare triple {17636#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17640#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-15 12:58:04,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {17650#(or (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))) (not (< 0 (mod 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; {17636#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-15 12:58:04,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {17654#(or (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~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; {17650#(or (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-15 12:58:04,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {17658#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (not (< 0 (mod 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; {17654#(or (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:58:04,742 INFO L290 TraceCheckUtils]: 18: Hoare triple {17662#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (not (< 0 (mod main_~x~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {17658#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-15 12:58:04,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {17666#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (mod main_~x~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; {17662#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (not (< 0 (mod main_~x~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:58:04,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {17670#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (mod main_~x~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; {17666#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-15 12:58:04,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {17674#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (mod main_~x~0 4294967296) 0) (< 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; {17670#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-15 12:58:04,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {17678#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (mod main_~x~0 4294967296) 0) (< 0 (mod (+ 4294967292 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; {17674#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (mod main_~x~0 4294967296) 0) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:58:04,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {17678#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (mod main_~x~0 4294967296) 0) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {17678#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (mod main_~x~0 4294967296) 0) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 12:58:04,769 INFO L290 TraceCheckUtils]: 12: Hoare triple {17685#(or (<= (mod (+ main_~x~0 1) 4294967296) 0) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (<= (mod main_~z~0 4294967296) 0) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 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; {17678#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (mod main_~x~0 4294967296) 0) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 12:58:04,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {17689#(or (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))) (<= (mod main_~x~0 4294967296) 0) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (<= (mod (+ main_~x~0 2) 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; {17685#(or (<= (mod (+ main_~x~0 1) 4294967296) 0) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (<= (mod main_~z~0 4294967296) 0) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:58:04,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {17693#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= (mod (+ main_~x~0 1) 4294967296) 0) (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (<= (mod (+ main_~x~0 3) 4294967296) 0) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (< 0 (mod (+ 4294967292 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; {17689#(or (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))) (<= (mod main_~x~0 4294967296) 0) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (<= (mod (+ main_~x~0 2) 4294967296) 0))} is VALID [2022-04-15 12:58:04,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {17697#(or (and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0))) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (<= (mod (+ main_~x~0 4) 4294967296) 0) (<= (mod (+ main_~x~0 2) 4294967296) 0) (<= (mod (+ main_~z~0 4294967293) 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; {17693#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= (mod (+ main_~x~0 1) 4294967296) 0) (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (<= (mod (+ main_~x~0 3) 4294967296) 0) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 12:58:04,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {17701#(or (and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (<= (mod (+ main_~x~0 4) 4294967296) 0) (<= (mod (+ main_~x~0 2) 4294967296) 0))} ~z~0 := ~y~0; {17697#(or (and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0))) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (<= (mod (+ main_~x~0 4) 4294967296) 0) (<= (mod (+ main_~x~0 2) 4294967296) 0) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0))} is VALID [2022-04-15 12:58:04,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {17705#(or (and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} [146] 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[] {17701#(or (and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (<= (mod (+ main_~x~0 4) 4294967296) 0) (<= (mod (+ main_~x~0 2) 4294967296) 0))} is VALID [2022-04-15 12:58:04,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {17709#(and (or (< (div (+ (- 4294967293) (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ 4294967291 main_~y~0 main_~x~0) 4294967296))) (< (div (+ (* (- 1) main_~x~0) (- 4294967297) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~n~0 4294967296) 2 (div (+ main_~y~0 main_~x~0 4294967296 (* (- 1) main_~n~0)) 4294967296)))) (or (< (div (+ (- 4294967293) (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ 4294967291 main_~y~0 main_~x~0) 4294967296))) (<= (div main_~n~0 4294967296) (div (+ main_~n~0 (- 4)) 4294967296))))} [147] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_62 1) 4294967296)) (<= v_main_~x~0_Out_62 v_main_~x~0_In_31) (= |v_main_#t~post5_Out_60| 0) (= (+ v_main_~x~0_In_31 v_main_~y~0_In_30) (+ v_main_~y~0_Out_60 v_main_~x~0_Out_62)) (= |v_main_#t~post6_Out_60| 0)) (and (= v_main_~y~0_In_30 v_main_~y~0_Out_60) (= 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_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_62, main_#t~post6=|v_main_#t~post6_Out_60|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17705#(or (and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 12:58:04,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {17469#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17709#(and (or (< (div (+ (- 4294967293) (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ 4294967291 main_~y~0 main_~x~0) 4294967296))) (< (div (+ (* (- 1) main_~x~0) (- 4294967297) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~n~0 4294967296) 2 (div (+ main_~y~0 main_~x~0 4294967296 (* (- 1) main_~n~0)) 4294967296)))) (or (< (div (+ (- 4294967293) (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ 4294967291 main_~y~0 main_~x~0) 4294967296))) (<= (div main_~n~0 4294967296) (div (+ main_~n~0 (- 4)) 4294967296))))} is VALID [2022-04-15 12:58:04,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {17469#true} call #t~ret15 := main(); {17469#true} is VALID [2022-04-15 12:58:04,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17469#true} {17469#true} #83#return; {17469#true} is VALID [2022-04-15 12:58:04,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {17469#true} assume true; {17469#true} is VALID [2022-04-15 12:58:04,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {17469#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17469#true} is VALID [2022-04-15 12:58:04,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {17469#true} call ULTIMATE.init(); {17469#true} is VALID [2022-04-15 12:58:04,845 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:58:04,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655222404] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:58:04,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:58:04,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25, 24] total 61 [2022-04-15 12:58:09,582 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:58:09,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1779674774] [2022-04-15 12:58:09,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1779674774] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:58:09,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:58:09,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 12:58:09,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880050843] [2022-04-15 12:58:09,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:58:09,582 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-15 12:58:09,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:58:09,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:09,999 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 12:58:09,999 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 12:58:09,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:09,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 12:58:10,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=455, Invalid=3835, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 12:58:10,001 INFO L87 Difference]: Start difference. First operand 87 states and 102 transitions. Second operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:29,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:29,735 INFO L93 Difference]: Finished difference Result 107 states and 128 transitions. [2022-04-15 12:58:29,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 12:58:29,735 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-15 12:58:29,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:58:29,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:29,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 61 transitions. [2022-04-15 12:58:29,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:29,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 61 transitions. [2022-04-15 12:58:29,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 61 transitions. [2022-04-15 12:58:30,189 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:58:30,190 INFO L225 Difference]: With dead ends: 107 [2022-04-15 12:58:30,191 INFO L226 Difference]: Without dead ends: 94 [2022-04-15 12:58:30,191 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1774 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=706, Invalid=6604, Unknown=0, NotChecked=0, Total=7310 [2022-04-15 12:58:30,192 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 31 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:58:30,192 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 106 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-15 12:58:30,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-15 12:58:31,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2022-04-15 12:58:31,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:58:31,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 90 states, 85 states have (on average 1.2) internal successors, (102), 85 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:58:31,178 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 90 states, 85 states have (on average 1.2) internal successors, (102), 85 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:58:31,178 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 90 states, 85 states have (on average 1.2) internal successors, (102), 85 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:58:31,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:31,179 INFO L93 Difference]: Finished difference Result 94 states and 110 transitions. [2022-04-15 12:58:31,179 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2022-04-15 12:58:31,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:31,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:31,179 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 85 states have (on average 1.2) internal successors, (102), 85 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 94 states. [2022-04-15 12:58:31,180 INFO L87 Difference]: Start difference. First operand has 90 states, 85 states have (on average 1.2) internal successors, (102), 85 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 94 states. [2022-04-15 12:58:31,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:31,181 INFO L93 Difference]: Finished difference Result 94 states and 110 transitions. [2022-04-15 12:58:31,181 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2022-04-15 12:58:31,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:31,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:31,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:58:31,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:58:31,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.2) internal successors, (102), 85 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:58:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2022-04-15 12:58:31,182 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 36 [2022-04-15 12:58:31,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:58:31,183 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2022-04-15 12:58:31,183 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:31,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 106 transitions. [2022-04-15 12:58:39,899 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:58:39,899 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2022-04-15 12:58:39,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 12:58:39,899 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:58:39,899 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:58:39,903 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:58:40,100 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:58:40,100 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:58:40,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:58:40,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1466061842, now seen corresponding path program 17 times [2022-04-15 12:58:40,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:40,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1239991259] [2022-04-15 12:58:40,268 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:58:40,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1390012653, now seen corresponding path program 1 times [2022-04-15 12:58:40,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:58:40,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588103149] [2022-04-15 12:58:40,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:58:40,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:58:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:40,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:58:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:40,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {18372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18357#true} is VALID [2022-04-15 12:58:40,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {18357#true} assume true; {18357#true} is VALID [2022-04-15 12:58:40,660 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18357#true} {18357#true} #83#return; {18357#true} is VALID [2022-04-15 12:58:40,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {18357#true} call ULTIMATE.init(); {18372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:58:40,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {18372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18357#true} is VALID [2022-04-15 12:58:40,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {18357#true} assume true; {18357#true} is VALID [2022-04-15 12:58:40,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18357#true} {18357#true} #83#return; {18357#true} is VALID [2022-04-15 12:58:40,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {18357#true} call #t~ret15 := main(); {18357#true} is VALID [2022-04-15 12:58:40,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {18357#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18357#true} is VALID [2022-04-15 12:58:40,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {18357#true} [149] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_31 v_main_~y~0_Out_62) (= v_main_~x~0_In_32 v_main_~x~0_Out_64)) (and (< 0 (mod (+ v_main_~x~0_Out_64 1) 4294967296)) (= |v_main_#t~post6_Out_62| 0) (= |v_main_#t~post5_Out_62| 0) (<= v_main_~x~0_Out_64 v_main_~x~0_In_32) (= (+ v_main_~y~0_Out_62 v_main_~x~0_Out_64) (+ v_main_~x~0_In_32 v_main_~y~0_In_31)))) InVars {main_~x~0=v_main_~x~0_In_32, 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_64, main_#t~post6=|v_main_#t~post6_Out_62|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18357#true} is VALID [2022-04-15 12:58:40,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {18357#true} [148] 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[] {18357#true} is VALID [2022-04-15 12:58:40,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {18357#true} ~z~0 := ~y~0; {18357#true} is VALID [2022-04-15 12:58:40,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {18357#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; {18362#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:40,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {18362#(<= main_~z~0 (+ 4294967294 (* (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; {18363#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:58:40,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {18363#(<= 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; {18364#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:40,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {18364#(<= 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; {18365#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:40,686 INFO L290 TraceCheckUtils]: 13: Hoare triple {18365#(<= 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; {18366#(<= main_~z~0 (+ 4294967290 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:40,686 INFO L290 TraceCheckUtils]: 14: Hoare triple {18366#(<= main_~z~0 (+ 4294967290 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {18366#(<= main_~z~0 (+ 4294967290 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:40,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {18366#(<= 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; {18367#(<= main_~z~0 (+ 4294967291 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:58:40,700 INFO L290 TraceCheckUtils]: 16: Hoare triple {18367#(<= 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; {18368#(<= main_~z~0 (+ 4294967292 (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:58:40,705 INFO L290 TraceCheckUtils]: 17: Hoare triple {18368#(<= 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; {18369#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:58:40,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {18369#(<= 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; {18370#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967294))} is VALID [2022-04-15 12:58:40,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {18370#(<= 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; {18371#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:58:40,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {18371#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {18371#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:58:40,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {18371#(<= (+ 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; {18371#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:58:40,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {18371#(<= (+ 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; {18371#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:58:40,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {18371#(<= (+ 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; {18371#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:58:40,713 INFO L290 TraceCheckUtils]: 24: Hoare triple {18371#(<= (+ 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; {18371#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:58:40,714 INFO L290 TraceCheckUtils]: 25: Hoare triple {18371#(<= (+ 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; {18371#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:58:40,714 INFO L290 TraceCheckUtils]: 26: Hoare triple {18371#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {18371#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:58:40,717 INFO L290 TraceCheckUtils]: 27: Hoare triple {18371#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {18358#false} is VALID [2022-04-15 12:58:40,717 INFO L272 TraceCheckUtils]: 28: Hoare triple {18358#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18358#false} is VALID [2022-04-15 12:58:40,717 INFO L290 TraceCheckUtils]: 29: Hoare triple {18358#false} ~cond := #in~cond; {18358#false} is VALID [2022-04-15 12:58:40,717 INFO L290 TraceCheckUtils]: 30: Hoare triple {18358#false} assume 0 == ~cond; {18358#false} is VALID [2022-04-15 12:58:40,717 INFO L290 TraceCheckUtils]: 31: Hoare triple {18358#false} assume !false; {18358#false} is VALID [2022-04-15 12:58:40,717 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 12:58:40,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:58:40,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588103149] [2022-04-15 12:58:40,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588103149] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:58:40,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268290163] [2022-04-15 12:58:40,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:58:40,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:58:40,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:58:40,719 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:58:40,719 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:58:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:40,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 12:58:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:40,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:58:41,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {18357#true} call ULTIMATE.init(); {18357#true} is VALID [2022-04-15 12:58:41,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {18357#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18357#true} is VALID [2022-04-15 12:58:41,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {18357#true} assume true; {18357#true} is VALID [2022-04-15 12:58:41,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18357#true} {18357#true} #83#return; {18357#true} is VALID [2022-04-15 12:58:41,477 INFO L272 TraceCheckUtils]: 4: Hoare triple {18357#true} call #t~ret15 := main(); {18357#true} is VALID [2022-04-15 12:58:41,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {18357#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18357#true} is VALID [2022-04-15 12:58:41,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {18357#true} [149] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_31 v_main_~y~0_Out_62) (= v_main_~x~0_In_32 v_main_~x~0_Out_64)) (and (< 0 (mod (+ v_main_~x~0_Out_64 1) 4294967296)) (= |v_main_#t~post6_Out_62| 0) (= |v_main_#t~post5_Out_62| 0) (<= v_main_~x~0_Out_64 v_main_~x~0_In_32) (= (+ v_main_~y~0_Out_62 v_main_~x~0_Out_64) (+ v_main_~x~0_In_32 v_main_~y~0_In_31)))) InVars {main_~x~0=v_main_~x~0_In_32, 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_64, main_#t~post6=|v_main_#t~post6_Out_62|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18357#true} is VALID [2022-04-15 12:58:41,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {18357#true} [148] 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[] {18357#true} is VALID [2022-04-15 12:58:41,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {18357#true} ~z~0 := ~y~0; {18357#true} is VALID [2022-04-15 12:58:41,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {18357#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; {18362#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:41,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {18362#(<= main_~z~0 (+ 4294967294 (* (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; {18406#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:58:41,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {18406#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18410#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:41,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {18410#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18414#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:41,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {18414#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~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; {18418#(<= main_~z~0 (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) 4294967290))} is VALID [2022-04-15 12:58:41,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {18418#(<= main_~z~0 (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) 4294967290))} assume !(~z~0 % 4294967296 > 0); {18418#(<= main_~z~0 (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) 4294967290))} is VALID [2022-04-15 12:58:41,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {18418#(<= main_~z~0 (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) 4294967290))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18414#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:41,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {18414#(<= main_~z~0 (+ 4294967291 (* (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; {18410#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:41,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {18410#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 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; {18406#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:58:41,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {18406#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 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; {18362#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:41,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {18362#(<= 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; {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:58:41,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:58:41,542 INFO L290 TraceCheckUtils]: 21: Hoare triple {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:58:41,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:58:41,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:58:41,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:58:41,543 INFO L290 TraceCheckUtils]: 25: Hoare triple {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:58:41,544 INFO L290 TraceCheckUtils]: 26: Hoare triple {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:58:41,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {18358#false} is VALID [2022-04-15 12:58:41,551 INFO L272 TraceCheckUtils]: 28: Hoare triple {18358#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18358#false} is VALID [2022-04-15 12:58:41,551 INFO L290 TraceCheckUtils]: 29: Hoare triple {18358#false} ~cond := #in~cond; {18358#false} is VALID [2022-04-15 12:58:41,551 INFO L290 TraceCheckUtils]: 30: Hoare triple {18358#false} assume 0 == ~cond; {18358#false} is VALID [2022-04-15 12:58:41,551 INFO L290 TraceCheckUtils]: 31: Hoare triple {18358#false} assume !false; {18358#false} is VALID [2022-04-15 12:58:41,551 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 12:58:41,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:58:41,984 INFO L290 TraceCheckUtils]: 31: Hoare triple {18358#false} assume !false; {18358#false} is VALID [2022-04-15 12:58:41,984 INFO L290 TraceCheckUtils]: 30: Hoare triple {18358#false} assume 0 == ~cond; {18358#false} is VALID [2022-04-15 12:58:41,984 INFO L290 TraceCheckUtils]: 29: Hoare triple {18358#false} ~cond := #in~cond; {18358#false} is VALID [2022-04-15 12:58:41,984 INFO L272 TraceCheckUtils]: 28: Hoare triple {18358#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18358#false} is VALID [2022-04-15 12:58:41,990 INFO L290 TraceCheckUtils]: 27: Hoare triple {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {18358#false} is VALID [2022-04-15 12:58:41,991 INFO L290 TraceCheckUtils]: 26: Hoare triple {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:58:41,991 INFO L290 TraceCheckUtils]: 25: Hoare triple {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:58:41,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:58:41,992 INFO L290 TraceCheckUtils]: 23: Hoare triple {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:58:41,992 INFO L290 TraceCheckUtils]: 22: Hoare triple {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:58:41,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:58:41,993 INFO L290 TraceCheckUtils]: 20: Hoare triple {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:58:41,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {18362#(<= 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; {18437#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:58:42,000 INFO L290 TraceCheckUtils]: 18: Hoare triple {18406#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 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; {18362#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:42,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {18410#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 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; {18406#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:58:42,023 INFO L290 TraceCheckUtils]: 16: Hoare triple {18414#(<= main_~z~0 (+ 4294967291 (* (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; {18410#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:42,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {18418#(<= main_~z~0 (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) 4294967290))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18414#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:42,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {18418#(<= main_~z~0 (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) 4294967290))} assume !(~z~0 % 4294967296 > 0); {18418#(<= main_~z~0 (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) 4294967290))} is VALID [2022-04-15 12:58:42,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {18414#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~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; {18418#(<= main_~z~0 (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) 4294967290))} is VALID [2022-04-15 12:58:42,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {18410#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18414#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:42,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {18406#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18410#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:42,060 INFO L290 TraceCheckUtils]: 10: Hoare triple {18362#(<= main_~z~0 (+ 4294967294 (* (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; {18406#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:58:42,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {18357#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; {18362#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:42,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {18357#true} ~z~0 := ~y~0; {18357#true} is VALID [2022-04-15 12:58:42,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {18357#true} [148] 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[] {18357#true} is VALID [2022-04-15 12:58:42,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {18357#true} [149] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_31 v_main_~y~0_Out_62) (= v_main_~x~0_In_32 v_main_~x~0_Out_64)) (and (< 0 (mod (+ v_main_~x~0_Out_64 1) 4294967296)) (= |v_main_#t~post6_Out_62| 0) (= |v_main_#t~post5_Out_62| 0) (<= v_main_~x~0_Out_64 v_main_~x~0_In_32) (= (+ v_main_~y~0_Out_62 v_main_~x~0_Out_64) (+ v_main_~x~0_In_32 v_main_~y~0_In_31)))) InVars {main_~x~0=v_main_~x~0_In_32, 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_64, main_#t~post6=|v_main_#t~post6_Out_62|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18357#true} is VALID [2022-04-15 12:58:42,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {18357#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18357#true} is VALID [2022-04-15 12:58:42,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {18357#true} call #t~ret15 := main(); {18357#true} is VALID [2022-04-15 12:58:42,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18357#true} {18357#true} #83#return; {18357#true} is VALID [2022-04-15 12:58:42,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {18357#true} assume true; {18357#true} is VALID [2022-04-15 12:58:42,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {18357#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18357#true} is VALID [2022-04-15 12:58:42,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {18357#true} call ULTIMATE.init(); {18357#true} is VALID [2022-04-15 12:58:42,064 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 12:58:42,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268290163] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:58:42,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:58:42,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 18 [2022-04-15 12:58:43,367 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:58:43,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1239991259] [2022-04-15 12:58:43,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1239991259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:58:43,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:58:43,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 12:58:43,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827100952] [2022-04-15 12:58:43,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:58:43,368 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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 12:58:43,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:58:43,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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 12:58:43,538 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 12:58:43,539 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 12:58:43,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:43,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 12:58:43,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:58:43,539 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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 12:59:03,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:03,358 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2022-04-15 12:59:03,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-15 12:59:03,359 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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 12:59:03,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:59:03,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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 12:59:03,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 96 transitions. [2022-04-15 12:59:03,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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 12:59:03,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 96 transitions. [2022-04-15 12:59:03,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 96 transitions. [2022-04-15 12:59:04,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:59:04,616 INFO L225 Difference]: With dead ends: 118 [2022-04-15 12:59:04,616 INFO L226 Difference]: Without dead ends: 113 [2022-04-15 12:59:04,616 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=637, Invalid=3023, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 12:59:04,617 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 67 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:59:04,617 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 49 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-15 12:59:04,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-15 12:59:05,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 92. [2022-04-15 12:59:05,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:59:05,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 92 states, 87 states have (on average 1.206896551724138) internal successors, (105), 87 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:05,688 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 92 states, 87 states have (on average 1.206896551724138) internal successors, (105), 87 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:05,688 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 92 states, 87 states have (on average 1.206896551724138) internal successors, (105), 87 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:05,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:05,689 INFO L93 Difference]: Finished difference Result 113 states and 135 transitions. [2022-04-15 12:59:05,689 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2022-04-15 12:59:05,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:59:05,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:59:05,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 87 states have (on average 1.206896551724138) internal successors, (105), 87 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 113 states. [2022-04-15 12:59:05,690 INFO L87 Difference]: Start difference. First operand has 92 states, 87 states have (on average 1.206896551724138) internal successors, (105), 87 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 113 states. [2022-04-15 12:59:05,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:05,691 INFO L93 Difference]: Finished difference Result 113 states and 135 transitions. [2022-04-15 12:59:05,691 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2022-04-15 12:59:05,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:59:05,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:59:05,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:59:05,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:59:05,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 87 states have (on average 1.206896551724138) internal successors, (105), 87 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:05,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2022-04-15 12:59:05,693 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 36 [2022-04-15 12:59:05,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:59:05,693 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2022-04-15 12:59:05,693 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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 12:59:05,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 109 transitions. [2022-04-15 12:59:16,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:59:16,122 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2022-04-15 12:59:16,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 12:59:16,122 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:59:16,122 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:59:16,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-04-15 12:59:16,322 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:59:16,323 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:59:16,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:59:16,323 INFO L85 PathProgramCache]: Analyzing trace with hash -424783871, now seen corresponding path program 9 times [2022-04-15 12:59:16,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:59:16,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1792909996] [2022-04-15 12:59:16,482 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:59:16,483 INFO L85 PathProgramCache]: Analyzing trace with hash -933385195, now seen corresponding path program 1 times [2022-04-15 12:59:16,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:59:16,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535262052] [2022-04-15 12:59:16,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:59:16,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:59:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:16,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:59:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:16,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {19307#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19297#true} is VALID [2022-04-15 12:59:16,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {19297#true} assume true; {19297#true} is VALID [2022-04-15 12:59:16,821 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19297#true} {19297#true} #83#return; {19297#true} is VALID [2022-04-15 12:59:16,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {19297#true} call ULTIMATE.init(); {19307#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:59:16,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {19307#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19297#true} is VALID [2022-04-15 12:59:16,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {19297#true} assume true; {19297#true} is VALID [2022-04-15 12:59:16,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19297#true} {19297#true} #83#return; {19297#true} is VALID [2022-04-15 12:59:16,822 INFO L272 TraceCheckUtils]: 4: Hoare triple {19297#true} call #t~ret15 := main(); {19297#true} is VALID [2022-04-15 12:59:16,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {19297#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19297#true} is VALID [2022-04-15 12:59:16,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {19297#true} [151] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_33 v_main_~x~0_Out_66) (= v_main_~y~0_In_32 v_main_~y~0_Out_64)) (and (= (+ v_main_~x~0_In_33 v_main_~y~0_In_32) (+ v_main_~y~0_Out_64 v_main_~x~0_Out_66)) (< 0 (mod (+ v_main_~x~0_Out_66 1) 4294967296)) (= |v_main_#t~post6_Out_64| 0) (= |v_main_#t~post5_Out_64| 0) (<= v_main_~x~0_Out_66 v_main_~x~0_In_33))) InVars {main_~x~0=v_main_~x~0_In_33, 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_66, main_#t~post6=|v_main_#t~post6_Out_64|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19297#true} is VALID [2022-04-15 12:59:16,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {19297#true} [150] 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[] {19297#true} is VALID [2022-04-15 12:59:16,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {19297#true} ~z~0 := ~y~0; {19297#true} is VALID [2022-04-15 12:59:16,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {19297#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; {19297#true} is VALID [2022-04-15 12:59:16,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {19297#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; {19297#true} is VALID [2022-04-15 12:59:16,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {19297#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; {19297#true} is VALID [2022-04-15 12:59:16,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {19297#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; {19297#true} is VALID [2022-04-15 12:59:16,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {19297#true} assume !(~z~0 % 4294967296 > 0); {19302#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:59:16,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {19302#(<= 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; {19303#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:59:16,840 INFO L290 TraceCheckUtils]: 15: Hoare triple {19303#(<= 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; {19304#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:59:16,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {19304#(<= 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; {19305#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:16,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {19305#(<= main_~z~0 (+ 3 (* (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; {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 12:59:16,855 INFO L290 TraceCheckUtils]: 18: Hoare triple {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !(~y~0 % 4294967296 > 0); {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 12:59:16,856 INFO L290 TraceCheckUtils]: 19: Hoare triple {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 12:59:16,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 12:59:16,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 12:59:16,857 INFO L290 TraceCheckUtils]: 22: Hoare triple {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 12:59:16,857 INFO L290 TraceCheckUtils]: 23: Hoare triple {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !(~x~0 % 4294967296 > 0); {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 12:59:16,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {19305#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:16,872 INFO L290 TraceCheckUtils]: 25: Hoare triple {19305#(<= 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; {19304#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:59:16,878 INFO L290 TraceCheckUtils]: 26: Hoare triple {19304#(<= 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; {19303#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:59:16,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {19303#(<= 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; {19302#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:59:16,894 INFO L290 TraceCheckUtils]: 28: Hoare triple {19302#(<= 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; {19298#false} is VALID [2022-04-15 12:59:16,894 INFO L290 TraceCheckUtils]: 29: Hoare triple {19298#false} assume !(~z~0 % 4294967296 > 0); {19298#false} is VALID [2022-04-15 12:59:16,894 INFO L272 TraceCheckUtils]: 30: Hoare triple {19298#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19298#false} is VALID [2022-04-15 12:59:16,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {19298#false} ~cond := #in~cond; {19298#false} is VALID [2022-04-15 12:59:16,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {19298#false} assume 0 == ~cond; {19298#false} is VALID [2022-04-15 12:59:16,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {19298#false} assume !false; {19298#false} is VALID [2022-04-15 12:59:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-15 12:59:16,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:59:16,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535262052] [2022-04-15 12:59:16,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535262052] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:59:16,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022300851] [2022-04-15 12:59:16,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:59:16,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:59:16,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:59:16,896 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 12:59:16,896 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 12:59:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:16,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 12:59:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:16,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:59:17,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {19297#true} call ULTIMATE.init(); {19297#true} is VALID [2022-04-15 12:59:17,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {19297#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19297#true} is VALID [2022-04-15 12:59:17,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {19297#true} assume true; {19297#true} is VALID [2022-04-15 12:59:17,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19297#true} {19297#true} #83#return; {19297#true} is VALID [2022-04-15 12:59:17,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {19297#true} call #t~ret15 := main(); {19297#true} is VALID [2022-04-15 12:59:17,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {19297#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19297#true} is VALID [2022-04-15 12:59:17,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {19297#true} [151] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_33 v_main_~x~0_Out_66) (= v_main_~y~0_In_32 v_main_~y~0_Out_64)) (and (= (+ v_main_~x~0_In_33 v_main_~y~0_In_32) (+ v_main_~y~0_Out_64 v_main_~x~0_Out_66)) (< 0 (mod (+ v_main_~x~0_Out_66 1) 4294967296)) (= |v_main_#t~post6_Out_64| 0) (= |v_main_#t~post5_Out_64| 0) (<= v_main_~x~0_Out_66 v_main_~x~0_In_33))) InVars {main_~x~0=v_main_~x~0_In_33, 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_66, main_#t~post6=|v_main_#t~post6_Out_64|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19297#true} is VALID [2022-04-15 12:59:17,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {19297#true} [150] 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[] {19297#true} is VALID [2022-04-15 12:59:17,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {19297#true} ~z~0 := ~y~0; {19297#true} is VALID [2022-04-15 12:59:17,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {19297#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; {19297#true} is VALID [2022-04-15 12:59:17,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {19297#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; {19297#true} is VALID [2022-04-15 12:59:17,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {19297#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; {19297#true} is VALID [2022-04-15 12:59:17,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {19297#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; {19297#true} is VALID [2022-04-15 12:59:17,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {19297#true} assume !(~z~0 % 4294967296 > 0); {19302#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:59:17,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {19302#(<= 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; {19303#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:59:17,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {19303#(<= 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; {19304#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:59:17,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {19304#(<= 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; {19305#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:17,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {19305#(<= main_~z~0 (+ 3 (* (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; {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 12:59:17,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !(~y~0 % 4294967296 > 0); {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 12:59:17,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 12:59:17,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 12:59:17,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 12:59:17,285 INFO L290 TraceCheckUtils]: 22: Hoare triple {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 12:59:17,285 INFO L290 TraceCheckUtils]: 23: Hoare triple {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !(~x~0 % 4294967296 > 0); {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 12:59:17,295 INFO L290 TraceCheckUtils]: 24: Hoare triple {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {19305#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:17,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {19305#(<= 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; {19304#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:59:17,308 INFO L290 TraceCheckUtils]: 26: Hoare triple {19304#(<= 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; {19303#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:59:17,318 INFO L290 TraceCheckUtils]: 27: Hoare triple {19303#(<= 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; {19302#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:59:17,324 INFO L290 TraceCheckUtils]: 28: Hoare triple {19302#(<= 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; {19298#false} is VALID [2022-04-15 12:59:17,324 INFO L290 TraceCheckUtils]: 29: Hoare triple {19298#false} assume !(~z~0 % 4294967296 > 0); {19298#false} is VALID [2022-04-15 12:59:17,324 INFO L272 TraceCheckUtils]: 30: Hoare triple {19298#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19298#false} is VALID [2022-04-15 12:59:17,324 INFO L290 TraceCheckUtils]: 31: Hoare triple {19298#false} ~cond := #in~cond; {19298#false} is VALID [2022-04-15 12:59:17,324 INFO L290 TraceCheckUtils]: 32: Hoare triple {19298#false} assume 0 == ~cond; {19298#false} is VALID [2022-04-15 12:59:17,324 INFO L290 TraceCheckUtils]: 33: Hoare triple {19298#false} assume !false; {19298#false} is VALID [2022-04-15 12:59:17,324 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-15 12:59:17,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:59:17,685 INFO L290 TraceCheckUtils]: 33: Hoare triple {19298#false} assume !false; {19298#false} is VALID [2022-04-15 12:59:17,685 INFO L290 TraceCheckUtils]: 32: Hoare triple {19298#false} assume 0 == ~cond; {19298#false} is VALID [2022-04-15 12:59:17,685 INFO L290 TraceCheckUtils]: 31: Hoare triple {19298#false} ~cond := #in~cond; {19298#false} is VALID [2022-04-15 12:59:17,685 INFO L272 TraceCheckUtils]: 30: Hoare triple {19298#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19298#false} is VALID [2022-04-15 12:59:17,686 INFO L290 TraceCheckUtils]: 29: Hoare triple {19298#false} assume !(~z~0 % 4294967296 > 0); {19298#false} is VALID [2022-04-15 12:59:17,692 INFO L290 TraceCheckUtils]: 28: Hoare triple {19302#(<= 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; {19298#false} is VALID [2022-04-15 12:59:17,700 INFO L290 TraceCheckUtils]: 27: Hoare triple {19303#(<= 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; {19302#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:59:17,708 INFO L290 TraceCheckUtils]: 26: Hoare triple {19304#(<= 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; {19303#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:59:17,714 INFO L290 TraceCheckUtils]: 25: Hoare triple {19305#(<= 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; {19304#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:59:17,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {19305#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:17,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !(~x~0 % 4294967296 > 0); {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 12:59:17,723 INFO L290 TraceCheckUtils]: 22: Hoare triple {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 12:59:17,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 12:59:17,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 12:59:17,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 12:59:17,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !(~y~0 % 4294967296 > 0); {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 12:59:17,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {19305#(<= main_~z~0 (+ 3 (* (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; {19306#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 12:59:17,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {19304#(<= 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; {19305#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:17,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {19303#(<= 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; {19304#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:59:17,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {19302#(<= 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; {19303#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:59:17,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {19297#true} assume !(~z~0 % 4294967296 > 0); {19302#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:59:17,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {19297#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; {19297#true} is VALID [2022-04-15 12:59:17,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {19297#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; {19297#true} is VALID [2022-04-15 12:59:17,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {19297#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; {19297#true} is VALID [2022-04-15 12:59:17,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {19297#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; {19297#true} is VALID [2022-04-15 12:59:17,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {19297#true} ~z~0 := ~y~0; {19297#true} is VALID [2022-04-15 12:59:17,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {19297#true} [150] 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[] {19297#true} is VALID [2022-04-15 12:59:17,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {19297#true} [151] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_33 v_main_~x~0_Out_66) (= v_main_~y~0_In_32 v_main_~y~0_Out_64)) (and (= (+ v_main_~x~0_In_33 v_main_~y~0_In_32) (+ v_main_~y~0_Out_64 v_main_~x~0_Out_66)) (< 0 (mod (+ v_main_~x~0_Out_66 1) 4294967296)) (= |v_main_#t~post6_Out_64| 0) (= |v_main_#t~post5_Out_64| 0) (<= v_main_~x~0_Out_66 v_main_~x~0_In_33))) InVars {main_~x~0=v_main_~x~0_In_33, 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_66, main_#t~post6=|v_main_#t~post6_Out_64|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19297#true} is VALID [2022-04-15 12:59:17,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {19297#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19297#true} is VALID [2022-04-15 12:59:17,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {19297#true} call #t~ret15 := main(); {19297#true} is VALID [2022-04-15 12:59:17,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19297#true} {19297#true} #83#return; {19297#true} is VALID [2022-04-15 12:59:17,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {19297#true} assume true; {19297#true} is VALID [2022-04-15 12:59:17,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {19297#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19297#true} is VALID [2022-04-15 12:59:17,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {19297#true} call ULTIMATE.init(); {19297#true} is VALID [2022-04-15 12:59:17,760 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-15 12:59:17,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022300851] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:59:17,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:59:17,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2022-04-15 12:59:18,717 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:59:18,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1792909996] [2022-04-15 12:59:18,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1792909996] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:59:18,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:59:18,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:59:18,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298445873] [2022-04-15 12:59:18,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:59:18,718 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-15 12:59:18,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:59:18,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:18,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:59:18,895 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:59:18,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:59:18,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:59:18,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:59:18,896 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:29,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:29,125 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2022-04-15 12:59:29,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 12:59:29,125 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-15 12:59:29,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:59:29,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:29,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 67 transitions. [2022-04-15 12:59:29,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:29,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 67 transitions. [2022-04-15 12:59:29,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 67 transitions. [2022-04-15 12:59:29,730 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:59:29,732 INFO L225 Difference]: With dead ends: 116 [2022-04-15 12:59:29,732 INFO L226 Difference]: Without dead ends: 95 [2022-04-15 12:59:29,732 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2022-04-15 12:59:29,732 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 36 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:59:29,732 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 53 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-15 12:59:29,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-15 12:59:30,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2022-04-15 12:59:30,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:59:30,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 87 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 82 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call 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:30,724 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 87 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 82 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call 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:30,724 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 87 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 82 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call 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:30,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:30,725 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2022-04-15 12:59:30,726 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2022-04-15 12:59:30,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:59:30,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:59:30,726 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 82 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 95 states. [2022-04-15 12:59:30,726 INFO L87 Difference]: Start difference. First operand has 87 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 82 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 95 states. [2022-04-15 12:59:30,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:30,727 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2022-04-15 12:59:30,728 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2022-04-15 12:59:30,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:59:30,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:59:30,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:59:30,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:59:30,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 82 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call 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:30,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2022-04-15 12:59:30,729 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 37 [2022-04-15 12:59:30,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:59:30,729 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions. [2022-04-15 12:59:30,729 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:30,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 102 transitions. [2022-04-15 12:59:39,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:59:39,130 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2022-04-15 12:59:39,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 12:59:39,130 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:59:39,131 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:59:39,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-15 12:59:39,331 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,SelfDestructingSolverStorable36 [2022-04-15 12:59:39,331 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:59:39,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:59:39,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1581437808, now seen corresponding path program 18 times [2022-04-15 12:59:39,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:59:39,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1510410771] [2022-04-15 12:59:39,492 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:59:39,493 INFO L85 PathProgramCache]: Analyzing trace with hash -676284188, now seen corresponding path program 1 times [2022-04-15 12:59:39,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:59:39,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713249146] [2022-04-15 12:59:39,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:59:39,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:59:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:41,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:59:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:41,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {20176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20155#true} is VALID [2022-04-15 12:59:41,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {20155#true} assume true; {20155#true} is VALID [2022-04-15 12:59:41,166 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20155#true} {20155#true} #83#return; {20155#true} is VALID [2022-04-15 12:59:41,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {20155#true} call ULTIMATE.init(); {20176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:59:41,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {20176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20155#true} is VALID [2022-04-15 12:59:41,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {20155#true} assume true; {20155#true} is VALID [2022-04-15 12:59:41,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20155#true} {20155#true} #83#return; {20155#true} is VALID [2022-04-15 12:59:41,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {20155#true} call #t~ret15 := main(); {20155#true} is VALID [2022-04-15 12:59:41,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {20155#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20160#(= main_~y~0 0)} is VALID [2022-04-15 12:59:41,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {20160#(= main_~y~0 0)} [153] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_33 v_main_~y~0_Out_66) (= v_main_~x~0_In_34 v_main_~x~0_Out_68)) (and (<= v_main_~x~0_Out_68 v_main_~x~0_In_34) (= (+ v_main_~y~0_Out_66 v_main_~x~0_Out_68) (+ v_main_~x~0_In_34 v_main_~y~0_In_33)) (= |v_main_#t~post5_Out_66| 0) (< 0 (mod (+ v_main_~x~0_Out_68 1) 4294967296)) (= |v_main_#t~post6_Out_66| 0))) InVars {main_~x~0=v_main_~x~0_In_34, 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_68, main_#t~post6=|v_main_#t~post6_Out_66|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20161#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 12:59:41,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {20161#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} [152] 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[] {20161#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 12:59:41,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {20161#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} ~z~0 := ~y~0; {20162#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0)))} is VALID [2022-04-15 12:59:41,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {20162#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= 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; {20163#(and (or (not (= main_~y~0 0)) (and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))) (or (<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296))) (= main_~y~0 0)))} is VALID [2022-04-15 12:59:41,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {20163#(and (or (not (= main_~y~0 0)) (and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))) (or (<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 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; {20164#(and (or (<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296))) (= main_~y~0 0)) (or (not (= main_~y~0 0)) (and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))))} is VALID [2022-04-15 12:59:41,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {20164#(and (or (<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296))) (= main_~y~0 0)) (or (not (= main_~y~0 0)) (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; {20165#(and (or (= main_~y~0 0) (<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))) (or (not (= main_~y~0 0)) (and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))))} is VALID [2022-04-15 12:59:41,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {20165#(and (or (= main_~y~0 0) (<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))) (or (not (= main_~y~0 0)) (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; {20166#(and (or (not (= main_~y~0 0)) (and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))) (or (<= main_~x~0 (+ (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296) 4294967298)) (= main_~y~0 0)))} is VALID [2022-04-15 12:59:41,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {20166#(and (or (not (= main_~y~0 0)) (and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))) (or (<= main_~x~0 (+ (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296) 4294967298)) (= 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; {20167#(and (or (not (= main_~y~0 0)) (and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))) (or (<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299)) (= main_~y~0 0)))} is VALID [2022-04-15 12:59:41,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {20167#(and (or (not (= main_~y~0 0)) (and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))) (or (<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299)) (= 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; {20168#(and (or (not (= main_~y~0 0)) (and (<= (+ (div main_~z~0 4294967296) 1) 0) (<= main_~y~0 (+ main_~z~0 6)))) (or (<= main_~x~0 (+ (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296) 4294967300)) (= main_~y~0 0)))} is VALID [2022-04-15 12:59:41,234 INFO L290 TraceCheckUtils]: 15: Hoare triple {20168#(and (or (not (= main_~y~0 0)) (and (<= (+ (div main_~z~0 4294967296) 1) 0) (<= main_~y~0 (+ main_~z~0 6)))) (or (<= main_~x~0 (+ (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296) 4294967300)) (= main_~y~0 0)))} assume !(~z~0 % 4294967296 > 0); {20169#(and (not (= main_~y~0 0)) (<= main_~x~0 (+ (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296) 4294967300)))} is VALID [2022-04-15 12:59:41,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {20169#(and (not (= main_~y~0 0)) (<= main_~x~0 (+ (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296) 4294967300)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20170#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296) 4294967300))} is VALID [2022-04-15 12:59:41,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {20170#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296) 4294967300))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20170#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296) 4294967300))} is VALID [2022-04-15 12:59:41,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {20170#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296) 4294967300))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20170#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296) 4294967300))} is VALID [2022-04-15 12:59:41,236 INFO L290 TraceCheckUtils]: 19: Hoare triple {20170#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296) 4294967300))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20170#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296) 4294967300))} is VALID [2022-04-15 12:59:41,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {20170#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296) 4294967300))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20170#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296) 4294967300))} is VALID [2022-04-15 12:59:41,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {20170#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296) 4294967300))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20170#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296) 4294967300))} is VALID [2022-04-15 12:59:41,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {20170#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296) 4294967300))} assume !(~y~0 % 4294967296 > 0); {20170#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296) 4294967300))} is VALID [2022-04-15 12:59:41,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {20170#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296) 4294967300))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20171#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} is VALID [2022-04-15 12:59:41,255 INFO L290 TraceCheckUtils]: 24: Hoare triple {20171#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20172#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:59:41,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {20172#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20173#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:41,275 INFO L290 TraceCheckUtils]: 26: Hoare triple {20173#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20174#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:41,279 INFO L290 TraceCheckUtils]: 27: Hoare triple {20174#(<= 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; {20175#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:59:41,282 INFO L290 TraceCheckUtils]: 28: Hoare triple {20175#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {20156#false} is VALID [2022-04-15 12:59:41,282 INFO L290 TraceCheckUtils]: 29: Hoare triple {20156#false} assume !(~z~0 % 4294967296 > 0); {20156#false} is VALID [2022-04-15 12:59:41,282 INFO L272 TraceCheckUtils]: 30: Hoare triple {20156#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20156#false} is VALID [2022-04-15 12:59:41,283 INFO L290 TraceCheckUtils]: 31: Hoare triple {20156#false} ~cond := #in~cond; {20156#false} is VALID [2022-04-15 12:59:41,283 INFO L290 TraceCheckUtils]: 32: Hoare triple {20156#false} assume 0 == ~cond; {20156#false} is VALID [2022-04-15 12:59:41,283 INFO L290 TraceCheckUtils]: 33: Hoare triple {20156#false} assume !false; {20156#false} is VALID [2022-04-15 12:59:41,283 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 12:59:41,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:59:41,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713249146] [2022-04-15 12:59:41,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713249146] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:59:41,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146674906] [2022-04-15 12:59:41,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:59:41,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:59:41,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:59:41,284 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 12:59:41,285 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 12:59:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:41,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-15 12:59:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:41,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:59:45,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {20155#true} call ULTIMATE.init(); {20155#true} is VALID [2022-04-15 12:59:45,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {20155#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20155#true} is VALID [2022-04-15 12:59:45,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {20155#true} assume true; {20155#true} is VALID [2022-04-15 12:59:45,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20155#true} {20155#true} #83#return; {20155#true} is VALID [2022-04-15 12:59:45,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {20155#true} call #t~ret15 := main(); {20155#true} is VALID [2022-04-15 12:59:45,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {20155#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20155#true} is VALID [2022-04-15 12:59:45,360 INFO L290 TraceCheckUtils]: 6: Hoare triple {20155#true} [153] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_33 v_main_~y~0_Out_66) (= v_main_~x~0_In_34 v_main_~x~0_Out_68)) (and (<= v_main_~x~0_Out_68 v_main_~x~0_In_34) (= (+ v_main_~y~0_Out_66 v_main_~x~0_Out_68) (+ v_main_~x~0_In_34 v_main_~y~0_In_33)) (= |v_main_#t~post5_Out_66| 0) (< 0 (mod (+ v_main_~x~0_Out_68 1) 4294967296)) (= |v_main_#t~post6_Out_66| 0))) InVars {main_~x~0=v_main_~x~0_In_34, 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_68, main_#t~post6=|v_main_#t~post6_Out_66|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20155#true} is VALID [2022-04-15 12:59:45,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {20155#true} [152] 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[] {20155#true} is VALID [2022-04-15 12:59:45,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {20155#true} ~z~0 := ~y~0; {20204#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:59:45,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {20204#(= 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; {20208#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:59:45,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {20208#(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; {20212#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:59:45,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {20212#(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; {20216#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:59:45,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {20216#(and (= (+ (- 2) 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; {20220#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:59:45,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {20220#(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; {20224#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:59:45,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {20224#(and (= (+ main_~y~0 (- 4)) (+ 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; {20228#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:59:45,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {20228#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {20228#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:59:45,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {20228#(and (= (+ main_~y~0 (- 4)) (+ 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; {20235#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= (+ main_~y~0 (- 4)) main_~z~0))} is VALID [2022-04-15 12:59:45,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {20235#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= (+ main_~y~0 (- 4)) 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; {20239#(and (= (+ main_~z~0 3) (+ main_~y~0 1)) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-15 12:59:45,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {20239#(and (= (+ main_~z~0 3) (+ main_~y~0 1)) (< 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; {20243#(and (< 0 (mod (+ main_~z~0 3) 4294967296)) (= (+ main_~z~0 1) (+ main_~y~0 1)))} is VALID [2022-04-15 12:59:45,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {20243#(and (< 0 (mod (+ main_~z~0 3) 4294967296)) (= (+ main_~z~0 1) (+ main_~y~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20247#(and (= (+ (- 1) main_~z~0) (+ main_~y~0 1)) (< 0 (mod (+ main_~z~0 2) 4294967296)))} is VALID [2022-04-15 12:59:45,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {20247#(and (= (+ (- 1) main_~z~0) (+ main_~y~0 1)) (< 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; {20251#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (+ main_~y~0 2) (+ (- 2) main_~z~0)))} is VALID [2022-04-15 12:59:45,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {20251#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (+ main_~y~0 2) (+ (- 2) main_~z~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20255#(and (= (+ main_~z~0 (- 5)) (+ main_~y~0 1)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 12:59:45,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {20255#(and (= (+ main_~z~0 (- 5)) (+ main_~y~0 1)) (< 0 (mod main_~z~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {20255#(and (= (+ main_~z~0 (- 5)) (+ main_~y~0 1)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 12:59:45,432 INFO L290 TraceCheckUtils]: 23: Hoare triple {20255#(and (= (+ main_~z~0 (- 5)) (+ main_~y~0 1)) (< 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; {20262#(and (< 0 (mod main_~z~0 4294967296)) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-15 12:59:45,437 INFO L290 TraceCheckUtils]: 24: Hoare triple {20262#(and (< 0 (mod main_~z~0 4294967296)) (= (+ main_~z~0 (- 5)) 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; {20266#(and (= (+ main_~z~0 (- 5)) (+ (- 1) main_~y~0)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 12:59:45,441 INFO L290 TraceCheckUtils]: 25: Hoare triple {20266#(and (= (+ main_~z~0 (- 5)) (+ (- 1) main_~y~0)) (< 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; {20270#(and (< 0 (mod main_~z~0 4294967296)) (= (+ (- 2) main_~y~0) (+ main_~z~0 (- 5))))} is VALID [2022-04-15 12:59:45,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {20270#(and (< 0 (mod main_~z~0 4294967296)) (= (+ (- 2) main_~y~0) (+ main_~z~0 (- 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; {20274#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:59:45,442 INFO L290 TraceCheckUtils]: 27: Hoare triple {20274#(< 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; {20274#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:59:45,442 INFO L290 TraceCheckUtils]: 28: Hoare triple {20274#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {20274#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:59:45,443 INFO L290 TraceCheckUtils]: 29: Hoare triple {20274#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {20156#false} is VALID [2022-04-15 12:59:45,443 INFO L272 TraceCheckUtils]: 30: Hoare triple {20156#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20156#false} is VALID [2022-04-15 12:59:45,443 INFO L290 TraceCheckUtils]: 31: Hoare triple {20156#false} ~cond := #in~cond; {20156#false} is VALID [2022-04-15 12:59:45,443 INFO L290 TraceCheckUtils]: 32: Hoare triple {20156#false} assume 0 == ~cond; {20156#false} is VALID [2022-04-15 12:59:45,443 INFO L290 TraceCheckUtils]: 33: Hoare triple {20156#false} assume !false; {20156#false} is VALID [2022-04-15 12:59:45,443 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:59:45,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:59:47,722 INFO L290 TraceCheckUtils]: 33: Hoare triple {20156#false} assume !false; {20156#false} is VALID [2022-04-15 12:59:47,723 INFO L290 TraceCheckUtils]: 32: Hoare triple {20156#false} assume 0 == ~cond; {20156#false} is VALID [2022-04-15 12:59:47,723 INFO L290 TraceCheckUtils]: 31: Hoare triple {20156#false} ~cond := #in~cond; {20156#false} is VALID [2022-04-15 12:59:47,723 INFO L272 TraceCheckUtils]: 30: Hoare triple {20156#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20156#false} is VALID [2022-04-15 12:59:47,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {20274#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {20156#false} is VALID [2022-04-15 12:59:47,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {20274#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {20274#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:59:47,724 INFO L290 TraceCheckUtils]: 27: Hoare triple {20274#(< 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; {20274#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:59:47,724 INFO L290 TraceCheckUtils]: 26: Hoare triple {20274#(< 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; {20274#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:59:47,724 INFO L290 TraceCheckUtils]: 25: Hoare triple {20274#(< 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; {20274#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:59:47,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {20274#(< 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; {20274#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:59:47,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {20274#(< 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; {20274#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:59:47,725 INFO L290 TraceCheckUtils]: 22: Hoare triple {20274#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {20274#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:59:47,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {20332#(< 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; {20274#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:59:47,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {20336#(< 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; {20332#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:59:47,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {20340#(< 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; {20336#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:59:47,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {20344#(< 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; {20340#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:59:47,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {20348#(< 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; {20344#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:59:47,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {20352#(< 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; {20348#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 12:59:47,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {20352#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !(~z~0 % 4294967296 > 0); {20352#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 12:59:47,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {20348#(< 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; {20352#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 12:59:47,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {20344#(< 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; {20348#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 12:59:47,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {20340#(< 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; {20344#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:59:47,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {20336#(< 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; {20340#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:59:47,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {20332#(< 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; {20336#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:59:47,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {20155#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; {20332#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:59:47,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {20155#true} ~z~0 := ~y~0; {20155#true} is VALID [2022-04-15 12:59:47,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {20155#true} [152] 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[] {20155#true} is VALID [2022-04-15 12:59:47,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {20155#true} [153] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_33 v_main_~y~0_Out_66) (= v_main_~x~0_In_34 v_main_~x~0_Out_68)) (and (<= v_main_~x~0_Out_68 v_main_~x~0_In_34) (= (+ v_main_~y~0_Out_66 v_main_~x~0_Out_68) (+ v_main_~x~0_In_34 v_main_~y~0_In_33)) (= |v_main_#t~post5_Out_66| 0) (< 0 (mod (+ v_main_~x~0_Out_68 1) 4294967296)) (= |v_main_#t~post6_Out_66| 0))) InVars {main_~x~0=v_main_~x~0_In_34, 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_68, main_#t~post6=|v_main_#t~post6_Out_66|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20155#true} is VALID [2022-04-15 12:59:47,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {20155#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20155#true} is VALID [2022-04-15 12:59:47,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {20155#true} call #t~ret15 := main(); {20155#true} is VALID [2022-04-15 12:59:47,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20155#true} {20155#true} #83#return; {20155#true} is VALID [2022-04-15 12:59:47,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {20155#true} assume true; {20155#true} is VALID [2022-04-15 12:59:47,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {20155#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20155#true} is VALID [2022-04-15 12:59:47,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {20155#true} call ULTIMATE.init(); {20155#true} is VALID [2022-04-15 12:59:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 12:59:47,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146674906] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:59:47,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:59:47,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 9] total 42 [2022-04-15 12:59:52,251 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:59:52,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1510410771] [2022-04-15 12:59:52,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1510410771] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:59:52,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:59:52,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 12:59:52,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23225011] [2022-04-15 12:59:52,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:59:52,252 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 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 12:59:52,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:59:52,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 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:59:52,481 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:59:52,482 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 12:59:52,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:59:52,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 12:59:52,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=2038, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 12:59:52,482 INFO L87 Difference]: Start difference. First operand 87 states and 102 transitions. Second operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 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:00:36,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:36,636 INFO L93 Difference]: Finished difference Result 135 states and 166 transitions. [2022-04-15 13:00:36,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 13:00:36,636 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 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:00:36,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:00:36,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 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:00:36,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 91 transitions. [2022-04-15 13:00:36,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 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:00:36,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 91 transitions. [2022-04-15 13:00:36,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 91 transitions. [2022-04-15 13:00:38,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:38,047 INFO L225 Difference]: With dead ends: 135 [2022-04-15 13:00:38,047 INFO L226 Difference]: Without dead ends: 124 [2022-04-15 13:00:38,047 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 37.5s TimeCoverageRelationStatistics Valid=565, Invalid=5915, Unknown=0, NotChecked=0, Total=6480 [2022-04-15 13:00:38,048 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 92 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-15 13:00:38,048 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 102 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-04-15 13:00:38,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-15 13:00:39,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 102. [2022-04-15 13:00:39,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:00:39,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 102 states, 97 states have (on average 1.2061855670103092) internal successors, (117), 97 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 13:00:39,286 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 102 states, 97 states have (on average 1.2061855670103092) internal successors, (117), 97 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 13:00:39,287 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 102 states, 97 states have (on average 1.2061855670103092) internal successors, (117), 97 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 13:00:39,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:39,288 INFO L93 Difference]: Finished difference Result 124 states and 149 transitions. [2022-04-15 13:00:39,288 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 149 transitions. [2022-04-15 13:00:39,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:39,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:39,288 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 97 states have (on average 1.2061855670103092) internal successors, (117), 97 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 124 states. [2022-04-15 13:00:39,288 INFO L87 Difference]: Start difference. First operand has 102 states, 97 states have (on average 1.2061855670103092) internal successors, (117), 97 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 124 states. [2022-04-15 13:00:39,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:39,290 INFO L93 Difference]: Finished difference Result 124 states and 149 transitions. [2022-04-15 13:00:39,290 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 149 transitions. [2022-04-15 13:00:39,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:39,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:39,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:00:39,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:00:39,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 97 states have (on average 1.2061855670103092) internal successors, (117), 97 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 13:00:39,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2022-04-15 13:00:39,292 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 37 [2022-04-15 13:00:39,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:00:39,292 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2022-04-15 13:00:39,292 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 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:00:39,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 121 transitions. [2022-04-15 13:00:56,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 120 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:56,195 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2022-04-15 13:00:56,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 13:00:56,196 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:00:56,196 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:00:56,221 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:00:56,396 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,SelfDestructingSolverStorable37 [2022-04-15 13:00:56,397 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:00:56,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:00:56,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1670686287, now seen corresponding path program 19 times [2022-04-15 13:00:56,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:56,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1414532716] [2022-04-15 13:00:56,570 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:00:56,571 INFO L85 PathProgramCache]: Analyzing trace with hash 692558510, now seen corresponding path program 1 times [2022-04-15 13:00:56,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:00:56,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600996867] [2022-04-15 13:00:56,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:00:56,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:00:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:57,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:00:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:57,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {21215#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21198#true} is VALID [2022-04-15 13:00:57,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {21198#true} assume true; {21198#true} is VALID [2022-04-15 13:00:57,441 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21198#true} {21198#true} #83#return; {21198#true} is VALID [2022-04-15 13:00:57,442 INFO L272 TraceCheckUtils]: 0: Hoare triple {21198#true} call ULTIMATE.init(); {21215#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:00:57,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {21215#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21198#true} is VALID [2022-04-15 13:00:57,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {21198#true} assume true; {21198#true} is VALID [2022-04-15 13:00:57,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21198#true} {21198#true} #83#return; {21198#true} is VALID [2022-04-15 13:00:57,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {21198#true} call #t~ret15 := main(); {21198#true} is VALID [2022-04-15 13:00:57,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {21198#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21198#true} is VALID [2022-04-15 13:00:57,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {21198#true} [155] 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_35 v_main_~x~0_Out_70)) (and (= |v_main_#t~post6_Out_68| 0) (= (+ v_main_~x~0_In_35 v_main_~y~0_In_34) (+ v_main_~y~0_Out_68 v_main_~x~0_Out_70)) (< 0 (mod (+ v_main_~x~0_Out_70 1) 4294967296)) (<= v_main_~x~0_Out_70 v_main_~x~0_In_35) (= |v_main_#t~post5_Out_68| 0))) InVars {main_~x~0=v_main_~x~0_In_35, 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_70, main_#t~post6=|v_main_#t~post6_Out_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {21198#true} is VALID [2022-04-15 13:00:57,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {21198#true} [154] 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[] {21198#true} is VALID [2022-04-15 13:00:57,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {21198#true} ~z~0 := ~y~0; {21203#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 13:00:57,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {21203#(= (+ 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; {21204#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 13:00:57,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {21204#(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; {21205#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 13:00:57,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {21205#(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; {21206#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 13:00:57,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {21206#(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; {21207#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 13:00:57,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {21207#(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; {21208#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 13:00:57,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {21208#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {21209#(and (<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 5 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 13:00:57,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {21209#(and (<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 5 (* (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; {21210#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:00:57,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {21210#(<= main_~y~0 (+ 4 (* (div (+ main_~y~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; {21211#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:00:57,487 INFO L290 TraceCheckUtils]: 17: Hoare triple {21211#(<= 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; {21212#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 13:00:57,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {21212#(<= 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; {21213#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 13:00:57,495 INFO L290 TraceCheckUtils]: 19: Hoare triple {21213#(<= 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; {21214#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 13:00:57,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {21214#(<= 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; {21199#false} is VALID [2022-04-15 13:00:57,498 INFO L290 TraceCheckUtils]: 21: Hoare triple {21199#false} assume !(~y~0 % 4294967296 > 0); {21199#false} is VALID [2022-04-15 13:00:57,498 INFO L290 TraceCheckUtils]: 22: Hoare triple {21199#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; {21199#false} is VALID [2022-04-15 13:00:57,498 INFO L290 TraceCheckUtils]: 23: Hoare triple {21199#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; {21199#false} is VALID [2022-04-15 13:00:57,498 INFO L290 TraceCheckUtils]: 24: Hoare triple {21199#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; {21199#false} is VALID [2022-04-15 13:00:57,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {21199#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; {21199#false} is VALID [2022-04-15 13:00:57,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {21199#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; {21199#false} is VALID [2022-04-15 13:00:57,498 INFO L290 TraceCheckUtils]: 27: Hoare triple {21199#false} assume !(~x~0 % 4294967296 > 0); {21199#false} is VALID [2022-04-15 13:00:57,498 INFO L290 TraceCheckUtils]: 28: Hoare triple {21199#false} assume !(~z~0 % 4294967296 > 0); {21199#false} is VALID [2022-04-15 13:00:57,498 INFO L272 TraceCheckUtils]: 29: Hoare triple {21199#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21199#false} is VALID [2022-04-15 13:00:57,498 INFO L290 TraceCheckUtils]: 30: Hoare triple {21199#false} ~cond := #in~cond; {21199#false} is VALID [2022-04-15 13:00:57,499 INFO L290 TraceCheckUtils]: 31: Hoare triple {21199#false} assume 0 == ~cond; {21199#false} is VALID [2022-04-15 13:00:57,499 INFO L290 TraceCheckUtils]: 32: Hoare triple {21199#false} assume !false; {21199#false} is VALID [2022-04-15 13:00:57,499 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 13:00:57,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:00:57,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600996867] [2022-04-15 13:00:57,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600996867] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:00:57,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114562289] [2022-04-15 13:00:57,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:00:57,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:00:57,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:00:57,500 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:00:57,501 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:00:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:57,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 13:00:57,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:57,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:00:58,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {21198#true} call ULTIMATE.init(); {21198#true} is VALID [2022-04-15 13:00:58,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {21198#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21198#true} is VALID [2022-04-15 13:00:58,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {21198#true} assume true; {21198#true} is VALID [2022-04-15 13:00:58,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21198#true} {21198#true} #83#return; {21198#true} is VALID [2022-04-15 13:00:58,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {21198#true} call #t~ret15 := main(); {21198#true} is VALID [2022-04-15 13:00:58,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {21198#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21198#true} is VALID [2022-04-15 13:00:58,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {21198#true} [155] 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_35 v_main_~x~0_Out_70)) (and (= |v_main_#t~post6_Out_68| 0) (= (+ v_main_~x~0_In_35 v_main_~y~0_In_34) (+ v_main_~y~0_Out_68 v_main_~x~0_Out_70)) (< 0 (mod (+ v_main_~x~0_Out_70 1) 4294967296)) (<= v_main_~x~0_Out_70 v_main_~x~0_In_35) (= |v_main_#t~post5_Out_68| 0))) InVars {main_~x~0=v_main_~x~0_In_35, 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_70, main_#t~post6=|v_main_#t~post6_Out_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {21198#true} is VALID [2022-04-15 13:00:58,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {21198#true} [154] 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[] {21198#true} is VALID [2022-04-15 13:00:58,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {21198#true} ~z~0 := ~y~0; {21203#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 13:00:58,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {21203#(= (+ 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; {21204#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 13:00:58,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {21204#(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; {21205#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 13:00:58,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {21205#(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; {21206#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 13:00:58,115 INFO L290 TraceCheckUtils]: 12: Hoare triple {21206#(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; {21207#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 13:00:58,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {21207#(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; {21208#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 13:00:58,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {21208#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {21261#(<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296))} is VALID [2022-04-15 13:00:58,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {21261#(<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21210#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:00:58,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {21210#(<= main_~y~0 (+ 4 (* (div (+ main_~y~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; {21211#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:00:58,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {21211#(<= 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; {21212#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 13:00:58,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {21212#(<= 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; {21213#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 13:00:58,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {21213#(<= 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; {21214#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 13:00:58,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {21214#(<= 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; {21199#false} is VALID [2022-04-15 13:00:58,157 INFO L290 TraceCheckUtils]: 21: Hoare triple {21199#false} assume !(~y~0 % 4294967296 > 0); {21199#false} is VALID [2022-04-15 13:00:58,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {21199#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; {21199#false} is VALID [2022-04-15 13:00:58,157 INFO L290 TraceCheckUtils]: 23: Hoare triple {21199#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; {21199#false} is VALID [2022-04-15 13:00:58,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {21199#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; {21199#false} is VALID [2022-04-15 13:00:58,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {21199#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; {21199#false} is VALID [2022-04-15 13:00:58,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {21199#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; {21199#false} is VALID [2022-04-15 13:00:58,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {21199#false} assume !(~x~0 % 4294967296 > 0); {21199#false} is VALID [2022-04-15 13:00:58,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {21199#false} assume !(~z~0 % 4294967296 > 0); {21199#false} is VALID [2022-04-15 13:00:58,157 INFO L272 TraceCheckUtils]: 29: Hoare triple {21199#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21199#false} is VALID [2022-04-15 13:00:58,157 INFO L290 TraceCheckUtils]: 30: Hoare triple {21199#false} ~cond := #in~cond; {21199#false} is VALID [2022-04-15 13:00:58,157 INFO L290 TraceCheckUtils]: 31: Hoare triple {21199#false} assume 0 == ~cond; {21199#false} is VALID [2022-04-15 13:00:58,158 INFO L290 TraceCheckUtils]: 32: Hoare triple {21199#false} assume !false; {21199#false} is VALID [2022-04-15 13:00:58,158 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 13:00:58,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:00:59,831 INFO L290 TraceCheckUtils]: 32: Hoare triple {21199#false} assume !false; {21199#false} is VALID [2022-04-15 13:00:59,831 INFO L290 TraceCheckUtils]: 31: Hoare triple {21199#false} assume 0 == ~cond; {21199#false} is VALID [2022-04-15 13:00:59,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {21199#false} ~cond := #in~cond; {21199#false} is VALID [2022-04-15 13:00:59,832 INFO L272 TraceCheckUtils]: 29: Hoare triple {21199#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21199#false} is VALID [2022-04-15 13:00:59,832 INFO L290 TraceCheckUtils]: 28: Hoare triple {21199#false} assume !(~z~0 % 4294967296 > 0); {21199#false} is VALID [2022-04-15 13:00:59,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {21199#false} assume !(~x~0 % 4294967296 > 0); {21199#false} is VALID [2022-04-15 13:00:59,832 INFO L290 TraceCheckUtils]: 26: Hoare triple {21199#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; {21199#false} is VALID [2022-04-15 13:00:59,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {21199#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; {21199#false} is VALID [2022-04-15 13:00:59,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {21199#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; {21199#false} is VALID [2022-04-15 13:00:59,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {21199#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; {21199#false} is VALID [2022-04-15 13:00:59,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {21199#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; {21199#false} is VALID [2022-04-15 13:00:59,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {21199#false} assume !(~y~0 % 4294967296 > 0); {21199#false} is VALID [2022-04-15 13:00:59,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {21214#(<= 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; {21199#false} is VALID [2022-04-15 13:00:59,849 INFO L290 TraceCheckUtils]: 19: Hoare triple {21213#(<= 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; {21214#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 13:00:59,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {21212#(<= 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; {21213#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 13:00:59,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {21211#(<= 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; {21212#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 13:00:59,882 INFO L290 TraceCheckUtils]: 16: Hoare triple {21210#(<= main_~y~0 (+ 4 (* (div (+ main_~y~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; {21211#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:00:59,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {21261#(<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21210#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:00:59,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {21370#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {21261#(<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296))} is VALID [2022-04-15 13:00:59,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {21374#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21370#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} is VALID [2022-04-15 13:00:59,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {21378#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21374#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} is VALID [2022-04-15 13:00:59,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {21382#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21378#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} is VALID [2022-04-15 13:00:59,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {21386#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21382#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} is VALID [2022-04-15 13:00:59,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {21390#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21386#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} is VALID [2022-04-15 13:00:59,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {21198#true} ~z~0 := ~y~0; {21390#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} is VALID [2022-04-15 13:00:59,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {21198#true} [154] 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[] {21198#true} is VALID [2022-04-15 13:00:59,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {21198#true} [155] 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_35 v_main_~x~0_Out_70)) (and (= |v_main_#t~post6_Out_68| 0) (= (+ v_main_~x~0_In_35 v_main_~y~0_In_34) (+ v_main_~y~0_Out_68 v_main_~x~0_Out_70)) (< 0 (mod (+ v_main_~x~0_Out_70 1) 4294967296)) (<= v_main_~x~0_Out_70 v_main_~x~0_In_35) (= |v_main_#t~post5_Out_68| 0))) InVars {main_~x~0=v_main_~x~0_In_35, 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_70, main_#t~post6=|v_main_#t~post6_Out_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {21198#true} is VALID [2022-04-15 13:00:59,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {21198#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21198#true} is VALID [2022-04-15 13:00:59,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {21198#true} call #t~ret15 := main(); {21198#true} is VALID [2022-04-15 13:00:59,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21198#true} {21198#true} #83#return; {21198#true} is VALID [2022-04-15 13:00:59,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {21198#true} assume true; {21198#true} is VALID [2022-04-15 13:00:59,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {21198#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21198#true} is VALID [2022-04-15 13:00:59,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {21198#true} call ULTIMATE.init(); {21198#true} is VALID [2022-04-15 13:00:59,942 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 13:00:59,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114562289] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:00:59,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:00:59,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 22 [2022-04-15 13:01:03,110 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:03,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1414532716] [2022-04-15 13:01:03,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1414532716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:03,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:03,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 13:01:03,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119135327] [2022-04-15 13:01:03,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:03,111 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-15 13:01:03,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:03,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:03,339 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:01:03,339 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 13:01:03,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:03,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 13:01:03,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2022-04-15 13:01:03,340 INFO L87 Difference]: Start difference. First operand 102 states and 121 transitions. Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:32,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:32,258 INFO L93 Difference]: Finished difference Result 172 states and 211 transitions. [2022-04-15 13:01:32,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 13:01:32,258 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-15 13:01:32,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:32,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:32,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 96 transitions. [2022-04-15 13:01:32,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:32,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 96 transitions. [2022-04-15 13:01:32,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 96 transitions. [2022-04-15 13:01:33,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:33,365 INFO L225 Difference]: With dead ends: 172 [2022-04-15 13:01:33,365 INFO L226 Difference]: Without dead ends: 105 [2022-04-15 13:01:33,365 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 70 SyntacticMatches, 6 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=427, Invalid=2879, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 13:01:33,365 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 43 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:33,366 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 90 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-04-15 13:01:33,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-15 13:01:34,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2022-04-15 13:01:34,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:34,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 88 states, 83 states have (on average 1.2048192771084338) internal successors, (100), 83 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:34,414 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 88 states, 83 states have (on average 1.2048192771084338) internal successors, (100), 83 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:34,414 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 88 states, 83 states have (on average 1.2048192771084338) internal successors, (100), 83 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:34,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:34,416 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2022-04-15 13:01:34,416 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 127 transitions. [2022-04-15 13:01:34,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:34,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:34,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 83 states have (on average 1.2048192771084338) internal successors, (100), 83 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 105 states. [2022-04-15 13:01:34,416 INFO L87 Difference]: Start difference. First operand has 88 states, 83 states have (on average 1.2048192771084338) internal successors, (100), 83 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 105 states. [2022-04-15 13:01:34,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:34,418 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2022-04-15 13:01:34,418 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 127 transitions. [2022-04-15 13:01:34,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:34,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:34,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:34,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:34,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.2048192771084338) internal successors, (100), 83 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:34,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2022-04-15 13:01:34,420 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 37 [2022-04-15 13:01:34,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:34,420 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2022-04-15 13:01:34,420 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:34,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 104 transitions. [2022-04-15 13:01:47,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 103 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:47,819 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2022-04-15 13:01:47,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 13:01:47,819 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:47,819 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:47,835 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:01:48,020 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-15 13:01:48,020 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:48,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:48,020 INFO L85 PathProgramCache]: Analyzing trace with hash -2087930961, now seen corresponding path program 20 times [2022-04-15 13:01:48,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:48,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [815214327] [2022-04-15 13:01:48,142 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:01:48,144 INFO L85 PathProgramCache]: Analyzing trace with hash -594156530, now seen corresponding path program 1 times [2022-04-15 13:01:48,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:48,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716066471] [2022-04-15 13:01:48,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:48,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:49,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:49,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {22236#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22219#true} is VALID [2022-04-15 13:01:49,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {22219#true} assume true; {22219#true} is VALID [2022-04-15 13:01:49,015 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22219#true} {22219#true} #83#return; {22219#true} is VALID [2022-04-15 13:01:49,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {22219#true} call ULTIMATE.init(); {22236#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:49,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {22236#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22219#true} is VALID [2022-04-15 13:01:49,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {22219#true} assume true; {22219#true} is VALID [2022-04-15 13:01:49,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22219#true} {22219#true} #83#return; {22219#true} is VALID [2022-04-15 13:01:49,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {22219#true} call #t~ret15 := main(); {22219#true} is VALID [2022-04-15 13:01:49,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {22219#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22219#true} is VALID [2022-04-15 13:01:49,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {22219#true} [157] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_70| 0) (= |v_main_#t~post6_Out_70| 0) (<= v_main_~x~0_Out_72 v_main_~x~0_In_36) (= (+ v_main_~y~0_Out_70 v_main_~x~0_Out_72) (+ v_main_~x~0_In_36 v_main_~y~0_In_35)) (< 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_35 v_main_~y~0_Out_70))) InVars {main_~x~0=v_main_~x~0_In_36, 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_72, main_#t~post6=|v_main_#t~post6_Out_70|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22219#true} is VALID [2022-04-15 13:01:49,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {22219#true} [156] 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[] {22219#true} is VALID [2022-04-15 13:01:49,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {22219#true} ~z~0 := ~y~0; {22219#true} is VALID [2022-04-15 13:01:49,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {22219#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; {22224#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 13:01:49,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {22224#(<= main_~z~0 (+ 4294967294 (* (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; {22225#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 13:01:49,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {22225#(<= 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; {22226#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 13:01:49,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {22226#(<= 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; {22227#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 13:01:49,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {22227#(<= 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; {22228#(<= main_~z~0 (+ 4294967290 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 13:01:49,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {22228#(<= main_~z~0 (+ 4294967290 (* (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; {22229#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967289))} is VALID [2022-04-15 13:01:49,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {22229#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967289))} assume !(~z~0 % 4294967296 > 0); {22229#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967289))} is VALID [2022-04-15 13:01:49,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {22229#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967289))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22230#(<= main_~z~0 (+ 4294967290 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 13:01:49,077 INFO L290 TraceCheckUtils]: 17: Hoare triple {22230#(<= main_~z~0 (+ 4294967290 (* 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; {22231#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967291))} is VALID [2022-04-15 13:01:49,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {22231#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967291))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22232#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:01:49,098 INFO L290 TraceCheckUtils]: 19: Hoare triple {22232#(<= main_~z~0 (+ 4294967292 (* (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; {22233#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 13:01:49,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {22233#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 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; {22234#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967294))} is VALID [2022-04-15 13:01:49,107 INFO L290 TraceCheckUtils]: 21: Hoare triple {22234#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 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; {22235#(<= (+ 6 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 13:01:49,107 INFO L290 TraceCheckUtils]: 22: Hoare triple {22235#(<= (+ 6 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {22235#(<= (+ 6 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 13:01:49,108 INFO L290 TraceCheckUtils]: 23: Hoare triple {22235#(<= (+ 6 (* (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; {22235#(<= (+ 6 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 13:01:49,108 INFO L290 TraceCheckUtils]: 24: Hoare triple {22235#(<= (+ 6 (* (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; {22235#(<= (+ 6 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 13:01:49,108 INFO L290 TraceCheckUtils]: 25: Hoare triple {22235#(<= (+ 6 (* (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; {22235#(<= (+ 6 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 13:01:49,109 INFO L290 TraceCheckUtils]: 26: Hoare triple {22235#(<= (+ 6 (* (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; {22235#(<= (+ 6 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 13:01:49,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {22235#(<= (+ 6 (* (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; {22235#(<= (+ 6 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 13:01:49,119 INFO L290 TraceCheckUtils]: 28: Hoare triple {22235#(<= (+ 6 (* (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; {22235#(<= (+ 6 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 13:01:49,120 INFO L290 TraceCheckUtils]: 29: Hoare triple {22235#(<= (+ 6 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {22235#(<= (+ 6 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 13:01:49,125 INFO L290 TraceCheckUtils]: 30: Hoare triple {22235#(<= (+ 6 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {22220#false} is VALID [2022-04-15 13:01:49,125 INFO L272 TraceCheckUtils]: 31: Hoare triple {22220#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {22220#false} is VALID [2022-04-15 13:01:49,125 INFO L290 TraceCheckUtils]: 32: Hoare triple {22220#false} ~cond := #in~cond; {22220#false} is VALID [2022-04-15 13:01:49,126 INFO L290 TraceCheckUtils]: 33: Hoare triple {22220#false} assume 0 == ~cond; {22220#false} is VALID [2022-04-15 13:01:49,126 INFO L290 TraceCheckUtils]: 34: Hoare triple {22220#false} assume !false; {22220#false} is VALID [2022-04-15 13:01:49,126 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-15 13:01:49,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:49,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716066471] [2022-04-15 13:01:49,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716066471] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:01:49,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701608133] [2022-04-15 13:01:49,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:49,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:49,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:01:49,132 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:01:49,134 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:01:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:49,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-15 13:01:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:49,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:01:52,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {22219#true} call ULTIMATE.init(); {22219#true} is VALID [2022-04-15 13:01:52,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {22219#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22219#true} is VALID [2022-04-15 13:01:52,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {22219#true} assume true; {22219#true} is VALID [2022-04-15 13:01:52,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22219#true} {22219#true} #83#return; {22219#true} is VALID [2022-04-15 13:01:52,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {22219#true} call #t~ret15 := main(); {22219#true} is VALID [2022-04-15 13:01:52,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {22219#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22219#true} is VALID [2022-04-15 13:01:52,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {22219#true} [157] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_70| 0) (= |v_main_#t~post6_Out_70| 0) (<= v_main_~x~0_Out_72 v_main_~x~0_In_36) (= (+ v_main_~y~0_Out_70 v_main_~x~0_Out_72) (+ v_main_~x~0_In_36 v_main_~y~0_In_35)) (< 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_35 v_main_~y~0_Out_70))) InVars {main_~x~0=v_main_~x~0_In_36, 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_72, main_#t~post6=|v_main_#t~post6_Out_70|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22219#true} is VALID [2022-04-15 13:01:52,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {22219#true} [156] 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[] {22219#true} is VALID [2022-04-15 13:01:52,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {22219#true} ~z~0 := ~y~0; {22264#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 13:01:52,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {22264#(= 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; {22268#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 13:01:52,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {22268#(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; {22272#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 13:01:52,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {22272#(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; {22276#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 13:01:52,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {22276#(and (= (+ (- 2) 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; {22280#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 13:01:52,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {22280#(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; {22284#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 13:01:52,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {22284#(and (= (+ main_~y~0 (- 4)) (+ 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; {22288#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 13:01:52,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {22288#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {22288#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 13:01:52,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {22288#(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; {22295#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= (+ main_~y~0 (- 4)) main_~z~0))} is VALID [2022-04-15 13:01:52,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {22295#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= (+ main_~y~0 (- 4)) 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; {22299#(and (= (+ main_~z~0 3) (+ main_~y~0 1)) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-15 13:01:52,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {22299#(and (= (+ main_~z~0 3) (+ main_~y~0 1)) (< 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; {22303#(and (= (+ main_~y~0 2) (+ main_~z~0 2)) (< 0 (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-15 13:01:52,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {22303#(and (= (+ main_~y~0 2) (+ main_~z~0 2)) (< 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; {22307#(and (< 0 (mod (+ main_~y~0 4) 4294967296)) (= (+ main_~y~0 2) main_~z~0))} is VALID [2022-04-15 13:01:52,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {22307#(and (< 0 (mod (+ main_~y~0 4) 4294967296)) (= (+ 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; {22311#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (+ main_~y~0 1) (+ main_~z~0 (- 3))))} is VALID [2022-04-15 13:01:52,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {22311#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (+ main_~y~0 1) (+ 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; {22315#(and (= (+ main_~z~0 (- 5)) (+ main_~y~0 1)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 13:01:52,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {22315#(and (= (+ main_~z~0 (- 5)) (+ main_~y~0 1)) (< 0 (mod main_~z~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {22315#(and (= (+ main_~z~0 (- 5)) (+ main_~y~0 1)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 13:01:52,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {22315#(and (= (+ main_~z~0 (- 5)) (+ main_~y~0 1)) (< 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; {22322#(and (< 0 (mod main_~z~0 4294967296)) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-15 13:01:52,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {22322#(and (< 0 (mod main_~z~0 4294967296)) (= (+ main_~z~0 (- 5)) 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; {22326#(and (< 0 (mod main_~z~0 4294967296)) (= main_~y~0 (+ main_~z~0 (- 4))))} is VALID [2022-04-15 13:01:52,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {22326#(and (< 0 (mod main_~z~0 4294967296)) (= main_~y~0 (+ main_~z~0 (- 4))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {22330#(and (= main_~y~0 (+ main_~z~0 (- 3))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 13:01:52,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {22330#(and (= main_~y~0 (+ main_~z~0 (- 3))) (< 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; {22334#(and (< 0 (mod main_~z~0 4294967296)) (= main_~y~0 (+ (- 2) main_~z~0)))} is VALID [2022-04-15 13:01:52,803 INFO L290 TraceCheckUtils]: 27: Hoare triple {22334#(and (< 0 (mod main_~z~0 4294967296)) (= 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; {22338#(and (< 0 (mod main_~z~0 4294967296)) (= main_~y~0 (+ (- 1) main_~z~0)))} is VALID [2022-04-15 13:01:52,804 INFO L290 TraceCheckUtils]: 28: Hoare triple {22338#(and (< 0 (mod main_~z~0 4294967296)) (= 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; {22342#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:01:52,804 INFO L290 TraceCheckUtils]: 29: Hoare triple {22342#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {22342#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:01:52,804 INFO L290 TraceCheckUtils]: 30: Hoare triple {22342#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {22220#false} is VALID [2022-04-15 13:01:52,804 INFO L272 TraceCheckUtils]: 31: Hoare triple {22220#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {22220#false} is VALID [2022-04-15 13:01:52,804 INFO L290 TraceCheckUtils]: 32: Hoare triple {22220#false} ~cond := #in~cond; {22220#false} is VALID [2022-04-15 13:01:52,804 INFO L290 TraceCheckUtils]: 33: Hoare triple {22220#false} assume 0 == ~cond; {22220#false} is VALID [2022-04-15 13:01:52,805 INFO L290 TraceCheckUtils]: 34: Hoare triple {22220#false} assume !false; {22220#false} is VALID [2022-04-15 13:01:52,805 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:52,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:01:54,880 INFO L290 TraceCheckUtils]: 34: Hoare triple {22220#false} assume !false; {22220#false} is VALID [2022-04-15 13:01:54,880 INFO L290 TraceCheckUtils]: 33: Hoare triple {22220#false} assume 0 == ~cond; {22220#false} is VALID [2022-04-15 13:01:54,880 INFO L290 TraceCheckUtils]: 32: Hoare triple {22220#false} ~cond := #in~cond; {22220#false} is VALID [2022-04-15 13:01:54,880 INFO L272 TraceCheckUtils]: 31: Hoare triple {22220#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {22220#false} is VALID [2022-04-15 13:01:54,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {22342#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {22220#false} is VALID [2022-04-15 13:01:54,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {22342#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {22342#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:01:54,881 INFO L290 TraceCheckUtils]: 28: Hoare triple {22342#(< 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; {22342#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:01:54,882 INFO L290 TraceCheckUtils]: 27: Hoare triple {22342#(< 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; {22342#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:01:54,882 INFO L290 TraceCheckUtils]: 26: Hoare triple {22342#(< 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; {22342#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:01:54,882 INFO L290 TraceCheckUtils]: 25: Hoare triple {22342#(< 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; {22342#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:01:54,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {22342#(< 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; {22342#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:01:54,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {22342#(< 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; {22342#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:01:54,883 INFO L290 TraceCheckUtils]: 22: Hoare triple {22342#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {22342#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:01:54,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {22224#(<= 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; {22342#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:01:54,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {22403#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 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; {22224#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 13:01:54,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {22407#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 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; {22403#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 13:01:54,924 INFO L290 TraceCheckUtils]: 18: Hoare triple {22411#(<= main_~z~0 (+ 4294967291 (* (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; {22407#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 13:01:54,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {22415#(<= main_~z~0 (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) 4294967290))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22411#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))} is VALID [2022-04-15 13:01:54,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {22419#(<= main_~z~0 (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) 4294967289))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22415#(<= main_~z~0 (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) 4294967290))} is VALID [2022-04-15 13:01:54,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {22419#(<= main_~z~0 (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) 4294967289))} assume !(~z~0 % 4294967296 > 0); {22419#(<= main_~z~0 (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-15 13:01:54,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {22415#(<= main_~z~0 (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) 4294967290))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22419#(<= main_~z~0 (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-15 13:01:54,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {22411#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~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; {22415#(<= main_~z~0 (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) 4294967290))} is VALID [2022-04-15 13:01:54,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {22407#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22411#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))} is VALID [2022-04-15 13:01:54,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {22403#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22407#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 13:01:54,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {22224#(<= main_~z~0 (+ 4294967294 (* (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; {22403#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 13:01:54,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {22219#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; {22224#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 13:01:54,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {22219#true} ~z~0 := ~y~0; {22219#true} is VALID [2022-04-15 13:01:54,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {22219#true} [156] 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[] {22219#true} is VALID [2022-04-15 13:01:54,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {22219#true} [157] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_70| 0) (= |v_main_#t~post6_Out_70| 0) (<= v_main_~x~0_Out_72 v_main_~x~0_In_36) (= (+ v_main_~y~0_Out_70 v_main_~x~0_Out_72) (+ v_main_~x~0_In_36 v_main_~y~0_In_35)) (< 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_35 v_main_~y~0_Out_70))) InVars {main_~x~0=v_main_~x~0_In_36, 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_72, main_#t~post6=|v_main_#t~post6_Out_70|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22219#true} is VALID [2022-04-15 13:01:54,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {22219#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22219#true} is VALID [2022-04-15 13:01:54,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {22219#true} call #t~ret15 := main(); {22219#true} is VALID [2022-04-15 13:01:54,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22219#true} {22219#true} #83#return; {22219#true} is VALID [2022-04-15 13:01:54,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {22219#true} assume true; {22219#true} is VALID [2022-04-15 13:01:54,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {22219#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22219#true} is VALID [2022-04-15 13:01:54,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {22219#true} call ULTIMATE.init(); {22219#true} is VALID [2022-04-15 13:01:54,993 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-15 13:01:54,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701608133] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:01:54,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:01:54,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21, 9] total 39 [2022-04-15 13:01:59,237 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:59,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [815214327] [2022-04-15 13:01:59,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [815214327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:59,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:59,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 13:01:59,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847062377] [2022-04-15 13:01:59,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:59,239 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 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 39 [2022-04-15 13:01:59,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:59,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 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:01:59,465 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:01:59,465 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 13:01:59,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:59,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 13:01:59,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1718, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 13:01:59,466 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 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:02:38,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:38,512 INFO L93 Difference]: Finished difference Result 136 states and 173 transitions. [2022-04-15 13:02:38,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-15 13:02:38,512 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 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 39 [2022-04-15 13:02:38,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:02:38,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 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:02:38,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 100 transitions. [2022-04-15 13:02:38,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 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:02:38,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 100 transitions. [2022-04-15 13:02:38,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 100 transitions. [2022-04-15 13:02:39,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:02:39,945 INFO L225 Difference]: With dead ends: 136 [2022-04-15 13:02:39,945 INFO L226 Difference]: Without dead ends: 131 [2022-04-15 13:02:39,946 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1398 ImplicationChecksByTransitivity, 31.0s TimeCoverageRelationStatistics Valid=753, Invalid=6053, Unknown=0, NotChecked=0, Total=6806 [2022-04-15 13:02:39,946 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 57 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:02:39,946 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 49 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-04-15 13:02:39,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-15 13:02:41,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 104. [2022-04-15 13:02:41,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:02:41,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 104 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 99 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:41,189 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 104 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 99 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:41,189 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 104 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 99 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:41,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:41,190 INFO L93 Difference]: Finished difference Result 131 states and 159 transitions. [2022-04-15 13:02:41,190 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 159 transitions. [2022-04-15 13:02:41,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:02:41,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:02:41,190 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 99 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states. [2022-04-15 13:02:41,191 INFO L87 Difference]: Start difference. First operand has 104 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 99 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states. [2022-04-15 13:02:41,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:41,192 INFO L93 Difference]: Finished difference Result 131 states and 159 transitions. [2022-04-15 13:02:41,192 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 159 transitions. [2022-04-15 13:02:41,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:02:41,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:02:41,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:02:41,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:02:41,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 99 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:41,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 125 transitions. [2022-04-15 13:02:41,193 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 125 transitions. Word has length 39 [2022-04-15 13:02:41,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:02:41,193 INFO L478 AbstractCegarLoop]: Abstraction has 104 states and 125 transitions. [2022-04-15 13:02:41,194 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 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:02:41,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 125 transitions. [2022-04-15 13:02:54,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:02:54,244 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2022-04-15 13:02:54,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 13:02:54,244 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:02:54,244 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:02:54,261 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:02:54,445 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,SelfDestructingSolverStorable39 [2022-04-15 13:02:54,445 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:02:54,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:02:54,445 INFO L85 PathProgramCache]: Analyzing trace with hash -355872300, now seen corresponding path program 21 times [2022-04-15 13:02:54,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:02:54,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [972826178] [2022-04-15 13:02:54,634 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:02:54,635 INFO L85 PathProgramCache]: Analyzing trace with hash 115330453, now seen corresponding path program 1 times [2022-04-15 13:02:54,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:02:54,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360312094] [2022-04-15 13:02:54,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:02:54,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:02:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:56,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:02:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:56,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {23315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23296#true} is VALID [2022-04-15 13:02:56,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {23296#true} assume true; {23296#true} is VALID [2022-04-15 13:02:56,096 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23296#true} {23296#true} #83#return; {23296#true} is VALID [2022-04-15 13:02:56,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {23296#true} call ULTIMATE.init(); {23315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:02:56,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {23315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23296#true} is VALID [2022-04-15 13:02:56,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {23296#true} assume true; {23296#true} is VALID [2022-04-15 13:02:56,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23296#true} {23296#true} #83#return; {23296#true} is VALID [2022-04-15 13:02:56,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {23296#true} call #t~ret15 := main(); {23296#true} is VALID [2022-04-15 13:02:56,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {23296#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23296#true} is VALID [2022-04-15 13:02:56,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {23296#true} [159] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_72| 0) (= (+ v_main_~x~0_In_37 v_main_~y~0_In_36) (+ v_main_~y~0_Out_72 v_main_~x~0_Out_74)) (<= v_main_~x~0_Out_74 v_main_~x~0_In_37) (= |v_main_#t~post5_Out_72| 0) (< 0 (mod (+ v_main_~x~0_Out_74 1) 4294967296))) (and (= v_main_~y~0_In_36 v_main_~y~0_Out_72) (= v_main_~x~0_In_37 v_main_~x~0_Out_74))) InVars {main_~x~0=v_main_~x~0_In_37, 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_74, main_#t~post6=|v_main_#t~post6_Out_72|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {23296#true} is VALID [2022-04-15 13:02:56,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {23296#true} [158] 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[] {23296#true} is VALID [2022-04-15 13:02:56,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {23296#true} ~z~0 := ~y~0; {23301#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 13:02:56,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {23301#(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; {23302#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 13:02:56,115 INFO L290 TraceCheckUtils]: 10: Hoare triple {23302#(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; {23303#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 13:02:56,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {23303#(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; {23304#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 13:02:56,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {23304#(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; {23305#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 13:02:56,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {23305#(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; {23306#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 13:02:56,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {23306#(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; {23307#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 13:02:56,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {23307#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !(~z~0 % 4294967296 > 0); {23308#(and (<= (+ 6 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 6 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 13:02:56,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {23308#(and (<= (+ 6 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 6 (* (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; {23309#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:56,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {23309#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 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; {23310#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:56,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {23310#(<= main_~y~0 (+ 4 (* (div (+ main_~y~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; {23311#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:56,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {23311#(<= 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; {23312#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:56,185 INFO L290 TraceCheckUtils]: 20: Hoare triple {23312#(<= 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; {23313#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 13:02:56,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {23313#(<= 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; {23314#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 13:02:56,196 INFO L290 TraceCheckUtils]: 22: Hoare triple {23314#(<= 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; {23297#false} is VALID [2022-04-15 13:02:56,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {23297#false} assume !(~y~0 % 4294967296 > 0); {23297#false} is VALID [2022-04-15 13:02:56,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {23297#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; {23297#false} is VALID [2022-04-15 13:02:56,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {23297#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; {23297#false} is VALID [2022-04-15 13:02:56,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {23297#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; {23297#false} is VALID [2022-04-15 13:02:56,197 INFO L290 TraceCheckUtils]: 27: Hoare triple {23297#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; {23297#false} is VALID [2022-04-15 13:02:56,197 INFO L290 TraceCheckUtils]: 28: Hoare triple {23297#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; {23297#false} is VALID [2022-04-15 13:02:56,197 INFO L290 TraceCheckUtils]: 29: Hoare triple {23297#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; {23297#false} is VALID [2022-04-15 13:02:56,197 INFO L290 TraceCheckUtils]: 30: Hoare triple {23297#false} assume !(~x~0 % 4294967296 > 0); {23297#false} is VALID [2022-04-15 13:02:56,197 INFO L290 TraceCheckUtils]: 31: Hoare triple {23297#false} assume !(~z~0 % 4294967296 > 0); {23297#false} is VALID [2022-04-15 13:02:56,197 INFO L272 TraceCheckUtils]: 32: Hoare triple {23297#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23297#false} is VALID [2022-04-15 13:02:56,197 INFO L290 TraceCheckUtils]: 33: Hoare triple {23297#false} ~cond := #in~cond; {23297#false} is VALID [2022-04-15 13:02:56,197 INFO L290 TraceCheckUtils]: 34: Hoare triple {23297#false} assume 0 == ~cond; {23297#false} is VALID [2022-04-15 13:02:56,197 INFO L290 TraceCheckUtils]: 35: Hoare triple {23297#false} assume !false; {23297#false} is VALID [2022-04-15 13:02:56,198 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-15 13:02:56,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:02:56,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360312094] [2022-04-15 13:02:56,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360312094] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:02:56,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501341309] [2022-04-15 13:02:56,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:02:56,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:02:56,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:02:56,199 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:02:56,200 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:02:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:56,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 13:02:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:56,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:02:56,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {23296#true} call ULTIMATE.init(); {23296#true} is VALID [2022-04-15 13:02:56,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {23296#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23296#true} is VALID [2022-04-15 13:02:56,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {23296#true} assume true; {23296#true} is VALID [2022-04-15 13:02:56,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23296#true} {23296#true} #83#return; {23296#true} is VALID [2022-04-15 13:02:56,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {23296#true} call #t~ret15 := main(); {23296#true} is VALID [2022-04-15 13:02:56,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {23296#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23296#true} is VALID [2022-04-15 13:02:56,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {23296#true} [159] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_72| 0) (= (+ v_main_~x~0_In_37 v_main_~y~0_In_36) (+ v_main_~y~0_Out_72 v_main_~x~0_Out_74)) (<= v_main_~x~0_Out_74 v_main_~x~0_In_37) (= |v_main_#t~post5_Out_72| 0) (< 0 (mod (+ v_main_~x~0_Out_74 1) 4294967296))) (and (= v_main_~y~0_In_36 v_main_~y~0_Out_72) (= v_main_~x~0_In_37 v_main_~x~0_Out_74))) InVars {main_~x~0=v_main_~x~0_In_37, 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_74, main_#t~post6=|v_main_#t~post6_Out_72|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {23296#true} is VALID [2022-04-15 13:02:56,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {23296#true} [158] 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[] {23296#true} is VALID [2022-04-15 13:02:56,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {23296#true} ~z~0 := ~y~0; {23301#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 13:02:56,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {23301#(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; {23302#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 13:02:56,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {23302#(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; {23303#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 13:02:56,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {23303#(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; {23304#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 13:02:56,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {23304#(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; {23305#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 13:02:56,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {23305#(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; {23306#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 13:02:56,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {23306#(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; {23307#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 13:02:56,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {23307#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !(~z~0 % 4294967296 > 0); {23364#(<= (div (+ 6 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 6)) 4294967296))} is VALID [2022-04-15 13:02:56,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {23364#(<= (div (+ 6 (* (- 1) main_~y~0)) (- 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; {23309#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:56,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {23309#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 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; {23310#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:56,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {23310#(<= main_~y~0 (+ 4 (* (div (+ main_~y~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; {23311#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:56,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {23311#(<= 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; {23312#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:56,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {23312#(<= 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; {23313#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 13:02:56,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {23313#(<= 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; {23314#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 13:02:56,909 INFO L290 TraceCheckUtils]: 22: Hoare triple {23314#(<= 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; {23297#false} is VALID [2022-04-15 13:02:56,909 INFO L290 TraceCheckUtils]: 23: Hoare triple {23297#false} assume !(~y~0 % 4294967296 > 0); {23297#false} is VALID [2022-04-15 13:02:56,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {23297#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; {23297#false} is VALID [2022-04-15 13:02:56,909 INFO L290 TraceCheckUtils]: 25: Hoare triple {23297#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; {23297#false} is VALID [2022-04-15 13:02:56,909 INFO L290 TraceCheckUtils]: 26: Hoare triple {23297#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; {23297#false} is VALID [2022-04-15 13:02:56,909 INFO L290 TraceCheckUtils]: 27: Hoare triple {23297#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; {23297#false} is VALID [2022-04-15 13:02:56,909 INFO L290 TraceCheckUtils]: 28: Hoare triple {23297#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; {23297#false} is VALID [2022-04-15 13:02:56,909 INFO L290 TraceCheckUtils]: 29: Hoare triple {23297#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; {23297#false} is VALID [2022-04-15 13:02:56,910 INFO L290 TraceCheckUtils]: 30: Hoare triple {23297#false} assume !(~x~0 % 4294967296 > 0); {23297#false} is VALID [2022-04-15 13:02:56,910 INFO L290 TraceCheckUtils]: 31: Hoare triple {23297#false} assume !(~z~0 % 4294967296 > 0); {23297#false} is VALID [2022-04-15 13:02:56,910 INFO L272 TraceCheckUtils]: 32: Hoare triple {23297#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23297#false} is VALID [2022-04-15 13:02:56,910 INFO L290 TraceCheckUtils]: 33: Hoare triple {23297#false} ~cond := #in~cond; {23297#false} is VALID [2022-04-15 13:02:56,910 INFO L290 TraceCheckUtils]: 34: Hoare triple {23297#false} assume 0 == ~cond; {23297#false} is VALID [2022-04-15 13:02:56,910 INFO L290 TraceCheckUtils]: 35: Hoare triple {23297#false} assume !false; {23297#false} is VALID [2022-04-15 13:02:56,910 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-15 13:02:56,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:02:59,388 INFO L290 TraceCheckUtils]: 35: Hoare triple {23297#false} assume !false; {23297#false} is VALID [2022-04-15 13:02:59,388 INFO L290 TraceCheckUtils]: 34: Hoare triple {23297#false} assume 0 == ~cond; {23297#false} is VALID [2022-04-15 13:02:59,388 INFO L290 TraceCheckUtils]: 33: Hoare triple {23297#false} ~cond := #in~cond; {23297#false} is VALID [2022-04-15 13:02:59,389 INFO L272 TraceCheckUtils]: 32: Hoare triple {23297#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23297#false} is VALID [2022-04-15 13:02:59,389 INFO L290 TraceCheckUtils]: 31: Hoare triple {23297#false} assume !(~z~0 % 4294967296 > 0); {23297#false} is VALID [2022-04-15 13:02:59,389 INFO L290 TraceCheckUtils]: 30: Hoare triple {23297#false} assume !(~x~0 % 4294967296 > 0); {23297#false} is VALID [2022-04-15 13:02:59,389 INFO L290 TraceCheckUtils]: 29: Hoare triple {23297#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; {23297#false} is VALID [2022-04-15 13:02:59,389 INFO L290 TraceCheckUtils]: 28: Hoare triple {23297#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; {23297#false} is VALID [2022-04-15 13:02:59,389 INFO L290 TraceCheckUtils]: 27: Hoare triple {23297#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; {23297#false} is VALID [2022-04-15 13:02:59,389 INFO L290 TraceCheckUtils]: 26: Hoare triple {23297#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; {23297#false} is VALID [2022-04-15 13:02:59,389 INFO L290 TraceCheckUtils]: 25: Hoare triple {23297#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; {23297#false} is VALID [2022-04-15 13:02:59,389 INFO L290 TraceCheckUtils]: 24: Hoare triple {23297#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; {23297#false} is VALID [2022-04-15 13:02:59,389 INFO L290 TraceCheckUtils]: 23: Hoare triple {23297#false} assume !(~y~0 % 4294967296 > 0); {23297#false} is VALID [2022-04-15 13:02:59,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {23314#(<= 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; {23297#false} is VALID [2022-04-15 13:02:59,399 INFO L290 TraceCheckUtils]: 21: Hoare triple {23313#(<= 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; {23314#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 13:02:59,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {23312#(<= 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; {23313#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 13:02:59,410 INFO L290 TraceCheckUtils]: 19: Hoare triple {23311#(<= 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; {23312#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:59,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {23310#(<= main_~y~0 (+ 4 (* (div (+ main_~y~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; {23311#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:59,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {23309#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 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; {23310#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:59,438 INFO L290 TraceCheckUtils]: 16: Hoare triple {23364#(<= (div (+ 6 (* (- 1) main_~y~0)) (- 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; {23309#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:59,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {23485#(or (<= (div (+ 6 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 6)) 4294967296)) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {23364#(<= (div (+ 6 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 6)) 4294967296))} is VALID [2022-04-15 13:02:59,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {23489#(or (<= (div (+ 6 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 6)) 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; {23485#(or (<= (div (+ 6 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 6)) 4294967296)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 13:02:59,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {23493#(or (<= (div (+ 6 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 6)) 4294967296)) (< 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; {23489#(or (<= (div (+ 6 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 6)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 13:02:59,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {23497#(or (<= (div (+ 6 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 6)) 4294967296)) (< 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; {23493#(or (<= (div (+ 6 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 6)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-15 13:02:59,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {23501#(or (<= (div (+ 6 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 6)) 4294967296)) (< 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; {23497#(or (<= (div (+ 6 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 6)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 13:02:59,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {23505#(or (<= (div (+ 6 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 6)) 4294967296)) (< 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; {23501#(or (<= (div (+ 6 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 6)) 4294967296)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-15 13:02:59,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {23509#(or (<= (div (+ 6 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 6)) 4294967296)) (< 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; {23505#(or (<= (div (+ 6 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 6)) 4294967296)) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-15 13:02:59,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {23296#true} ~z~0 := ~y~0; {23509#(or (<= (div (+ 6 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 6)) 4294967296)) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-15 13:02:59,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {23296#true} [158] 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[] {23296#true} is VALID [2022-04-15 13:02:59,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {23296#true} [159] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_72| 0) (= (+ v_main_~x~0_In_37 v_main_~y~0_In_36) (+ v_main_~y~0_Out_72 v_main_~x~0_Out_74)) (<= v_main_~x~0_Out_74 v_main_~x~0_In_37) (= |v_main_#t~post5_Out_72| 0) (< 0 (mod (+ v_main_~x~0_Out_74 1) 4294967296))) (and (= v_main_~y~0_In_36 v_main_~y~0_Out_72) (= v_main_~x~0_In_37 v_main_~x~0_Out_74))) InVars {main_~x~0=v_main_~x~0_In_37, 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_74, main_#t~post6=|v_main_#t~post6_Out_72|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {23296#true} is VALID [2022-04-15 13:02:59,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {23296#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23296#true} is VALID [2022-04-15 13:02:59,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {23296#true} call #t~ret15 := main(); {23296#true} is VALID [2022-04-15 13:02:59,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23296#true} {23296#true} #83#return; {23296#true} is VALID [2022-04-15 13:02:59,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {23296#true} assume true; {23296#true} is VALID [2022-04-15 13:02:59,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {23296#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23296#true} is VALID [2022-04-15 13:02:59,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {23296#true} call ULTIMATE.init(); {23296#true} is VALID [2022-04-15 13:02:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-15 13:02:59,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501341309] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:02:59,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:02:59,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 25 [2022-04-15 13:03:04,033 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:03:04,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [972826178] [2022-04-15 13:03:04,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [972826178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:03:04,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:03:04,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 13:03:04,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329927298] [2022-04-15 13:03:04,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:03:04,034 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-15 13:03:04,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:03:04,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:04,385 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:03:04,385 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 13:03:04,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:03:04,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 13:03:04,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2022-04-15 13:03:04,386 INFO L87 Difference]: Start difference. First operand 104 states and 125 transitions. Second operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:59,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:03:59,811 INFO L93 Difference]: Finished difference Result 245 states and 303 transitions. [2022-04-15 13:03:59,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-15 13:03:59,811 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-15 13:03:59,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:03:59,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:59,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 125 transitions. [2022-04-15 13:03:59,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 125 transitions. [2022-04-15 13:03:59,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 125 transitions. [2022-04-15 13:04:01,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:01,907 INFO L225 Difference]: With dead ends: 245 [2022-04-15 13:04:01,907 INFO L226 Difference]: Without dead ends: 172 [2022-04-15 13:04:01,907 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 31.4s TimeCoverageRelationStatistics Valid=566, Invalid=4546, Unknown=0, NotChecked=0, Total=5112 [2022-04-15 13:04:01,908 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 85 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:01,908 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 97 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2022-04-15 13:04:01,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-04-15 13:04:03,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 119. [2022-04-15 13:04:03,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:03,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand has 119 states, 114 states have (on average 1.2017543859649122) internal successors, (137), 114 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call 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:03,426 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand has 119 states, 114 states have (on average 1.2017543859649122) internal successors, (137), 114 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call 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:03,426 INFO L87 Difference]: Start difference. First operand 172 states. Second operand has 119 states, 114 states have (on average 1.2017543859649122) internal successors, (137), 114 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call 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:03,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:03,428 INFO L93 Difference]: Finished difference Result 172 states and 209 transitions. [2022-04-15 13:04:03,428 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 209 transitions. [2022-04-15 13:04:03,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:03,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:03,428 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 114 states have (on average 1.2017543859649122) internal successors, (137), 114 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 172 states. [2022-04-15 13:04:03,428 INFO L87 Difference]: Start difference. First operand has 119 states, 114 states have (on average 1.2017543859649122) internal successors, (137), 114 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 172 states. [2022-04-15 13:04:03,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:03,431 INFO L93 Difference]: Finished difference Result 172 states and 209 transitions. [2022-04-15 13:04:03,431 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 209 transitions. [2022-04-15 13:04:03,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:03,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:03,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:03,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:03,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.2017543859649122) internal successors, (137), 114 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call 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:03,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 141 transitions. [2022-04-15 13:04:03,433 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 141 transitions. Word has length 40 [2022-04-15 13:04:03,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:03,434 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 141 transitions. [2022-04-15 13:04:03,434 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:03,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 141 transitions. [2022-04-15 13:04:18,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:18,329 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 141 transitions. [2022-04-15 13:04:18,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 13:04:18,329 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:18,330 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:18,347 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:04:18,530 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:18,530 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:18,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:18,530 INFO L85 PathProgramCache]: Analyzing trace with hash -264974095, now seen corresponding path program 10 times [2022-04-15 13:04:18,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:18,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [835730488] [2022-04-15 13:04:18,751 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:18,752 INFO L85 PathProgramCache]: Analyzing trace with hash -2113325808, now seen corresponding path program 1 times [2022-04-15 13:04:18,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:18,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701336562] [2022-04-15 13:04:18,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:18,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:20,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:20,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {24727#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24703#true} is VALID [2022-04-15 13:04:20,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {24703#true} assume true; {24703#true} is VALID [2022-04-15 13:04:20,961 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24703#true} {24703#true} #83#return; {24703#true} is VALID [2022-04-15 13:04:20,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {24703#true} call ULTIMATE.init(); {24727#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:20,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {24727#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24703#true} is VALID [2022-04-15 13:04:20,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {24703#true} assume true; {24703#true} is VALID [2022-04-15 13:04:20,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24703#true} {24703#true} #83#return; {24703#true} is VALID [2022-04-15 13:04:20,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {24703#true} call #t~ret15 := main(); {24703#true} is VALID [2022-04-15 13:04:20,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {24703#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24708#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 13:04:20,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {24708#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [161] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_76 1) 4294967296)) (= |v_main_#t~post6_Out_74| 0) (= (+ v_main_~x~0_In_38 v_main_~y~0_In_37) (+ v_main_~y~0_Out_74 v_main_~x~0_Out_76)) (<= v_main_~x~0_Out_76 v_main_~x~0_In_38) (= |v_main_#t~post5_Out_74| 0)) (and (= v_main_~y~0_In_37 v_main_~y~0_Out_74) (= v_main_~x~0_In_38 v_main_~x~0_Out_76))) InVars {main_~x~0=v_main_~x~0_In_38, 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_76, main_#t~post6=|v_main_#t~post6_Out_74|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {24709#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))))} is VALID [2022-04-15 13:04:20,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {24709#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))))} [160] 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[] {24710#(or (and (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 main_~x~0) main_~n~0)) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} is VALID [2022-04-15 13:04:20,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {24710#(or (and (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 main_~x~0) main_~n~0)) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} ~z~0 := ~y~0; {24711#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-15 13:04:20,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {24711#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (+ main_~z~0 main_~x~0) 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; {24712#(and (<= (+ main_~z~0 main_~x~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294 (* (div main_~z~0 4294967296) (- 4294967296)) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296))) (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) main_~n~0))} is VALID [2022-04-15 13:04:20,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {24712#(and (<= (+ main_~z~0 main_~x~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294 (* (div main_~z~0 4294967296) (- 4294967296)) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296))) (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) 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; {24713#(and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= (+ main_~z~0 main_~x~0 (* (div (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0 (* (- 1) main_~z~0) (* (div main_~z~0 4294967296) (- 4294967296)) 4294967293) 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296))))} is VALID [2022-04-15 13:04:21,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {24713#(and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= (+ main_~z~0 main_~x~0 (* (div (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0 (* (- 1) main_~z~0) (* (div main_~z~0 4294967296) (- 4294967296)) 4294967293) 4294967296) 4294967296)) (+ main_~n~0 (* (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; {24714#(and (<= (+ main_~z~0 main_~x~0 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0) (* (div main_~z~0 4294967296) (- 4294967296)) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296))) (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) main_~n~0))} is VALID [2022-04-15 13:04:21,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {24714#(and (<= (+ main_~z~0 main_~x~0 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0) (* (div main_~z~0 4294967296) (- 4294967296)) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296))) (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) 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; {24715#(and (<= (+ 4 (* (div (+ main_~z~0 main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (div main_~z~0 4294967296) (- 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~x~0) (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) main_~n~0))} is VALID [2022-04-15 13:04:21,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {24715#(and (<= (+ 4 (* (div (+ main_~z~0 main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (div main_~z~0 4294967296) (- 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~x~0) (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) 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; {24716#(and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) main_~n~0) (or (<= (+ 4294967291 main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0)))} is VALID [2022-04-15 13:04:21,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {24716#(and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) main_~n~0) (or (<= (+ 4294967291 main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0)))} assume !(~z~0 % 4294967296 > 0); {24717#(and (<= main_~n~0 (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296)) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0))} is VALID [2022-04-15 13:04:21,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {24717#(and (<= main_~n~0 (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296)) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) 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; {24718#(and (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-15 13:04:21,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {24718#(and (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 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; {24718#(and (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-15 13:04:21,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {24718#(and (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 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; {24718#(and (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-15 13:04:21,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {24718#(and (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 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; {24718#(and (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-15 13:04:21,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {24718#(and (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 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; {24718#(and (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-15 13:04:21,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {24718#(and (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0))} assume !(~y~0 % 4294967296 > 0); {24718#(and (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-15 13:04:21,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {24718#(and (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24719#(and (<= (+ (* (div (+ main_~n~0 4294967294 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-15 13:04:21,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {24719#(and (<= (+ (* (div (+ main_~n~0 4294967294 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) 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; {24720#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0) 4294967293) 4294967296) 4294967296) main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} is VALID [2022-04-15 13:04:21,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {24720#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0) 4294967293) 4294967296) 4294967296) main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) 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; {24721#(and (<= (+ main_~x~0 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 2) main_~x~0))} is VALID [2022-04-15 13:04:21,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {24721#(and (<= (+ main_~x~0 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 2) 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; {24722#(and (<= (+ main_~x~0 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) 4) main_~n~0) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 1) main_~x~0))} is VALID [2022-04-15 13:04:21,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {24722#(and (<= (+ main_~x~0 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) 4) main_~n~0) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 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; {24723#(and (<= (+ (* 4294967296 (div (+ 4294967290 main_~n~0 (* (- 1) main_~x~0)) 4294967296)) 5 main_~x~0) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-15 13:04:21,108 INFO L290 TraceCheckUtils]: 26: Hoare triple {24723#(and (<= (+ (* 4294967296 (div (+ 4294967290 main_~n~0 (* (- 1) main_~x~0)) 4294967296)) 5 main_~x~0) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} assume !(~x~0 % 4294967296 > 0); {24723#(and (<= (+ (* 4294967296 (div (+ 4294967290 main_~n~0 (* (- 1) main_~x~0)) 4294967296)) 5 main_~x~0) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-15 13:04:21,124 INFO L290 TraceCheckUtils]: 27: Hoare triple {24723#(and (<= (+ (* 4294967296 (div (+ 4294967290 main_~n~0 (* (- 1) main_~x~0)) 4294967296)) 5 main_~x~0) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~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; {24722#(and (<= (+ main_~x~0 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) 4) main_~n~0) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 1) main_~x~0))} is VALID [2022-04-15 13:04:21,136 INFO L290 TraceCheckUtils]: 28: Hoare triple {24722#(and (<= (+ main_~x~0 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) 4) main_~n~0) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 1) main_~x~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; {24721#(and (<= (+ main_~x~0 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 2) main_~x~0))} is VALID [2022-04-15 13:04:21,146 INFO L290 TraceCheckUtils]: 29: Hoare triple {24721#(and (<= (+ main_~x~0 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 2) main_~x~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; {24720#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0) 4294967293) 4294967296) 4294967296) main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} is VALID [2022-04-15 13:04:21,152 INFO L290 TraceCheckUtils]: 30: Hoare triple {24720#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0) 4294967293) 4294967296) 4294967296) main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~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; {24719#(and (<= (+ (* (div (+ main_~n~0 4294967294 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-15 13:04:21,157 INFO L290 TraceCheckUtils]: 31: Hoare triple {24719#(and (<= (+ (* (div (+ main_~n~0 4294967294 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~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; {24724#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 13:04:21,158 INFO L290 TraceCheckUtils]: 32: Hoare triple {24724#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {24724#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 13:04:21,159 INFO L272 TraceCheckUtils]: 33: Hoare triple {24724#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24725#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:04:21,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {24725#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {24726#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:04:21,160 INFO L290 TraceCheckUtils]: 35: Hoare triple {24726#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24704#false} is VALID [2022-04-15 13:04:21,160 INFO L290 TraceCheckUtils]: 36: Hoare triple {24704#false} assume !false; {24704#false} is VALID [2022-04-15 13:04:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 13:04:21,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:21,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701336562] [2022-04-15 13:04:21,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701336562] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:04:21,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341991711] [2022-04-15 13:04:21,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:21,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:21,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:04:21,161 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:04:21,162 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:04:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:21,517 WARN L261 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 91 conjunts are in the unsatisfiable core [2022-04-15 13:04:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:21,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:04:49,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {24703#true} call ULTIMATE.init(); {24703#true} is VALID [2022-04-15 13:04:49,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {24703#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24703#true} is VALID [2022-04-15 13:04:49,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {24703#true} assume true; {24703#true} is VALID [2022-04-15 13:04:49,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24703#true} {24703#true} #83#return; {24703#true} is VALID [2022-04-15 13:04:49,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {24703#true} call #t~ret15 := main(); {24703#true} is VALID [2022-04-15 13:04:49,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {24703#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24708#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 13:04:49,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {24708#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [161] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_76 1) 4294967296)) (= |v_main_#t~post6_Out_74| 0) (= (+ v_main_~x~0_In_38 v_main_~y~0_In_37) (+ v_main_~y~0_Out_74 v_main_~x~0_Out_76)) (<= v_main_~x~0_Out_76 v_main_~x~0_In_38) (= |v_main_#t~post5_Out_74| 0)) (and (= v_main_~y~0_In_37 v_main_~y~0_Out_74) (= v_main_~x~0_In_38 v_main_~x~0_Out_76))) InVars {main_~x~0=v_main_~x~0_In_38, 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_76, main_#t~post6=|v_main_#t~post6_Out_74|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {24749#(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:04:49,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {24749#(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)))} [160] 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[] {24753#(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:04:49,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {24753#(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; {24757#(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:04:49,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {24757#(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; {24761#(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)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 13:04:49,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {24761#(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)) (< 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; {24765#(and (<= 0 main_~y~0) (< 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)) (= (+ main_~n~0 2 (* (- 1) main_~y~0)) main_~x~0) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 13:04:49,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {24765#(and (<= 0 main_~y~0) (< 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)) (= (+ main_~n~0 2 (* (- 1) main_~y~0)) main_~x~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; {24769#(and (<= 0 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (= (+ (- 1) main_~x~0) (+ main_~n~0 2 (* (- 1) main_~y~0))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 13:04:49,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {24769#(and (<= 0 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (= (+ (- 1) main_~x~0) (+ main_~n~0 2 (* (- 1) main_~y~0))) (< 0 (mod (+ main_~y~0 4294967295) 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; {24773#(and (<= 0 main_~y~0) (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0) 4)) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 13:04:49,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {24773#(and (<= 0 main_~y~0) (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0) 4)) (= (+ (- 2) main_~y~0) (+ 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; {24777#(and (<= 0 main_~y~0) (< 0 (mod (+ main_~z~0 2) 4294967296)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (= (+ (- 2) main_~y~0) (+ main_~z~0 3)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ (- 1) main_~x~0) (+ main_~n~0 (* (- 1) main_~y~0) 4)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 13:04:49,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {24777#(and (<= 0 main_~y~0) (< 0 (mod (+ main_~z~0 2) 4294967296)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (= (+ (- 2) main_~y~0) (+ main_~z~0 3)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ (- 1) main_~x~0) (+ main_~n~0 (* (- 1) main_~y~0) 4)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {24781#(and (<= 0 main_~y~0) (= (+ 5 main_~z~0) main_~y~0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (= (+ 5 main_~n~0) (+ main_~y~0 main_~x~0)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-15 13:04:49,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {24781#(and (<= 0 main_~y~0) (= (+ 5 main_~z~0) main_~y~0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (= (+ 5 main_~n~0) (+ 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; {24785#(and (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (<= (mod (+ main_~n~0 4294967295 (* main_~y~0 4294967295)) 4294967296) 0) (= (+ main_~y~0 main_~x~0 1) (+ 5 main_~n~0)) (= (+ main_~y~0 1) (+ main_~z~0 4)) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-15 13:04:49,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {24785#(and (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (<= (mod (+ main_~n~0 4294967295 (* main_~y~0 4294967295)) 4294967296) 0) (= (+ main_~y~0 main_~x~0 1) (+ 5 main_~n~0)) (= (+ main_~y~0 1) (+ main_~z~0 4)) (<= 0 (+ main_~y~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24789#(and (<= 0 (+ main_~y~0 2)) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (= (+ main_~y~0 main_~x~0 2) (+ 5 main_~n~0)) (= main_~z~0 (+ (- 1) main_~y~0)) (<= (mod (+ main_~n~0 4294967294 (* main_~y~0 4294967295)) 4294967296) 0))} is VALID [2022-04-15 13:04:49,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {24789#(and (<= 0 (+ main_~y~0 2)) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (= (+ main_~y~0 main_~x~0 2) (+ 5 main_~n~0)) (= main_~z~0 (+ (- 1) main_~y~0)) (<= (mod (+ main_~n~0 4294967294 (* main_~y~0 4294967295)) 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24793#(and (<= 0 (+ main_~y~0 3)) (= (+ 5 main_~n~0) (+ main_~y~0 main_~x~0 3)) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295) 4294967293) 4294967296) 0) (= main_~y~0 (+ (- 1) main_~z~0)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-15 13:04:49,407 INFO L290 TraceCheckUtils]: 18: Hoare triple {24793#(and (<= 0 (+ main_~y~0 3)) (= (+ 5 main_~n~0) (+ main_~y~0 main_~x~0 3)) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295) 4294967293) 4294967296) 0) (= main_~y~0 (+ (- 1) main_~z~0)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24797#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ 5 main_~n~0)) (= (+ main_~y~0 1) (+ main_~n~0 2 (* (- 1) main_~x~0))) (= (+ (- 2) main_~z~0) (+ main_~n~0 2 (* (- 1) main_~x~0))) (<= (mod (+ 4294967291 main_~x~0) 4294967296) 0))} is VALID [2022-04-15 13:04:49,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {24797#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ 5 main_~n~0)) (= (+ main_~y~0 1) (+ main_~n~0 2 (* (- 1) main_~x~0))) (= (+ (- 2) main_~z~0) (+ main_~n~0 2 (* (- 1) main_~x~0))) (<= (mod (+ 4294967291 main_~x~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; {24801#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ 5 main_~n~0)) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~y~0 1)) (= (+ main_~n~0 2 (* (- 1) main_~x~0)) (+ main_~z~0 (- 3))) (<= (mod (+ 4294967291 main_~x~0) 4294967296) 0))} is VALID [2022-04-15 13:04:49,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {24801#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ 5 main_~n~0)) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~y~0 1)) (= (+ main_~n~0 2 (* (- 1) main_~x~0)) (+ main_~z~0 (- 3))) (<= (mod (+ 4294967291 main_~x~0) 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {24805#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ 5 main_~n~0)) (= (+ 5 main_~n~0) (+ main_~z~0 main_~x~0)) (<= (mod (+ 4294967291 main_~x~0) 4294967296) 0))} is VALID [2022-04-15 13:04:49,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {24805#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ 5 main_~n~0)) (= (+ 5 main_~n~0) (+ main_~z~0 main_~x~0)) (<= (mod (+ 4294967291 main_~x~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; {24809#(and (= (+ main_~n~0 4) (+ main_~z~0 main_~x~0)) (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ 4294967291 main_~z~0) 4294967296) 0) (<= 0 main_~z~0))} is VALID [2022-04-15 13:04:49,440 INFO L290 TraceCheckUtils]: 22: Hoare triple {24809#(and (= (+ main_~n~0 4) (+ main_~z~0 main_~x~0)) (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ 4294967291 main_~z~0) 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; {24813#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (= (+ main_~x~0 1) (+ main_~n~0 (* (- 1) main_~z~0) 4)) (<= (mod (+ 4294967291 main_~z~0) 4294967296) 0) (<= 0 main_~z~0))} is VALID [2022-04-15 13:04:49,447 INFO L290 TraceCheckUtils]: 23: Hoare triple {24813#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (= (+ main_~x~0 1) (+ main_~n~0 (* (- 1) main_~z~0) 4)) (<= (mod (+ 4294967291 main_~z~0) 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; {24817#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ 4294967291 main_~z~0) 4294967296) 0) (<= 0 main_~z~0) (= (+ main_~x~0 1) (+ main_~n~0 (* (- 1) main_~z~0) 3)))} is VALID [2022-04-15 13:04:49,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {24817#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ 4294967291 main_~z~0) 4294967296) 0) (<= 0 main_~z~0) (= (+ main_~x~0 1) (+ main_~n~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; {24821#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ 4294967291 main_~z~0) 4294967296) 0) (<= 0 main_~z~0) (= (+ main_~n~0 (* (- 1) main_~z~0) 3) (+ main_~x~0 2)))} is VALID [2022-04-15 13:04:49,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {24821#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ 4294967291 main_~z~0) 4294967296) 0) (<= 0 main_~z~0) (= (+ main_~n~0 (* (- 1) main_~z~0) 3) (+ main_~x~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; {24825#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ 4294967291 main_~z~0) 4294967296) 0) (= (+ main_~x~0 3) (+ main_~n~0 (* (- 1) main_~z~0) 3)) (<= 0 main_~z~0))} is VALID [2022-04-15 13:04:49,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {24825#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ 4294967291 main_~z~0) 4294967296) 0) (= (+ main_~x~0 3) (+ main_~n~0 (* (- 1) main_~z~0) 3)) (<= 0 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {24825#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ 4294967291 main_~z~0) 4294967296) 0) (= (+ main_~x~0 3) (+ main_~n~0 (* (- 1) main_~z~0) 3)) (<= 0 main_~z~0))} is VALID [2022-04-15 13:04:49,475 INFO L290 TraceCheckUtils]: 27: Hoare triple {24825#(and (<= (mod (+ main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ 4294967291 main_~z~0) 4294967296) 0) (= (+ main_~x~0 3) (+ main_~n~0 (* (- 1) main_~z~0) 3)) (<= 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; {24832#(and (<= 0 (+ main_~z~0 1)) (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0) (<= (mod (+ main_~n~0 4294967295 (* main_~z~0 4294967295)) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~z~0)) main_~x~0))} is VALID [2022-04-15 13:04:49,486 INFO L290 TraceCheckUtils]: 28: Hoare triple {24832#(and (<= 0 (+ main_~z~0 1)) (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0) (<= (mod (+ main_~n~0 4294967295 (* main_~z~0 4294967295)) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~z~0)) main_~x~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; {24836#(and (<= 0 (+ main_~z~0 2)) (<= (mod (+ main_~n~0 4294967294 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~z~0)) main_~x~0))} is VALID [2022-04-15 13:04:49,490 INFO L290 TraceCheckUtils]: 29: Hoare triple {24836#(and (<= 0 (+ main_~z~0 2)) (<= (mod (+ main_~n~0 4294967294 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~z~0)) main_~x~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; {24840#(and (<= main_~x~0 (+ main_~n~0 3)) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (<= (mod (+ main_~n~0 4294967294 (* main_~x~0 4294967295)) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~z~0 1)))} is VALID [2022-04-15 13:04:49,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {24840#(and (<= main_~x~0 (+ main_~n~0 3)) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (<= (mod (+ main_~n~0 4294967294 (* main_~x~0 4294967295)) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ 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; {24844#(and (<= (mod (+ 4294967292 main_~x~0) 4294967296) 0) (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 4)) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~z~0 1)))} is VALID [2022-04-15 13:04:49,503 INFO L290 TraceCheckUtils]: 31: Hoare triple {24844#(and (<= (mod (+ 4294967292 main_~x~0) 4294967296) 0) (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 4)) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ 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; {24848#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ 5 main_~n~0)) (= (+ main_~z~0 2) (+ main_~n~0 2 (* (- 1) main_~x~0))) (<= (mod (+ 4294967291 main_~x~0) 4294967296) 0))} is VALID [2022-04-15 13:04:49,504 INFO L290 TraceCheckUtils]: 32: Hoare triple {24848#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ 5 main_~n~0)) (= (+ main_~z~0 2) (+ main_~n~0 2 (* (- 1) main_~x~0))) (<= (mod (+ 4294967291 main_~x~0) 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {24852#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ 5 main_~n~0)) (<= (mod (+ 4294967291 main_~x~0) 4294967296) 0))} is VALID [2022-04-15 13:04:49,510 INFO L272 TraceCheckUtils]: 33: Hoare triple {24852#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ 5 main_~n~0)) (<= (mod (+ 4294967291 main_~x~0) 4294967296) 0))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24856#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:04:49,511 INFO L290 TraceCheckUtils]: 34: Hoare triple {24856#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24860#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:04:49,511 INFO L290 TraceCheckUtils]: 35: Hoare triple {24860#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24704#false} is VALID [2022-04-15 13:04:49,511 INFO L290 TraceCheckUtils]: 36: Hoare triple {24704#false} assume !false; {24704#false} is VALID [2022-04-15 13:04:49,511 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:49,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:05:12,257 INFO L290 TraceCheckUtils]: 36: Hoare triple {24704#false} assume !false; {24704#false} is VALID [2022-04-15 13:05:12,257 INFO L290 TraceCheckUtils]: 35: Hoare triple {24860#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24704#false} is VALID [2022-04-15 13:05:12,258 INFO L290 TraceCheckUtils]: 34: Hoare triple {24856#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24860#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:05:12,259 INFO L272 TraceCheckUtils]: 33: Hoare triple {24724#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24856#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:05:12,260 INFO L290 TraceCheckUtils]: 32: Hoare triple {24879#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {24724#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 13:05:12,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {24883#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 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; {24879#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 13:05:12,287 INFO L290 TraceCheckUtils]: 30: Hoare triple {24887#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24883#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))))} is VALID [2022-04-15 13:05:12,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {24891#(or (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< 0 (mod (+ main_~z~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; {24887#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-15 13:05:12,320 INFO L290 TraceCheckUtils]: 28: Hoare triple {24895#(or (and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ 4294967292 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; {24891#(or (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 13:05:12,339 INFO L290 TraceCheckUtils]: 27: Hoare triple {24899#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24895#(or (and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-15 13:05:12,344 INFO L290 TraceCheckUtils]: 26: Hoare triple {24903#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {24899#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-15 13:05:12,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {24907#(or (and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24903#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 13:05:12,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {24911#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< 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; {24907#(or (and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-15 13:05:12,381 INFO L290 TraceCheckUtils]: 23: Hoare triple {24915#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24911#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-15 13:05:12,396 INFO L290 TraceCheckUtils]: 22: Hoare triple {24919#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24915#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-15 13:05:12,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {24923#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (< 0 (mod (+ 4294967291 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; {24919#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-15 13:05:12,417 INFO L290 TraceCheckUtils]: 20: Hoare triple {24927#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {24923#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-15 13:05:12,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {24931#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24927#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 13:05:12,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {24935#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24931#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-15 13:05:12,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {24939#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24935#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-15 13:05:12,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {24943#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24939#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-15 13:05:12,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {24947#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24943#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-15 13:05:12,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {24947#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {24947#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-15 13:05:12,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {24954#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 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; {24947#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-15 13:05:12,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {24958#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~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; {24954#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-15 13:05:12,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {24962#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24958#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-15 13:05:12,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {24966#(or (and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (< 0 (mod (+ 4294967291 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; {24962#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-15 13:05:12,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {24970#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ 4294967291 main_~y~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; {24966#(or (and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-15 13:05:12,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {24974#(or (and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (< 0 (mod main_~x~0 4294967296)))} ~z~0 := ~y~0; {24970#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 13:05:12,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {24974#(or (and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (< 0 (mod main_~x~0 4294967296)))} [160] 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[] {24974#(or (and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 13:05:12,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {24981#(and (or (<= (+ (div (+ (- 4294967292) (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (* (- 1) main_~x~0) (- 4294967297) (* (- 1) main_~y~0)) (- 4294967296))) (+ (div (+ 4294967290 main_~y~0 main_~x~0) 4294967296) 3 (div (+ main_~y~0 main_~x~0) 4294967296))) (<= (div main_~n~0 4294967296) (div (+ main_~n~0 (- 5)) 4294967296))) (or (< (div (+ (* (- 1) main_~x~0) (- 4294967297) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~n~0 4294967296) 2 (div (+ main_~y~0 main_~x~0 4294967296 (* (- 1) main_~n~0)) 4294967296))) (<= (+ (div (+ (- 4294967292) (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (* (- 1) main_~x~0) (- 4294967297) (* (- 1) main_~y~0)) (- 4294967296))) (+ (div (+ 4294967290 main_~y~0 main_~x~0) 4294967296) 3 (div (+ main_~y~0 main_~x~0) 4294967296)))))} [161] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_76 1) 4294967296)) (= |v_main_#t~post6_Out_74| 0) (= (+ v_main_~x~0_In_38 v_main_~y~0_In_37) (+ v_main_~y~0_Out_74 v_main_~x~0_Out_76)) (<= v_main_~x~0_Out_76 v_main_~x~0_In_38) (= |v_main_#t~post5_Out_74| 0)) (and (= v_main_~y~0_In_37 v_main_~y~0_Out_74) (= v_main_~x~0_In_38 v_main_~x~0_Out_76))) InVars {main_~x~0=v_main_~x~0_In_38, 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_76, main_#t~post6=|v_main_#t~post6_Out_74|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {24974#(or (and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 13:05:12,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {24703#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24981#(and (or (<= (+ (div (+ (- 4294967292) (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (* (- 1) main_~x~0) (- 4294967297) (* (- 1) main_~y~0)) (- 4294967296))) (+ (div (+ 4294967290 main_~y~0 main_~x~0) 4294967296) 3 (div (+ main_~y~0 main_~x~0) 4294967296))) (<= (div main_~n~0 4294967296) (div (+ main_~n~0 (- 5)) 4294967296))) (or (< (div (+ (* (- 1) main_~x~0) (- 4294967297) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~n~0 4294967296) 2 (div (+ main_~y~0 main_~x~0 4294967296 (* (- 1) main_~n~0)) 4294967296))) (<= (+ (div (+ (- 4294967292) (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (* (- 1) main_~x~0) (- 4294967297) (* (- 1) main_~y~0)) (- 4294967296))) (+ (div (+ 4294967290 main_~y~0 main_~x~0) 4294967296) 3 (div (+ main_~y~0 main_~x~0) 4294967296)))))} is VALID [2022-04-15 13:05:12,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {24703#true} call #t~ret15 := main(); {24703#true} is VALID [2022-04-15 13:05:12,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24703#true} {24703#true} #83#return; {24703#true} is VALID [2022-04-15 13:05:12,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {24703#true} assume true; {24703#true} is VALID [2022-04-15 13:05:12,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {24703#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24703#true} is VALID [2022-04-15 13:05:12,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {24703#true} call ULTIMATE.init(); {24703#true} is VALID [2022-04-15 13:05:12,698 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:12,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341991711] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:05:12,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:05:12,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 31, 30] total 75 [2022-04-15 13:05:23,608 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:05:23,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [835730488] [2022-04-15 13:05:23,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [835730488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:23,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:23,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 13:05:23,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902217060] [2022-04-15 13:05:23,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:05:23,609 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 24 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-15 13:05:23,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:05:23,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 24 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:05:24,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:24,235 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 13:05:24,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:24,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 13:05:24,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1140, Invalid=5340, Unknown=0, NotChecked=0, Total=6480 [2022-04-15 13:05:24,236 INFO L87 Difference]: Start difference. First operand 119 states and 141 transitions. Second operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 24 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)